An efficient approach for generating frequent patterns without candidate generation

G. LakshmiPriya, Shanmugasundaram Hariharan. An efficient approach for generating frequent patterns without candidate generation. In K. Gopalan, Sabu M. Thampi, editors, 2012 International Conference on Advances in Computing, Communications and Informatics, ICACCI '12, Chennai, India, August 3-5, 2012. pages 1061-1067, ACM, 2012. [doi]

@inproceedings{LakshmiPriyaH12,
  title = {An efficient approach for generating frequent patterns without candidate generation},
  author = {G. LakshmiPriya and Shanmugasundaram Hariharan},
  year = {2012},
  doi = {10.1145/2345396.2345566},
  url = {http://doi.acm.org/10.1145/2345396.2345566},
  researchr = {https://researchr.org/publication/LakshmiPriyaH12},
  cites = {0},
  citedby = {0},
  pages = {1061-1067},
  booktitle = {2012 International Conference on Advances in Computing, Communications and Informatics, ICACCI '12, Chennai, India, August 3-5, 2012},
  editor = {K. Gopalan and Sabu M. Thampi},
  publisher = {ACM},
  isbn = {978-1-4503-1196-0},
}