Journal of Intelligent Information Systems

, Volume 44, Issue 2, pp 271–288 | Cite as

Efficient redundancy reduced subgroup discovery via quadratic programming

  • Rui Li
  • Robert Perneczky
  • Alexander Drzezga
  • Stefan KramerEmail author


Subgroup discovery is a task at the intersection of predictive and descriptive induction, aiming at identifying subgroups that have the most unusual statistical (distributional) characteristics with respect to a property of interest. Although a great deal of work has been devoted to the topic, one remaining problem concerns the redundancy of subgroup descriptions, which often effectively convey very similar information. In this paper, we propose a quadratic programming based approach to reduce the amount of redundancy in the subgroup rules. Experimental results on 12 datasets show that the resulting subgroups are in fact less redundant compared to standard methods. In addition, our experiments show that the computational costs are significantly lower than the costs of other methods compared in the paper.


Subgroup discovery Mutual information Quadratic programming Rule learning Redundancy 



The first author acknowledges the support of the TUM Graduate School of Information Science in Health (GSISH), Technische Universität München.


  1. Bache, K., & Lichman, M. (2013). UCI machine learning repository. University of California, Irvine, School of Information and Computer Sciences.
  2. Bay, S., & Pazzani, M. (2001). Detecting group differences: mining contrast sets. Data Mining and Knowledge Discovery, 5, 213–246.CrossRefzbMATHGoogle Scholar
  3. Bouckaert, R., & Frank, E. (2004). Evaluating the replicability of significance tests for comparing learning algorithms. In The 8th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD) (pp. 3–12). Springer.Google Scholar
  4. Bringmann, B., & Zimmermann, A. (2009). One in a million: picking the right patterns. Knowledge and Information Systems, 18, 61–81.CrossRefGoogle Scholar
  5. Cohen, W., & Singer, Y. (1999). A simple, fast, and effective rule learner. In Proceedings of the sixteenth national conference on artificial intelligence (pp. 335–342). AAAI Press.Google Scholar
  6. Dong, G., & Li, J. (1999). Efficient mining of emerging patterns: discovering trends and differences. In Proceedings of the fifth ACM SIGKDD international conference on knowledge discovery and data mining, KDD ’99.Google Scholar
  7. Drzezga, A. (2009). Diagnosis of Alzheimer’s disease with [18F] PET in mild and asymptomatic stages. Behavioural Neurology, 21, 101–115.CrossRefGoogle Scholar
  8. Friedman, J., & Popescu, B. (2008). Predictive learning via rule ensembles. The Annals of Applied Statistics, 2, 916–954.CrossRefzbMATHMathSciNetGoogle Scholar
  9. Grosskreutz, H., & Paurat, D. (2011). Fast and memory-efficient discovery of the top-k relevant subgroups in a reduced candidate space. In Proceedings of the 21st European conference on machine learning and principles and practice of knowledge discovery in databases (pp. 533–548). Springer-Verlag.Google Scholar
  10. Grosskreutz, H., Rüping, S., Wrobel, S. (2008). Tight optimistic estimates for fast subgroup discovery. In Proceedings of the 18th European conference on machine learning and principles and practice of knowledge discovery in databases (pp. 440–456). Springer-Verlag.Google Scholar
  11. Herrera, F., Carmona, C., González, P., Jesus, M. (2011). An overview on subgroup discovery: foundations and applications. Knowledge and Information Systems, 29, 495–525.CrossRefGoogle Scholar
  12. Kaufman, L., & Rousseeuw, P. (1990). Finding groups in data: an introduction to cluster analysis. New York: Wiley.CrossRefGoogle Scholar
  13. Klösgen, W. (1996). Explora: A multipattern and multistrategy discovery assistant. In Advances in knowledge discovery and data mining.Google Scholar
  14. Klösgen, W., & May, M. (2002). Census data mining-an application. In Mining official data (pp. 65–79).Google Scholar
  15. Lavrac, N., Kavsek, B., Flach, P., Todorovski, L., Wrobel, S. (2004). Subgroup discovery with CN2-SD. Journal of Machine Learning Research, 5, 153–118.Google Scholar
  16. Martin, A., & Frank, P. (2006). SD-Map – a fast algorithm for exhaustive subgroup discovery. In Proceeding of 10th European conferences on principles and practice of knowledge discovery in databases (pp. 6–17).Google Scholar
  17. Morishita, S., & Sese, J. (2000). Traversing itemset lattices with statistical metric pruning. In Proceedings of the 19th ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems (pp. 226–236). ACM.Google Scholar
  18. Novak, P., Lavrac, N., Webb, G. (2009). Supervised descriptive rule discovery: a unifying survey of contrast set, emerging pattern and subgroup mining. Journal of Machine Learning Research, 10, 377–403.zbMATHGoogle Scholar
  19. Rodrigue-Lujan, I., Huerta, R., Elkan, C., Cruz, C. (2010). Quadratic programming feature selection. Journal of Machine Learning Research, 11, 1491–1516.Google Scholar
  20. Rückert, U., & Kramer, S. (2008). Margin-based first-order rule learning. Machine Learning, 70, 189–206.CrossRefGoogle Scholar
  21. Rüping, S. (2009). Ranking interesting subgroups. In Proceedings of the 26th annual International Conference on Machine Learning, ICML ’09 (pp. 913–920). New York: ACM.Google Scholar
  22. Schmidt, J., Hapfelmeier, A., Müller, M., Perneczky, R., Drzezga, A., Kurz, A., Kramer, S. (2010). Interpreting PET scans by structured patient data: a data mining case study in dementia research. Journal of Knowledge and Information Systems (KAIS), 24, 149–170.CrossRefGoogle Scholar
  23. van Leeuwen, M.V., & Knobbe, A. (2011). Non-redundant subgroup discovery in large and complex data. In Proceedings of the 21st European conference on machine learning and principles and practice of knowledge discovery in databases (pp. 459–474). Springer-Verlag.Google Scholar
  24. Vreeken, J., Leeuwen, M., Siebes, A. (2011). Krimp: mining itemsets that compress. Data Mining Knowledge Discovery, 23, 169–214.CrossRefzbMATHGoogle Scholar
  25. Wrobel, S. (1997). An algorithm for multi-relational discovery of subgroups. In Proceedings of the first European symposium on principles of data mining and knowledge discovery.Google Scholar
  26. Xin, D., Cheng, H., Yan, X., Han, J. (2006). Extracting redundancy-aware top-k patterns. In Proceedings of the 12th ACM SIGKDD international conference on knowledge discovery and data mining (pp. 444–453).Google Scholar
  27. Zimmermann, A., & Raedt, L. (2004). CorClass: Correlated association rule mining for classification. In Proceedings of discovery science (pp. 60–72). Springer.Google Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  • Rui Li
    • 1
  • Robert Perneczky
    • 2
    • 3
    • 4
  • Alexander Drzezga
    • 5
  • Stefan Kramer
    • 6
    Email author
  1. 1.Institut für Informatik/I12Technische Universität MünchenGarching b. MünchenGermany
  2. 2.Neuroepidemiology and Ageing Research Unit, School of Public Health, Faculty of MedicineThe Imperial College of Science, Technology and MedicineLondonUK
  3. 3.Klinik und Poliklinik für Psychiatrie und PsychotherapieTechnische Universität MünchenMünchenGermany
  4. 4.West London Cognitive Disorders Treatment and Research Unit, West London Mental Health TrustLondonUK
  5. 5.Klinik und Poliklinik für NuklearmedizinUniversität zu KölnKölnGermany
  6. 6.Institut für InformatikJohannes Gutenberg - Universität MainzMainzGermany

Personalised recommendations