{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,24]],"date-time":"2024-07-24T11:59:12Z","timestamp":1721822352226},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,4,4]],"date-time":"2015-04-04T00:00:00Z","timestamp":1428105600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1007\/s10994-015-5488-x","type":"journal-article","created":{"date-parts":[[2015,4,3]],"date-time":"2015-04-03T20:28:01Z","timestamp":1428092881000},"page":"101-126","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":33,"title":["Efficient inference and learning in a large knowledge base"],"prefix":"10.1007","volume":"100","author":[{"given":"William Yang","family":"Wang","sequence":"first","affiliation":[]},{"given":"Kathryn","family":"Mazaitis","sequence":"additional","affiliation":[]},{"given":"Ni","family":"Lao","sequence":"additional","affiliation":[]},{"given":"William W.","family":"Cohen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,4]]},"reference":[{"key":"5488_CR1","unstructured":"Ahmadi, B., Kersting, K., & Sanner, S. (2011). Multi-evidence lifted message passing, with application to pagerank and the kalman filter. In Proceedings of the twenty-second international joint conference on artificial intelligence (pp. 1152\u20131158)."},{"key":"5488_CR2","doi-asserted-by":"crossref","unstructured":"Andersen, R., Chung, F. R. K., & Lang, K. J. (2006). Local graph partitioning using pagerank vectors. In FOCS (pp. 475\u2013486).","DOI":"10.1109\/FOCS.2006.44"},{"issue":"1","key":"5488_CR3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1080\/15427951.2008.10129297","volume":"5","author":"R Andersen","year":"2008","unstructured":"Andersen, R., Chung, F. R. K., & Lang, K. J. (2008). Local partitioning for directed graphs using pagerank. Internet Mathematics, 5(1), 3\u201322.","journal-title":"Internet Mathematics"},{"key":"5488_CR4","doi-asserted-by":"crossref","unstructured":"Backstrom, L., & Leskovec, J. (2011). Supervised random walks: Predicting and recommending links in social networks. In Proceedings of the fourth ACM international conference on web search and data mining (pp. 635\u2013644).","DOI":"10.1145\/1935826.1935914"},{"key":"5488_CR5","unstructured":"Brocheler, M., Mihalkova, L., & Getoor, L. (2010). Probabilistic similarity logic. In Proceedings of the conference on uncertainty in artificial intelligence (pp. 73\u201382)."},{"key":"5488_CR6","unstructured":"Callan, J., Hoy, M., Yoo, C., & Zhao, L. (2009). Clueweb09 data set."},{"key":"5488_CR7","doi-asserted-by":"crossref","unstructured":"Carlson, A., Betteridge, J., Kisiel, B., Settles, B., Hruschka Jr. E. R., & Mitchell, T. M. (2010). Toward an architecture for never-ending language learning. In AAAI (pp. 1306\u20131313).","DOI":"10.1609\/aaai.v24i1.7519"},{"key":"5488_CR8","doi-asserted-by":"crossref","unstructured":"Chakrabarti, S. (2007). Dynamic personalized PageRank in entity-relation graphs. In Proceedings of the 16th international conference on world wide web (pp. 571\u2013580).","DOI":"10.1145\/1242572.1242650"},{"issue":"3","key":"5488_CR9","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1145\/352595.352598","volume":"18","author":"WW Cohen","year":"2000","unstructured":"Cohen, W. W. (2000). Data integration using similarity joins and a word-based information representation language. ACM Transactions on Information Systems, 18(3), 288\u2013321.","journal-title":"ACM Transactions on Information Systems"},{"key":"5488_CR10","unstructured":"Cohen, W. W. (2010). Graph walks and graphical models. CMU-ML-10-102, Carnegie Mellon University, School of Computer Science, Machine Learning Department."},{"issue":"3","key":"5488_CR11","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1023\/A:1010924021315","volume":"44","author":"J Cussens","year":"2001","unstructured":"Cussens, J. (2001). Parameter estimation in stochastic logic programs. Machine Learning, 44(3), 245\u2013271.","journal-title":"Machine Learning"},{"key":"5488_CR12","unstructured":"De Raedt, L., Kimmig, A., & Toivonen, H. (2007). Problog: A probabilistic prolog and its application in link discovery. In Proceedings of the 20th international joint conference on artifical intelligence (pp. 2462\u20132467)."},{"key":"5488_CR13","doi-asserted-by":"crossref","unstructured":"Fuhr, N. (1995). Probabilistic datalog\u2014A logic for powerful retrieval methods. In Proceedings of the 18th annual international ACM SIGIR conference on research and development in information retrieval. ACM (pp. 282\u2013290).","DOI":"10.1145\/215206.215372"},{"key":"5488_CR14","unstructured":"Gutmann, B., Kimmig, A., Kersting, K., & De Raedt L. (2010). Parameter estimation in problog from annotated queries. CW reports (583)."},{"key":"5488_CR15","unstructured":"Ho, Q., Cipar, J., Cui, H., Lee, S., Kim, J. K., Gibbons, P. B., et al. (2013). More effective distributed ml via a stale synchronous parallel parameter server. In Advances in neural information processing systems (pp. 1223\u20131231)."},{"key":"5488_CR16","unstructured":"Hoffmann, R., Zhang, C., Ling, X., Zettlemoyer, L. S., & Weld, D. S. (2011). Knowledge-based weak supervision for information extraction of overlapping relations. In ACL (pp. 541\u2013550)."},{"issue":"11","key":"5488_CR17","doi-asserted-by":"crossref","first-page":"1160","DOI":"10.14778\/2350229.2350236","volume":"5","author":"A Jha","year":"2012","unstructured":"Jha, A., & Suciu, D. (2012). Probabilistic databases with markoviews. Proceedings of the VLDB Endowment, 5(11), 1160\u20131171.","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"1","key":"5488_CR18","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/s10994-010-5205-8","volume":"81","author":"N Lao","year":"2010","unstructured":"Lao, N., & Cohen, W. W. (2010). Relational retrieval using a combination of path-constrained random walks. Machine Learning, 81(1), 53\u201367.","journal-title":"Machine Learning"},{"key":"5488_CR19","unstructured":"Lao, N., Mitchell, T. M., & Cohen, W. W. (2011) Random walk inference and learning in a large scale knowledge base. In EMNLP. ACL (pp. 529\u2013539)."},{"key":"5488_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of logic programming","author":"JW Lloyd","year":"1987","unstructured":"Lloyd, J. W. (1987). Foundations of logic programming (2nd ed.). Berlin: Springer.","edition":"2"},{"key":"5488_CR21","doi-asserted-by":"crossref","unstructured":"Lowd, D., & Domingos, P. (2007). Efficient weight learning for markov logic networks. In Knowledge discovery in databases: PKDD 2007. Springer (pp. 200\u2013211).","DOI":"10.1007\/978-3-540-74976-9_21"},{"key":"5488_CR22","doi-asserted-by":"crossref","unstructured":"McCallum, A., Nigam, K., & Ungar, L. H. (2000). Efficient clustering of high-dimensional data sets with application to reference matching. In Knowledge discovery and data mining (pp. 169\u2013178). http:\/\/dl.acm.org\/citation.cfm?id=347123 .","DOI":"10.1145\/347090.347123"},{"key":"5488_CR23","first-page":"254","volume":"32","author":"S Muggleton","year":"1996","unstructured":"Muggleton, S. (1996). Stochastic logic programs. Advances in Inductive Logic Programming, 32, 254\u2013264.","journal-title":"Advances in Inductive Logic Programming"},{"issue":"6","key":"5488_CR24","doi-asserted-by":"crossref","first-page":"373","DOI":"10.14778\/1978665.1978669","volume":"4","author":"F Niu","year":"2011","unstructured":"Niu, F., R\u00e9, C., Doan, A., & Shavlik, J. (2011). Tuffy: Scaling up statistical inference in markov logic networks using an RDBMS. Proceedings of the VLDB Endowment, 4(6), 373\u2013384.","journal-title":"Proceedings of the VLDB Endowment"},{"key":"5488_CR25","unstructured":"Page, L., Brin, S., Motwani, R., & Winograd, T. (1998). The PageRank citation ranking: Bringing order to the web. Technical report, Computer Science department, Stanford University."},{"key":"5488_CR26","unstructured":"Poon, H., & Domingos, P. (2007). Joint inference in information extraction. In AAAI (Vol. 7, pp. 913\u2013918)."},{"key":"5488_CR27","doi-asserted-by":"crossref","unstructured":"Poon, H., & Domingos, P. (2008). Joint unsupervised coreference resolution with markov logic. In Proceedings of the conference on empirical methods in natural language processing. Association for Computational Linguistics (pp. 650\u2013659).","DOI":"10.3115\/1613715.1613796"},{"key":"5488_CR28","unstructured":"Recht, B., Re, C., Wright, S., & Niu, F. (2011). Hogwild: A lock-free approach to parallelizing stochastic gradient descent. In Advances in Neural Information Processing Systems (pp. 693\u2013701)."},{"issue":"1\u20132","key":"5488_CR29","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/s10994-006-5833-1","volume":"62","author":"M Richardson","year":"2006","unstructured":"Richardson, M., & Domingos, P. (2006). Markov logic networks. Machine Learning, 62(1\u20132), 107\u2013136. doi: 10.1007\/s10994-006-5833-1 .","journal-title":"Machine Learning"},{"key":"5488_CR30","unstructured":"Shavlik, J., & Natarajan, S. (2009). Speeding up inference in markov logic networks by preprocessing to reduce the size of the resulting grounded network. In Proceedings of the 21st international jont conference on artifical intelligence (pp. 1951\u20131956)."},{"key":"5488_CR31","unstructured":"Singhal, A. (2012). Introducing the knowledge graph: Things, not strings. The official Google blog: http:\/\/googleblog.blogspot.com\/2012\/05\/introducing-knowledge-graph-things-not.html ."},{"key":"5488_CR32","doi-asserted-by":"crossref","unstructured":"Singla, P., & Domingos, P. (2006a). Entity resolution with markov logic. In Sixth international conference on data mining, 2006. ICDM\u201906 (pp. 572\u2013582).","DOI":"10.1109\/ICDM.2006.65"},{"key":"5488_CR33","unstructured":"Singla, P., & Domingos, P. (2006b). Memory-efficient inference in relational domains. In Proceedings of the national conference on artificial intelligence (pp. 488\u2013493)."},{"key":"5488_CR34","unstructured":"Singla, P., & Domingos, P. (2008). Lifted first-order belief propagation. In Proceedings of the 23rd national conference on artificial intelligence (pp. 1094\u20131099)."},{"key":"5488_CR35","doi-asserted-by":"crossref","unstructured":"Suchanek, F. M., Kasneci, G., & Weikum, G. (2007). Yago: A core of semantic knowledge. In Proceedings of the 16th international conference on world wide web. ACM (pp. 697\u2013706).","DOI":"10.1145\/1242572.1242667"},{"key":"5488_CR36","doi-asserted-by":"crossref","unstructured":"Tong, H., Faloutsos, C., & Pan, J.-Y. (2006). Fast random walk with restart and its applications. In ICDM. IEEE Computer Society (pp. 613\u2013622).","DOI":"10.1109\/ICDM.2006.70"},{"key":"5488_CR37","doi-asserted-by":"crossref","unstructured":"Van den Broeck, G., Thon, I., van Otterlo, M., & De Raedt L. (2010). Dtproblog: A decision-theoretic probabilistic prolog. In AAAI (pp. 1217\u20131222).","DOI":"10.1609\/aaai.v24i1.7755"},{"key":"5488_CR38","doi-asserted-by":"crossref","unstructured":"Wang, W. Y., Mazaitis, K., & Cohen, W. W. (2013). Programming with personalized pagerank: A locally groundable first-order probabilistic logic. In Proceedings of the 22nd ACM international conference on information and knowledge management (CIKM 2013) (pp. 2129\u20132138).","DOI":"10.1145\/2505515.2505573"},{"key":"5488_CR39","first-page":"2331","volume":"22","author":"M Zinkevich","year":"2009","unstructured":"Zinkevich, M., Smola, A., & Langford, J. (2009). Slow learners are fast. Advances in Neural Information Processing Systems, 22, 2331\u20132339.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"5488_CR40","unstructured":"Zinkevich, M., Weimer, M., Smola, A., & Li, L. (2010). Parallelized stochastic gradient descent. In Advances in neural information processing systems (pp. 2595\u20132603)."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-015-5488-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-015-5488-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-015-5488-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T05:32:09Z","timestamp":1691559129000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-015-5488-x"}},"subtitle":["Reasoning with extracted information using a locally groundable first-order probabilistic logic"],"short-title":[],"issued":{"date-parts":[[2015,4,4]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["5488"],"URL":"https:\/\/doi.org\/10.1007\/s10994-015-5488-x","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,4]]}}}