{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T23:10:03Z","timestamp":1746141003435,"version":"3.40.4"},"publisher-location":"New Delhi","reference-count":25,"publisher":"Springer India","isbn-type":[{"type":"print","value":"9788132216018"},{"type":"electronic","value":"9788132216025"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-81-322-1602-5_138","type":"book-chapter","created":{"date-parts":[[2014,2,25]],"date-time":"2014-02-25T12:58:40Z","timestamp":1393333120000},"page":"1333-1341","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Computing Vectors Based Document Clustering and Numerical Result Analysis"],"prefix":"10.1007","author":[{"given":"Neeraj","family":"Sahu","sequence":"first","affiliation":[]},{"given":"G. S.","family":"Thakur","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,2,26]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Arora, S., Raghavan, P., Rao, S.: Approximation schemes for Euclidean k-median and related problems. In: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, May 1998, pp. 106\u2013113","key":"138_CR1","DOI":"10.1145\/276698.276718"},{"key":"138_CR2","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"JL Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Comm. ACM 18, 509\u2013517 (1975)","journal-title":"Comm. ACM"},{"unstructured":"Bradley, P.S., Fayyad, U.: Refining initial points for k-means clustering. In: Proceedings of the 15th International Conference on Machine Learning, 1998, pp. 91\u201399","key":"138_CR3"},{"unstructured":"www.kdd.ics.uci.edu","key":"138_CR4"},{"doi-asserted-by":"crossref","unstructured":"Dasgupta, S.: Learning mixtures of Gaussians. In: Proceedings of the 40th IEEE Symposium on Foundations of Computer Science, Oct 1999, pp. 634\u2013644","key":"138_CR5","DOI":"10.1109\/SFFCS.1999.814639"},{"key":"138_CR6","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1137\/S0036144599352836","volume":"41","author":"Q Du","year":"1999","unstructured":"Du, Q., Faber, V., Gunzburger, M.: Centroidal Voronoi tesselations: Applications and algorithms. SIAM Rev. 41, 637\u2013676 (1999)","journal-title":"SIAM Rev."},{"unstructured":"Agarwal, P.K., Procopiuc, C.M.: Exact and approximation algorithms for clustering. In: Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, Jan 1998, pp. 658\u2013667","key":"138_CR7"},{"key":"138_CR8","volume-title":"Pattern Classification and Scene Analysis","author":"RO Duda","year":"1973","unstructured":"Duda, R.O., Hart, P.E.: Pattern Classification and Scene Analysis. Wiley, New York (1973)"},{"key":"138_CR9","first-page":"138","volume":"22","author":"V Faber","year":"1994","unstructured":"Faber, V.: Clustering and the continuous k-means algorithm. Los Alamos Sci. 22, 138\u2013144 (1994)","journal-title":"Los Alamos Sci."},{"key":"138_CR10","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0925-7721(00)00022-5","volume":"17","author":"S Arya","year":"2000","unstructured":"Arya, S., Mount, D.M.: Approximate range searching. Comput. Geom. Theor. Appl. 17, 135\u2013163 (2000)","journal-title":"Comput. Geom. Theor. Appl."},{"key":"138_CR11","first-page":"768","volume":"21","author":"E Forgey","year":"1965","unstructured":"Forgey, E.: Cluster analysis of multivariate data: efficiency versus interpretability of classification. Biometrics 21, 768 (1965)","journal-title":"Biometrics"},{"key":"138_CR12","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"UM Fayyad","year":"1996","unstructured":"Fayyad, U.M., Piatetsky-Shapiro, G., Smyth, P., Uthurusamy, R.: Advances in Knowledge Discovery and Data Mining. AAAI\/MIT Press, Cambridge (1996)"},{"key":"138_CR13","volume-title":"Introduction to Statistical Pattern Recognition","author":"K Fukunaga","year":"1990","unstructured":"Fukunaga, K.: Introduction to Statistical Pattern Recognition. Academic Press, Boston (1990)"},{"unstructured":"Ball, G.H., Hall, D.J.: Some fundamental concepts and synthesis procedures for pattern recognition preprocessors. In: Proceedings of the International Conference on Microwaves, Circuit Theory, and Information Theory, Sept 1964","key":"138_CR14"},{"unstructured":"Dasgupta, S., Shulman, L.J.: A two-round variant of EM for Gaussian mixtures. In: Procedings of the 16th Conference on Uncertainty in Artificial Intelligence (UAI-2000), June 2000, pp. 152\u2013159","key":"138_CR15"},{"key":"138_CR16","volume-title":"An Introduction to Probability Theory and Its Applications","author":"W Feller","year":"1968","unstructured":"Feller, W.: An Introduction to Probability Theory and Its Applications, 3rd edn. Wiley, New York (1968)","edition":"3"},{"unstructured":"Alsabti, K., Ranka, S., Singh, V.: An Efficient k-means clustering algorithm. In: Proceedings of the First Workshop High Performance Data Mining, Mar 1998","key":"138_CR17"},{"key":"138_CR18","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1145\/293347.293348","volume":"45","author":"S Arya","year":"1998","unstructured":"Arya, S., Mount, D.M., Netanyahu, N.S., Silverman, R., Wu, A.Y.: An optimal algorithm for approximate nearest neighbor searching. J. ACM 45, 891\u2013923 (1998)","journal-title":"J. ACM"},{"unstructured":"Bottou, L., Bengio, Y.: Convergence properties of the k-means algorithms. In: Tesauro, G., Touretzky, D. (eds.) Advances in Neural Information Processing Systems 7, pp. 585\u2013592. MIT Press, Cambridge (1996)","key":"138_CR19"},{"key":"138_CR20","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0167-8655(85)90053-4","volume":"3","author":"JM Coggins","year":"1985","unstructured":"Coggins, J.M., Jain, A.K.: A spatial filtering approach to texture analysis. Pattern Recognit. Lett. 3, 195\u2013203 (1985)","journal-title":"Pattern Recognit. Lett."},{"unstructured":"Ester, M., Kriegel, H., Xu, X.: A database interface for clustering in large spatial databases. In: Procedings of the First International Conference on Knowledge Discovery and Data Mining (KDD-95), 1995, pp. 94\u201399","key":"138_CR21"},{"unstructured":"Neeraj, S., Thakur, G.S. : Hesitant distance similarity measures for document clustering. In: IEEE Conference\u20142011 World Congress on Information and Communication Technologies Mumbai, 11\u201314 Dec 2011. ISBN: 978-1-4673-0125-1","key":"138_CR22"},{"issue":"5","key":"138_CR23","first-page":"509","volume":"2","author":"SK Sahu","year":"2012","unstructured":"Sahu, S.K., Sahu, N., Thakur, G.S.: Classification of document clustering approaches. Intl. J. Comput. Sci. Softw. Eng. 2(5), 509\u2013513 (2012). ISSN (Online): 2277 128X","journal-title":"Intl. J. Comput. Sci. Softw. Eng."},{"unstructured":"Sahu, B., Sahu, N., Thakur, G.S.: Architecture based users and administrator login data processing. In: International Conference on Intelligent Computing and Information System (ICICIS-2012), Pachmarhi, Piparia, 27\u201328 Oct 2012. ISSN (Online): 2249\u2013071X","key":"138_CR24"},{"unstructured":"Bradley, P.S., Fayyad, U., Reina, C.: Scaling clustering algorithms to large databases. In: Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining, 1998, pp. 9\u201315","key":"138_CR25"}],"container-title":["Advances in Intelligent Systems and Computing","Proceedings of the Second International Conference on Soft Computing for Problem Solving (SocProS 2012), December 28-30, 2012"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-81-322-1602-5_138","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T22:49:28Z","timestamp":1746139768000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-81-322-1602-5_138"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9788132216018","9788132216025"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-81-322-1602-5_138","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"26 February 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}