Cited by 255Bayesian Modeling and Causal InferenceData Mining and Machine Learning ApplicationsData Mining Algorithms and Applications

A Simple Relational Classifier

Open access
Macskassy, Sofus A., Provost, Foster·2003

Abstract

Abstract. We analyze a Relational Neighbor (RN) classifier, a simple relational predictive model that predicts only based on class labels of related neighbors, using no learning and no inherent attributes. We show that it performs surprisingly well by comparing it to more complex models such as Probabilistic Relational Models and Relational Probability Trees on three data sets from published work. We argue that a simple model such as this should be used as a baseline to assess the performance of relational learners. 1

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.21236/ada452802

Cites

26 of 26 references verified0 citation errors · 0 not checkable

Statistics

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.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • wvRN is a weighted-vote Relational Neighbor relational classifier.

    “wvRN [24]: The weighted-vote Relational Neighbor is a relational classifier.”

    From DeepWalk: online learning of social representations (2014) · cites this paper as [24]

  • wvRN estimates Pr(y_i|N_i) with the appropriately normalized weighted mean of its neighbors.

    “Given the neighborhood N i of vertex v i , wvRN estimates Pr( y i |N i ) with the (appropriately normalized) weighted mean of its neighbors”

    From DeepWalk: online learning of social representations (2014) · cites this paper as [24]

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 5

  1. Morgan Kaufmann, 1996.
  2. Morgan Kaufmann.
  3. T. Mitchell. Machine Learning. McGraw Hill, 1997.
  4. F. J. Provost, C. Perlich, and S. A. Macskassy. Relational Learning Problems and Simple Models. In Proceedings of the Relational Learning Workshop at IJCAI-2003, 2003.
  5. Morgan Kaufmann, San Mateo, CA, 1993.

Cited by

Sorted by citations

Authors
Macskassy, S. A., & Provost, F.
Affiliations
New York University (US)
Published
2003-01-01
OpenAlex
W1497163089
Cited by
255
References
26
Citations by year
2026: 1 · 2025: 2 · 2023: 8 · 2022: 5 · 2021: 7 · 2020: 4 · 2019: 18 · 2018: 10 · 2017: 18 · 2016: 20 · 2015: 12 · 2014: 25 · 2013: 13 · 2012: 15
Type
report
Language
en
Open access
Locations
  • Faculty Digital Archive (New York University Florence) (submittedVersion)
  • Defense Technical Information Center (DTIC) (submittedVersion)
Funders
  • Defense Advanced Research Projects Agency
  • U.S. Air Force
  • Advanced Research Projects Agency
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Bayesian Modeling and Causal Inference
  • Physical Sciences › Computer Science › Information Systems › Data Mining and Machine Learning Applications
  • Physical Sciences › Computer Science › Information Systems › Data Mining Algorithms and Applications
Keywords
relational learning, probabilistic relational models, baseline model, model performance comparison

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