Fast discovery of relevant subgroup patterns

Proceedings of the 23rd International Florida Artificial Intelligence Research Society Conference, FLAIRS-23

Volumn , Issue , 2010, Pages 428-433

  Lemmerich, Florian ^a   Rohlfs, Mathias ^a   Atzmueller, Martin ^a  

^a UNIVERSITY OF WÜRZBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING METHODS; DATA SETS; EFFICIENT METHOD; LOCAL PATTERNS; NOVEL ALGORITHM; SUBGROUP DISCOVERY;

DATA STRUCTURES;

ARTIFICIAL INTELLIGENCE;

EID: 77957867624     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. Aouad, L. M.; Le-Khac, N.-A.; and Kechadi, T. M. 2007. Grid-based approach for distributed frequent itemsets mining using dynamic workload management. In Proc. 2nd International Conference on Advances in Information Technology (IAIT2007).
2. Atzmueller, M., and Lemmerich, F. 2009. Fast Subgroup Discovery for Continuous Target Concepts. In Proc. 18th International Symposium on Methodologies for Intelligent Systems (ISMIS 2009), LNCS.
3. Atzmueller, M., and Puppe, F. 2006. SD-Map - A Fast Algorithm for Exhaustive Subgroup Discovery. In Proc. 10th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD 2006), number 4213 in LNAI, 6-17. Berlin: Springer Verlag. (Pubitemid 44617708)
4. Burdick, D.; Calimlim, M.; and Gehrke, J. 2001. MAFIA: A Maximal Frequent Itemset Algorithm for Transactional Databases. In Proc. 17th International Conference on Data Engineering (ICDE'01), 443-452. (Pubitemid 32457146)
5. Cheng, H.; Yan, X.; Han, J.; and Yu, P. S. 2008. Direct discriminative pattern mining for effective classification. In ICDE '08: Proceedings of the 2008 IEEE 24th International Conference on Data Engineering, 169-178. Washington, DC, USA: IEEE Computer Society.
6. Garriga, G. C.; Kralj, P.; and Lavrač, N. 2008. Closed Sets for Labeled Data. J. Mach. Learn. Res. 9:559-580.
7. Grosskreutz, H.; Rüping, S.; and Wrobel, S. 2008. Tight Optimistic Estimates for Fast Subgroup Discovery. In Proceedings of the 2008 ECML-PKDD - Part I, 440-456. Berlin: Springer Verlag.
8. Klösgen, W. 1996. Explora: A Multipattern and Multistrategy Discovery Assistant. In Fayyad, U. M.; Piatetsky-Shapiro, G.; Smyth, P.; and Uthurusamy, R., eds., Advances in Knowledge Discovery and Data Mining. AAAI Press. 249-271.
9. Lavrac, N., and Gamberger, D. 2006. Relevancy in Constraint-based Subgroup Discovery. In JeanFrancois Boulicaut, Luc de Raedt, H. M., ed., Constraint-based Mining and Inductive Databases, volume 3848 of LNCS. Berlin: Springer Verlag.
10. Lavrac, N.; Kavsek, B.; Flach, P.; and Todorovski, L. 2004. Subgroup Discovery with CN2-SD, Journal of Machine Learning Research 5:153-188.
11. Mattern, F. 1987. Algorithms for Distributed Termination Detection, Distributed Computing 2(3): 161-175.
12. Newman, D.; Hettich, S.; Blake, C.; and Merz, C. 1998. UCI Repository of Machine Learning Databases, http://www.ics.uci.edu/~mlearn/mlrepository.html.
13. Wrobel, S. 1997. An Algorithm for Multi-Relational Discovery of Subgroups. In Proc. 1st European Symposium on Principles of Data Mining and Knowledge Discovery (PKDD-97), 78-87. Berlin: Springer Verlag.
14. Wurst, M., and Scholz, M. 2006. Distributed subgroup mining. In Fürnkranz, J.; Scheffer, T.; and Spiliopoulou, M., eds., Proc. PKDD 2006, 10th European Conference on Principles and Practice of Knowledge Discovery in Databases, volume 4213 of Lecture Notes in Computer Science, 421-433. Springer.
15. Zaiane, O. R.; El-Hajj, M.; and Lu, P. 2001. Fast parallel association rule mining without candidacy generation. In Proc. 2001 IEEE Int. Conf on Data Mining, 665-668.
16. Zaki, M. J. 1998. Efficient Enumeration of Frequent Sequences. In CIKM '98: Proceedings of the seventh international conference on Information and knowledge management, 68-75. New York, NY, USA: ACM.