Relational One-Class Classification: A Non-Parametric Approach

Abstract

One-class classification approaches have been proposed in the literature to learn classifiers from examples of only one class. But these approaches are not directly applicable to relational domains due to their reliance on a feature vector or a distance measure. We propose a non-parametric relational one-class classification approach based on first-order trees. We learn a tree-based distance measure that iteratively introduces new relational features to differentiate relational examples. We update the distance measure so as to maximize the one-class classification performance of our model. We also relate our model definition to existing work on probabilistic combination functions and density estimation. We experimentally show that our approach can discover relevant features and outperform three baseline approaches.

Cite

Text

Khot et al. "Relational One-Class Classification: A Non-Parametric Approach." AAAI Conference on Artificial Intelligence, 2014. doi:10.1609/AAAI.V28I1.9072

Markdown

[Khot et al. "Relational One-Class Classification: A Non-Parametric Approach." AAAI Conference on Artificial Intelligence, 2014.](https://mlanthology.org/aaai/2014/khot2014aaai-relational/) doi:10.1609/AAAI.V28I1.9072

BibTeX

@inproceedings{khot2014aaai-relational,
  title     = {{Relational One-Class Classification: A Non-Parametric Approach}},
  author    = {Khot, Tushar and Natarajan, Sriraam and Shavlik, Jude W.},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2014},
  pages     = {2453-2459},
  doi       = {10.1609/AAAI.V28I1.9072},
  url       = {https://mlanthology.org/aaai/2014/khot2014aaai-relational/}
}