The complexity of mining maximal frequent itemsets and maximal frequent patterns
暂无分享,去创建一个
[1] Ganesh Ramesh,et al. Feasible itemset distributions in data mining: theory and application , 2003, PODS '03.
[2] Srinivasan Parthasarathy,et al. New Algorithms for Fast Discovery of Association Rules , 1997, KDD.
[3] Salil P. Vadhan,et al. The Complexity of Counting in Sparse, Regular, and Planar Graphs , 2002, SIAM J. Comput..
[4] Vladimir Gurvich,et al. On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets , 2002, STACS.
[5] H. Mannila,et al. Discovering all most specific sentences , 2003, TODS.
[6] Zvi M. Kedem,et al. Pincer-Search: An Efficient Algorithm for Discovering the Maximum Frequent Set , 2002, IEEE Trans. Knowl. Data Eng..
[7] Mohammed J. Zaki. Efficiently mining frequent trees in a forest , 2002, KDD.
[8] J. Scott Provan,et al. The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected , 1983, SIAM J. Comput..
[9] George Karypis,et al. Frequent subgraph discovery , 2001, Proceedings 2001 IEEE International Conference on Data Mining.
[10] Johannes Gehrke,et al. MAFIA: a maximal frequent itemset algorithm for transactional databases , 2001, Proceedings 17th International Conference on Data Engineering.
[11] Christos H. Papadimitriou,et al. NP-Completeness: A Retrospective , 1997, ICALP.
[12] Christos H. Papadimitriou,et al. Computational complexity , 1993 .
[13] Hiroki Arimura,et al. Optimized Substructure Discovery for Semi-structured Data , 2002, PKDD.
[14] Harry B. Hunt,et al. The Complexity of Planar Counting Problems , 1998, SIAM J. Comput..
[15] Roberto J. Bayardo,et al. Efficiently mining long patterns from databases , 1998, SIGMOD '98.
[16] Mohammed J. Zaki,et al. Efficiently mining maximal frequent itemsets , 2001, Proceedings 2001 IEEE International Conference on Data Mining.
[17] Jian Pei,et al. CLOSET+: searching for the best strategies for mining frequent closed itemsets , 2003, KDD '03.
[18] Ramakrishnan Srikant,et al. Mining sequential patterns , 1995, Proceedings of the Eleventh International Conference on Data Engineering.
[19] Zhigang Li,et al. Efficient data mining for maximal frequent subtrees , 2003, Third IEEE International Conference on Data Mining.
[20] Leslie G. Valiant,et al. The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..
[21] Takashi Washio,et al. An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data , 2000, PKDD.
[22] Hiroki Arimura,et al. Efficient Substructure Discovery from Large Semi-Structured Data , 2001, IEICE Trans. Inf. Syst..
[23] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[24] Ramesh C Agarwal,et al. Depth first generation of long patterns , 2000, KDD '00.
[25] M. Crochemore,et al. On-line construction of suffix trees , 2002 .
[26] Ramakrishnan Srikant,et al. Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.
[27] Mohammed J. Zaki,et al. SPADE: An Efficient Algorithm for Mining Frequent Sequences , 2004, Machine Learning.