{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T19:04:54Z","timestamp":1725908694968},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319608334"},{"type":"electronic","value":"9783319608341"}],"license":[{"start":{"date-parts":[[2017,8,18]],"date-time":"2017-08-18T00:00:00Z","timestamp":1503014400000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-60834-1_5","type":"book-chapter","created":{"date-parts":[[2017,8,17]],"date-time":"2017-08-17T06:43:54Z","timestamp":1502952234000},"page":"38-46","source":"Crossref","is-referenced-by-count":0,"title":["Graph Community Detection: Normalized Compression Distance Based Implementation for Text Data"],"prefix":"10.1007","author":[{"given":"Abhishek","family":"Sanwaliya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sunil K.","family":"Chinnamgari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abhishek","family":"Desai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arijit","family":"Saha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,18]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2606-0","volume-title":"An Introduction to Kolmogorov Complexity and its Applications","author":"M Li","year":"1997","unstructured":"Li, M., Vitanyi, P.M.B.: An Introduction to Kolmogorov Complexity and its Applications, 2nd edn. Springer, New York (1997)","edition":"2"},{"issue":"4","key":"5_CR2","doi-asserted-by":"crossref","first-page":"1523","DOI":"10.1109\/TIT.2005.844059","volume":"51","author":"R Cilibrasi","year":"2005","unstructured":"Cilibrasi, R., Vit\u00e1nyi, P.M.B.: Clustering by compression. IEEE Trans. Inf. Theor. 51(4), 1523\u20131545 (2005)","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"4","key":"5_CR3","doi-asserted-by":"crossref","first-page":"1407","DOI":"10.1109\/18.681318","volume":"44","author":"CH Bennett","year":"1998","unstructured":"Bennett, C.H., G\u00e1cs, P., Li, M., Vit\u00e1nyi, P.M.B., Zurek, W.: Information distance. IEEE Trans. Inf. Theor. 44(4), 1407\u20131423 (1998)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"5_CR4","doi-asserted-by":"crossref","first-page":"066111","DOI":"10.1103\/PhysRevE.70.066111","volume":"70","author":"A Clauset","year":"2004","unstructured":"Clauset, A., Newman, M.E.J., Moore, C.: Finding community structure in very large networks. Phys. Rev. E 70, 066111 (2004)","journal-title":"Phys. Rev. E"},{"key":"5_CR5","doi-asserted-by":"crossref","first-page":"066133","DOI":"10.1103\/PhysRevE.69.066133","volume":"69","author":"MEJ Newman","year":"2004","unstructured":"Newman, M.E.J.: Fast algorithm for detecting community structure in networks. Phys. Rev. E 69, 066133 (2004)","journal-title":"Phys. Rev. E"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Pons, P., Latapy, M.: Computing communities in large networks using random walks. In: Proceedings of Computer and Information Sciences (Iscis 2005), vol. 3733, pp. 284-293 (2005)","DOI":"10.1007\/11569596_31"},{"key":"5_CR7","doi-asserted-by":"crossref","first-page":"036104","DOI":"10.1103\/PhysRevE.74.036104","volume":"74","author":"MEJ Newman","year":"2006","unstructured":"Newman, M.E.J.: Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E 74, 036104 (2006)","journal-title":"Phys. Rev. E"},{"key":"5_CR8","doi-asserted-by":"crossref","first-page":"036106","DOI":"10.1103\/PhysRevE.76.036106","volume":"76","author":"UN Raghavan","year":"2007","unstructured":"Raghavan, U.N., Albert, R., Kumara, S.: Near linear time algorithm to detect community structures in large-scale networks. Phys. Rev. E 76, 036106 (2007)","journal-title":"Phys. Rev. E"},{"key":"5_CR9","doi-asserted-by":"crossref","first-page":"016110","DOI":"10.1103\/PhysRevE.74.016110","volume":"74","author":"J Reichardt","year":"2006","unstructured":"Reichardt, J., Bornholdt, S.: Statistical mechanics of community detection. Phys. Rev. E 74, 016110 (2006)","journal-title":"Phys. Rev. E"},{"key":"5_CR10","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1038\/35065725","volume":"410","author":"SH Strogatz","year":"2001","unstructured":"Strogatz, S.H.: Exploring complex networks. Nature 410, 268\u2013276 (2001)","journal-title":"Nature"},{"key":"5_CR11","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R Albert","year":"2002","unstructured":"Albert, R., Barab\u00e1si, A.-L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74, 47\u201397 (2002)","journal-title":"Rev. Mod. Phys."},{"key":"5_CR12","doi-asserted-by":"crossref","first-page":"1079","DOI":"10.1080\/00018730110112519","volume":"51","author":"SN Dorogovtsev","year":"2002","unstructured":"Dorogovtsev, S.N., Mendes, J.F.F.: Evolution of networks. Adv. Phys. 51, 1079\u20131187 (2002)","journal-title":"Adv. Phys."},{"key":"5_CR13","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"MEJ Newman","year":"2003","unstructured":"Newman, M.E.J.: The structure and function of complex networks. SIAM Rev. 45, 167\u2013256 (2003)","journal-title":"SIAM Rev."},{"key":"5_CR14","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"BW Kernighan","year":"1970","unstructured":"Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49, 291\u2013307 (1970)","journal-title":"Bell Syst. Tech. J."},{"key":"5_CR15","doi-asserted-by":"crossref","first-page":"298","DOI":"10.21136\/CMJ.1973.101168","volume":"23","author":"M Fiedler","year":"1973","unstructured":"Fiedler, M.: Algebraic connectivity of graphs. Czech. Math. J. 23, 298\u2013305 (1973)","journal-title":"Czech. Math. J."},{"key":"5_CR16","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1137\/0611030","volume":"11","author":"A Pothen","year":"1990","unstructured":"Pothen, A., Simon, H., Liou, K.-P.: Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl. 11, 430\u2013452 (1990)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"5_CR17","volume-title":"Social Network Analysis: A Handbook","author":"J Scott","year":"2000","unstructured":"Scott, J.: Social Network Analysis: A Handbook, 2nd edn. Sage, London (2000)","edition":"2"},{"key":"5_CR18","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1140\/epjb\/e2004-00124-y","volume":"38","author":"MEJ Newman","year":"2004","unstructured":"Newman, M.E.J.: Detecting community structure in networks. Eur. Phys. J. B 38, 321\u2013330 (2004)","journal-title":"Eur. Phys. J. B"},{"key":"5_CR19","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1016\/S0378-4371(03)00622-8","volume":"329","author":"AC-C Yang","year":"2003","unstructured":"Yang, A.C.-C., Peng, C.-K., Yien, H.-W., Goldberger, A.L.: Information categorization approach to literary authorship disputes. Physica A 329, 473\u2013483 (2003)","journal-title":"Physica A"},{"key":"5_CR20","unstructured":"Wehner, S.: Analyzing network traffic and worms using compression. Manuscript, CWI (2004). http:\/\/homepages.cwi.nl\/wehner\/worms\/"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Keogh, E., Lonardi, S., Rtanamahatana, C.A.: Toward parameter free data mining. In: Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Seattle, Washington, USA, pp. 206\u2013215, 22\u201325 August (2004)","DOI":"10.1145\/1014052.1014077"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Greene, D., Cunningham, P.: Practical solutions to the problem of diagonal dominance in kernel document clustering. In: Proceedings of the ICML (2006)","DOI":"10.1145\/1143844.1143892"},{"key":"5_CR23","unstructured":"http:\/\/www.parrotanalytics.com\/pacific-asia-knowledge-discovery-and-data-mining-conference-2016-contest\/"},{"key":"5_CR24","unstructured":"http:\/\/ankara.lti.cs.cmu.edu\/side\/"},{"key":"5_CR25","unstructured":"http:\/\/jmlr.csail.mit.edu\/papers\/volume5\/lewis04a\/a11-smart-stop-list\/english.stop"},{"key":"5_CR26","unstructured":"http:\/\/complearn.org\/"},{"key":"5_CR27","unstructured":"http:\/\/stackoverflow.com\/questions\/12725263\/computing-f-measure-for-clustering"}],"container-title":["Advances in Intelligent Systems and Computing","Proceedings of the Third International Afro-European Conference for Industrial Advancement \u2014 AECIA 2016"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-60834-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,15]],"date-time":"2020-10-15T12:38:14Z","timestamp":1602765494000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-60834-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,18]]},"ISBN":["9783319608334","9783319608341"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-60834-1_5","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2017,8,18]]}}}