{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:29:37Z","timestamp":1725488977772},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540410669"},{"type":"electronic","value":"9783540453727"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"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":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45372-5_72","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T07:21:49Z","timestamp":1186903309000},"page":"599-604","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Experimental Study of Partition Quality Indices in Clustering"],"prefix":"10.1007","author":[{"given":"C\u00e9line","family":"Robardet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabien","family":"Feschet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Nicoloyannis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,7,18]]},"reference":[{"key":"72_CR1","series-title":"Technical report","volume-title":"Iterate: a conceptual clustering method for knowledge discovery in databases","author":"G. Biswas","year":"1995","unstructured":"G. Biswas, J. Weinberg, and C. Li. Iterate: a conceptual clustering method for knowledge discovery in databases. Technical report, CS Departement, Vanderbilt university, Nashville, 1995."},{"key":"72_CR2","unstructured":"G. Celeux and E. Diday et al. Classiffication automatique des donn\u00e9es. Dunod, 1988."},{"key":"72_CR3","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1023\/A:1022694001379","volume":"6","author":"R. L\u00f3pez de M\u00e0ntaras","year":"1991","unstructured":"R. L\u00f3pez de M\u00e0ntaras. A distance based attribute selection measure for decision tree induction. Machine Learning, 6:81\u201392, 1991.","journal-title":"Machine Learning"},{"issue":"1-2","key":"72_CR4","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69B","author":"J. Edmonds","year":"1965","unstructured":"J. Edmonds. Maximum matching and a polyhedron with 0-1 vertices. Res. Nat. Bureau Standards, 69B(1-2):125\u2013130, 1965.","journal-title":"Res. Nat. Bureau Standards"},{"key":"72_CR5","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1613\/jair.276","volume":"4","author":"D. Fisher","year":"1996","unstructured":"Doug Fisher. Iterative optimization and simplification of hierarchical clusterings. Journal of Artificial Intelligence Research, 4:147\u2013180, 1996.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"72_CR6","first-page":"139","volume":"2","author":"D. H. Fisher","year":"1987","unstructured":"Douglas H. Fisher. Knowledge acquisition via incremental conceptual clustering. Machine Learning, 2:139\u2013172, 1987.","journal-title":"Machine Learning"},{"key":"72_CR7","series-title":"Technical report","volume-title":"Unsupervised learning of probabilistic concept hierarchies","author":"W. Iba","year":"1999","unstructured":"W. Iba and P. Langley. Unsupervised learning of probabilistic concept hierarchies. Technical report, Inst. for the study of learning and expertise Pablo Alto, 1999."},{"key":"72_CR8","volume-title":"Algorithms for clustering data","author":"A. K. Jain","year":"1988","unstructured":"A. K. Jain and R.C. Dubes. Algorithms for clustering data. Prentice Hall, Englewood cliffs, New Jersey, 1988."},{"key":"72_CR9","first-page":"47","volume":"16","author":"M. Karonski","year":"1977","unstructured":"M. Karonski and Z. Palka. On marczewski-steinhaus type distance between hypergraphs. Zastosowania Mat. Appli. Mathematicae, 16:47\u201357, 1977.","journal-title":"Zastosowania Mat. Appli. Mathematicae"},{"key":"72_CR10","doi-asserted-by":"crossref","first-page":"319","DOI":"10.4064\/cm-6-1-319-327","volume":"6","author":"E. Marczewski","year":"1958","unstructured":"E. Marczewski and H. Steinhaus. On a certain distance of sets and the corresponding distance of functions. Colloquium Mathematicum, 6:319\u2013327, 1958.","journal-title":"Colloquium Mathematicum"},{"key":"72_CR11","doi-asserted-by":"crossref","unstructured":"L. Talavera and J. B\u00e9jar. Efficient construction of comprehensible hierarchical clusterings. In J. M. \u017cytkow and M. Quafafou, editors, 2nd PKDD, volume 1510, pages 93\u2013101. Springer-Verlag, 1998.","DOI":"10.1007\/BFb0094809"},{"key":"72_CR12","unstructured":"L. Wehenkel. On uncertainty measures used for decision tree induction. In Info. Proc. and Manag. of Uncertainty, pages 413\u2013418, 1996."}],"container-title":["Lecture Notes in Computer Science","Principles of Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45372-5_72","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T14:22:52Z","timestamp":1558275772000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45372-5_72"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540410669","9783540453727"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-45372-5_72","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"18 July 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}