{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:48:57Z","timestamp":1725900537069},"publisher-location":"Berlin\/Heidelberg","reference-count":12,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540250565"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-32392-9_4","type":"book-chapter","created":{"date-parts":[[2006,5,27]],"date-time":"2006-05-27T03:09:20Z","timestamp":1148699360000},"page":"31-40","source":"Crossref","is-referenced-by-count":0,"title":["Minimum Spanning Trees Displaying Semantic Similarity"],"prefix":"10.1007","author":[{"given":"W\u0142odzis\u0142aw","family":"Duch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pawe\u0142","family":"Matykiewicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"G. Aas. Html-parser. http:\/\/search.cpan.org\/~gaas\/HTML-Parser, 2004."},{"key":"4_CR2","unstructured":"G. Aas. Html-parser. http:\/\/www.touchgraph.com, 2004."},{"key":"4_CR3","unstructured":"The Brain. The brain. http:\/\/www.thebrain.com, 2004."},{"key":"4_CR4","unstructured":"T. Buzan. Mind maps. http:\/\/www.mind-map.com, 2004."},{"key":"4_CR5","volume-title":"Modern Multidimensional Scaling. Theory and Applications","author":"P. Groenen","year":"1996","unstructured":"P. Groenen I. Borg. Modern Multidimensional Scaling. Theory and Applications. Springer Series in Statistics, Heidelberg, 1996."},{"key":"4_CR6","unstructured":"T. Kohonen. Websom. http:\/\/websom.hut.fi, 1999."},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"48","DOI":"10.2307\/2033241","volume":"7","author":"J. Kruskal","year":"1956","unstructured":"J. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. In Proceedings of the American Mathematical Society, volume 7, pages 48\u201350, 1956.","journal-title":"Proceedings of the American Mathematical Society"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1080\/01638539809545028","volume":"25","author":"T. K. Landauer","year":"1998","unstructured":"T. K. Landauer, P. W. Foltz, and D. Laham. Introduction to latent semantic analysis. Discourse Processes, 25:259\u2013284, 1998.","journal-title":"Discourse Processes"},{"key":"4_CR9","unstructured":"D.D. Lewis. Reuters-21578 text categorization test collection. http:\/\/www.daviddlewis.com\/resources\/testcollections\/reuters21578\/, 1997."},{"key":"4_CR10","unstructured":"P. Matykiewicz. Demonstration applet. http:\/\/www.neuron.m4u.pl\/search, 2004."},{"key":"4_CR11","doi-asserted-by":"crossref","DOI":"10.1002\/0471708607","volume-title":"Knowledge-Based Clustering: From Data to Information Granules","author":"W. Pedrycz","year":"2005","unstructured":"W. Pedrycz. Knowledge-Based Clustering: From Data to Information Granules. John Wiley and Sons, Chichester, 2005."},{"issue":"3","key":"4_CR12","first-page":"48","volume":"14","author":"M._.F. Porter","year":"1980","unstructured":"M._F. Porter. An algorithm for suffix stripping. Program, 14(3):48\u201350, 1980.","journal-title":"Program"}],"container-title":["Advances in Soft Computing","Intelligent Information Processing and Web Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-32392-9_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:53:52Z","timestamp":1619556832000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-32392-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540250565"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-32392-9_4","relation":{},"subject":[]}}