{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T23:03:27Z","timestamp":1729638207419,"version":"3.28.0"},"reference-count":44,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1109\/bigdata.2015.7363859","type":"proceedings-article","created":{"date-parts":[[2015,12,28]],"date-time":"2015-12-28T16:36:21Z","timestamp":1451320581000},"page":"1053-1062","source":"Crossref","is-referenced-by-count":5,"title":["Scalable community discovery from multi-faceted graphs"],"prefix":"10.1109","author":[{"given":"Ahmed","family":"Metwally","sequence":"first","affiliation":[]},{"given":"Jia-Yu","family":"Pan","sequence":"additional","affiliation":[]},{"given":"Minh","family":"Doan","sequence":"additional","affiliation":[]},{"given":"Christos","family":"Faloutsos","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref39","DOI":"10.1109\/ICDM.2009.125"},{"doi-asserted-by":"publisher","key":"ref38","DOI":"10.1109\/ICDM.2009.20"},{"key":"ref33","first-page":"899","article-title":"Do more views of a graph help? Community detection and clustering in multi-graphs","author":"papalexakis","year":"2013","journal-title":"Proceedings of the 16th International Conference on Information Fusion FUSION"},{"doi-asserted-by":"publisher","key":"ref32","DOI":"10.1109\/ICDM.2008.142"},{"key":"ref31","first-page":"1017","article-title":"Fundamental Limitations of Spectral Clustering","volume":"19","author":"nadler","year":"2007","journal-title":"Advances in neural information processing systems"},{"key":"ref30","doi-asserted-by":"crossref","first-page":"876","DOI":"10.1126\/science.1184819","article-title":"Community Structure in Time-Dependent, Multiscale, and Multiplex Networks","volume":"328","author":"mucha","year":"2010","journal-title":"Science"},{"doi-asserted-by":"publisher","key":"ref37","DOI":"10.1109\/INFCOM.2012.6195581"},{"doi-asserted-by":"publisher","key":"ref36","DOI":"10.1109\/ICDE.2013.6544813"},{"doi-asserted-by":"publisher","key":"ref35","DOI":"10.1145\/2588555.2593661"},{"key":"ref34","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1007\/978-3-642-13672-6_42","article-title":"Eigen-Spokes: Surprising Patterns and Scalable Community Chipping in Large Graphs","author":"prakash","year":"2010","journal-title":"Proc 14th Pacific-Asia Conf Advances in Knowledge Discovery and Data Mining"},{"key":"ref10","first-page":"10","article-title":"MapReduce: Simplified Data Processing on Large Clusters","author":"dean","year":"2004","journal-title":"Proceedings of the 6th OSDI Symposium on Opearting Systems Design & Implementation"},{"doi-asserted-by":"publisher","key":"ref40","DOI":"10.1186\/1471-2105-10-99"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1137\/1.9780898719918.ch7"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1093\/nar\/30.7.1575"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1145\/347090.347121"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1016\/j.physrep.2009.11.002"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1126\/science.1136800","article-title":"Clustering by Passing Messages Between Data Points","volume":"315","author":"frey","year":"2007","journal-title":"Science"},{"key":"ref16","first-page":"721","article-title":"Discovering Large Dense Subgraphs in Massive Graphs","author":"gibson","year":"2005","journal-title":"Proceedings of the International Conference on Very Large Data Bases VLDB"},{"year":"1984","author":"goldberg","journal-title":"Finding a Maximum Density Subgraph Technical report EECS Department University of California","key":"ref17"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.14778\/1687627.1687771"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1137\/1.9781611972801.66"},{"doi-asserted-by":"publisher","key":"ref28","DOI":"10.1145\/1242572.1242606"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1007\/s10618-013-0331-0"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1145\/1557019.1557080"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1145\/1824777.1824780"},{"key":"ref6","first-page":"1","article-title":"Identifying and Filtering Near-Duplicate Documents","author":"broder","year":"2000","journal-title":"Proc 11th Annu Symp Combinatorial Pattern Matching"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.14778\/2212351.2212353"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1145\/1807167.1807273"},{"key":"ref8","article-title":"Online Advertising Fraud","author":"daswani","year":"2008","journal-title":"Crimeware Understanding New Attacks and Defenses"},{"year":"2015","author":"bureau","journal-title":"IAB Internet Advertising Revenue Report 2014 Full Year Results","key":"ref7"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1007\/978-3-642-23780-5_13","article-title":"Is There a Best Quality Metric for Graph Clusters?","author":"almeida","year":"2011","journal-title":"Machine Learning and Knowledge Discovery in Databases"},{"key":"ref9","first-page":"11","article-title":"The Anatomy of Clickbot. A","author":"daswani","year":"2007","journal-title":"Proc 1st Workshop on Hot Topics in Understanding Botnets"},{"key":"ref1","doi-asserted-by":"crossref","DOI":"10.1201\/b15410","author":"aggarwal","year":"2013","journal-title":"Data Clustering Algorithms and Applications"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1093\/bioinformatics\/bti1049"},{"key":"ref22","first-page":"228","article-title":"On Mining Cross-graph Quasi-cliques","author":"jian","year":"2005","journal-title":"Proceedings of the 11th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1109\/T-C.1973.223640"},{"doi-asserted-by":"publisher","key":"ref42","DOI":"10.1145\/2487575.2487625"},{"key":"ref24","article-title":"The Goals and Challenges of Click Fraud Penetration Testing Systems","author":"kintana","year":"2009","journal-title":"Proceedings of the 20th IEEE ISSRE International Symposium on Software Reliability Engineering"},{"doi-asserted-by":"publisher","key":"ref41","DOI":"10.1007\/s10618-010-0181-y"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1109\/ICDM.2009.14"},{"key":"ref44","first-page":"1","article-title":"Characterizing Botnets from Email Spam Records","author":"zhuang","year":"2008","journal-title":"Proc of 1st Usenix Workshop on Large-Scale Exploits and Emergent Threats"},{"key":"ref26","first-page":"18:1","article-title":"Connected Components in MapReduce and Beyond","author":"kiveris","year":"2014","journal-title":"Proc ACM Symposium on Cloud Computing"},{"doi-asserted-by":"publisher","key":"ref43","DOI":"10.1109\/ASONAM.2011.111"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1093\/comnet\/cnu016"}],"event":{"name":"2015 IEEE International Conference on Big Data (Big Data)","start":{"date-parts":[[2015,10,29]]},"location":"Santa Clara, CA, USA","end":{"date-parts":[[2015,11,1]]}},"container-title":["2015 IEEE International Conference on Big Data (Big Data)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7347101\/7363706\/07363859.pdf?arnumber=7363859","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,2]],"date-time":"2019-09-02T20:35:54Z","timestamp":1567456554000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7363859\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10]]},"references-count":44,"URL":"https:\/\/doi.org\/10.1109\/bigdata.2015.7363859","relation":{},"subject":[],"published":{"date-parts":[[2015,10]]}}}