ABSTRACT

Many information-management tasks (including classification, retrieval, information extraction, and information integration) can be formalized as inference in an appropriate probabilistic first-order logic. However, most probabilistic first-order logics are not efficient enough for realistically-sized instances of these tasks. One key problem is that queries are typically answered by "grounding" the query---i.e., mapping it to a propositional representation, and then performing propositional inference---and with a large database of facts, groundings can be very large, making inference and learning computationally expensive. Here we present a first-order probabilistic language which is well-suited to approximate "local" grounding: in particular, every query $Q$ can be approximately grounded with a small graph. The language is an extension of stochastic logic programs where inference is performed by a variant of personalized PageRank. Experimentally, we show that the approach performs well on an entity resolution task, a classification task, and a joint inference task; that the cost of inference is independent of database size; and that speedup in learning is possible by multi-threading.
- Babak Ahmadi, Kristian Kersting, and Scott Sanner. 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, 2011. Google Scholar
Digital Library
- Reid Andersen, Fan R. K. Chung, and Kevin J. Lang. Local partitioning for directed graphs using pagerank. Internet Mathematics, 5(1):3--22, 2008.Google Scholar
Cross Ref
- Lars Backstrom and Jure Leskovec. Supervised random walks: predicting and recommending links in social networks. In Proceedings of the fourth ACM international conference on Web search and data mining, 2011. Google Scholar
Digital Library
- Matthias Brocheler, Lilyana Mihalkova, and Lise Getoor. Probabilistic similarity logic. In Proceedings of the Conference on Uncertainty in Artificial Intelligence, 2010.Google Scholar
- Andrew Carlson, Justin Betteridge, Bryan Kisiel, Burr Settles, Estevam R. Hruschka Jr., and Tom M. Mitchell. Toward an architecture for never-ending language learning. In Maria Fox and David Poole, editors, AAAI. AAAI Press, 2010.Google Scholar
- Soumen Chakrabarti. Dynamic personalized PageRank in entity-relation graphs. In Proceedings of the 16th international conference on World Wide Web, 2007. Google Scholar
Digital Library
- William W. Cohen. Data integration using similarity joins and a word-based information representation language. ACM Transactions on Information Systems, 18(3):288--321, July 2000. Google Scholar
Digital Library
- William W Cohen. Graph Walks and Graphical Models. Carnegie Mellon University, School of Computer Science, Machine Learning Department, 2010.Google Scholar
- James Cussens. Parameter estimation in stochastic logic programs. Machine Learning, 44(3):245--271, 2001. Google Scholar
Digital Library
- Luc De Raedt, Angelika Kimmig, and Hannu Toivonen. Problog: A probabilistic prolog and its application in link discovery. In Proceedings of the 20th international joint conference on Artifical intelligence, 2007. Google Scholar
Digital Library
- Pedro Domingos and Daniel Lowd. Markov Logic: An Interface Layer for Artificial Intelligence. Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan & Claypool Publishers, 2009. Google Scholar
Digital Library
- Norbert Fuhr. Probabilistic datalog--a logic for powerful retrieval methods. In Proceedings of the 18th annual international ACM SIGIR conference on Research and development in information retrieval, pages 282--290. ACM, 1995. Google Scholar
Digital Library
- Bernd Gutmann, Angelika Kimmig, Kristian Kersting, and Luc De Raedt. Parameter estimation in problog from annotated queries. CW Reports, 2010.Google Scholar
- Abhay Jha and Dan Suciu. Probabilistic databases with markoviews. Proceedings of the VLDB Endowment, 5(11):1160--1171, 2012. Google Scholar
Digital Library
- Ni Lao and William W. Cohen. Relational retrieval using a combination of path-constrained random walks. Machine Learning, 81(1):53--67, 2010. Google Scholar
Digital Library
- Ni Lao, Tom M. Mitchell, and William W. Cohen. Random walk inference and learning in a large scale knowledge base. In EMNLP, pages 529--539. ACL, 2011. Google Scholar
Digital Library
- J. W. Lloyd. Foundations of Logic Programming: Second Edition. Springer-Verlag, 1987. Google Scholar
Digital Library
- Daniel Lowd and Pedro Domingos. Efficient weight learning for markov logic networks. In Knowledge Discovery in Databases: PKDD 2007, pages 200--211. Springer, 2007. Google Scholar
Digital Library
- Andrew McCallum, Kamal Nigam, and Lyle H. Ungar. Efficient clustering of high-dimensional data sets with application to reference matching. In Knowledge Discovery and Data Mining, pages 169--178, 2000. Google Scholar
Digital Library
- Feng Niu, Christopher Ré, AnHai Doan, and Jude Shavlik. Tuffy: Scaling up statistical inference in markov logic networks using an RDBMS. Proceedings of the VLDB Endowment, 4(6):373--384, 2011. Google Scholar
Digital Library
- Feng Niu, Benjamin Recht, Christopher Ré, and Stephen J Wright. Hogwild!: A lock-free approach to parallelizing stochastic gradient descent. arXiv preprint arXiv:1106.5730, 2011.Google Scholar
- Larry Page, Sergey Brin, R. Motwani, and T. Winograd. The PageRank citation ranking: Bringing order to the web. In Technical Report, Computer Science department, Stanford University, 1998.Google Scholar
- Hoifung Poon and Pedro Domingos. Joint inference in information extraction. In Proceedings of the National Conference on Artificial Intelligence, 2007. Google Scholar
Digital Library
- Hoifung Poon and Pedro Domingos. Joint unsupervised coreference resolution with markov logic. In Proceedings of the Conference on Empirical Methods in Natural Language Processing, pages 650--659. Association for Computational Linguistics, 2008. Google Scholar
Digital Library
- Matthew Richardson and Pedro Domingos. Markov logic networks. Mach. Learn., 62(1--2):107--136, 2006. Google Scholar
Digital Library
- Jude Shavlik and Sriraam Natarajan. Speeding up inference in markov logic networks by preprocessing to reduce the size of the resulting grounded network. In Proceedings of the Twenty-first International Joint Conference on Artificial Intelligence (IJCAI-09), 2009. Google Scholar
Digital Library
- Parag Singla and Pedro Domingos. Entity resolution with markov logic. In Data Mining, 2006. ICDM'06. Sixth International Conference on, 2006. Google Scholar
Digital Library
- Parag Singla and Pedro Domingos. Memory-efficient inference in relational domains. In Proceedings of the national conference on Artificial intelligence, 2006. Google Scholar
Digital Library
- Parag Singla and Pedro Domingos. Lifted first-order belief propagation. In Proceedings of the 23rd national conference on Artificial intelligence, 2008. Google Scholar
Digital Library
- Hanghang Tong, Christos Faloutsos, and Jia-Yu Pan. Fast random walk with restart and its applications. In ICDM, pages 613--622. IEEE Computer Society, 2006. Google Scholar
Digital Library
- Martin Zinkevich, Alex Smola, and John Langford. Slow learners are fast. Advances in Neural Information Processing Systems, 22:2331--2339, 2009.Google Scholar
- Martin Zinkevich, Markus Weimer, Alex Smola, and Lihong Li. Parallelized stochastic gradient descent. Advances in Neural Information Processing Systems, 2010.Google Scholar
Index Terms
Programming with personalized pagerank: a locally groundable first-order probabilistic logic
Recommendations
Disjunctive Logic Program = Horn Program + Control Program
JELIA '98: Proceedings of the European Workshop on Logics in Artificial IntelligenceThis paper presents an alternative view on propositional disjunctive logic program: Disjunctive program = Control program + Horn program. For this we introduce a program transformation which transforms a disjunctive logic program into a Horn program and ...
Formal proof of a program: Find
In 1971, C.A.R. Hoare gave the proof of correctness and termination of a rather complex algorithm, in a paper entitled Proof of a program: Find. It is a handmade proof, where the program is given together with its formal specification and where each ...
Structure Learning via Parameter Learning
CIKM '14: Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge ManagementA key challenge in information and knowledge management is to automatically discover the underlying structures and patterns from large collections of extracted information. This paper presents a novel structure-learning method for a new, scalable ...






Comments