Generalized disjunction-free representation of frequent patterns with negation

Journal of Experimental and Theoretical Artificial Intelligence

Volumn 17, Issue 1-2, 2005, Pages 63-82

  Kryszkiewicz, Marzena ^a  

^a WARSAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Concise representations; Data mining; Frequent patterns; Knowledge discovery

Indexed keywords

ALGORITHMS; ASSOCIATIVE PROCESSING; DATA MINING; DATABASE SYSTEMS; PROBLEM SOLVING; SET THEORY;

CONCISE REPRESENTATIONS; FREQUENT PATTERNS; KNOWLEDGE DISCOVERY; NEGATION;

KNOWLEDGE BASED SYSTEMS;

EID: 11944270082     PISSN: 0952813X     EISSN: None     Source Type: Journal    
DOI: 10.1080/09528130512331315882     Document Type: Article

References (31)

1. R. Agrawal, R. Imielinski and A.N. Swami, "Mining association rules between sets of items in large database", in Proceedings, ACM SIGMOD International Conference on Management of Data, 1993, pp. 207-216.
2. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen and A.I. Verkamo, "Fast discovery of association rules", in U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth and R. Uthurusamy, Eds, Menlo Park CA: AAAI, 1996, pp. 307-328.
3. J. Baptiste and J.-F. Boulicaut, "Constraint-based discovery and inductive queries: application to association rule mining", in Proceedings, Pattern Detection and Discovery, ESF Exploratory Workshop, 2002, pp. 110-124.
4. E. Baralis, S. Chiusano and P. Garza, "On support thresholds in associative classification", in Proceedings, SAC-04 ACM Symposium on Applied Computing, 2004, pp. 553-558.
5. J.-F. Boulicaut, A. Bykowski and C. Rigotti, "Approximation of frequency queries by means of free-sets", in Proceedings, Principles of Data Mining and Knowledge Discovery, PKDD-00 European Conference, 2000, pp. 75-85.
6. A. Bykowski and C. Rigotti, "A condensed representation to find frequent patterns", in Proceedings, PODS-01 ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2001, pp. 267-273.
7. T. Calders, "Axiomatization and deduction rules for the frequency of itemsets", PhD Thesis, University of Antwerp.
8. T. Calders and B. Goethals, "Mining all non-derivable frequent itemsets", in Proceedings, PKDD-02 European Conference on Principles and Practice of Knowledge Discovery in Databases, 2002, pp. 74-85.
9. T. Calders and B. Goethals, "Minimal k-free representations", in Proceedings, PKDD-03 European Conference on Principles and Practice of Knowledge Discovery in Databases, 2003, pp. 71-82.
10. J. Han and M. Kamber, Data Mining: Concepts and Techniques, San Francisco: Morgan Kaufmann Publishers, 2000.
11. S. K. Harms, J. Deogun, J. Saquer and T. Tadesse, "Discovering representative episodal association rules from event sequences using frequent closed episode sets and event constraints", in Proceedings, ICDM-01 IEEE International Conference on Data Mining, 2001, pp. 603-606.
12. M. Kryszkiewicz, "Closed set based discovery of representative association rules", in Proceedings, Advances in Intelligent Data Analysis, IDA-01 International Conference, 2001a, pp. 350-359.
13. M. Kryszkiewicz, "Concise representation of frequent patterns based on disjunction-free generators", in Proceedings, ICDM-01 IEEE International Conference on Data Mining, 2001b, pp. 305-312.
14. M. Kryszkiewicz, "Inferring knowledge from frequent pattern", in Proceedings, Computing in an Imperfect World, First International Conference, Soft- Ware-02, 2002a, pp. 247-262.
15. M. Kryszkiewicz, Concise representations of frequent patterns and association rules, Warsaw: Publishing House of Warsaw University of Technology, 2002b.
16. M. Kryszkiewicz, "Concise representations of association rules", in Proceedings, Pattern Detection and Discovery, ESF Exploratory Workshop, 2002c, pp. 92-109.
17. M. Kryszkiewicz, "Reducing infrequent borders of downward complete representations of frequent patterns", in Proceedings, The First Symposium on Databases, Data Warehousing and Knowledge Discovery, 2003a, pp. 29-42.
18. M. Kryszkiewicz, "Closed set based discovery of maximal covering rules", International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 11, 2003b, pp. 15-29.
19. M. Kryszkiewicz, "Reducing borders of k-disjunction free representations of frequent patterns", in Proceedings, SAC-04 ACM Symposium on Applied Computing, 2004a, pp. 559-563.
20. M. Kryszkiewicz, "Upper bound on the length of generalized disjunction-free patterns", in Proceedings, SSDBM-04 International Conference on Scientific and Statistical Database Management, 2004b, pp. 31-40.
21. M. Kryszkiewicz, "Reducing main components of k-disjunction free representations of frequent patterns", in Proceedings, IPMU-04 International Conference in Information Processing and Management of Uncertainty in Knowledge-Based Systems, 2004c, pp. 1751-1758.
22. M. Kryszkiewicz and M. Gajek, "Concise representation of frequent patterns based on generalized disjunction-free generators", in Proceedings, Advances in Knowledge Discovery and Data Mining, PAKDD-02 Pacific-Asia Conference, 2002a, pp. 159-171.
23. M. Kryszkiewicz and M. Gajek, "Why to apply generalized disjunction-free generators representation of frequent patterns?", in Proceedings, Foundations of Intelligent Systems, ISMIS-02, 2002b, pp. 383-392.
24. M. Kryszkiewicz, H. Rybiński and M. Gajek, "Dataless transitions between concise representations of frequent patterns", Journal of Intelligent Information Systems, 2004, 41-70.
25. N. Pasquier, "Data mining: Algorithmes d'extraction et de réduction des règles d'association dans les bases de données", PhD thesis, Université Blaise Pascal-Clermont- Ferrand II.
26. N. Pasquier, Y. Bastide, R. Taouil and L. Lakhal, "Efficient mining of association rules using closed itemset lattices", Journal of Information Systems, 1999, 25-46.
27. J. Pei, G. Dong, W. Zou and J. Han, "On computing condensed frequent pattern bases", in Proceedings, ICDM-02 IEEE International Conference on Data Mining, 2002, pp. 378-385.
28. V. Phan-Luong, "Representative bases of association rules", in Proceedings, ICDM-01 IEEE International Conference on Data Mining, 2001, pp. 639-640.
29. J. Saquer and J. S. Deogun, "Using closed itemsets for discovering representative association rules", in Proceedings, Foundations of Intelligent Systems, ISMIS-00, 2000, pp. 495-504.
30. A. Savinov, "Mining dependence rules by finding largest itemset support quota", in Proceedings, SAC-04 ACM Symposium on Applied Computing, 2004, pp. 525-529.
31. M. J. Zaki and C. J. Hsiao, "CHARM: An efficient algorithm for closed itemset mining", in Proceedings, SIAM-02 International Conference on Data Mining, 2002.