Bump hunting in high-dimensional data
Statistics and Computing
ECML '95 Proceedings of the 8th European Conference on Machine Learning
Data mining tasks and methods: Subgroup discovery: change analysis
Handbook of data mining and knowledge discovery
On learning linear ranking functions for beam search
Proceedings of the 24th international conference on Machine learning
PKDD'06 Proceedings of the 10th European conference on Principle and Practice of Knowledge Discovery in Databases
IDA '09 Proceedings of the 8th International Symposium on Intelligent Data Analysis: Advances in Intelligent Data Analysis VIII
Maximal exceptions with minimal descriptions
Data Mining and Knowledge Discovery
Subgroup discovery for election analysis: a case study in descriptive data mining
DS'10 Proceedings of the 13th international conference on Discovery science
Non-redundant subgroup discovery in large and complex data
ECML PKDD'11 Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part III
Hunting for fraudsters in random forests
HAIS'12 Proceedings of the 7th international conference on Hybrid Artificial Intelligent Systems - Volume Part I
Different slopes for different folks: mining for exceptional regression models with cook's distance
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
From black and white to full color: extending redescription mining outside the Boolean world
Statistical Analysis and Data Mining
Generic pattern trees for exhaustive exceptional model mining
ECML PKDD'12 Proceedings of the 2012 European conference on Machine Learning and Knowledge Discovery in Databases - Volume Part II
Multi-label lego -- enhancing multi-label classifiers with local patterns
IDA'12 Proceedings of the 11th international conference on Advances in Intelligent Data Analysis
Contrasting temporal trend discovery for large healthcare databases
Computer Methods and Programs in Biomedicine
Hi-index | 0.00 |
In most databases, it is possible to identify small partitions of the data where the observed distribution is notably different from that of the database as a whole. In classical subgroup discovery, one considers the distribution of a single nominal attribute, and exceptional subgroups show a surprising increase in the occurrence of one of its values. In this paper, we introduce Exceptional Model Mining(EMM), a framework that allows for more complicated target concepts. Rather than finding subgroups based on the distribution of a single target attribute, EMM finds subgroups where a model fitted to that subgroup is somehow exceptional. We discuss regression as well as classification models, and define quality measures that determine how exceptional a given model on a subgroup is. Our framework is general enough to be applied to many types of models, even from other paradigms such as association analysis and graphical modeling.