Iterative Classification in Relational Data

Jennifer Neville, David Jensen

2000 · 309 citations · 8 references

Concepts

TL;DR

Relational data enable improved classification accuracy by allowing inference about one object to inform inference about related objects. The study proposes an iterative classification procedure that exploits relational dependencies. The method iteratively applies simple Bayesian classifiers, updating object attributes with high‑confidence inferences and feeding them back to refine subsequent predictions, and is evaluated on a binary classification task. Experiments show that iterative classification markedly improves accuracy over a single‑pass approach.

Abstract

Relational data offer a unique opportunity for improving the c lassification accuracy o f statistical m odels. If two objects are related, inferring something about one object can aid inferences about the other. We present an iterative classification p rocedure that exploits this characteristic of relational data. This approach uses simple Bayesian classifiers in an iterative fashion, dynamically upd ating the attributes of some objects as inferences are made about related ob jects. Inferences made with h igh confidence in initial iterations are fed back into the data and are used to inform subsequent i nferences about related ob jects. We evaluate the performance of this approach on a binary classification task. Experiments indicate that it erative classification significantly increases accuracy when compared to a single-pass approach.

References

8