{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T09:50:22Z","timestamp":1725529822538},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642006715"},{"type":"electronic","value":"9783642006722"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00672-2_55","type":"book-chapter","created":{"date-parts":[[2009,3,21]],"date-time":"2009-03-21T17:04:48Z","timestamp":1237655088000},"page":"584-589","source":"Crossref","is-referenced-by-count":3,"title":["Short Text Clustering for Search Results"],"prefix":"10.1007","author":[{"given":"Xingliang","family":"Ni","sequence":"first","affiliation":[]},{"given":"Zhi","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Xiaojun","family":"Quan","sequence":"additional","affiliation":[]},{"given":"Wenyin","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Bei","family":"Hua","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"55_CR1","doi-asserted-by":"crossref","unstructured":"Zhao, Y., Karypis, G.: Evaluation of hierarchical clustering algorithms for document datasets. In: Proc. 11th international conference on information and knowledge management, pp. 515\u2013524 (2002)","DOI":"10.21236\/ADA439551"},{"key":"55_CR2","doi-asserted-by":"crossref","unstructured":"Ding, C., He, X., Zha, H.: A min-max cut algorithm for graph partitioning and data clustering. In: Proc. international conference on data mining, pp. 107\u2013114 (2001)","DOI":"10.1109\/ICDM.2001.989507"},{"key":"55_CR3","doi-asserted-by":"crossref","unstructured":"Larsen, B., Aone, C.: Fast and effective text mining using linear-time document clustering. In: Proc. 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 16\u201322 (1999)","DOI":"10.1145\/312129.312186"},{"key":"55_CR4","doi-asserted-by":"crossref","unstructured":"Zhang, D., Lee, W.S.: Question classification using support vector machines. In: Proc. 26th annual international ACM SIGIR conference on Research and development in information retrieval, pp. 26\u201332 (2003)","DOI":"10.1145\/860435.860443"},{"key":"55_CR5","doi-asserted-by":"crossref","unstructured":"Hachey, B., Grover, C.: Sequence modelling for sentence classification in a legal summarisation system. In: Proc. ACM symposium on applied computing, pp. 292\u2013296 (2005)","DOI":"10.1145\/1066677.1066746"},{"key":"55_CR6","unstructured":"Buyans (2008), \n                    \n                      http:\/\/www.buyans.com"}],"container-title":["Lecture Notes in Computer Science","Advances in Data and Web Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00672-2_55","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,7]],"date-time":"2019-03-07T06:02:59Z","timestamp":1551938579000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00672-2_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642006715","9783642006722"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00672-2_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}