Programming with personalized pagerank

William Yang Wang, Kathryn Mazaitis, William W. Cohen
2013 Proceedings of the 22nd ACM international conference on Conference on information & knowledge management - CIKM '13  
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 realisticallysized instances of these tasks. One key problem is that queries are typically answered by "grounding" the queryi.e., mapping it to a propositional representation, and then performing propositional
more » ... ce-and with a large database of facts, groundings can be very large, making inference and learning computationally expensive. Here we present a firstorder 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.
doi:10.1145/2505515.2505573 dblp:conf/cikm/WangMC13 fatcat:o7zm4oqhurfrbbbmvkettykdsy