{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T01:34:01Z","timestamp":1777685641076,"version":"3.51.4"},"reference-count":13,"publisher":"SAGE Publications","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["HIS"],"published-print":{"date-parts":[[2019,4,17]]},"DOI":"10.3233\/his-190260","type":"journal-article","created":{"date-parts":[[2019,4,5]],"date-time":"2019-04-05T10:51:01Z","timestamp":1554461461000},"page":"55-65","source":"Crossref","is-referenced-by-count":0,"title":["Compression of community graph using graph mining techniques"],"prefix":"10.1177","volume":"15","author":[{"given":"Bapuji","family":"Rao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sarojananda","family":"Mishra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","reference":[{"key":"10.3233\/HIS-190260_ref1","first-page":"1031","article-title":"Graph Compression by BFS","volume":"2","author":"Apostolico","year":"2009","journal-title":"Published in Algorithms 2009"},{"key":"10.3233\/HIS-190260_ref2","doi-asserted-by":"crossref","unstructured":"B. Rao and A. Mitra, An Approach to Merging of two Community Sub-Graphs to form a Community Graph using Graph Mining Techniques, In Proceedings of 2014 IEEE ICCIC-2014, Coimbatore, India, 2014, pp. 460\u2013466.","DOI":"10.1109\/ICCIC.2014.7238392"},{"key":"10.3233\/HIS-190260_ref3","first-page":"1","article-title":"A new approach for detection of common communities in a social network using graph mining techniques","author":"Rao","year":"2014","journal-title":"Proceedings of IEEE ICHPCA-2014"},{"key":"10.3233\/HIS-190260_ref4","doi-asserted-by":"crossref","unstructured":"B. Rao, A. Mitra and U. Narayana, An approach to study properties and behavior of Social Network using Graph Mining Techniques, In Proceedings of DIGNATE 2014: ETEECT 2014, India, 2014, pp. 13\u201317.","DOI":"10.1109\/ICHPCA.2014.7045335"},{"key":"10.3233\/HIS-190260_ref5","doi-asserted-by":"crossref","first-page":"678","DOI":"10.1016\/j.procs.2015.07.444","article-title":"3rd ICRTC-2015","volume":"57","author":"Rao","year":"2015","journal-title":"Elsevier Procedia Computer Science"},{"key":"10.3233\/HIS-190260_ref6","doi-asserted-by":"crossref","unstructured":"B. Rao and A. Mitra, A Proposed Algorithm for Partitioning Community Graph into Sub-Community Graphs using Graph Mining Techniques, 3rd ICACNI 2015, 2015, KIIT University, Bhubaneswar, India, published in Smart Innovation, Systems and Technologies, 2015, pp. 3\u201315.","DOI":"10.1007\/978-81-322-2529-4_1"},{"key":"10.3233\/HIS-190260_ref7","doi-asserted-by":"crossref","unstructured":"B. Rao, A. Mitra and D.P. Acharjya, A new Approach of Compression of Large Community Graph Using Graph Mining Techniques, 3rd ERCICA 2015, Bangalore, India, Springer Verlag, volume 1, 2015, pp. 127\u2013136.","DOI":"10.1007\/978-81-322-2550-8_13"},{"key":"10.3233\/HIS-190260_ref9","first-page":"2011","article-title":"Compression of Weighted Graphs","author":"Toivonen","journal-title":"Proceedings of KDD\u201911"},{"key":"10.3233\/HIS-190260_ref10","doi-asserted-by":"crossref","unstructured":"M. Girvan and M.E.J. Newman, Community structure in social and biological networks, In Proceedings of the National Academy of Sciences of the United States of America 99(12) (2002), 7821\u20137826.","DOI":"10.1073\/pnas.122653799"},{"key":"10.3233\/HIS-190260_ref11","doi-asserted-by":"crossref","unstructured":"M.E.J. Newman and M. Girvan, Finding and evaluating community structure in networks, Physical Review E 69 (2004).","DOI":"10.1103\/PhysRevE.69.026113"},{"issue":"4","key":"10.3233\/HIS-190260_ref12","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1007\/BF02289527","article-title":"The centrality index of a graph","volume":"31","author":"Gert","year":"1966","journal-title":"Psychometrika"},{"key":"10.3233\/HIS-190260_ref13","doi-asserted-by":"crossref","unstructured":"S. Navlakha, R. Rastogi and N. Shrivastava, Graph summarization with bounded error, In Proceedings of the 2008 ACM SIGMOD international conference on Management of data, New York, USA, ACM, 2008, pp. 419\u2013432.","DOI":"10.1145\/1376616.1376661"},{"key":"10.3233\/HIS-190260_ref14","doi-asserted-by":"crossref","unstructured":"Y. Tian, R. Hankins and J. Patel, Efficient aggregation for graph summarization, In Proceedings of the 2008 ACM SIGMOD international conference on Management of data, New York, NY, USA, ACM, 2008, pp. 567\u2013580.","DOI":"10.1145\/1376616.1376675"}],"container-title":["International Journal of Hybrid Intelligent Systems"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/HIS-190260","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T08:52:43Z","timestamp":1777452763000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/HIS-190260"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,17]]},"references-count":13,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.3233\/his-190260","relation":{},"ISSN":["1448-5869","1875-8819"],"issn-type":[{"value":"1448-5869","type":"print"},{"value":"1875-8819","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,4,17]]}}}