Ranking interesting subgroups

Proceedings of the 26th International Conference On Machine Learning, ICML 2009

Volumn , Issue , 2009, Pages 913-920

  Rueping, Stefan ^a  

^a FRAUNHOFER IAIS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

INTERESTINGNESS; LOGICAL FORMULAS; STATISTICAL SIGNIFICANCE; SUBGROUP DISCOVERY;

ROBOT LEARNING;

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

References (15)

1. Asuncion, A., & Newman, D. (2007). UCI machine learning repository. http://www.ics.uci.edu/~mlearn/MLRepository.html.
2. Atzmueller, M., Puppe, F., & Buscher, H.-P. (2005). Exploiting background knowledge for knowledge-intensive subgroup discovery. Proc. 19th International Joint Conference on Artificial Intelligence (IJCAI-05) (pp. 647-652).
3. Bratko, I. (1996). Machine learning: Between accuracy and interpretability. In G. Delia Riccia, H.-J. Lenz and R. Kruse (Eds.), Learning, networks and statistics, vol. 382 of CISM Int. Centre for Mechanical Sciences Courses and Lectures, 163177. Springer.
4. Demsar, J. (2006). Statistical comparisons of classifiers over multiple data sets. Journal of Machine Learning Research, 7, 1-30.
5. Grosskreutz, H., Rüping, S., & Wrobel, S. (2008). Tight optimistic estimates for fast subgroup discovery. Proc. European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (pp. 440-456). Springer.
6. Hand, D. (2002). Pattern detection and discovery. In D. Hand, N. Adams and R. Bolton (Eds.), Pattern detection and discovery. Springer.
7. Herbrich, R., Graepel, T., & Obermayer, K. (2000). Large margin rank boundaries for ordinal regression. In P. J. Bartlett, B. Schölkopf, D. Schuurmans and A. J. Smola (Eds.), Advances in large margin classifiers, 115-132. MIT Press.
8. Joachims, T. (2002). Optimizing search engines using clickthrough data. Proceedings of the ACM Conference on Knowledge Discovery and Data Mining (KDD) (pp. 133-142).
9. Kavsek, B., Lavrac, N., & Jovanoski, V. (2003). Apriori-sd: Adapting association rule learning to subgroup discovery. Proc. 5th International Symposium on Intelligent Data Analysis (pp. 230-241).
10. Klösgen, W. (1996). Explora: A Multipattern and Multistrategy Discovery Assistant. In U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth and R. Uthurusamy (Eds.), Advances in knowledge discovery and data mining, chapter 3, 249-272. AAAI/MIT Press.
11. Lavrac, N., Cestnik, B., Gamberger, D., & Flach, P. A. (2004). Decision support through subgroup discovery: Three case studies and the lessons learned. Machine Learning, 57, 115-143.
12. Morik, K., & Köpcke, H. (2004). Analysing Customer Churn in Insurance Data - A Case Study. Knowledge Discovery in Databases: PKDD 2004 (pp. 325-336). Springer.
13. Radlinski, F., Kurup, M., & Joachims, T. (2008). How does clickthrough data reflect retrieval quality? Proceedings of the ACM Conference on Information and Knowledge Management (CIKM) (pp. 43-52).
14. Scholz, M. (2005). Sampling-Based Sequential Subgroup Mining. Proceedings of the 11th ACM SIGKDD International Conference on Knowledge Discovery in Databases (KDD'05) (pp. 265-274).
15. Srikant, R., Vu, Q., & Agrawal, R. (1997). Mining association rules with item constraints. Proceedings 3rd International Conference on Knowledge Discovery and Data Mining (pp. 66-73). AAAI Press.