{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:07:44Z","timestamp":1742926064749,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540404989"},{"type":"electronic","value":"9783540450634"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45063-4_5","type":"book-chapter","created":{"date-parts":[[2011,1,8]],"date-time":"2011-01-08T21:56:31Z","timestamp":1294523791000},"page":"68-82","source":"Crossref","is-referenced-by-count":7,"title":["Information Force Clustering Using Directed Trees"],"prefix":"10.1007","author":[{"given":"Robert","family":"Jenssen","sequence":"first","affiliation":[]},{"given":"Deniz","family":"Erdogmus","sequence":"additional","affiliation":[]},{"suffix":"II","given":"Kenneth E.","family":"Hild","sequence":"additional","affiliation":[]},{"given":"Jose C.","family":"Principe","sequence":"additional","affiliation":[]},{"given":"Torbj\u00f8rn","family":"Eltoft","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","volume-title":"Algorithms for Clustering Data","author":"A.K. Jain","year":"1988","unstructured":"Jain, A.K., Dubes, R.C.: Algorithms for Clustering Data. Prentice-Hall, Englewood Cliffs (1988)"},{"key":"5_CR2","volume-title":"Numerical Taxonomy","author":"P.H.A. Sneath","year":"1973","unstructured":"Sneath, P.H.A., Sokal, R.R.: Numerical Taxonomy. Freeman, London (1973)"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"King, B.: Step-wise clustering procedures. J. Am. Stat. Assoc., 86\u2013101 (1967)","DOI":"10.1080\/01621459.1967.10482890"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1109\/T-C.1971.223083","volume":"20","author":"C.T. Zahn","year":"1971","unstructured":"Zahn, C.T.: Graph Theoretic Methods for Detecting and Describing Gestalt Clusters. IEEE Trans. Comput.\u00a020, 68\u201386 (1971)","journal-title":"IEEE Trans. Comput."},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0031-3203(82)90069-3","volume":"15","author":"R. Urquart","year":"1982","unstructured":"Urquart, R.: Graph Theoretical Clustering based on Limited Neighborhood Sets. Pattern Recognition\u00a015, 173\u2013187 (1982)","journal-title":"Pattern Recognition"},{"issue":"11","key":"5_CR6","doi-asserted-by":"publisher","first-page":"1101","DOI":"10.1109\/34.244673","volume":"15","author":"Z. Wu","year":"1993","unstructured":"Wu, Z., Leahy, R.: An Optimal Graph Theoretic Approach to Data Clustering: Theory and Its Applications to Image Segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a015(11), 1101\u20131113 (1993)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"8","key":"5_CR7","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J. Shi","year":"2000","unstructured":"Shi, J., Malik, J.: Normalized Cuts and Image Segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a022(8), 888\u2013905 (2000)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Ding, C.H.Q., He, X., Zha, H., Gu, M., Simon, H.D.: A Min-max Cut Algorithm for Graph Partitioning and Data Clustering. In: IEEE Int. Conf. on Data Mining, pp. 107\u2013114 (2001)","DOI":"10.1109\/ICDM.2001.989507"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"936","DOI":"10.1109\/TC.1976.1674719","volume":"25","author":"W.L.G. Koontz","year":"1975","unstructured":"Koontz, W.L.G., Narendra, P.M., Fukunaga, K.: A graph-theoretic approach to nonparametric cluster analysis. IEEE Transactions on Computers\u00a025, 936\u2013944 (1975)","journal-title":"IEEE Transactions on Computers"},{"key":"5_CR10","volume-title":"Introduction to Statistical Pattern Recognition","author":"K. Fukunaga","year":"1990","unstructured":"Fukunaga, K.: Introduction to Statistical Pattern Recognition. Academic Press, New York (1990)"},{"key":"5_CR11","volume-title":"Information Theoretic Learning","author":"J. Principe","year":"2000","unstructured":"Principe, J., Xu, D., Fisher, J.: Unsupervised Adaptive Filtering. In: Information Theoretic Learning, vol.\u00a01, ch. 7. John Wiley & Sons, Chichester (2000)"},{"key":"5_CR12","first-page":"849","volume":"14","author":"A.Y. Ng","year":"2002","unstructured":"Ng, A.Y., Jordan, M., Weiss, Y.: On Spectral Clustering: Analysis and an Algorithm. Advances in Neural Information Processing Systems\u00a014, 849\u2013856 (2002)","journal-title":"Advances in Neural Information Processing Systems"},{"issue":"3","key":"5_CR13","doi-asserted-by":"publisher","first-page":"780","DOI":"10.1109\/TNN.2002.1000150","volume":"13","author":"M. Girolami","year":"2002","unstructured":"Girolami, M.: Mercer Kernel-Based Clustering in Feature Space. IEEE Transactions on Neural Networks\u00a013(3), 780\u2013784 (2002)","journal-title":"IEEE Transactions on Neural Networks"},{"issue":"4","key":"5_CR14","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1103\/PhysRev.106.620","volume":"106","author":"E.T. Jaynes","year":"1957","unstructured":"Jaynes, E.T.: Information Theory and Statistical Mechanics. The Physical Review\u00a0106(4), 620\u2013630 (1957)","journal-title":"The Physical Review"},{"key":"5_CR15","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"C.E. Shannon","year":"1948","unstructured":"Shannon, C.E.: A Mathematical Theory of Communication. Bell Sys. Tech. J.\u00a027, 379\u2013423 (1948)","journal-title":"Bell Sys. Tech. J."},{"key":"5_CR16","unstructured":"Renyi, A.: On Measures of Entropy and Information. In: Fourth Berkeley Symposium on Mathematical Statistics and Probability, pp. 547\u2013561 (1960)"},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1214\/aoms\/1177704472","volume":"32","author":"E. Parzen","year":"1962","unstructured":"Parzen, E.: On the Estimation of a probability density function and the mode. Ann. Math. Stat.\u00a032, 1065\u20131076 (1962)","journal-title":"Ann. Math. Stat."},{"key":"5_CR18","unstructured":"McQueen, J.: Some methods for classification and analysis of multivariate observations. In: Fifth Berkeley Symposium on Mathematical Statistics and Probability, pp. 281\u2013297 (1967)"},{"key":"5_CR19","unstructured":"Murphy, R., Ada, D.: \u201dUCI Repository of Machine Learning databases,\u201d Tech. Rep., Dept. Comput. Sci. Univ. California, Irvine (1994)"},{"issue":"2","key":"5_CR20","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1109\/34.982897","volume":"24","author":"E. Gokcay","year":"2002","unstructured":"Gokcay, E., Principe, J.: Information Theoretic Clustering. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a024(2), 158\u2013170 (2002)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"5","key":"5_CR21","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1109\/72.712183","volume":"9","author":"T. Eltoft","year":"1998","unstructured":"Eltoft, T., de Figueiredo, R.J.P.: A New Neural Network for Cluster- Detectionand-Labeling. IEEE Transactions on Neural Networks\u00a09(5), 1021\u20131035 (1998)","journal-title":"IEEE Transactions on Neural Networks"},{"key":"5_CR22","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1162\/15324430260185565","volume":"2","author":"A. Ben-Hur","year":"2001","unstructured":"Ben-Hur, A., Horn, D., Siegelmann, H.T., Vapnik, V.: Support Vector Clustering. Journal of Machine Learning Research\u00a02, 125\u2013137 (2001)","journal-title":"Journal of Machine Learning Research"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Tishby, N., Slonim, N.: Data Clustering by Markovian Relaxation and the Information Bottleneck Method. In: Advances in Neural Information Processing Systems, Denver, USA, vol.\u00a013, pp. 640\u2013646 (2000)","DOI":"10.1145\/345508.345578"},{"issue":"8","key":"5_CR24","doi-asserted-by":"publisher","first-page":"1805","DOI":"10.1162\/neco.1997.9.8.1805","volume":"9","author":"M. Blatt","year":"1997","unstructured":"Blatt, M., Wiseman, S., Domany, E.: Data Clustering using a Model Granular Magnet. Neural Computation\u00a09(8), 1805\u20131842 (1997)","journal-title":"Neural Computation"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Horn, D., Gottlieb, A.: The Method of Quantum Clustering. In: Advances in Neural Information Processing Systems, Vancouver, Canada, vol.\u00a014, pp. 769\u2013776 (2001)","DOI":"10.7551\/mitpress\/1120.003.0103"}],"container-title":["Lecture Notes in Computer Science","Energy Minimization Methods in Computer Vision and Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45063-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T15:15:24Z","timestamp":1740842124000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45063-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540404989","9783540450634"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45063-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}