| Alternate document: Details Learning Bayesian Network Structure from Massive Datasets: The "Sparse Candidate" Algorithm (99) Nir Friedman, Iftach Nachman, Dana |
Nir Friedman, Lise Getoor, Daphne Koller, Avi Pfeffer  Home/Search
Context Related
Links: ACM DBLP | stanford.edu/users/getoor/pap...lprm.ps stanford.edu/people/getoor/pa...lprm.ps stanford.edu/~getoor/papers/lprm.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: stanford.edu/users/getoo...papers (more) From: stanford.edu/~getoor/papers (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A large portion of real-world data is stored in commercial relational database systems. In contrast, most statistical learning methods work only with "flat" data representations. Thus, to apply these methods, we are forced to convert our data into a flat form, thereby losing much of the relational structure present in our database. This paper builds on the recent work on probabilistic relational models (PRMs), and describes how to learn them from databases. PRMs allow the properties of an... (Update)
Cited by: More
Active Learning with Multiple Views - Muslea (2002) (Correct)
Large Scale Use of Common Sense for Activity Recognition and.. - Pentney (2005) (Correct)
A Comparison of Statistical and Machine Learning.. - Goldenberg, Kubica, al. (2003) (Correct)
Active bibliography (related documents): More All
0.2: Learning in First-Order Probabilistic Representations - Matthew Richardson Ph (2003) (Correct)
0.1: Probabilistic Logic Learning - De Raedt, Kersting (2004) (Correct)
0.1: Building Large Knowledge Bases by Mass Collaboration - Matthew Richardson Mattr (2003) (Correct)
Similar documents based on text: More All
1.0: Learning Probabilistic Models of Relational Structure - Getoor, Friedman, Koller.. (2001) (Correct)
0.8: Learning Probabilistic Models of Link Structure - Getoor, Friedman, Koller, Taskar (2002) (Correct)
0.7: Learning Probabilistic Relational Models with Structural.. - Getoor, Koller, al. (2000) (Correct)
Related documents from co-citation: More All
26: A tutorial on learning with bayesian networks - Heckerman - 1995
25: Stochastic Logic Programs - Muggleton - 1996
24: Probabilistic frame-based systems - Koller, Pfeffer - 1998
BibTeX entry: (Update)
L. Getoor, N. Friedman, D. Koller, and A. Pfeffer. Learning probabilistic relational models. In IJCAI '99. 1999. http://citeseer.ist.psu.edu/friedman99learning.html More
@inproceedings{ friedman99learning,
author = "Nir Friedman and Lise Getoor and Daphne Koller and Avi Pfeffer",
title = "Learning Probabilistic Relational Models",
booktitle = "{IJCAI}",
pages = "1300-1309",
year = "1999",
url = "citeseer.ist.psu.edu/friedman99learning.html" }
Citations (may not include all citations):351 Learning Bayesian networks: The combination of knowledge and.. - Heckerman, Geiger et al. - 1995 DBLP
219 A tutorial on learning with Bayesian networks - Heckerman - 1998
212 Inductive Logic Programming: Techniques and Applications (context) - Lavrac, Dzeroski - 1994
181 Optimal Statistical Decisions (context) - DeGroot - 1970
149 Learning to extract symbolic knowledge from the world wide w.. - Craven, DiPasquo et al. - 1998 ACM DBLP
138 Probabilistic Horn abduction and Bayesian networks - Poole - 1993 ACM DBLP
46 Probabilistic frame-based systems - Koller, Pfeffer - 1998 ACM DBLP
39 Learning Bayesian networks is NP-complete - Chickering - 1996
35 From knowledge bases to decision models (context) - Wellman, Breese et al. - 1992
33 Learning belief networks in the presence of missing values a.. - Friedman - 1997 ACM DBLP
28 Answering queries from contextsensitive probabilistic knowle.. - Ngo, Haddawy - 1996
17 sparse candidate (context) - Friedman, Nachman et al. - 1999
12 Learning probabilities for noisy firstorder rules - Koller, Pfeffer - 1997
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://robotics.stanford.edu/users/getoor/papers.html): More
Scope and Abstraction: Two Criteria for Localized Planning - Lansky, Getoor (1995) (Correct)
Online Scheduling for Reprographic Machines - Fromherz, Getoor (Correct)
Efficient Learning using Constrained Sufficient Statistics - Friedman, Getoor (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC