Dataless Transitions between Concise Representations of Frequent Patterns

Journal of Intelligent Information Systems

Volumn 22, Issue 1, 2004, Pages 41-70

  Kryszkiewicz, Marzena ^a   Rybiński, Henryk ^a   Gajek, Marcin ^a  

^a WARSAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Closed itemsets; Concise representation; Data mining; Frequent itemsets; Knowledge discovery

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DATABASE SYSTEMS; KNOWLEDGE BASED SYSTEMS; SET THEORY;

DATALESS TRANSITIONS; KNOWLEDGE DISCOVERY;

DATA MINING;

EID: 0347132396     PISSN: 09259902     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1025828729955     Document Type: Conference Paper

References (20)

1. Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., and Verkamo, A.I. (1996). Fast Discovery of Association Rules. In U.M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurasamy (Eds.), Advances in Knowledge Discovery and Data Mining. AAAI, CA.
2. Bastide, Y., Taouil, R., Pasquier, N., Stumme, G., and Lakhal, L. (2000). Mining Frequent Patterns with Counting Inference. ACM SIGKDD Explorations, 2(2), 66-75.
3. Bykowski, A. and Rigotti, C. (2001). A Condensed Representation to Find Frequent Patterns. In Proc. of PODS '01 (pp. 267-273). Santa Barbara, CA, USA: ACM.
4. Boulicaut, J.F., Bykowski, A., and Rigotti, C. (2000). Approximation of Frequency Queries by Means of Free-Sets. In Proc. of PKDD 00 (pp. 75-85). Lyon, France: Springer.
5. Calders, T. and Goethals, B. (2002). Mining All Non-derivable Frequent Itemsets. In Proc. of PKDD '02 (pp. 74-85). Helsinki, Finland: Springer.
6. Han, J. and Kamber, M. (2000). Data Mining: Concepts and Techniques. The Morgan Kaufmann Series in Data Management Systems, Morgan Kaufmann Publishers.
7. Harms, S.K., Deogun, J., Saquer, J., and Tadesse, T. (2001). Discovering Representative Episodal Association Rules from Event Sequences Using Frequent Closed Episode Sets and Event Constraints. In Proc. of ICDM '01 (pp. 603-606). San Jose, CA, USA: IEEE Computer Society.
8. Kryszkiewicz, M. (2001a). Closed Set Based Discovery of Representative Association Rules. In Proc. of IDA' 01 (pp. 350-359). Cascais, Portugal: Springer.
9. Kryszkiewicz, M. (2001b). Concise Representation of Frequent Patterns based on Disjunction-free Generators. In Proc. of ICDM' 01 (pp. 305-312). San Jose, CA, USA: IEEE Computer Society.
10. Kryszkiewicz, M. (2002a). Concise Representations of Association Rules. In Proc. of ESF' 02 (pp. 92-109). London, UK: Springer.
11. Kryszkiewicz, M. (2002b). Concise Representation of Frequent Patterns And Association Rules, Habilitation Thesis, Publishing House of the Warsaw University of Technology.
12. Kryszkiewicz, M. (2002c). Converting Generators Representation and Closed Itemset Representations of Frequent Patterns. ICS Research Report, No. 27, Warsaw University of Technology.
13. Kryszkiewicz, M. and Gajek, M. (2002a). Concise Representation of Frequent Patterns based on Generalized Disjunction - Free Generators. In Proc. of PAKDD' 02 (pp. 159-171). Taipei, Taiwan: Springer.
14. Kryszkiewicz, M. and Gajek, M. (2002b). Why to Apply Generalized Disjunction - Free Generators Representation of Frequent Patterns? In Proc. of ISMIS' 02 (pp. 383-392). Lyon, France: Springer.
15. Pasquier, N. (2000). DM: Algorithmes d'extraction et de Réduction des Règles d'association dans les Bases de Données, Ph.D., Univ. B. Pascal-Clermont-Ferrand II.
16. Pasquier, N., Bastide, Y., Taouil, R., and Lakhal, L. (1999a). Discovering Frequent Closed Itemsets for Association Rules. In Proc. of ICDT '99 (pp. 398-416). Jerusalem, Israel: Springer.
17. Pasquier, N., Bastide, Y., Taouil, R., and Lakhal, L. (1999b). Efficient Mining of Association Rules Using Closed Itemset Lattices. Journal of Information Systems, 24(1), 25-46.
18. Pei, J., Han, J., and Mao, R. (2000). CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets. In Proc. of DMKD'00 (pp. 21-30). Dallas, TX, USA: ACM.
19. Stumme, G., Taouil, R., Bastide, Y., Pasquier, N., and Lakhal, L. (2000). Fast Computation of Concept Lattices Using Data Mining Techniques. In Proc. of KRDB' 00 (pp. 129-139). Berlin, Germany.
20. Zaki, M.J. and Hsiao, C.J. (2002). CHARM: An Efficient Algorithm for Closed Itemset Mining. In Proc. of 2nd SIAM Int. Conf. on Data Mining, Arlington.