{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,20]],"date-time":"2024-01-20T14:43:53Z","timestamp":1705761833949},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,11,20]],"date-time":"2013-11-20T00:00:00Z","timestamp":1384905600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Intell Inf Syst"],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1007\/s10844-013-0284-1","type":"journal-article","created":{"date-parts":[[2013,11,19]],"date-time":"2013-11-19T06:09:30Z","timestamp":1384841370000},"page":"271-288","source":"Crossref","is-referenced-by-count":5,"title":["Efficient redundancy reduced subgroup discovery via quadratic programming"],"prefix":"10.1007","volume":"44","author":[{"given":"Rui","family":"Li","sequence":"first","affiliation":[]},{"given":"Robert","family":"Perneczky","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Drzezga","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Kramer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,11,20]]},"reference":[{"key":"284_CR7","unstructured":"Bache, K., & Lichman, M. (2013). UCI machine learning repository. University of California, Irvine, School of Information and Computer Sciences. http:\/\/archive.ics.uci.edu\/ml ."},{"key":"284_CR1","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1023\/A:1011429418057","volume":"5","author":"S Bay","year":"2001","unstructured":"Bay, S., & Pazzani, M. (2001). Detecting group differences: mining contrast sets. Data Mining and Knowledge Discovery, 5, 213\u2013246.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"284_CR2","doi-asserted-by":"crossref","unstructured":"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\u201312). Springer.","DOI":"10.1007\/978-3-540-24775-3_3"},{"key":"284_CR3","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s10115-008-0136-4","volume":"18","author":"B Bringmann","year":"2009","unstructured":"Bringmann, B., & Zimmermann, A. (2009). One in a million: picking the right patterns. Knowledge and Information Systems, 18, 61\u201381.","journal-title":"Knowledge and Information Systems"},{"key":"284_CR4","unstructured":"Cohen, W., & Singer, Y. (1999). A simple, fast, and effective rule learner. In Proceedings of the sixteenth national conference on artificial intelligence (pp. 335\u2013342). AAAI Press."},{"key":"284_CR5","doi-asserted-by":"crossref","unstructured":"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 \u201999.","DOI":"10.1145\/312129.312191"},{"key":"284_CR6","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1155\/2009\/276026","volume":"21","author":"A Drzezga","year":"2009","unstructured":"Drzezga, A. (2009). Diagnosis of Alzheimer\u2019s disease with [18F] PET in mild and asymptomatic stages. Behavioural Neurology, 21, 101\u2013115.","journal-title":"Behavioural Neurology"},{"key":"284_CR8","doi-asserted-by":"crossref","first-page":"916","DOI":"10.1214\/07-AOAS148","volume":"2","author":"J Friedman","year":"2008","unstructured":"Friedman, J., & Popescu, B. (2008). Predictive learning via rule ensembles. The Annals of Applied Statistics, 2, 916\u2013954.","journal-title":"The Annals of Applied Statistics"},{"key":"284_CR9","doi-asserted-by":"crossref","unstructured":"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\u2013548). Springer-Verlag.","DOI":"10.1007\/978-3-642-23780-5_44"},{"key":"284_CR10","doi-asserted-by":"crossref","unstructured":"Grosskreutz, H., R\u00fcping, 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\u2013456). Springer-Verlag.","DOI":"10.1007\/978-3-540-87479-9_47"},{"key":"284_CR11","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1007\/s10115-010-0356-2","volume":"29","author":"F Herrera","year":"2011","unstructured":"Herrera, F., Carmona, C., Gonz\u00e1lez, P., Jesus, M. (2011). An overview on subgroup discovery: foundations and applications. Knowledge and Information Systems, 29, 495\u2013525.","journal-title":"Knowledge and Information Systems"},{"key":"284_CR12","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316801","volume-title":"Finding groups in data: an introduction to cluster analysis","author":"L Kaufman","year":"1990","unstructured":"Kaufman, L., & Rousseeuw, P. (1990). Finding groups in data: an introduction to cluster analysis. New York: Wiley."},{"key":"284_CR13","unstructured":"Kl\u00f6sgen, W. (1996). Explora: A multipattern and multistrategy discovery assistant. In Advances in knowledge discovery and data mining."},{"key":"284_CR14","unstructured":"Kl\u00f6sgen, W., & May, M. (2002). Census data mining-an application. In Mining official data (pp. 65\u201379)."},{"key":"284_CR15","first-page":"153","volume":"5","author":"N Lavrac","year":"2004","unstructured":"Lavrac, N., Kavsek, B., Flach, P., Todorovski, L., Wrobel, S. (2004). Subgroup discovery with CN2-SD. Journal of Machine Learning Research, 5, 153\u2013118.","journal-title":"Journal of Machine Learning Research"},{"key":"284_CR17","unstructured":"Martin, A., & Frank, P. (2006). SD-Map \u2013 a fast algorithm for exhaustive subgroup discovery. In Proceeding of 10th European conferences on principles and practice of knowledge discovery in databases (pp. 6\u201317)."},{"key":"284_CR18","unstructured":"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\u2013236). ACM."},{"key":"284_CR19","first-page":"377","volume":"10","author":"P Novak","year":"2009","unstructured":"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\u2013403.","journal-title":"Journal of Machine Learning Research"},{"key":"284_CR20","first-page":"1491","volume":"11","author":"I Rodrigue-Lujan","year":"2010","unstructured":"Rodrigue-Lujan, I., Huerta, R., Elkan, C., Cruz, C. (2010). Quadratic programming feature selection. Journal of Machine Learning Research, 11, 1491\u20131516.","journal-title":"Journal of Machine Learning Research"},{"key":"284_CR21","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s10994-007-5034-6","volume":"70","author":"U R\u00fcckert","year":"2008","unstructured":"R\u00fcckert, U., & Kramer, S. (2008). Margin-based first-order rule learning. Machine Learning, 70, 189\u2013206.","journal-title":"Machine Learning"},{"key":"284_CR22","first-page":"913","volume-title":"Proceedings of the 26th annual International Conference on Machine Learning, ICML \u201909","author":"S R\u00fcping","year":"2009","unstructured":"R\u00fcping, S. (2009). Ranking interesting subgroups. In Proceedings of the 26th annual International Conference on Machine Learning, ICML \u201909 (pp. 913\u2013920). New York: ACM."},{"key":"284_CR23","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/s10115-009-0234-y","volume":"24","author":"J Schmidt","year":"2010","unstructured":"Schmidt, J., Hapfelmeier, A., M\u00fcller, 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\u2013170.","journal-title":"Journal of Knowledge and Information Systems (KAIS)"},{"key":"284_CR16","doi-asserted-by":"crossref","unstructured":"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\u2013474). Springer-Verlag.","DOI":"10.1007\/978-3-642-23808-6_30"},{"key":"284_CR24","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/s10618-010-0202-x","volume":"23","author":"J Vreeken","year":"2011","unstructured":"Vreeken, J., Leeuwen, M., Siebes, A. (2011). Krimp: mining itemsets that compress. Data Mining Knowledge Discovery, 23, 169\u2013214.","journal-title":"Data Mining Knowledge Discovery"},{"key":"284_CR25","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1007\/3-540-63223-9_108"},{"key":"284_CR26","doi-asserted-by":"crossref","unstructured":"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\u2013453).","DOI":"10.1145\/1150402.1150452"},{"key":"284_CR27","doi-asserted-by":"crossref","unstructured":"Zimmermann, A., & Raedt, L. (2004). CorClass: Correlated association rule mining for classification. In Proceedings of discovery science (pp. 60\u201372). Springer.","DOI":"10.1007\/978-3-540-30214-8_5"}],"container-title":["Journal of Intelligent Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-013-0284-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10844-013-0284-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-013-0284-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,2]],"date-time":"2019-08-02T13:21:28Z","timestamp":1564752088000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10844-013-0284-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,20]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["284"],"URL":"https:\/\/doi.org\/10.1007\/s10844-013-0284-1","relation":{},"ISSN":["0925-9902","1573-7675"],"issn-type":[{"value":"0925-9902","type":"print"},{"value":"1573-7675","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,11,20]]}}}