{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:34:27Z","timestamp":1761896067963},"reference-count":33,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2016,2,1]],"date-time":"2016-02-01T00:00:00Z","timestamp":1454284800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"name":"National Strategic Reference Framework"},{"name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[2016,2]]},"DOI":"10.1016\/j.ins.2015.04.022","type":"journal-article","created":{"date-parts":[[2015,4,17]],"date-time":"2015-04-17T23:38:18Z","timestamp":1429313898000},"page":"921-936","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":48,"special_numbering":"C","title":["Entropy-based discretization methods for ranking data"],"prefix":"10.1016","volume":"329","author":[{"given":"Cl\u00e1udio Rebelo","family":"de S\u00e1","sequence":"first","affiliation":[]},{"given":"Carlos","family":"Soares","sequence":"additional","affiliation":[]},{"given":"Arno","family":"Knobbe","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ins.2015.04.022_b0005","unstructured":"R. Agrawal, R. Srikant, Fast algorithms for mining association rules in large databases, in: VLDB, 1994, pp. 487\u2013499."},{"key":"10.1016\/j.ins.2015.04.022_b0010","doi-asserted-by":"crossref","unstructured":"A. Aiguzhinov, C. Soares, A.P. Serra, A similarity-based adaptation of naive Bayes for label ranking: application to the metalearning problem of algorithm recommendation, in: Discovery Science \u2013 13th International Conference, DS 2010, Canberra, Australia, October 6\u20138, 2010, Proceedings, 2010, pp. 16\u201326.","DOI":"10.1007\/978-3-642-16184-1_2"},{"issue":"1","key":"10.1016\/j.ins.2015.04.022_b0015","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s10618-010-0173-y","article-title":"Ensembles of jittered association rule classifiers","volume":"21","author":"Azevedo","year":"2010","journal-title":"Data Min. Knowl. Discov."},{"issue":"4","key":"10.1016\/j.ins.2015.04.022_b0020","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/PL00011680","article-title":"Multivariate discretization for set mining","volume":"3","author":"Bay","year":"2001","journal-title":"Knowl. Inform. Syst."},{"key":"10.1016\/j.ins.2015.04.022_b0025","unstructured":"J. Cerquides, R.L. de M\u00e1ntaras, Proposal and empirical comparison of a parallelizable distance-based discretization method, in: Proceedings of the Third International Conference on Knowledge Discovery and Data Mining (KDD-97), Newport Beach, California, USA, August 14\u201317, 1997, 1997, pp. 139\u2013142. <http:\/\/www.aaai.org\/Library\/KDD\/1997\/kdd97-024.php>."},{"key":"10.1016\/j.ins.2015.04.022_b0030","doi-asserted-by":"crossref","unstructured":"W. Cheng, J.C. Huhn, E. H\u00fcllermeier, Decision tree and instance-based learning for label ranking, in: Proceedings of the 26th Annual International Conference on Machine Learning, ICML 2009, Montreal, Quebec, Canada, June 14\u201318, 2009, 2009, pp. 161\u2013168.","DOI":"10.1145\/1553374.1553395"},{"key":"10.1016\/j.ins.2015.04.022_b0035","unstructured":"W. Cheng, E. H\u00fcllermeier, Label ranking with abstention: predicting partial orders by thresholding probability distributions (extended abstract), Comput. Res. Repository, CoRR abs\/1112.0508. <http:\/\/arxiv.org\/abs\/1112.0508>."},{"key":"10.1016\/j.ins.2015.04.022_b0040","unstructured":"W. Cheng, E. H\u00fcllermeier, W. Waegeman, V. Welker, Label ranking with partial abstention based on thresholded probabilistic models, in: Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012, Proceedings of a Meeting held December 3\u20136, 2012, Lake Tahoe, Nevada, United States, 2012, pp. 2510\u20132518. <http:\/\/books.nips.cc\/papers\/files\/nips25\/NIPS2012_1200.pdf>."},{"issue":"2","key":"10.1016\/j.ins.2015.04.022_b0045","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1080\/09528139008953718","article-title":"Information synthesis based on hierarchical maximum entropy discretization","volume":"2","author":"Chiu","year":"1990","journal-title":"J. Exp. Theor. Artif. Intell."},{"key":"10.1016\/j.ins.2015.04.022_b0050","doi-asserted-by":"crossref","unstructured":"C.R. de S\u00e1, C. Soares, A.M. Jorge, P.J. Azevedo, J.P. da Costa, Mining association rules for label ranking, in: Advances in Knowledge Discovery and Data Mining \u2013 15th Pacific-Asia Conference, PAKDD 2011, Shenzhen, China, May 24\u201327, 2011, Proceedings, Part II, 2011, pp. 432\u2013443.","DOI":"10.1007\/978-3-642-20847-8_36"},{"key":"10.1016\/j.ins.2015.04.022_b0055","doi-asserted-by":"crossref","unstructured":"C.R. de S\u00e1, C. Soares, A.J. Knobbe, P.J. Azevedo, A.M. Jorge, Multi-interval discretization of continuous attributes for label ranking, in: Discovery Science \u2013 16th International Conference, DS 2013, Singapore, October 6\u20139, 2013, Proceedings, 2013, pp. 155\u2013169.","DOI":"10.1007\/978-3-642-40897-7_11"},{"key":"10.1016\/j.ins.2015.04.022_b0060","doi-asserted-by":"crossref","unstructured":"J. Dougherty, R. Kohavi, M. Sahami, Supervised and unsupervised discretization of continuous features, in: Machine Learning, Proceedings of the Twelfth International Conference on Machine Learning, Tahoe City, California, USA, July 9\u201312, 1995, 1995, pp. 194\u2013202.","DOI":"10.1016\/B978-1-55860-377-6.50032-3"},{"issue":"2","key":"10.1016\/j.ins.2015.04.022_b0065","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1023\/B:DAMI.0000015868.85039.e6","article-title":"Efficient multisplitting revisited: optima-preserving elimination of partition candidates","volume":"8","author":"Elomaa","year":"2004","journal-title":"Data Min. Knowl. Discov."},{"key":"10.1016\/j.ins.2015.04.022_b0070","unstructured":"U.M. Fayyad, K.B. Irani, Multi-interval discretization of continuous-valued attributes for classification learning, in: Proceedings of the 13th International Joint Conference on Artificial Intelligence. Chamb\u00e9ry, France, August 28 \u2013 September 3, 1993, 1993, pp. 1022\u20131029."},{"issue":"4","key":"10.1016\/j.ins.2015.04.022_b0075","doi-asserted-by":"crossref","first-page":"734","DOI":"10.1109\/TKDE.2012.35","article-title":"A survey of discretization techniques: taxonomy and empirical analysis in supervised learning","volume":"25","author":"Garc\u00eda","year":"2013","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"10.1016\/j.ins.2015.04.022_b0080","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1145\/360402.360421","article-title":"Algorithms for association rule mining \u2013 a general survey and comparison","volume":"2","author":"Hipp","year":"2000","journal-title":"SIGKDD Explor."},{"key":"10.1016\/j.ins.2015.04.022_b0085","unstructured":"K.M. Ho, P.D. Scott, Zeta: a global method for discretization of continuous variables, in: Proceedings of the Third International Conference on Knowledge Discovery and Data Mining (KDD-97), Newport Beach, California, USA, August 14\u201317, 1997, 1997, pp. 191\u2013194. <http:\/\/www.aaai.org\/Library\/KDD\/1997\/kdd97-037.php>."},{"key":"10.1016\/j.ins.2015.04.022_b0090","doi-asserted-by":"crossref","unstructured":"W. Huang, Y. Pan, J. Wu, Supervised discretization for optimal prediction, Proc. Comput. Sci. 30 (0) (2014) 75\u201380 (1st International Conference on Data Science, {ICDS} 2014). <http:\/\/www.sciencedirect.com\/science\/article\/pii\/S1877050914005602>.","DOI":"10.1016\/j.procs.2014.05.383"},{"issue":"16\u201317","key":"10.1016\/j.ins.2015.04.022_b0095","doi-asserted-by":"crossref","first-page":"1897","DOI":"10.1016\/j.artint.2008.08.002","article-title":"Label ranking by learning pairwise preferences","volume":"172","author":"H\u00fcllermeier","year":"2008","journal-title":"Artif. Intell."},{"key":"10.1016\/j.ins.2015.04.022_b0100","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1016\/j.knosys.2014.10.014","article-title":"A novel approach for discretization of continuous attributes in rough set theory","volume":"73","author":"Jiang","year":"2015","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.ins.2015.04.022_b0105","series-title":"Rank Correlation Methods","author":"Kendall","year":"1970"},{"key":"10.1016\/j.ins.2015.04.022_b0110","unstructured":"R. Kerber, Chimerge: discretization of numeric attributes, in: Proceedings of the 10th National Conference on Artificial Intelligence. San Jose, CA, July 12\u201316, 1992, 1992, pp. 123\u2013128. <http:\/\/www.aaai.org\/Library\/AAAI\/1992\/aaai92-019.php>."},{"issue":"1","key":"10.1016\/j.ins.2015.04.022_b0115","first-page":"47","article-title":"Discretization techniques: a recent survey","volume":"32","author":"Kotsiantis","year":"2006","journal-title":"GESTS Int. Trans. Comput. Sci. Eng."},{"issue":"5","key":"10.1016\/j.ins.2015.04.022_b0120","doi-asserted-by":"crossref","first-page":"e96431","DOI":"10.1371\/journal.pone.0096431","article-title":"A cognitive model for aggregating people\u2019s rankings","volume":"9","author":"Lee","year":"2014","journal-title":"Publ. Libr. Sci. PLOS ONE"},{"key":"10.1016\/j.ins.2015.04.022_b0125","unstructured":"B. Letham, T.H. Mccormick, C. Rudin, D. Madigan, Building Interpretable Classifiers with Rules using Bayesian Analysis, 2012. <http:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.300.4630>."},{"key":"10.1016\/j.ins.2015.04.022_b0130","unstructured":"B. Liu, W. Hsu, Y. Ma, Integrating classification and association rule mining, in: Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining (KDD-98), New York City, New York, USA, August 27\u201331, 1998, 1998, pp. 80\u201386. <http:\/\/www.aaai.org\/Library\/KDD\/1998\/kdd98-012.php>."},{"issue":"4","key":"10.1016\/j.ins.2015.04.022_b0135","doi-asserted-by":"crossref","first-page":"642","DOI":"10.1109\/69.617056","article-title":"Feature selection via discretization","volume":"9","author":"Liu","year":"1997","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.ins.2015.04.022_b0140","series-title":"Machine Learning","author":"Mitchell","year":"1997"},{"key":"10.1016\/j.ins.2015.04.022_b0145","series-title":"C4.5: Programs for Machine Learning","author":"Quinlan","year":"1993"},{"key":"10.1016\/j.ins.2015.04.022_b0150","doi-asserted-by":"crossref","unstructured":"G. Ribeiro, W. Duivesteijn, C. Soares, A.J. Knobbe, Multilayer perceptron for label ranking, in: Artificial Neural Networks and Machine Learning \u2013 ICANN 2012 \u2013 22nd International Conference on Artificial Neural Networks, Lausanne, Switzerland, September 11\u201314, 2012, Proceedings, Part II, 2012, pp. 25\u201332.","DOI":"10.1007\/978-3-642-33266-1_4"},{"key":"10.1016\/j.ins.2015.04.022_b0155","doi-asserted-by":"crossref","first-page":"72","DOI":"10.2307\/1412159","article-title":"The proof and measurement of association between two things","volume":"15","author":"Spearman","year":"1904","journal-title":"Am. J. Psychol."},{"key":"10.1016\/j.ins.2015.04.022_b0160","series-title":"Preference Learning","first-page":"45","article-title":"Label ranking algorithms: a survey","author":"Vembu","year":"2010"},{"key":"10.1016\/j.ins.2015.04.022_b0165","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/j.knosys.2014.08.029","article-title":"A label ranking method based on gaussian mixture model","volume":"72","author":"Zhou","year":"2014","journal-title":"Knowl.-Based Syst."}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002002551500290X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002002551500290X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,6,23]],"date-time":"2022-06-23T03:28:58Z","timestamp":1655954938000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S002002551500290X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2]]},"references-count":33,"alternative-id":["S002002551500290X"],"URL":"https:\/\/doi.org\/10.1016\/j.ins.2015.04.022","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[2016,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Entropy-based discretization methods for ranking data","name":"articletitle","label":"Article Title"},{"value":"Information Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ins.2015.04.022","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2015 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}