Inducing theory for the rule set

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

Volumn 2005, Issue , 2001, Pages 391-398

  Kryszkiewicz, Marzena ^a  

^a WARSAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; ROUGH SET THEORY;

CONSISTENT SUBSET; DATA MINING PROBLEMS; LOW QUALITIES; RULE SET; SET OF RULES;

COMPUTATION THEORY;

EID: 84957802813     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45554-X_48     Document Type: Conference Paper

References (5)

1. Agrawal, R., Imielinski, T., Swami, A.: Mining Associations Rules between Sets of Items in Large Databases. In: Proc. of the ACM SIGMOD Conference on Management of Data. Washington, D.C. (1993) 207-216
2. Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verlcamo, A.I.: Fast Discovery of Association Rules. In: Fayyad, U.M., Piatetsky-Shapiro, G., Smyth, P., Uthurusamy, R. (eds.): Advances in Knowledge Discovery and Data Mining. AAAI, Menlo Park, California (1996) 307-328
3. Kryszkiewicz, M.: Representative Association Rules. In: Proc. of PAKDD’98. Melbourne, Australia. LNAI 1394. Springer-Verlag (1998) 198-209
4. Kryszkiewicz, M.: Fast Discovery of Representative Association Rules. In: Proc. of RSCTC’98. Warsaw, Poland. LNAI 1424. Springer-Verlag (1998) 214-221
5. Kryszkiewicz, M.: Mining with Cover and Extension Operators. In: Proc. of PKDD’00. Lyon, France. To appear as a Springer-Verlag LNAI volume