{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,27]],"date-time":"2026-09-27T22:44:20Z","timestamp":1790549060868,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540317821","type":"print"},{"value":"9783540317845","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11663881_18","type":"book-chapter","created":{"date-parts":[[2006,1,19]],"date-time":"2006-01-19T11:31:46Z","timestamp":1137670306000},"page":"313-330","source":"Crossref","is-referenced-by-count":9,"title":["Hybrid Minimal Spanning Tree and Mixture of Gaussians Based Clustering Algorithm"],"prefix":"10.1007","author":[{"given":"Agnes","family":"Vathy-Fogarassy","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Attila","family":"Kiss","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Janos","family":"Abonyi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"4","key":"18_CR1","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1145\/321607.321608","volume":"17","author":"J.G. Augustson","year":"1970","unstructured":"Augustson, J.G., Minker, J.: An analysis of some graph theoretical clustering techniques. J. ACM\u00a017(4), 571\u2013588 (1970)","journal-title":"J. ACM"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"870","DOI":"10.2307\/2286853","volume":"71","author":"F.B. Backer","year":"1976","unstructured":"Backer, F.B., Hubert, L.J.: A graph-theoretic approach to goodness-of-fit in complete-link hierarchical clustering. J. Am. Stat. Assoc.\u00a071, 870\u2013878 (1976)","journal-title":"J. Am. Stat. Assoc."},{"key":"18_CR3","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1093\/mnras\/216.1.17","volume":"216","author":"J.D. Barrow","year":"1985","unstructured":"Barrow, J.D., Bhavsar, S.P., Sonoda, D.H.: Minimal spanning trees, filaments and galaxy clustering. Monthly Notices of the Royal Astronomical Society\u00a0216, 17\u201335 (1985)","journal-title":"Monthly Notices of the Royal Astronomical Society"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Ben-Dor, A., Yakhini, Z.: Clustering gene expression patterns. In: Proceedings of the 3rd Annual International Conference on Computational Molecular Biology (RECOMB 1999), pp. 11\u201314 (1999)","DOI":"10.1145\/299432.299448"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1109\/91.493905","volume":"4","author":"J.C. Bezdek","year":"1996","unstructured":"Bezdek, J.C., Clarke, L.P., Silbiger, M.L., Arrington, J.A., Bensaid, A.M., Hall, L.O., Murtagh, R.F.: Validity-guided (re)clustering with applications to image segmentation. IEEE Transactions on Fuzzy Systems\u00a04, 112\u2013123 (1996)","journal-title":"IEEE Transactions on Fuzzy Systems"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Castellano, G., Fanelli, A.M., Mencar, C.: A fuzzy clustering approach for mining diagnostic rules. In: Proceedings of 2003 IEEE International Conference on Systems, Man & Cybernetics (IEEE SMC 2003), vol.\u00a01, pp. 2007\u20132012 (2003)","DOI":"10.1109\/ICSMC.2003.1244707"},{"issue":"1","key":"18_CR7","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/BF03325089","volume":"1","author":"R. Cooley","year":"1999","unstructured":"Cooley, R., Mobasher, B., Srivastava, J.: Data preparation for mining world wide web browsing. Journal of Knowledge Information Systems\u00a01(1), 5\u201332 (1999)","journal-title":"Journal of Knowledge Information Systems"},{"issue":"1","key":"18_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"A.P. Dempster","year":"1977","unstructured":"Dempster, A.P., Laird, N.M., Rubin, D.B.: Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, Series B (Methodological)\u00a039(1), 1\u201338 (1977)","journal-title":"Journal of the Royal Statistical Society, Series B (Methodological)"},{"issue":"6","key":"18_CR9","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1016\/0031-3203(87)90034-3","volume":"20","author":"R.C. Dubes","year":"1987","unstructured":"Dubes, R.C.: How many clusters are best? \u2013 an experiment. Pattern Recogn.\u00a020(6), 645\u2013663 (1987)","journal-title":"Pattern Recogn."},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1080\/01969727408546059","volume":"4","author":"J.C. Dunn","year":"1974","unstructured":"Dunn, J.C.: Well separated clusters and optimal fuzzy partitions. Journal Cybernetics\u00a04, 95\u2013104 (1974)","journal-title":"Journal Cybernetics"},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.aca.2004.02.064","volume":"515","author":"M. Forina","year":"2004","unstructured":"Forina, M., Oliveros, C., Concepcion, M., Casolino, C., Casale, M.: Minimum spanning tree: ordering edges to identify clustering structure. Analytica Chimica Acta\u00a0515, 43\u201353 (2004)","journal-title":"Analytica Chimica Acta"},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1109\/34.192473","volume":"11","author":"I. Gath","year":"1989","unstructured":"Gath, I., Geva, A.B.: Unsupervised Optimal Fuzzy Clustering. IEEE Trans. on Pattern Analysis and Machine Intelligence\u00a011, 773\u2013781 (1989)","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence"},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0167-7152(02)00421-2","volume":"62","author":"J.M. Gonz\u00e1les-Barrios","year":"2003","unstructured":"Gonz\u00e1les-Barrios, J.M., Quiroz, A.J.: A clustering procedure based on the comparsion between the k nearest neighbors graph and the minimal spanning tree. Statistics & Probability Letter\u00a062, 23\u201334 (2003)","journal-title":"Statistics & Probability Letter"},{"issue":"4","key":"18_CR14","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1145\/321479.321480","volume":"15","author":"C.C. Gotlieb","year":"1968","unstructured":"Gotlieb, C.C., Kumar, S.: Semantic Clustering of Index Terms. J. ACM\u00a015(4), 493\u2013513 (1968)","journal-title":"J. ACM"},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"54","DOI":"10.2307\/2346439","volume":"18","author":"J.C. Gower","year":"1969","unstructured":"Gower, J.C., Ross, G.J.S.: Minimal Spanning Trees and Single Linkage Cluster Analysis. Applied Statistics\u00a018, 54\u201364 (1969)","journal-title":"Applied Statistics"},{"key":"18_CR16","unstructured":"Heer, J., Chi, E.: Identification of Web user traffic composition using multimodal clustering and information scent. In: 1st SIAM ICDM, Workshop on Web Mining, Chicago, IL, pp. 51\u201358 (2001)"},{"key":"18_CR17","series-title":"Prentice-Hall advanced reference series","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 advanced reference series. Prentice-Hall, Inc., Englewood Cliffs (1988)"},{"key":"18_CR18","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"J.B. Kruskal","year":"1956","unstructured":"Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. American Mathematical Society\u00a07, 48\u201350 (1956)","journal-title":"American Mathematical Society"},{"key":"18_CR19","volume-title":"Machine Learning","author":"T. Mitchell","year":"1997","unstructured":"Mitchell, T.: Machine Learning. McGraw-Hill, Inc., New York (1997)"},{"issue":"7","key":"18_CR20","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1016\/j.patrec.2004.09.039","volume":"26","author":"N. P\u00e4ivinen","year":"2005","unstructured":"P\u00e4ivinen, N.: Clustering with a minimum spanning tree of scale-free-like structure. Pattern Recognition Letters\u00a026(7), 921\u2013930 (2005)","journal-title":"Pattern Recognition Letters"},{"key":"18_CR21","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R. Prim","year":"1957","unstructured":"Prim, R.: Shortest connection networks and some generalizations. Bell System Technical Journal\u00a036, 1389\u20131401 (1957)","journal-title":"Bell System Technical Journal"},{"key":"18_CR22","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1109\/TPAMI.1981.4767125","volume":"3","author":"V.V. Raghavan","year":"1981","unstructured":"Raghavan, V.V., Yu, C.T.: A comparison of the stability characteristics of some graph theoretic clustering methods. IEEE Trans. Pattern Anal. Mach. Intell.\u00a03, 393\u2013402 (1981)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"2","key":"18_CR23","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1023\/A:1009745219419","volume":"2","author":"J. Sander","year":"1998","unstructured":"Sander, J., Ester, M., Kriegel, H.-P., Xu, X.: Density-based clustering in spatial databases: the algorithm GDBSCAN and its applications. Data Mining and Knowledge Discovery\u00a02(2), 169\u2013194 (1998)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"18_CR24","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1186\/1471-2105-5-126","volume":"5","author":"S. Varma","year":"2004","unstructured":"Varma, S., Simon, R.: Iterative class discovery and feature selection using Minimal Spanning Trees. BMC Bioinformatics\u00a05, 126\u2013134 (2004)","journal-title":"BMC Bioinformatics"},{"key":"18_CR25","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-theoretical methods for detecting and describing gestalt clusters. IEEE Transaction on Computers\u00a0C20, 68\u201386 (1971)","journal-title":"IEEE Transaction on Computers"}],"container-title":["Lecture Notes in Computer Science","Foundations of Information and Knowledge Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11663881_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:12:48Z","timestamp":1619507568000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11663881_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540317821","9783540317845"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/11663881_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}