The complexity of mining maximal frequent itemsets and maximal frequent patterns

KDD-2004 - Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2004, Pages 344-353

  Yang, Guizhen ^a  

^a the State University of New York   (United States)

Author keywords

P complete; P hard; Data mining; Maximal frequent itemset; Maximal frequent pattern

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATABASE SYSTEMS; DECISION THEORY; POLYNOMIALS; PROBLEM SOLVING; TREES (MATHEMATICS);

#P-COMPLETE; #P-HARD; MAXIMAL FREQUENT ITEMSET; MAXIMAL FREQUENT PATTERN;

DATA MINING;

EID: 12244312166     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1014052.1014091     Document Type: Conference Paper

References (28)

1. R. C. Agarwal, C. C. Aggarwal, and V. V. V. Prasad. Depth first generation of long patterns. In KDD, 2000.
2. R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. In VLDB, 1994.
3. R. Agrawal and R. Srikant. Mining sequential patterns. In ICDE, 1995.
4. T. Asai, K. Abe, S. Kawasoe, H. Arimura, H. Satamoto, and S. Arikawa. Efficient substructure discovery from large semi-structured data. In SDM, 2002.
5. R. J. Bayardo Jr. Efficiently mining long patterns from databases. In SIGMOD, 1998.
6. E. Boros, V. Gurvich, L. Khachiyan, and K. Makino. On the complexity of generating maximal frequent and minimal infrequent sets. In STACS, 2002.
7. D. Burdick, M. Calimlim, and J. Gehrke. MAFIA: A maximal frequent itemset algorithm for transactional databases. In ICDE, 2001.
8. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979.
9. K. Gouda and M. J. Zaki. Efficiently mining maximal frequent itemsets. In ICDM, 2001.
10. D. Gunopulos, R. Khardon, H. Mannila, S. Saluja, H. Toivonen, and R. S. Sharm. Discovering all most specific sentences. ACM Transactions on Database Systems (TODS), 28(2):140-174, 2003.
11. H. B. Hunt III, M. V. Marathe, V. Radhakrishnan, and R. E. Stearns. The complexity of planar counting problems. SIAM Journal on Computing, 27(4):1142-1167, 1998.
12. A. Inokuchi, T. Washio, and H. Motoda. An apriori-based algorithm for mining frequent substructures from graph data. In PKDD, 2000.
13. M. Kuramochi and G. Karypis. Frequent subgraph discovery. In ICDM, 2001.
14. S. O. Kuznetsov. Interpretation on graphs and complexity characteristics of a search for specific patterns. Nauchno-Tekhnicheskaya Informatsiya, Seriya 2 (Automatic Documentation and Mathematical Linguistics), 23(1):23-27, 1989.
15. D.-I. Lin and Z. M. Kedem. Pincer-Search: An efficient algorithm for discovering the maximum frequent set. IEEE Transactions on Knowledge and Data Engineering (TKDE), 14(3):553-566, 2002.
16. C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
17. C. H. Papadimitriou. NP-completeness: A retrospective. In ICALP, 1997.
18. J. S. Provan and M. O. Ball. The complexity of counting cuts and of computing the probability that a graph is connected. SIAM Journal on Computing, 12(4):777-788, 1983.
19. G. Ramesh, W. Maniatty, and M. J. Zaki. Feasible itemset distributions in data mining: Theory and application. In PODS, 2003.
20. E. Ukkonen. On-line construction of suffix trees. Algorithmica, 14(3):249-260, 1995.
21. S. P. Vadhan. The complexity of counting in sparse, regular, and planar graphs. SIAM Journal on Computing, 31(2):398-427, 2001.
22. L. G. Valiant. The complexity of computing the permanent. Theoretical Computer Science, 8:189-201, 1979.
23. J. Wang, J. Han, and J. Pei. CLOSET+: Searching for the best strategies for mining frequent closed itemsets. In KDD, 2003.
24. Y. Xiao, J.-F. Yao, Z. Li, and M. H. Dunham. Efficient data mining for maximal frequent subtrees. In ICDM, 2003.
25. M. J. Zaki. SPADE: An efficient algorithm for mining frequent sequences. Machine Learning, 42(1/2):31-60, 2001.
26. M. J. Zaki. Efficiently mining frequent trees in a forest. In KDD, 2002.
27. M. J. Zaki and M. Ogihara. Theoretical foundations of association rules. In DMKD, 1998.
28. M. J. Zaki, S. Parthasarathy, M. Ogihara, and W. Li. New algorithms for fast discovery of association rules. In KDD, 1997.