{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T00:05:54Z","timestamp":1752192354425,"version":"3.41.2"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Machine Learning"],"published-print":{"date-parts":[[2002,4]]},"DOI":"10.1023\/a:1013631728342","type":"journal-article","created":{"date-parts":[[2002,12,23]],"date-time":"2002-12-23T17:11:47Z","timestamp":1040663507000},"page":"35-61","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["A New Nonparametric Pairwise Clustering Algorithm Based on Iterative Estimation of Distance Profiles"],"prefix":"10.1007","volume":"47","author":[{"given":"Shlomo","family":"Dubnov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ran","family":"El-Yaniv","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoram","family":"Gdalyahu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elad","family":"Schneidman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naftali","family":"Tishby","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Golan","family":"Yona","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"390056_CR1","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198538493.001.0001","volume-title":"Neural networks for pattern recognition","author":"C. Bishop","year":"1995","unstructured":"Bishop, C. (1995). Neural networks for pattern recognition. Oxford: Oxford Press."},{"key":"390056_CR2","unstructured":"Blake, C., Keogh, E., & Merz, C. (1998). UCI Repository of machine learning databases. http:\/\/www.ics.uci.edu\/ ~mlearn\/MLRepository.html."},{"key":"390056_CR3","first-page":"416","volume-title":"Advances in neural information processing system","author":"M. Blatt","year":"1996","unstructured":"Blatt, M., Wisemann, S., & Domany, E. (1996). Clustering data through an analogy to the Potts model. In D. Touretzky, M. Mozer, & M. Hasselmo (Eds.), Advances in neural information processing system (Vol. 8, pp. 416\u2013422), Cambridge, MA: The MIT Press."},{"key":"390056_CR4","unstructured":"Buhmann, J., & Hofmann, T. (1995). Pairwise data clustering by deterministic annealing. Technical Report IAITR\u201395\u20137, Department of Computer Science, University of Bonn. ftp:\/\/ftp.informatik.uni-bonn.de\/pub\/paper\/ infIII\/IAI-TR\u201395\u20137.ps.gz."},{"key":"390056_CR5","first-page":"54","volume-title":"Proceedings of the Fifth International Machine Learing Conference","author":"P. Cheeseman","year":"1988","unstructured":"Cheeseman, P., Kelly, J., Self, M., Stutz, J., Taylor, W., & Freeman, D. (1988). AUTOCLASS: A Bayesian classification system. In Proceedings of the Fifth International Machine Learing Conference (pp. 54\u201364). Ann Arbor MI: Morgan Kaufmann."},{"key":"390056_CR6","volume-title":"An introduction to phonetics and phonology (Blackwell textbooks in linguistics, Vol. 9)","author":"J. Clark","year":"1995","unstructured":"Clark, J., & Yallop, C. (1995). An introduction to phonetics and phonology (Blackwell textbooks in linguistics, Vol. 9). Oxford: Blackwell Pub."},{"key":"390056_CR7","first-page":"73","volume":"11","author":"T. Crawford","year":"1998","unstructured":"Crawford, T., Iliopolous, C., & Raman, R. (1998). String matching techniques for musical similarity and melodic recognition. Computing in Muiscology, 11, 73\u2013100.","journal-title":"Computing in Muiscology"},{"key":"390056_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"A. Dempster","year":"1977","unstructured":"Dempster, A., Laird, N., & Rubin, D. (1977). Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, 39 (Series B), 1\u201338.","journal-title":"Journal of the Royal Statistical Society"},{"key":"390056_CR9","unstructured":"Dubnov, S., El-Yaniv, R., & Assayag, G. (1997). Universal classification applied to musical sequences. In Proceedings of the International Computer Music Conference. Ann Arbor, Michigan."},{"key":"390056_CR10","volume-title":"Pattern classification and scene analysis","author":"R. Duda","year":"1973","unstructured":"Duda, R., & Hart, P. (1973). Pattern classification and scene analysis. New York: Wiley."},{"key":"390056_CR11","volume-title":"Advances in neural information processing system (Vol. 10)","author":"R. El-Yaniv","year":"1997","unstructured":"El-Yaniv, R., Fine, S., & Tishby, N. (1997). Agnostic classification of markovian sequences. In M. Jordan, M. Kearns, & S. Solla (Eds.), Advances in neural information processing system (Vol. 10). Cambridge, MA: The MIT Press."},{"key":"390056_CR12","first-page":"220","volume-title":"Advances in neural information processing system","author":"M. Fanty","year":"1991","unstructured":"Fanty, M., & Cole, R. (1991). Spoken letter recognition. In R. Lippmann, J. Moody, D. Touretzky, & S. Hanson (Eds.), Advances in neural information processing system (Vol. 3., pp. 220\u2013226). Cambridge, MA: The MIT Press."},{"key":"390056_CR13","first-page":"147","volume":"4","author":"D. Fisher","year":"1996","unstructured":"Fisher, D. (1996). Iterative optimization and simplification of hierarchical clusterings. J. Artifi. Intel. Res., 4, 147\u2013179.","journal-title":"J. Artifi. Intel. Res."},{"issue":"2","key":"390056_CR14","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1111\/j.1469-1809.1936.tb02137.x","volume":"7","author":"R. Fisher","year":"1936","unstructured":"Fisher, R. (1936). The use of multiple measurements in taxonomic problems. Annals of Eugenics, 7:2, 179\u2013188.","journal-title":"Annals of Eugenics"},{"key":"390056_CR15","volume-title":"Advances in neural information processing systems (Vol. 11)","author":"Y. Gdalyahu","year":"1988","unstructured":"Gdalyahu, Y., Weinshall, D., & Werman, M. (1988).Arandomized algorithm for pairwise clustering. In M. Kearns, S. Solla, & D. Cohn (Eds.), Advances in neural information processing systems (Vol. 11). Cambridge, MA: The MIT Press."},{"key":"390056_CR16","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1137\/0109047","volume":"9","author":"R. Gomory","year":"1961","unstructured":"Gomory, R., & Hu, T. (1961). Multi-terminal network flows. SIAM Journal of Applied Mathematics, 9, 551\u2013570.","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"390056_CR17","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1109\/TIT.1979.1056066","volume":"25","author":"K.C. Gowda","year":"1979","unstructured":"Gowda, K.C., & Krishna, G. (1979). The condensed nearest neighbor rule using the concept of mutual nearest neighborhood. IEEE Transactions on Information Theory, 25, 488\u2013490.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"390056_CR18","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1109\/18.32134","volume":"35","author":"M. Gutman","year":"1989","unstructured":"Gutman, M. (1989). Asymptotically optimal classification for multiple tests with empirically obsereved statistics. IEEE Transactions on Information Theory, 35:2, 401\u2013408.","journal-title":"IEEE Transactions on Information Theory"},{"key":"390056_CR19","volume-title":"Algorithms for clustering data","author":"A. Jain","year":"1988","unstructured":"Jain, A., & Dubes, R. (1988). Algorithms for clustering data. New Jersey: Prentice-Hall."},{"key":"390056_CR20","unstructured":"Kleinberg, J. (1998). Authoritative sources in a hyperlinked environment. In Proc. 9th ACM-SIAM Symposium on Discrete Algorithms."},{"key":"390056_CR21","series-title":"Technical Report MH 2C-571","volume-title":"A theorem about CONCOR","author":"J. Kruskal","year":"1978","unstructured":"Kruskal, J. (1978). A theorem about CONCOR. Technical Report MH 2C-571, Bell Laboratories, 600 Mountain Avenue, Murray Hill, NJ 07974."},{"key":"390056_CR22","volume-title":"Information theory and statistics","author":"S. Kullback","year":"1959","unstructured":"Kullback, S. (1959). Information theory and statistics. New York: Wiley & Sons."},{"issue":"1","key":"390056_CR23","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1109\/18.61115","volume":"37","author":"J. Lin","year":"1991","unstructured":"Lin, J. (1991). Divergence measures based on the Shannon entropy. IEEE Transactions on Information Theory, 37:1, 145\u2013151.","journal-title":"IEEE Transactions on Information Theory"},{"key":"390056_CR24","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1006\/jmbi.1997.0948","volume":"268","author":"M. Linial","year":"1997","unstructured":"Linial, M., Linial, N., Tishby, N., & Yona, G. (1997). Global organization of protein segments using newalgorithms for metric empbedding and clustering. Journal of Molecular Biology, 268, 539\u2013556.","journal-title":"Journal of Molecular Biology"},{"key":"390056_CR25","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1177\/001316446802800201","volume":"28","author":"L. McQuitty","year":"1968","unstructured":"McQuitty, L., & Clark, J. (1968). Clusters from iterative intercolumnar correlational analysis. Educ. Psych. Meas., 28, 211\u2013238.","journal-title":"Educ. Psych. Meas."},{"key":"390056_CR26","first-page":"219","volume":"5","author":"R. Michalski","year":"1983","unstructured":"Michalski, R., & Stepp, R. (1983). Automated construction of classifications: Conceptual clustering versus numerical taxonomy. IEEE Transactions on Pattern Analysis and Machine Intelligenc, 5, 219\u2013243.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligenc"},{"key":"390056_CR27","doi-asserted-by":"crossref","unstructured":"Pereira, F., Tishby, N., & Lee, L. (1993). Distributional clustering of English words. In Proc. of the 31st Annual Meeting of the Association for Computational Linguistics.","DOI":"10.3115\/981574.981598"},{"key":"390056_CR28","doi-asserted-by":"crossref","unstructured":"Perona, P., & Freeman, W.T. (1998). A factorization approach to grouping. In Proceedings of ECCV.","DOI":"10.1007\/BFb0055696"},{"key":"390056_CR29","volume-title":"Reading in music and AI","author":"P. Rolland","year":"1999","unstructured":"Rolland, P., & Ganascia, J. (1999). Musical pattern extraction and similarity assesment. In E. Miranda (Ed.), Reading in music and AI. New York: Harwood Academic Press."},{"key":"390056_CR30","doi-asserted-by":"crossref","unstructured":"Rose, K., Gurewitz, E., & Fox, G. (1992). Vector quantization by deterministic annealing. IEEE Transactions on Information Theory, 38.","DOI":"10.1109\/18.144705"},{"key":"390056_CR31","unstructured":"Schreibman, A. (2000). Stochastic modeling for efficient computation of information theoretic quantities. Master's thesis, Hebrew University."},{"key":"390056_CR32","unstructured":"Schwob, R. (1998). The classical midi archive. http:\/\/www.prs.net\/midi.html."},{"key":"390056_CR33","unstructured":"Shi, J., & Malik, J. (1997). Normalized cuts and image segmentation. In Proceedings of CVPR."},{"key":"390056_CR34","first-page":"640","volume-title":"Advances in Neural Information Processing Systems","author":"N. Slonim","year":"2000","unstructured":"Slonim, N., & Tishby, N. (2000). Data clustering by Markovian relaxation and the information bottleneck method. Advances in Neural Information Processing Systems (Vol. 13, pp. 640\u2013646). Cambridge, MA: The MIT Press."},{"key":"390056_CR35","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1109\/34.184777","volume":"15","author":"S. Smith","year":"1993","unstructured":"Smith, S. (1993). Threshold validity for mutual neighborhood clustering. IEEE Transactions on Pattern Analysis and Machine Intelligence, 15, 89\u201392.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"390056_CR36","unstructured":"Tishby, N., Pereira, F., & Bialek, W. (1999). The information bottleneck method. In Proceedings of the 37th Annual Allerton Conference on Communication, Control and Computing (pp. 368\u2013377)."},{"key":"390056_CR37","first-page":"37","volume-title":"Proceedings of the 7th Australian Joint Conference on Artificial Intelligence","author":"C. Wallace","year":"1994","unstructured":"Wallace, C., & Dowe, D. (1994). Intrinsic classification by MML-the SNOB program. In Proceedings of the 7th Australian Joint Conference on Artificial Intelligence (pp. 37\u201344). UNE, Armidale, NSW, Australia: World Scientific."},{"key":"390056_CR38","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1162\/neco.1993.5.1.89","volume":"5","author":"Y. Wong","year":"1993","unstructured":"Wong, Y. (1993). Clustering data by melting. Neural Computation, 5, 89\u2013104.","journal-title":"Neural Computation"},{"key":"390056_CR39","doi-asserted-by":"crossref","first-page":"1101","DOI":"10.1109\/34.244673","volume":"15","author":"Z. Wu","year":"1993","unstructured":"Wu, Z., & Leahy, R. (1993). An optimal graph theoretic approach to data clustering: Theory and its application to image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 15, 1101\u20131113.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1013631728342.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1013631728342\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1013631728342.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T11:45:15Z","timestamp":1752147915000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1013631728342"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,4]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,4]]}},"alternative-id":["390056"],"URL":"https:\/\/doi.org\/10.1023\/a:1013631728342","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"type":"print","value":"0885-6125"},{"type":"electronic","value":"1573-0565"}],"subject":[],"published":{"date-parts":[[2002,4]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}