Generalized disjunction-free representation of frequents patterns with at most k negations

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

Volumn 3918 LNAI, Issue , 2006, Pages 468-472

  Kryszkiewicz, Marzena ^a  

^a WARSAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE SYSTEMS; ALGORITHMS; DATA MINING; DATA PROCESSING; USER INTERFACES;

DATA MINING COMMUNITY; GENERALIZED DISJUNCTION-FREE REPRESENTATION (GDFLR); K NEGATIONS; USER;

PATTERN RECOGNITION;

EID: 33745777192     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11731139_54     Document Type: Conference Paper

References (6)

1. Agrawal, R., Imielinski, T., Swami, A.: Mining Associations Rules between Sets of Items in Large Databases. In: Proc. of the ACM SIGMOD, Washington, USA (1993) 207-216
2. Kryszkiewicz, M.: Generalized Disjunction-Free Representation of Frequent Patterns with Negation. JETAI, Taylor & Francis Group, UK (2003) 63-82
3. Kryszkiewicz, M.: Reasoning about Frequent Patterns with Negation. Encyclopedia of Data Warehousing and Mining. Idea Group Reference (2005) 941-946
4. Kryszkiewicz, M., Cichon, K.: Support Oriented Discovery of Generalized Disjunction-Free Representation of Frequent Patterns with Negation. In: Proc. of PAKDD'05 (2005) 672-682
5. Kryszkiewicz, M., Gajek, M.: Concise Representation of Frequent Patterns based on Generalized Disjunction-Free Generators. In: Proc. of PAKDD'02 (2002) 159-171
6. Toivonen, H.: Discovery of Frequent Patterns in Large Data Collections. Ph.D. Thesis, Report A-1996-5, University of Helsinki (1996)