Non-redundant Subgroup Discovery in Large and Complex Data
暂无分享,去创建一个
[1] H. Mannila,et al. Biogeography of European land mammals shows environmentally distinct and spatially coherent clusters , 2007 .
[2] Arno J. Knobbe,et al. Pattern Teams , 2006, PKDD.
[3] Francesco Bonchi,et al. Knowledge Discovery in Inductive Databases, 4th International Workshop, KDID 2005, Porto, Portugal, October 3, 2005, Revised Selected and Invited Papers , 2006, KDID.
[4] Florian Lemmerich,et al. Fast Discovery of Relevant Subgroup Patterns , 2010, FLAIRS Conference.
[5] Peter A. Flach,et al. Subgroup Discovery with CN2-SD , 2004, J. Mach. Learn. Res..
[6] Peter A. Flach,et al. Evaluation Measures for Multi-class Subgroup Discovery , 2009, ECML/PKDD.
[7] Nicolas Pasquier,et al. Discovering Frequent Closed Itemsets for Association Rules , 1999, ICDT.
[8] P. Grünwald. The Minimum Description Length Principle (Adaptive Computation and Machine Learning) , 2007 .
[9] Willi Klösgen,et al. Explora: A Multipattern and Multistrategy Discovery Assistant , 1996, Advances in Knowledge Discovery and Data Mining.
[10] Nada Lavrac,et al. Closed Sets for Labeled Data , 2008, J. Mach. Learn. Res..
[11] Albrecht Zimmermann,et al. The Chosen Few: On Identifying Valuable Patterns , 2007, Seventh IEEE International Conference on Data Mining (ICDM 2007).
[12] Willi Klösgen,et al. Knowledge Discovery in Databases and Data Mining , 1996, ISMIS.
[13] Jan Komorowski,et al. Principles of Data Mining and Knowledge Discovery , 2001, Lecture Notes in Computer Science.
[14] Fuhui Long,et al. Feature selection based on mutual information criteria of max-dependency, max-relevance, and min-redundancy , 2003, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[15] P. Grünwald. The Minimum Description Length Principle (Adaptive Computation and Machine Learning) , 2007 .
[16] Matthijs van Leeuwen,et al. Maximal exceptions with minimal descriptions , 2010, Data Mining and Knowledge Discovery.
[17] Malcolm P. Atkinson,et al. Issues Raised by Three Years of Developing PJama: An Orthogonally Persistent Platform for Java , 1999, ICDT.
[18] Heikki Mannila,et al. Multiple Uses of Frequent Sets and Condensed Representations (Extended Abstract) , 1996, KDD.
[19] Jilles Vreeken,et al. Krimp: mining itemsets that compress , 2011, Data Mining and Knowledge Discovery.
[20] Saso Dzeroski,et al. Beam Search Induction and Similarity Constraints for Predictive Clustering Trees , 2006, KDID.
[21] Arno Knobbe,et al. Exceptional Model Mining , 2008, ECML/PKDD.
[22] Stefan Wrobel,et al. Tight Optimistic Estimates for Fast Subgroup Discovery , 2008, ECML/PKDD.
[23] Stefan Wrobel,et al. An Algorithm for Multi-relational Discovery of Subgroups , 1997, PKDD.