The DOI matches its Crossref record; 40 of the 40 references it cites were found in a registry or an index.
Relational Dependency Networks
Open accessAbstract
Recent work on graphical models for relational data has demonstrated significant improvements in classification and inference when models represent the dependencies among instances. Despite its use in conventional statistical models, the assumption of instance independence is contradicted by most relational datasets. For example, in citation data there are dependencies among the topics of a paper’s references, and in genomic data there are dependencies among the functions of interacting proteins. In this paper, we present relational dependency networks (RDNs), graphical models that are capable of expressing and reasoning with such dependencies in a relational setting. We discuss RDNs in the context of relational Bayes networks and relational Markov networks and outline the relative strengths of RDNs—namely, the ability to represent cyclic dependencies, simple methods for parameter estimation, and efficient structure learning techniques. The strengths of RDNs are due to the use of pseudolikelihood learning techniques, which estimate an efficient approximation of the full joint distribution. We present learned RDNs for a number of real-world datasets and evaluate the models in a prediction context, showing that RDNs identify and exploit cyclic relational dependencies to achieve significant performance gains over conventional conditional models. In addition, we use synthetic data to explore model performance under various relational data characteristics, showing that RDN learning and inference techniques are accurate over a wide range of conditions.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data
Lafferty, J., McCallum, A., & Pereira, F. C. N. (2001) · ScholarlyCommons (University of Pennsylvania) · Cited by 12,935
Spatial Interaction and the Statistical Analysis of Lattice Systems
Besag, J. (1974) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1974.tb00999.x · Cited by 6,067
Casella, G., & Berger, R. (2024) · Chapman & Hall/CRC eBooks · doi:10.1201/9781003456285 · Cited by 5,711
Ziegel, E. R., Lehmann, E. L., & Casella, G. (1999) · Technometrics · doi:10.2307/1270597 · Cited by 4,203
Mining the network value of customers
Domingos, P., & Richardson, M. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502525 · Cited by 2,830
Richardson, M., & Domingos, P. (2006) · Machine Learning · doi:10.1007/s10994-006-5833-1 · Cited by 2,676
Statistical Analysis of Non-Lattice Data
Besag, J. (1975) · The Statistician · doi:10.2307/2987782 · Cited by 1,559
Loopy Belief Propagation for Approximate Inference: An Empirical Study
Murphy, K. P., Weiss, Y., & Jordan, M. I. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.6725 · Cited by 1,397
Learning Probabilistic Relational Models
Getoor, L., Friedman, N., Koller, D., & Pfeffer, A. (2001) · Relational Data Mining · doi:10.1007/978-3-662-04599-2_13 · Cited by 933
Fawcett, T., & Provost, F. (1997) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009700419189 · Cited by 881
Enhanced hypertext categorization using hyperlinks
Chakrabarti, S., Dom, B., & Indyk, P. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276332 · Cited by 769
(2001) · Cited by 683
Learning to extract symbolic knowledge from the World Wide Web
Craven, M. W., DiPasquo, D., Freitag, D., McCallum, A., Mitchell, T. M., Nigam, K., & Slattery, S. (1998) · National Conference on Artificial Intelligence · Cited by 662
Discriminative probabilistic models for relational data
Taskar, B., Abbeel, P., & Koller, D. (2002) · Cited by 625
Getoor, L. (2006) · Advanced Information and Knowledge Processing · doi:10.1007/1-84628-284-5_7 · Cited by 612
Estimation, Inference and Specification Analysis.
Smith, R. J., & White, H. (1996) · Economica · doi:10.2307/2555022 · Cited by 512
Network-Based Marketing: Identifying Likely Adopters Via Consumer Networks
Hill, S., Provost, F. J., & Volinsky, C. (2006) · Faculty Digital Archive (New York University Florence) · Cited by 454
Classification in Networked Data: A Toolkit and a Univariate Case Study
(2007) · Journal of Machine Learning Research · doi:10.5555/1248659.1248693 · Cited by 452
Efficiently Inducing Features of Conditional Random Fields
McCallum, A. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1212.2504 · Cited by 363
Iterative Classification in Relational Data
Neville, J., & Jensen, D. D. (2000) · Cited by 318
Self-citationLearning the structure of Markov logic networks
Kok, S., & Domingos, P. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102407 · Cited by 298
Why collective inference improves relational classification
Jensen, D., Neville, J., & Gallagher, B. (2004) · Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1014052.1014125 · Cited by 256
Self-citationA Simple Relational Classifier
Macskassy, S. A., & Provost, F. (2003) · doi:10.21236/ada452802 · Cited by 255
Probabilistic classification and clustering in relational data
Taskar, B., Segal, E., & Koller, D. (2001) · Cited by 225
Learning relational probability trees
Neville, J., Jensen, D., Friedland, L., & Hay, M. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956830 · Cited by 215
Self-citationCortes, C., Pregibon, D., & Volinsky, C. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44816-0_11 · Cited by 192
A machine learning approach to building domain-specific search engines
McCallum, A., Nigam, K., Rennie, J. D. M., & Seymore, K. (1999) · Cited by 183
Linkage and Autocorrelation Cause Feature Selection Bias in Relational Learning
Jensen, D. D., & Neville, J. (2002) · Cited by 167
Self-citationGraphical Models for Genetic Analyses
Lauritzen, S. L., & Sheehan, N. A. (2003) · Statistical Science · doi:10.1214/ss/1081443232 · Cited by 144
Using relational knowledge discovery to prevent securities fraud
Neville, J., Şimşek, Ö., Jensen, D. D., Komoroske, J., Palmer, K. N. B., & Goldberg, H. G. (2005) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1081870.1081922 · Cited by 111
Self-citationCollective classification with relational dependency networks
Neville, J., & Jensen, D. D. (2003) · Cited by 105
Self-citationAggregation-based feature invention and relational concept classes
Perlich, C., & Provost, F. J. (2003) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/956750.956772 · Cited by 97
Dependency Networks for Relational Data
Neville, J., & Jensen, D. D. (2005) · Proceedings · doi:10.1109/icdm.2004.10101 · Cited by 94
Self-citationProbabilistic Models for Relational Data
Heckerman, D. E., Meek, C., & Koller, D. (2004) · Cited by 88
Simple estimators for relational Bayesian classifiers
Neville, J., Jensen, D. D., & Gallagher, B. J. (2004) · Proceedings · doi:10.1109/icdm.2003.1250989 · Cited by 87
Self-citation1BC: A First-Order Bayesian Classifier
Flach, P. A., & Lachiche, N. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48751-4_10 · Cited by 85
Basic Principles of Learning Bayesian Logic Programs
Kersting, K., & Raedt, L. D. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-78652-8_7 · Cited by 77
Dynamic probabilistic relational models
Sanghai, S. K., Domingos, P., & Weld, D. S. (2003) · Cited by 61
Statistical relational learning for document mining
Popescul, A., Ungar, L., Lawrence, S., & Pennock, D. M. (2004) · Proceedings · doi:10.1109/icdm.2003.1250930 · Cited by 57
Avoiding bias when aggregating relational data with degree disparity
Jensen, D. D., Neville, J., & Hay, M. (2003) · Cited by 31
Self-citation
Cited by
Collective Classification in Network Data
Sen, P., Namata, G., Bilgic, M., Getoor, L., Gallagher, B., & Eliassi‐Rad, T. (2008) · AI Magazine · doi:10.1609/aimag.v29i3.2157 · Cited by 3,293
Link prediction in complex networks: A survey
Lü, L., & Zhou, T. (2011) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2010.11.027 · Cited by 2,819
A Review of Relational Machine Learning for Knowledge Graphs
Nickel, M., Murphy, K., Tresp, V., & Gabrilovich, E. (2016) · Proceedings of the IEEE · doi:10.1109/jproc.2015.2483592 · Cited by 1,638
Mining Heterogeneous Information Networks: Principles and Methodologies
Sun, Y., & Han, J. (2012) · Synthesis lectures on data mining and knowledge discovery · doi:10.2200/s00433ed1v01y201207dmk005 · Cited by 471
Classification in Networked Data: A Toolkit and a Univariate Case Study
(2007) · Journal of Machine Learning Research · doi:10.5555/1248659.1248693 · Cited by 452
Metadata
- Authors
- Neville, J., & Jensen, D.
- Venue
- Introduction to Statistical Relational Learning
- Publisher
- The MIT Press
- Published
- 2007-08-31
- Pages
- 239-268
- OpenAlex
- W2101705355
- Cited by
- 279
- References
- 40
- FWCI
- 22.40
- Type
- book chapter
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.