Frequent Pattern Mining Algorithms: A Survey - Frequent Pattern Mining - page 62

42. C. Lucchese, S. Orlando, and R. Perego. Fast and memory efficient mining of frequent closed
itemsets. IEEE TKDE Journal , 18(1), pp. 21-36, January 2006.
43. G. Manku, R. Motwani. Approximate Frequency Counts over Data Streams. VLDB Conference ,
2002.
44. H. Mannila, H. Toivonen, and A.I. Verkamo. Efficient algorithms for discovering association
rules. Proceedings of the AAAI Workshop on Knowledge Discovery in Databases , pp. 181-192,
1994.
45. B. Negrevergne, T. Guns, A. Dries, and S. Nijssen. Dominance Programming for Itemset
Mining. IEEE ICDM Conference , 2013.
46. S. Orlando, P. Palmerini, R. Perego. Enhancing the a-priori algorithm for frequent set counting,
Third International Conference on Data Warehousing and Knowledge Discovery , 2001.
47. S. Orlando, P. Palmerini, R. Perego, and F. Silvestri. Adaptive and resource-aware mining of
frequent sets. ICDM Conference , 2002.
48. F. Pan, G. Cong, A. K. H. Tung, J. Yang, and M. J. Zaki. Finding closed patterns in long
biological datasets. ACM KDD Conference , 2003.
49. F Pan, A. K. H. Tung, G. Cong, X. Xu. COBBLER: Combining column and Row Enumeration
for Closed Pattern Discovery. SSDBM , 2004.
50. J.-S. Park, M. S. Chen, and P. S.Yu. An Effective Hash-based Algorithm for Mining Association
Rules, ACM SIGMOD Conference , 1995.
51. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Discovering frequent closed itemsets for
association rules. ICDT Conference , 1999.
52. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Efficient mining of association rules using
closed itemset lattices. Journal of Information Systems , 24(1), pp. 25-46, 1999.
53. J. Pei, J. Han, and R. Mao. CLOSET: An Efficient Algorithm for Mining Frequent Closed
Itemsets, DMKD Workshop , 2000.
54. J. Pei, J. Han, H. Lu, S. Nishio, S. Tang, D. Yang. H-mine: Hyper-structure mining of frequent
patterns in large databases, ICDM Conference , 2001.
55. B. Racz. nonordfp: An FP-Growth Variation without Rebuilding the FP-Tree, FIMI Workshop ,
2004.
56. M. Holsheimer, M. Kersten, H. Mannila, and H. Toivonen. A Perspective on Databases and
Data Mining, ACM KDD Conference , 1995.
57. A. Savasere, E. Omiecinski, and S. Navathe. An efficient algorithm for mining association rules
in large databases. VLDB Conference , 1995.
58. P. Shenoy, J. Haritsa, S. Sudarshan, G. Bhalotia, M. Bawa, D. Shah. Turbo-charging Vertical
Mining of Large Databases. ACM SIGMOD Conference , pp. 22-33, 2000.
59. Z. Shi,

and Q. He. Efficiently Mining Frequent Itemsets with Compact FP-Tree, IFIP

International Federation for Information Processing, V-163, pp. 397-406, 2005.
60. R. Srikant. Fast algorithms for mining association rules and sequential patterns. PhD thesis,
University of Wisconsin, Madison , 1996.
61. Y. G. Sucahyo and R. P. Gopalan. CT-ITL: Efficient Frequent Item Set Mining Using a
Compressed Prefix Tree with PatternGrowth, Proceedings of the 14th Australasian Database
Conference , 2003.
62. Y. G. Sucahyo and R. P. Gopalan. CT-PRO: A Bottom Up Non Recursive Frequent Itemset
Mining Algorithm Using Compressed FP-Tree Data Structures. FIMI Workshop , 2004.
63. P.-N. Tan, V. Kumar, amd J. Srivastava. Selecting the Right Interestingness Measure for
Association Patterns. ACM KDD Conference , 2002.
64. I. Taouil, N. Pasquier, Y. Bastide, and L. Lakhal. Mining Basis for Association Rules using
Closed Sets, ICDE Conference , 2000.
65. H. Toivonen. Sampling large databases for association rules. VLDB Conference , 1996.
66. T. Uno, M. Kiyomi and H. Arimura. Efficient Mining Algorithms for Frequent/Closed/Maximal
Itemsets, FIMI Workshop , 2004.
67. J. Wang, J. Han. BIDE: Efficient Mining of Frequent Closed Sequences. ICDE Conference ,
2004.