Efficient Mining Top-k Regular-Frequent Itemset Using Compressed Tidsets

Komate Amphawan, Philippe Lenca, Athasit Surarerks. Efficient Mining Top-k Regular-Frequent Itemset Using Compressed Tidsets. In Longbing Cao, Joshua Zhexue Huang, James Bailey, Yun Sing Koh, Jun Luo, editors, New Frontiers in Applied Data Mining - PAKDD 2011 International Workshops, Shenzhen, China, May 24-27, 2011, Revised Selected Papers. Volume 7104 of Lecture Notes in Computer Science, pages 124-135, Springer, 2011. [doi]

@inproceedings{AmphawanLS11,
  title = {Efficient Mining Top-k Regular-Frequent Itemset Using Compressed Tidsets},
  author = {Komate Amphawan and Philippe Lenca and Athasit Surarerks},
  year = {2011},
  doi = {10.1007/978-3-642-28320-8_11},
  url = {http://dx.doi.org/10.1007/978-3-642-28320-8_11},
  researchr = {https://researchr.org/publication/AmphawanLS11},
  cites = {0},
  citedby = {0},
  pages = {124-135},
  booktitle = {New Frontiers in Applied Data Mining - PAKDD 2011 International Workshops, Shenzhen, China, May 24-27, 2011, Revised Selected Papers},
  editor = {Longbing Cao and Joshua Zhexue Huang and James Bailey and Yun Sing Koh and Jun Luo},
  volume = {7104},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-28319-2},
}