{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:11:17Z","timestamp":1759133477489,"version":"3.37.3"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2016,5,1]],"date-time":"2016-05-01T00:00:00Z","timestamp":1462060800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/100000001","name":"US National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1217284","CCF-1018114"],"award-info":[{"award-number":["CCF-1217284","CCF-1018114"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2016,5,1]]},"DOI":"10.1109\/tkde.2015.2509973","type":"journal-article","created":{"date-parts":[[2015,12,17]],"date-time":"2015-12-17T19:41:23Z","timestamp":1450381283000},"page":"1189-1202","source":"Crossref","is-referenced-by-count":8,"title":["Fast Top-K Path-Based Relevance Query on Massive Graphs"],"prefix":"10.1109","volume":"28","author":[{"given":"Samamon","family":"Khemmarat","sequence":"first","affiliation":[]},{"given":"Lixin","family":"Gao","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.14778\/2212351.2212354"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920881"},{"key":"ref31","first-page":"8","article-title":"Neighborhood formation and anomaly detection in bipartite graphs","author":"sun","year":"0","journal-title":"Proc Int Conf Data Mining"},{"key":"ref30","first-page":"613","article-title":"Fast random walk with restart and its applications","author":"tong","year":"0","journal-title":"Proc Int Conf Data Mining"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775126"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2351316.2351321"},{"volume":"31","year":"2012","author":"allen","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367738"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339538"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.14778\/2140436.2140441"},{"key":"ref16","first-page":"613","article-title":"Roundtriprank: Graph-based proximity with importance and specificity","author":"fang","year":"0","journal-title":"Proc IEEE 29th Int Conf Data Eng"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2463717"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2013.235"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2038916.2038929"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2005.10129104"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989421"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988752"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367618"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289026"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.14778\/1929861.1929864"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/775152.775191"},{"key":"ref8","article-title":"SpamRank—Fully automatic link spam detection work in progress","author":"benczur","year":"0","journal-title":"Proc 1st Int Workshop Adversarial Inf Retrieval Web"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77004-6_12"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2003.1208999"},{"key":"ref9","first-page":"439","article-title":"Link spam detection based on mass estimation","author":"gyongyi","year":"0","journal-title":"Proc Intl Conf on Very Large Databases"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816661"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.14778\/2732977.2732978"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217301"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150479"},{"key":"ref24","article-title":"Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters","volume":"abs 810 1355","author":"leskovec","year":"2008","journal-title":"CoRR"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/1232722.1232727"},{"key":"ref26","first-page":"44","article-title":"Group formation in large social networks: membership, growth, and evolution","author":"backstrom","year":"0","journal-title":"Proc 12th ACM SIGKDD Int Conf Knowl Discovery Data Mining"},{"key":"ref25","first-page":"1","article-title":"Data analysis in public social networks","author":"takac","year":"0","journal-title":"Proc Int Sci Conf Int Workshop Present Day Trends Innovations"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/7445292\/7360177.pdf?arnumber=7360177","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T02:34:16Z","timestamp":1633919656000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7360177\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,1]]},"references-count":33,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2015.2509973","relation":{},"ISSN":["1041-4347"],"issn-type":[{"type":"print","value":"1041-4347"}],"subject":[],"published":{"date-parts":[[2016,5,1]]}}}