Rare itemset mining

Proceedings - 6th International Conference on Machine Learning and Applications, ICMLA 2007

Volumn , Issue , 2007, Pages 73-80

  Adda, Mehdi ^a   Wu, Lei ^b   Feng, Yi ^c  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

^b Rochester Institute of Technology   (United States)

^c ALGOMA UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARSENIC COMPOUNDS; ARTIFICIAL INTELLIGENCE; COMPUTATIONAL GEOMETRY; COMPUTER CRIME; ERROR ANALYSIS; FINANCE; LEARNING SYSTEMS; MINES; ROBOT LEARNING;

A-PRIORI; BOTTOM UP MANNER; COMPUTER ATTACKS; DATA SETS; FINANCIAL INSTITUTIONS; FRAUDULENT TRANSACTIONS; FREQUENT ITEMSETS; FREQUENT PATTERN MINING (FPM); FREQUENT PATTERNS; GENERIC FRAMEWORKS; INPUT DATA; INTERNATIONAL CONFERENCES; ITEM SET MINING; ITEM SETS; ITEMSET SPACE; ITEMSETS; LATTICE (CO); MACHINE-LEARNING; TRANSACTION DATABASES;

MINING;

EID: 47349103359     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICMLA.2007.87     Document Type: Conference Paper

References (12)

1. R. Agrawal and R. Srikant, Fast algorithms for mining association rules, The International Conference on Very Large Databases (1994), 487-499.
2. P. Bagwell, Ideal hash trees, http://infoscience.epfl.ch.
3. B. Goethals, Survey on frequent pattern mining, www.adrem.ua.ac.be/ goethals/software/survey.pdf (2003).
4. J. Han, J. Pei, and Y. Yin, Mining frequent patterns without candidate generation, In Proceedings of the 2000 ACM SIGMOD international conference on Management of data (2000), 1-12.
5. W. Lee and S. Stolfo, Data mining approaches for intrusion detection, In Proceedings of the Seventh USENIX Security Symposium (1998).
6. Dao-I Lin and Zvi M. Kedem, Pincer search: A new algorithm for discovering the maximum frequent set, Lecture Notes in Computer Science 1377 (1998), 105-121.
7. Gou Masuda, Norihiro Sakamoto, and Ryuichi Yamamoto, A framework for dynamic evidence based medicine using data mining, CBMS '02: Proceedings of the 15th IEEE Symposium on Computer-Based Medical Systems (2002), 117.
8. Nicolas Pasquier, Yves Bastide, Rafik Taouil, and Lotfi Lakhal, Discovering frequent closed itemsets for association rules, Lecture Notes in Computer Science 1540 (1999), 398-416.
9. Ronaldo Cristiano Prati, Maria Carolina Monard, André C. P., and L. F. de Carvalho, A method for refining knowledge rules using exceptions, SADIO Electronic Journal of Informatics and Operations Research 6(1) (2004), 53-65.
10. M. Song and R. Sanguthevar, A transaction mapping algorithm for frequent itemsets mining, IEEE Transactions on Knowledge and Data Engineering 18 (2006), 472-481.
11. Laszlo Szathmary, Sandy Maumus, Pierre Petronin, Yannick Toussaint, and Amedeo Napoli, Vers l'extraction de motifs rares., EGC : Extraction et gestion des connaissances (2006), 499-510.
12. M. J. Zaki, S. Parthasarathy, M. Ogihara, and W. Li, New algorithms for fast discovery of association rules, In Proceedings of the 3rd International Conference on Knowledge Discovery and Data Mining (1997), 283-296.