{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T22:05:04Z","timestamp":1778364304750,"version":"3.51.4"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,3,16]],"date-time":"2018-03-16T00:00:00Z","timestamp":1521158400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Classif"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1007\/s00357-018-9253-2","type":"journal-article","created":{"date-parts":[[2018,3,16]],"date-time":"2018-03-16T08:17:42Z","timestamp":1521188262000},"page":"100-123","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Extended Box Clustering for Classification Problems"],"prefix":"10.1007","volume":"35","author":[{"given":"Vincenzo","family":"Spinelli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,16]]},"reference":[{"key":"9253_CR1","first-page":"117","volume":"4","author":"B ACHARYA","year":"2007","unstructured":"ACHARYA, B. (2007), \u201cDomination in Hypergraphs\u201d, AKCE Journal of Graphs Combinatorics, 4, 117\u2013126.","journal-title":"AKCE Journal of Graphs Combinatorics"},{"issue":"3","key":"9253_CR2","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/116873.116880","volume":"23","author":"F AURENHAMMER","year":"1991","unstructured":"AURENHAMMER, F. (1991), \u201cVoronoi Diagrams - A Survey of a Fundamental Geometric Data Structure\u201d, ACM Computing Surveys, 23(3), 345\u2013405.","journal-title":"ACM Computing Surveys"},{"key":"9253_CR3","unstructured":"AWASTHI, P., and ZADEH, R.B. (2010), \u201cSupervised Clustering\u201d, in Advances in Neural Information Processing Systems 23, eds. J. Lafferty, C. Williams, J. Shawe-Taylor, R. Zemel, and A. Culotta, Curran Associates, Inc., pp 91\u201399."},{"key":"9253_CR4","unstructured":"BACHE, K., and LICHMAN, M. (2013), \u201cUCIMachine Learning Repository\u201d, http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html"},{"issue":"2","key":"9253_CR5","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/S0195-6698(87)80001-X","volume":"8","author":"I B\u00c1R\u00c1NY","year":"1987","unstructured":"B\u00c1R\u00c1NY, I., and LEHEL, J. (1987), \u201cCovering with Euclidean Boxes\u201d, European Journal of Combinatorics, 8(2), 113\u2013119.","journal-title":"European Journal of Combinatorics"},{"key":"9253_CR6","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-540-33259-6_2","volume-title":"Effective Computational Geometry for Curves and Surfaces","author":"JD BOISSONNAT","year":"2006","unstructured":"BOISSONNAT, J.D., WORMSER, C., and YVINEC, M. (2006), \u201cCurved Voronoi Diagrams\u201d, in Effective Computational Geometry for Curves and Surfaces, eds. J.D. Boissonnat and M. Teillaud, Berlin Heidelberg: Springer, pp 67\u2013116."},{"key":"9253_CR7","unstructured":"BOROS, E. (2010), \u201cIncompatibility Graphs\u201d, in Workshop in Graph Theory and Combinatorics, University of Illinois at Chicago."},{"issue":"2","key":"9253_CR8","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1109\/69.842268","volume":"12","author":"E BOROS","year":"2000","unstructured":"BOROS, E., HAMMER, P., IBARAKI, T., KOGAN, A., MAYORAZ, E., and MUCHNIK, I. (2000), \u201cAn Implementation of Logical Analysis of Data\u201d, IEEE Transactions on Knowledge and Data Engineering, 12(2), 292\u2013306.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"9253_CR9","unstructured":"BOROS, E., GURVICH, V., and LIU, Y. (2005), \u201cComparison of Convex Hulls and Box Hulls\u201d, Ars Combinatoria, 77."},{"key":"9253_CR10","unstructured":"BOROS, E., RICCA, F., and SPINELLI, V. (2011), \u201cIncompatibility Graphs in Data Mining\u201d, in Proceedings of the 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, pp. 4\u20137."},{"key":"9253_CR11","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF03014795","volume":"32","author":"C CARATH\u00c9ODORY","year":"1911","unstructured":"CARATH\u00c9ODORY, C. (1911), \u201c\u00dcber den Variabilit\u00e4tsbereich der Fourier\u2019schen Konstanten von Positiven Harmonischen Funktionen\u201d, Rendiconti del Circolo Matematico di Palermo, 32, 193\u2013217.","journal-title":"Rendiconti del Circolo Matematico di Palermo"},{"key":"9253_CR12","first-page":"67","volume-title":"Experimental Algorithms, Lecture Notes in Computer Science","author":"M CHIARANDINI","year":"2010","unstructured":"CHIARANDINI, M., and ST\u00dcTZLE, T. (2010), \u201cAn Analysis of Heuristics for Vertex Colouring\u201d, in Festa P (ed) Experimental Algorithms, Lecture Notes in Computer Science, Vol 6049, Berlin Heidelberg: Springer, pp 67\u2013116."},{"key":"9253_CR13","volume-title":"Boolean Functions - Theory, Algorithms, and Applications, Encyclopedia of Mathematics and Its Applications","author":"Y CRAMA","year":"2011","unstructured":"CRAMA, Y., and HAMMER, P.L. (2011), Boolean Functions - Theory, Algorithms, and Applications, Encyclopedia of Mathematics and Its Applications, Vol 142, Cambridge: Cambridge University Press."},{"issue":"1","key":"9253_CR14","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/BF02283750","volume":"16","author":"Y CRAMA","year":"1988","unstructured":"CRAMA, Y., HAMMER, P., and IBARAKI, T. (1988), \u201cCause-Effect Relationships and Partially Defined Boolean Functions\u201d, Annals of Operations Research, 16(1), 299\u2013325.","journal-title":"Annals of Operations Research"},{"key":"9253_CR15","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/s00493-005-0032-4","volume":"25","author":"I DINUR","year":"2005","unstructured":"DINUR, I., REGEV, O., and SMYTH, C. (2005), \u201cThe Hardness of 3-Uniform Hypergraph Coloring\u201d, Combinatorica 25, 519\u2013535.","journal-title":"Combinatorica"},{"key":"9253_CR16","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1016\/j.jctb.2008.09.004","volume":"99","author":"R DOTSON","year":"2009","unstructured":"DOTSON, R., and NAGLE, B. (2009), \u201cHereditary Properties of Hypergraphs\u201d, Journal of Combinatorial Theory Series B, 99, 460\u2013473.","journal-title":"Journal of Combinatorial Theory Series B"},{"issue":"4","key":"9253_CR17","first-page":"937","volume":"29","author":"W DUCH","year":"2000","unstructured":"DUCH, W. (2000), \u201cSimilarity-Based Methods: A General Framework for Classification, Approximation and Association\u201d, Control and Cybernetics, 29(4), 937\u2013968.","journal-title":"Control and Cybernetics"},{"issue":"3","key":"9253_CR18","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1023\/A:1020546910706","volume":"23","author":"J ECKSTEIN","year":"2002","unstructured":"ECKSTEIN, J., HAMMER, P., LIU, Y., NEDIAK, M., and SIMEONE, B. (2002), \u201cThe Maximum Box Problem and Its Application to Data Analysis\u201d, Computational Optimization and Application, 23(3), 285\u2013298.","journal-title":"Computational Optimization and Application"},{"key":"9253_CR19","doi-asserted-by":"crossref","unstructured":"EICK, C.F., ZEIDAT, N., and ZHAO, Z. (2004), \u201cSupervised Clustering - Algorithms and Benefits\u201d, in Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence, pp. 774\u2013776.","DOI":"10.1109\/ICTAI.2004.111"},{"key":"9253_CR20","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1115\/1.2218366","volume":"6","author":"P FAYOLLE","year":"2005","unstructured":"FAYOLLE, P., PASKO, A., SCHMITT, B., and MIRENKOV, N. (2005), \u201cConstructive Heterogeneous Object Modeling Using Signed Approximate Real Distance Functions\u201d, Journal of Computing and Information Science in Engineering, 6, 221\u2013229.","journal-title":"Journal of Computing and Information Science in Engineering"},{"key":"9253_CR21","doi-asserted-by":"crossref","unstructured":"FELICI, G., SIMEONE, B., and SPINELLI, V. (2010),\u201cClassification Techniques and Error Control in Logic Mining\u201d, in Data Mining, Annals of Information Systems, Vol 8, eds. R. Stahlbock, S.F. Crone, and S. Lessmann, Springer, pp. 99\u2013119.","DOI":"10.1007\/978-1-4419-1280-0_5"},{"issue":"2-180","key":"9253_CR22","first-page":"57","volume":"46","author":"O GOLUBITSKY","year":"2012","unstructured":"GOLUBITSKY, O., MAZALOV, V., and WATT, S. (2012), \u201cAn Algorithm to Compute the Distance from a Point to a Simplex\u201d, ACM Communications in Computer Algebra, 46(2-180), 57.","journal-title":"ACM Communications in Computer Algebra"},{"key":"9253_CR23","volume-title":"Algorithmic Graph Theory and Perfect Graphs. Computer Science and Applied Mathematics","author":"MC GOLUMBIC","year":"1980","unstructured":"GOLUMBIC, M.C. (1980), Algorithmic Graph Theory and Perfect Graphs. Computer Science and Applied Mathematics, New York: Academic Press."},{"key":"9253_CR24","unstructured":"HELLY, E. (1923), \u201c\u00dcber Mengen Konvexer K\u00f6rper mit Gemeinschaftlichen Punkten\u201d, Jahresbericht der Deutschen Mathematiker-Vereinigung, pp. 175\u2013176."},{"key":"9253_CR25","doi-asserted-by":"crossref","unstructured":"KANEKO, A., and KANO, M. (2003), \u201cDiscrete Geometry on Red and Blue Points in the Plane \u2013 A Survey\u201d, in Discrete and Computational Geometry, Springer, pp. 551\u2013570.","DOI":"10.1007\/978-3-642-55566-4_25"},{"key":"9253_CR26","volume-title":"New York NY","author":"M KANTARDZIC","year":"2002","unstructured":"KANTARDZIC, M. (2002), Data Mining: Concepts, Models, Methods and Algorithms, New York NY: John Wiley and Sons, Inc."},{"issue":"9","key":"9253_CR27","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1016\/j.comgeo.2009.03.002","volume":"42","author":"E KLEIN","year":"2009","unstructured":"KLEIN, E., LANGETEPE, E., and NILFOROUSHAN, Z. (2009), \u201cAbstract Voronoi Diagrams Revisited\u201d, Computational Geometry, 42(9), 885\u2013902.","journal-title":"Computational Geometry"},{"key":"9253_CR28","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/S0196-6774(03)00077-4","volume":"49","author":"M KRIVELEVICH","year":"2003","unstructured":"KRIVELEVICH, M., and SUDAKOV, B. (2003), \u201cApproximate Coloring of Uniform Hypergraphs\u201d, Journal of Algorithms, 49, 2\u201312.","journal-title":"Journal of Algorithms"},{"issue":"4","key":"9253_CR29","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1561\/2200000019","volume":"5","author":"B KULIS","year":"2013","unstructured":"KULIS, B. (2013), \u201cMetric Learning: A Survey\u201d, Foundations and Trends in Machine Learning, 5(4), 287\u2013364.","journal-title":"Foundations and Trends in Machine Learning"},{"issue":"6","key":"9253_CR30","doi-asserted-by":"publisher","first-page":"489","DOI":"10.6028\/jres.084.024","volume":"84","author":"F LEIGHTON","year":"1979","unstructured":"LEIGHTON, F. (1979), \u201cA Graph Coloring Algorithm for Large Scheduling Problems\u201d, Journal of Research of the National Bureau of Standards, 84(6), 489\u2013506.","journal-title":"Journal of Research of the National Bureau of Standards"},{"key":"9253_CR31","volume-title":"WEKA - Data Mining Software in Java","author":"MACHINE LEARNING GROUP","year":"2013","unstructured":"MACHINE LEARNING GROUP (2013), \u201cWEKA - Data Mining Software in Java\u201d, University of Waikato, New Zealand, http:\/\/www.cs.waikato.ac.nz\/ml\/weka ."},{"key":"9253_CR32","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1145\/359423.359430","volume":"20","author":"F PREPARATA","year":"1977","unstructured":"PREPARATA, F., and HONG, S. (1977), \u201cConvex Hulls of Finite Sets of Points in Two and Three Dimensions\u201d, Communications of the ACM, 20, 87\u201393.","journal-title":"Communications of the ACM"},{"key":"9253_CR33","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF01464231","volume":"83","author":"J RADON","year":"1921","unstructured":"RADON, J. (1921), \u201cMengen Konvexer K\u00f6rper, Die Einen Gemeinsamen Punkt Enthalten\u201d, Mathematische Annalen, 83, 113\u2013115.","journal-title":"Mathematische Annalen"},{"key":"9253_CR34","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-02149-7","volume-title":"Semi-Supervised Learning and Domain Adaptation in Natural Language Processing","author":"A SOGAARD","year":"2013","unstructured":"SOGAARD, A. (2013) ,Semi-Supervised Learning and Domain Adaptation in Natural Language Processing, San Rafael: Morgan and Claypool."},{"issue":"3","key":"9253_CR35","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s11634-014-0193-3","volume":"10","author":"V SPINELLI","year":"2016","unstructured":"SPINELLI, V. (2016), \u201cPruning Boxes in a Box-Based Classification Method\u201d, Advances in Data Analysis and Classification,10(3), 285\u2013304.","journal-title":"Advances in Data Analysis and Classification"},{"issue":"1","key":"9253_CR36","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s11634-016-0233-2","volume":"11","author":"V SPINELLI","year":"2017","unstructured":"SPINELLI, V. (2017), \u201cSupervised Box Clustering\u201d, Advances in Data Analysis and Classification, 11(1), 179\u2013204.","journal-title":"Advances in Data Analysis and Classification"},{"key":"9253_CR37","doi-asserted-by":"crossref","unstructured":"WITTEN, I., FRANK, E., and HALL, M. (2011), Data Mining: Practical Machine Learning Tools and Techniques (3rd ed.), Morgan Kaufmann.","DOI":"10.1016\/B978-0-12-374856-0.00001-8"},{"key":"9253_CR38","first-page":"1033","volume":"14","author":"M ZHAO","year":"2013","unstructured":"ZHAO, M., EDAKUNNI, N., POCOCK, A., and BROWN, G. (2013), \u201cBeyond Fanos Inequality: Bounds on the Optimal F-Score, Ber, and Cost-Sensitive Risk and Their Implications\u201d, Journal of Machine Learning Research, 14, 1033\u20131090.","journal-title":"Journal of Machine Learning Research"},{"key":"9253_CR39","unstructured":"ZHOU, D., HUANG, J., and SCH\u00d6LKOPF, B. (2006), \u201cLearning with Hypergraphs: Clustering, Classification, and Embedding\u201d, in Advances in Neural Information Processing Systems (NIPS) 19, MIT Press, pp. 1601\u20131608."}],"container-title":["Journal of Classification"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00357-018-9253-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00357-018-9253-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00357-018-9253-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,16]],"date-time":"2022-08-16T04:58:07Z","timestamp":1660625887000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00357-018-9253-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,16]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,4]]}},"alternative-id":["9253"],"URL":"https:\/\/doi.org\/10.1007\/s00357-018-9253-2","relation":{},"ISSN":["0176-4268","1432-1343"],"issn-type":[{"value":"0176-4268","type":"print"},{"value":"1432-1343","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,3,16]]},"assertion":[{"value":"16 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}