메뉴 건너뛰기




Volumn , Issue , 2013, Pages 2129-2138

Programming with personalized PageRank: A locally groundable first-order probabilistic logic

Author keywords

Personalized PageRank; Probabilistic prolog

Indexed keywords

CLASSIFICATION TASKS; ENTITY RESOLUTIONS; FIRST ORDER LOGIC; INFORMATION INTEGRATION; PERSONALIZED PAGERANK; PROBABILISTIC LANGUAGE; PROBABILISTIC PROLOG; STOCHASTIC LOGIC PROGRAMS;

EID: 84889589680     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2505515.2505573     Document Type: Conference Paper
Times cited : (107)

References (32)
  • 2
    • 80051666179 scopus 로고    scopus 로고
    • Local partitioning for directed graphs using pagerank
    • Reid Andersen, Fan R. K. Chung, and Kevin J. Lang. Local partitioning for directed graphs using pagerank. Internet Mathematics, 5(1):3-22, 2008.
    • (2008) Internet Mathematics , vol.5 , Issue.1 , pp. 3-22
    • Andersen, R.1    Chung, F.R.K.2    Lang, K.J.3
  • 5
    • 85021776053 scopus 로고    scopus 로고
    • Toward an architecture for never-ending language learning
    • Maria Fox and David Poole, editors AAAI Press
    • 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.
    • (2010) AAAI
    • Carlson, A.1    Betteridge, J.2    Kisiel, B.3    Settles, B.4    Hruschka Jr., E.R.5    Mitchell, T.M.6
  • 7
    • 0000666461 scopus 로고    scopus 로고
    • Data integration using similarity joins and a word-based information representation language
    • July
    • 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.
    • (2000) ACM Transactions on Information Systems , vol.18 , Issue.3 , pp. 288-321
    • Cohen, W.W.1
  • 8
    • 84880207811 scopus 로고    scopus 로고
    • Carnegie Mellon University, School of Computer Science, Machine Learning Department
    • William W Cohen. Graph Walks and Graphical Models. Carnegie Mellon University, School of Computer Science, Machine Learning Department, 2010.
    • (2010) Graph Walks and Graphical Models
    • Cohen, W.W.1
  • 9
    • 0035451897 scopus 로고    scopus 로고
    • Parameter estimation in stochastic logic programs
    • James Cussens. Parameter estimation in stochastic logic programs. Machine Learning, 44(3):245-271, 2001.
    • (2001) Machine Learning , vol.44 , Issue.3 , pp. 245-271
    • Cussens, J.1
  • 13
  • 14
    • 84873170216 scopus 로고    scopus 로고
    • Probabilistic databases with Markoviews
    • Abhay Jha and Dan Suciu. Probabilistic databases with markoviews. Proceedings of the VLDB Endowment, 5(11):1160-1171, 2012.
    • (2012) Proceedings of the VLDB Endowment , vol.5 , Issue.11 , pp. 1160-1171
    • Jha, A.1    Suciu, D.2
  • 15
    • 77955656002 scopus 로고    scopus 로고
    • Relational retrieval using a combination of path-constrained random walks
    • Ni Lao and William W. Cohen. Relational retrieval using a combination of path-constrained random walks. Machine Learning, 81(1):53-67, 2010.
    • (2010) Machine Learning , vol.81 , Issue.1 , pp. 53-67
    • Ni, L.1    Cohen, W.W.2
  • 16
    • 80053232762 scopus 로고    scopus 로고
    • Random walk inference and learning in a large scale knowledge base
    • ACL
    • 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.
    • (2011) EMNLP , pp. 529-539
    • Lao, N.1    Mitchell, T.M.2    Cohen, W.W.3
  • 18
    • 38049174896 scopus 로고    scopus 로고
    • Efficient weight learning for Markov logic networks
    • Springer
    • Daniel Lowd and Pedro Domingos. Efficient weight learning for markov logic networks. In Knowledge Discovery in Databases: PKDD 2007, pages 200-211. Springer, 2007.
    • (2007) Knowledge Discovery in Databases: PKDD 2007 , pp. 200-211
    • Lowd, D.1    Domingos, P.2
  • 19
    • 0034592784 scopus 로고    scopus 로고
    • Efficient clustering of high-dimensional data sets with application to reference matching
    • 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.
    • (2000) Knowledge Discovery and Data Mining , pp. 169-178
    • McCallum, A.1    Nigam, K.2    Ungar, L.H.3
  • 20
    • 83055176154 scopus 로고    scopus 로고
    • Tuffy: Scaling up statistical inference in Markov logic networks using an RDBMS
    • 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.
    • (2011) Proceedings of the VLDB Endowment , vol.4 , Issue.6 , pp. 373-384
    • Niu, F.1    Ré, C.2    Doan, A.H.3    Shavlik, J.4
  • 25
    • 32044466073 scopus 로고    scopus 로고
    • Markov logic networks
    • Matthew Richardson and Pedro Domingos. Markov logic networks. Mach. Learn., 62(1-2):107-136, 2006.
    • (2006) Mach. Learn. , vol.62 , Issue.1-2 , pp. 107-136
    • Richardson, M.1    Domingos, P.2
  • 27
    • 84878044770 scopus 로고    scopus 로고
    • Entity resolution with Markov logic
    • ICDM'06. Sixth International Conference on
    • Parag Singla and Pedro Domingos. Entity resolution with markov logic. In Data Mining, 2006. ICDM'06. Sixth International Conference on, 2006.
    • (2006) Data Mining, 2006
    • Singla, P.1    Domingos, P.2
  • 30
    • 34748827346 scopus 로고    scopus 로고
    • Fast random walk with restart and its applications
    • IEEE Computer Society
    • 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.
    • (2006) ICDM , pp. 613-622
    • Tong, H.1    Faloutsos, C.2    Pan, J.-Y.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.