Enumerating maximal frequent sets using irredundant dualization

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2843, Issue , 2003, Pages 256-268

  Satoh, Ken ^a   Uno, Takeaki ^a  

^a NATIONAL INSTITUTE OF INFORMATICS   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COMPUTATION TIME; FREQUENT SETS; HYPERGRAPH; PRIMAL-DUAL; QUERY COMPLEXITY; SPACE COMPLEXITY; TRANSACTION DATA;

COMPUTATIONAL COMPLEXITY;

EID: 0242329355     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39644-4_22     Document Type: Article

References (10)

1. Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., and Verkamo, A. I., "Fast Discovery of Association Rules", U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy, (eds), Advances in Knowledge Discovery and Data Mining, chapter 12, pp. 307-328 (1996).
2. Bayardo Jr., R. J., "Efficiently Mining Long Patterns from Databases", Proc. of the 1998 ACM-SIGMOD, pp. 85-93 (1998).
3. Boros, E., Gurvich, V., Khachiyan, L., and Makino, K., "On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets", Proc. of STACS 2002, pp. 133-141 (2002).
4. Fredman, M. L. and Khachiyan, L., "On the Complexity of Dualization of Monotone Disjunctive Normal Forms", Journal of Algorithms 21(3), pp. 618-628 (1996)
5. Gunopulos, D., Khardon, R., Mannila, H. and Toivonen, H., "Data mining, Hypergraph Transversals, and Machine Learning", Proc. of PODS'97, pp. 209-216 (1997).
6. Gunopulos, D., Mannila, H., and Saluja, S., "Discovering All Most Specific Sentences using Randomized Algorithms", Proc. of ICDT'97, pp. 215-229 (1997).
7. Kavvadias, D. J., and Stavropoulos, E. C., "Evaluation of an Algorithm for the Transversal Hypergraph Problem", Algorithm Engineering, pp 72-84 (1999).
8. Mannila, H. and Toivonen, T., "On an Algorithm for Finding All Interesting Sentences", Cybernetics and Systems, Vol II, The Thirteen European Meeting on Cybernetics and Systems Research, pp. 973-978 (1996).
9. Satoh, K., "Formalizing Soft Constraints by Interpretation Ordering", Proc. of ECAI'90, pp. 585-590 (1990).
10. Uno, T., "A Practical Fast Algorithm for Enumerating Minimal Set Coverings", SIGAL83, Information Processing Society of Japan, pp. 9-16 (in Japanese) (2002).