{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T21:07:09Z","timestamp":1781039229186,"version":"3.54.1"},"reference-count":38,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1109\/bigdata.2014.7004267","type":"proceedings-article","created":{"date-parts":[[2015,1,13]],"date-time":"2015-01-13T20:04:23Z","timestamp":1421179463000},"page":"500-509","source":"Crossref","is-referenced-by-count":6,"title":["Clique guided community detection"],"prefix":"10.1109","author":[{"given":"Diana","family":"Palsetia","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Md. Mostofa Ali","family":"Patwary","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"William","family":"Hendrix","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ankit","family":"Agrawal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alok","family":"Choudhary","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0400054101"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1145\/1718487.1718519"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.026113"},{"key":"36","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217301"},{"key":"18","first-page":"87","article-title":"Betweenness-based decomposition methods for social and biological networks","author":"pinney","year":"2007","journal-title":"Interdisciplinary Statistics and Bioinformatics"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1007\/BF01908075"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242805"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.67.026126"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.122653799"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.06.015"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2006\/11\/P11010"},{"key":"37","doi-asserted-by":"publisher","DOI":"10.1145\/1232722.1232727"},{"key":"11","author":"garey","year":"1979","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"38","author":"zafarani","year":"2009","journal-title":"Social Computing Data Repository at Arizona State University School of Computing Informatics and Decision Systems Engineering"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/ICICISYS.2009.5358036"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.77.016104"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1140\/epjb\/e2004-00125-x"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-014-0170-z"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.74.016107"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1002\/cplx.20166"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2012.05.021"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1038\/nature03607"},{"key":"27","author":"lee","year":"2010","journal-title":"Detecting Highly Overlapping Community Structure by Greedy Clique Expansion"},{"key":"28","first-page":"5","article-title":"An improved branch and bound algorithm for the maximum clique problem","volume":"4","author":"konc","year":"2007","journal-title":"Proteins"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1145\/362342.362367"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511815478"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1038\/35065725"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/1348549.1348552"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0601602103"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(90)90057-C"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367733"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.70.066111"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.78.046110"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.066133"},{"key":"31","article-title":"Fast algorithms for the maximum clique problem on massive sparse graphs","author":"pattabiraman","year":"2012","journal-title":"CoRR"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2009.11.002"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl039"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0605965104"}],"event":{"name":"2014 IEEE International Conference on Big Data (Big Data)","location":"Washington, DC, USA","start":{"date-parts":[[2014,10,27]]},"end":{"date-parts":[[2014,10,30]]}},"container-title":["2014 IEEE International Conference on Big Data (Big Data)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6973861\/7004197\/07004267.pdf?arnumber=7004267","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,24]],"date-time":"2017-03-24T05:03:18Z","timestamp":1490331798000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7004267\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/bigdata.2014.7004267","relation":{},"subject":[],"published":{"date-parts":[[2014,10]]}}}