{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T09:14:28Z","timestamp":1771233268216,"version":"3.50.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,8,7]],"date-time":"2018-08-07T00:00:00Z","timestamp":1533600000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"DST-SERB"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Parallel Prog"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s10766-018-0591-9","type":"journal-article","created":{"date-parts":[[2018,8,7]],"date-time":"2018-08-07T03:08:20Z","timestamp":1533611300000},"page":"496-514","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Charismatic Document Clustering Through Novel K-Means Non-negative Matrix Factorization (KNMF) Algorithm Using Key Phrase Extraction"],"prefix":"10.1007","volume":"48","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6788-7051","authenticated-orcid":false,"given":"E.","family":"Laxmi Lydia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Krishna Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Shankar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. K.","family":"Lakshmanaprabu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R. M.","family":"Vidhyavathi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andino","family":"Maseleno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,7]]},"reference":[{"issue":"8","key":"591_CR1","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/j.patrec.2009.09.011","volume":"31","author":"AK Jain","year":"2010","unstructured":"Jain, A.K.: Data clustering: 50 years beyond K-means. Pattern Recognit. Lett. 31(8), 651\u2013666 (2010)","journal-title":"Pattern Recognit. Lett."},{"key":"591_CR2","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/j.cviu.2007.08.003","volume":"110","author":"H Zhang","year":"2008","unstructured":"Zhang, H., Fritts, J.E., Goldman, S.A.: Image segmentation evaluation: a survey of unsupervised methods. Comput. Vis. Image Underst. 110(2), 260\u2013280 (2008)","journal-title":"Comput. Vis. Image Underst."},{"key":"591_CR3","volume-title":"Modern Information Retrieval","author":"R Baeza Yates","year":"1999","unstructured":"Baeza Yates, R., Ribeiro Neto, B., et al.: Modern Information Retrieval. ACMPress, New York (1999)"},{"issue":"1","key":"591_CR4","doi-asserted-by":"publisher","first-page":"677","DOI":"10.2741\/2711","volume":"13","author":"DJ Miller","year":"2008","unstructured":"Miller, D.J., Wang, Y., Kesidis, G.: Emergent unsupervised clustering paradigms with potential application to bioinformatics. Front. Biosci. 13(1), 677\u2013690 (2008)","journal-title":"Front. Biosci."},{"key":"591_CR5","unstructured":"Guduru, N.: Text Mining with Support Vector Machines (SVM) and Non-Negative Matrix Factorization (NMF) Algorithm. Master\u2019s Thesis, University of Rhode Island, CS Department (2006)"},{"issue":"4","key":"591_CR6","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1137\/1037127","volume":"37","author":"MW Berry","year":"1994","unstructured":"Berry, M.W., Dumais, S.T., O\u2019Brien, G.W.: Using linear algebra for intelligent information retrieval. SIAM Rev. 37(4), 573\u2013595 (1994)","journal-title":"SIAM Rev."},{"issue":"2\u20133","key":"591_CR7","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1080\/01638539809545028","volume":"25","author":"TK Landauer","year":"1998","unstructured":"Landauer, T.K., Foltz, P.W., Laham, D.: An introduction to latent semantic analysis. Discourse Process. 25(2\u20133), 259\u2013284 (1998)","journal-title":"Discourse Process."},{"key":"591_CR8","doi-asserted-by":"publisher","first-page":"788","DOI":"10.1038\/44565","volume":"401","author":"DD Lee","year":"1999","unstructured":"Lee, D.D., Seung, H.: Learning the parts of objects by non-negative matrix factorization (NMF). Nature 401, 788\u2013791 (1999)","journal-title":"Nature"},{"key":"591_CR9","unstructured":"Lee, D.D., Seung, H.: Algorithm for non-negative matrix factorization. In: Dietterich, T.G., Tresp, V. (eds.) Advances in Neural Information Processing Systems, Volume 13, Proceedings of the Conference: 556562. The MIT Press"},{"key":"591_CR10","doi-asserted-by":"crossref","unstructured":"Ding, C., He, X., Simon, H.D.: On the equivalence of nonnegative matrix factorization (NMF) and spectral clustering. In: Proceedings of the 2005 SIAM International Conference on Data Mining, pp. 606\u2013610. Society for Industrial and Applied Mathematics (2005)","DOI":"10.1137\/1.9781611972757.70"},{"key":"591_CR11","doi-asserted-by":"crossref","unstructured":"Xu, W., Liu, X., Gong, Y.: Document clustering based on NON-negative matrix factorization. In: Proceedings in ACM SIGIR, pp. 267\u2013273 (2003)","DOI":"10.1145\/860435.860485"},{"key":"591_CR12","doi-asserted-by":"crossref","unstructured":"Yang, C.F., Ye, M., Zhao, J.: Document clustering based on non-negative sparse matrix factorization. In: International Conference on Advances in Natural Computation, pp. 557\u2013563 (2005)","DOI":"10.1007\/11539117_80"},{"key":"591_CR13","unstructured":"Kanjani, K.: Parallel Non Negative Matrix Factorization for Document Clustering. CPSC-659 (Parallel and Distributed Numerical Algorithms) Course. Texas A&M University, Tech. Rep. (2007)"},{"issue":"3","key":"591_CR14","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1108\/eb046814","volume":"14","author":"MF Porter","year":"1980","unstructured":"Porter, M.F.: An algorithm for suffix stripping. Program 14(3), 130\u2013137 (1980)","journal-title":"Program"},{"issue":"1\u20132","key":"591_CR15","first-page":"22","volume":"11","author":"JB Lovins","year":"1968","unstructured":"Lovins, J.B.: Development of a stemming algorithm. Mech. Translat. Comp. Linguistics 11(1\u20132), 22\u201331 (1968)","journal-title":"Mech. Translat. & Comp. Linguistics"},{"issue":"7","key":"591_CR16","first-page":"18047","volume":"10","author":"HVTEV Laxmi","year":"2015","unstructured":"Laxmi, H.V.T.E.V., Somasundaram, K.: 2HARS: heterogeneity-aware resource scheduling in grid environment using K-centroids clustering and PSO techniques. Int. J. Appl. Eng. Res. 10(7), 18047\u201318062 (2015)","journal-title":"Int. J. Appl. Eng. Res."},{"key":"591_CR17","doi-asserted-by":"crossref","unstructured":"Laxmi Lydia, E., Ben Swarup, M., Narsimham, C.: A disparateness\u2013aware scheduling using K-centroids clustering and PSO techniques in hadoop cluster. Int. J. Adv. Found. Res. Comput. 2(12) (2015)","DOI":"10.21307\/ijanmc-2016-014"},{"key":"591_CR18","first-page":"191","volume":"118","author":"E Laxmi Lydia","year":"2018","unstructured":"Laxmi Lydia, E.: Text mining with lucene and hadoop: document clustering with updated rules of NMF non-negative matrix factorization. Int. J. Pure Appl. Math. 118, 191\u2013198 (2018)","journal-title":"Int. J. Pure Appl. Math."}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-018-0591-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10766-018-0591-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-018-0591-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,24]],"date-time":"2020-04-24T01:09:52Z","timestamp":1587690592000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10766-018-0591-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,7]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["591"],"URL":"https:\/\/doi.org\/10.1007\/s10766-018-0591-9","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"value":"0885-7458","type":"print"},{"value":"1573-7640","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,8,7]]},"assertion":[{"value":"13 May 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 July 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 August 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}