{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:55:25Z","timestamp":1760597725206},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2017,2,1]],"date-time":"2017-02-01T00:00:00Z","timestamp":1485907200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"VSU Faculty Research"},{"name":"Center for Faculty Scholarship at VSU"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2017,2,1]]},"DOI":"10.1109\/tkde.2016.2625251","type":"journal-article","created":{"date-parts":[[2016,11,4]],"date-time":"2016-11-04T18:24:08Z","timestamp":1478283848000},"page":"433-445","source":"Crossref","is-referenced-by-count":8,"title":["Scaling Up Markov Logic Probabilistic Inference for Social Graphs"],"prefix":"10.1109","volume":"29","author":[{"given":"Haiquan","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei-Shinn","family":"Ku","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haixun","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liang","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Min-Te","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref30","first-page":"290","article-title":"LinkProbe: Probabilistic inference on large-scale social networks","author":"chen","year":"0","journal-title":"Proc IEEE 29th Int Conf Data Eng"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458084"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89765-1_1"},{"key":"ref12","first-page":"1106","article-title":"Hybrid Markov logic networks","author":"wang","year":"0","journal-title":"Proc 23rd Nat Conf Artif Intell"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526859"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526724"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835845"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376686"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453896"},{"key":"ref18","first-page":"488","article-title":"Memory-efficient inference in relational domains","author":"singla","year":"0","journal-title":"Proc 21st Nat Conf Artif Intell"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13840-9_11"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835855"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557108"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/956863.956972"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1754393.1754397"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/HICSS.2005.299"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/1935826.1935914"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081925"},{"key":"ref8","first-page":"1951","article-title":"Speeding up inference in Markov logic networks by preprocessing to reduce the size of the\n resulting grounded network","author":"shavlik","year":"0","journal-title":"Proc 21st Int Joint Conf Artif Intell"},{"key":"ref7","first-page":"1138","article-title":"Linking social networks on the web with FOAF: A Semantic Web case study","author":"golbeck","year":"0","journal-title":"Proc 23rd Nat Conf Artif Intell"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772875"},{"key":"ref9","first-page":"745","article-title":"Defining and evaluating network communities based on ground-truth","author":"yang","year":"0","journal-title":"Proc IEEE Int Conf Data Mining"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.140"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.14778\/1978665.1978669"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2398559"},{"key":"ref21","first-page":"1406","article-title":"Web information extraction using Markov logic networks","author":"satpal","year":"0","journal-title":"Proc 17th ACM SIGKDD Int Conf Knowl Discovery Data Mining"},{"key":"ref24","first-page":"2868","article-title":"On the complexity and approximation of binary evidence in lifted inference","author":"van den broeck and","year":"0","journal-title":"Proc Advances Neural Inf Process Syst"},{"key":"ref23","first-page":"131","article-title":"Lifted\n relax, compensate and then recover: From approximate to exact lifted probabilistic inference","author":"den broeck","year":"0","journal-title":"Proc 28th Conf Uncertainty Artif Intell"},{"key":"ref26","first-page":"3606","article-title":"Just count\n the satisfied groundings: Scalable local-search and sampling based inference in MLNs","author":"venugopal","year":"0","journal-title":"Proc 29th AAAI Conf Artif Intell"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44845-8_17"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/7812805\/07736107.pdf?arnumber=7736107","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:38:11Z","timestamp":1642005491000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7736107\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,1]]},"references-count":30,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2016.2625251","relation":{},"ISSN":["1041-4347"],"issn-type":[{"value":"1041-4347","type":"print"}],"subject":[],"published":{"date-parts":[[2017,2,1]]}}}