{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T18:52:51Z","timestamp":1767984771165,"version":"3.49.0"},"reference-count":27,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,12,7]],"date-time":"2020-12-07T00:00:00Z","timestamp":1607299200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,12,7]],"date-time":"2020-12-07T00:00:00Z","timestamp":1607299200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,12,7]],"date-time":"2020-12-07T00:00:00Z","timestamp":1607299200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,12,7]]},"DOI":"10.1109\/asonam49781.2020.9381413","type":"proceedings-article","created":{"date-parts":[[2021,3,24]],"date-time":"2021-03-24T20:17:37Z","timestamp":1616617057000},"page":"73-80","source":"Crossref","is-referenced-by-count":1,"title":["Detection and Visualization of Dense Subgroups at Multiple Resolutions in Large Social Networks"],"prefix":"10.1109","author":[{"given":"Neil","family":"Gupta","sequence":"first","affiliation":[]},{"given":"Joydeep","family":"Ghosh","sequence":"additional","affiliation":[]},{"given":"Gunjan","family":"Gupta","sequence":"additional","affiliation":[]},{"given":"Sheshank","family":"Shankar","sequence":"additional","affiliation":[]},{"given":"Alex","family":"Tarasar","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3329872"},{"key":"ref11","first-page":"1","author":"\u00e7ataly\u00fcrek","year":"1999","journal-title":"PaToH Partitioning Tool for Hypergraphs"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48350-3_52"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.60"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1109\/71.780863","article-title":"Hypergraph-partitioning-based decomposition for parallel sparse-matrix vector multiplication","volume":"10","author":"catalyurek","year":"1999","journal-title":"IEEE Trans Parallel and Distrib Syst"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1142\/7070"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2345355"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0903215107"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bth163"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1117\/12.421079"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2733381"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/BF01908075"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2008.32"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/266021.266273"},{"key":"ref5","first-page":"282","article-title":"Mode analysis: A generalization of nearest neighbour which reduces chaining effects","author":"wishart","year":"1968","journal-title":"Proc Colloquium in Numerical Taxonomy"},{"key":"ref8","first-page":"164","article-title":"Think locally, act globally: Highly balanced graph partitioning","volume":"7933","year":"0","journal-title":"Experimental Algorithms 12th Int Symp SEA 2013 Proc"},{"key":"ref7","author":"sanders","year":"0","journal-title":"Kahip Karlsruhe high quality partitioning"},{"key":"ref2","doi-asserted-by":"crossref","DOI":"10.1023\/A:1009843930701","article-title":"A density-based algorithm for discovering clusters in large spatial databases with noise","author":"ester","year":"0","journal-title":"Proc 2nd Int Conf Knowl Discovery and Data Mining ser KDD'96"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975499.17"},{"key":"ref1","first-page":"226","author":"heineman","year":"2008","journal-title":"Algorithms in a Nutshell O'Reilly Media"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1999.754967"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10377-8_1"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972733.5"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2009.10129177"},{"key":"ref23","first-page":"1","article-title":"Data analysis in public social networks","author":"takac","year":"0","journal-title":"Int Scientific Conf and Int Workshop Present Day Trends of Innovations"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2012.115"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2017.12"}],"event":{"name":"2020 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","location":"The Hague, Netherlands","start":{"date-parts":[[2020,12,7]]},"end":{"date-parts":[[2020,12,10]]}},"container-title":["2020 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9381192\/9381291\/09381413.pdf?arnumber=9381413","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T15:48:09Z","timestamp":1656344889000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9381413\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,7]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/asonam49781.2020.9381413","relation":{},"subject":[],"published":{"date-parts":[[2020,12,7]]}}}