Mining soft-matching association rules

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2002, Pages 681-683

  Nahm, Un Yong ^a   Mooney, Raymond J ^a  

^a University of Texas at Austin   (United States)

Author keywords

Association rules; Noisy databases; Text mining; Textual databases

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; DATABASE SYSTEMS; KNOWLEDGE BASED SYSTEMS; PATTERN RECOGNITION; TEXT PROCESSING; WEBSITES;

ASSOCIATION RULE MINING; NOISY DATABASES; SOFT MATCHING ASSOCIATION RULES; TEXT MINING; TEXTUAL DATABASE; VECTOR SPACE MODEL;

DATA MINING;

EID: 0037818367     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/584792.584918     Document Type: Conference Paper

References (4)

1. R. Agraval and R. Srikant. Fast algorithms for mining association rules. In Proceedings of the 20th International Conference on Very Large Databases (VLDB-94), pages 487-499, Santiago, Chile, Sept. 1994.
2. C. Borgelt. Apriori version 2.6. http://fuzzy.cs.UniMagdeburg.de/~borgelt/, 2000.
3. U. Y. Nahm, M. Bilenko, and R. J. Mooney, Two approaches to handling noisy variation in text mining. In Papers from the Nineteenth International Conference on Machine Learning (ICML-2002) Workshop on Text Learning, pages 18-27. Sydney, Australia, July 2002.
4. G. Salton, Automatic Text Processing: The Transformation, Analysis and Retrieval of Information by Computer, Addison-Wesley, 1989.