{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T16:31:19Z","timestamp":1759941079267,"version":"3.28.0"},"reference-count":38,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,4]]},"DOI":"10.1109\/icde.2008.4497457","type":"proceedings-article","created":{"date-parts":[[2008,4,29]],"date-time":"2008-04-29T15:04:39Z","timestamp":1209481479000},"page":"486-495","source":"Crossref","is-referenced-by-count":56,"title":["Mining (Social) Network Graphs to Detect Random Link Attacks"],"prefix":"10.1109","author":[{"given":"Nisheeth","family":"Shrivastava","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anirban","family":"Majumder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajeev","family":"Rastogi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","article-title":"the sybil attack","author":"douceur","year":"0","journal-title":"IPTPS'02"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335325"},{"key":"36","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1979.34"},{"key":"18","article-title":"small-worlds: beyond social networking","volume":"5","author":"curtis","year":"2004","journal-title":"Rose-Hulman Inst of Tech Math Journal"},{"key":"33","article-title":"discovering large dense subgraphs in massive graphs","author":"gibson","year":"2005","journal-title":"VLDB'05"},{"key":"15","first-page":"61","article-title":"the small world problem","volume":"1","author":"milgram","year":"1967","journal-title":"Psychology Today"},{"key":"34","first-page":"287","article-title":"a heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere","author":"busygin","year":"2002","journal-title":"JCO"},{"key":"16","doi-asserted-by":"crossref","DOI":"10.1126\/science.286.5439.509","article-title":"emergence of scaling in random networks","author":"barabasi","year":"1999","journal-title":"Science"},{"year":"0","key":"13"},{"year":"0","key":"14"},{"key":"37","first-page":"290","article-title":"on random graphs","volume":"6","author":"erdos","year":"1959","journal-title":"Publ Math Debrecen"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1145\/1216016.1216017"},{"key":"38","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548398003538"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1990","author":"garey","key":"12"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1145\/1281100.1281181"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2008.923723"},{"key":"22","article-title":"secure routing in wireless sensor networks: attacks and countermeasures","author":"karlof","year":"0","journal-title":"SNPA'03"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1145\/984622.984660"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242598"},{"year":"0","key":"25"},{"key":"26","article-title":"a bayesian approach to filtering junk e-mail","author":"sahami","year":"1998","journal-title":"AAAI Tech Report"},{"key":"27","first-page":"2673","article-title":"spam filtering using statistical data compression models","volume":"7","author":"bratko","year":"2006","journal-title":"JMLR"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2006.12.005"},{"key":"29","article-title":"reputation network analysis for email filtering","author":"goelback","year":"0","journal-title":"CEAS'04"},{"year":"0","key":"3"},{"year":"0","key":"2"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.012582999"},{"journal-title":"Hotel campari ad campaign","year":"0","key":"1"},{"key":"30","article-title":"comparative graph theoretical characterization of networks of spam","author":"gomes","year":"0","journal-title":"CEAS'05"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502525"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.2307\/1252170"},{"year":"0","key":"32"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2005.132"},{"key":"31","first-page":"639","article-title":"extracting large-scale knowledge bases from the web","author":"kumar","year":"1999","journal-title":"The VLDB Journal"},{"year":"0","key":"4"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"}],"event":{"name":"2008 IEEE 24th International Conference on Data Engineering (ICDE 2008)","start":{"date-parts":[[2008,4,7]]},"location":"Cancun, Mexico","end":{"date-parts":[[2008,4,12]]}},"container-title":["2008 IEEE 24th International Conference on Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4492792\/4497384\/04497457.pdf?arnumber=4497457","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,4]],"date-time":"2020-05-04T18:44:43Z","timestamp":1588617883000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4497457\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,4]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/icde.2008.4497457","relation":{},"subject":[],"published":{"date-parts":[[2008,4]]}}}