{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:36:43Z","timestamp":1725550603618},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540292272"},{"type":"electronic","value":"9783540320876"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11563952_44","type":"book-chapter","created":{"date-parts":[[2005,10,19]],"date-time":"2005-10-19T11:24:50Z","timestamp":1129721090000},"page":"502-512","source":"Crossref","is-referenced-by-count":5,"title":["On the Performance of Feature Weighting K-Means for Text Subspace Clustering"],"prefix":"10.1007","author":[{"given":"Liping","family":"Jing","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael K.","family":"Ng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joshua Zhexue","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"44_CR1","volume-title":"Algorithms for clustering data","author":"A. Jain","year":"1988","unstructured":"Jain, A., Dubes, R.: Algorithms for clustering data. Prentice-Hall, Englewood Cliffs (1988)"},{"key":"44_CR2","unstructured":"Etzioni, O., Zamir, O.: Web document clustering: a feasibility demonstration. In: ACM SIGIR, pp. 46\u201354 (1998)"},{"key":"44_CR3","doi-asserted-by":"crossref","unstructured":"Zhao, Y., Karypis, G.: Comparison of agglomerative and partitional document clustering algorithms. Technical report #02-014, University of Minnesota (2002)","DOI":"10.21236\/ADA439503"},{"issue":"1","key":"44_CR4","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1145\/1007730.1007731","volume":"6","author":"L. Parsons","year":"2004","unstructured":"Parsons, L., Haque, E., Liu, H.: Subspace clustering for high dimensional data: a review. SIGKDD Explorations\u00a06(1), 90\u2013105 (2004)","journal-title":"SIGKDD Explorations"},{"key":"44_CR5","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Gehrke, J., Gunopulos, D., Raghavan, P.: Automatic subspace clustering of high dimensional data for data mining applications. In: Proceedings of the 1998 ACM SIGMOD international conference on Man-agement of data, pp. 94\u2013105 (1998)","DOI":"10.1145\/276304.276314"},{"key":"44_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1007\/11430919_94","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"L. Jing","year":"2005","unstructured":"Jing, L., Ng, M., Xu, J., Huang, Z.: Subspace clustering of text documents with feature weighting k-means algorithm. In: Ho, T.-B., Cheung, D., Liu, H. (eds.) PAKDD 2005. LNCS (LNAI), vol.\u00a03518, pp. 802\u2013812. Springer, Heidelberg (2005)"},{"key":"44_CR7","unstructured":"Steinbach, M., Karypis, G., Kumar, V.: A comparison of document clustering techniques. In: Proc. Text ming workshop, KDD (2000)"},{"key":"44_CR8","unstructured":"Ghosh, J.: Scalable clustering methods for data mining. Handbook of data mining (2003)"},{"key":"44_CR9","volume-title":"Modern information retrieval","author":"B. Ricardo","year":"1999","unstructured":"Ricardo, B., PBerthier, R.: Modern information retrieval. Addison-Wesley, Reading (1999)"},{"issue":"5","key":"44_CR10","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1016\/j.patcog.2003.11.003","volume":"37","author":"Y. Chan","year":"2004","unstructured":"Chan, Y., Ching, K., Ng, K., Huang, Z.: An optimization algorithm for clustering using weighted dissimilarity measures. Pattern recognition\u00a037(5), 943\u2013952 (2004)","journal-title":"Pattern recognition"},{"key":"44_CR11","unstructured":"Hague, P., Harris, P.: Sampling and statistics. Kogan Page (1993)"},{"key":"44_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TPAMI.1980.4766964","volume":"2","author":"J. Bezdek","year":"1980","unstructured":"Bezdek, J.: A convergence theorem for the fuzzy isodata clustering algorithms. IEEE Trans. on Pattern Analysis and Machine Intelligence\u00a02, 1\u20138 (1980)","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence"},{"key":"44_CR13","unstructured":"Yang, Y., Pedersen, J.: A comparative study on feature selection in text categoriztion. In: ICML 1997, pp. 412\u2013420 (1997)"},{"key":"44_CR14","unstructured":"McCallum, A.: Bow: A toolkit for statistical language modeling, text retrieval, classification and clustering (1996), Online Available \n                    \n                      http:\/\/www.cs.cmu.edu\/mccallum\/bow"},{"key":"44_CR15","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/7287.001.0001","volume-title":"Wordnet: an electronic lexical databases","author":"C. Fellbaum","year":"1998","unstructured":"Fellbaum, C.: Wordnet: an electronic lexical databases. The MIT Press, Cambridge (1998)"}],"container-title":["Lecture Notes in Computer Science","Advances in Web-Age Information Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11563952_44.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:14:54Z","timestamp":1619507694000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11563952_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540292272","9783540320876"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11563952_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}