k-RNN: k-Relational Neareast Neighbour Algorithm

Nuno A. Fonseca, Vítor Santos Costa, Ricardo Rocha and Rui Camacho

March 2008

---

Abstract

The amount of data collected and stored in databases is growing considerably in almost all areas of human activity. In complex applications the data involves several relations and proposionalization is not a suitable approach. Multi-Relational Data Mining algorithms can analyze data from multiple relations, with no need to transform the data into a single table, but are computationally more expensive. In this paper a novel relational classification algorithm based on the k-nearest neighbour algorithm is presented and evaluated.

Bibtex

@InProceedings{fonseca-sac08,
  author =    {N. A. Fonseca and V. Santos Costa and R. Rocha and R. Camacho},
  title =     {{k-RNN: k-Relational Neareast Neighbour Algorithm}},
  booktitle = {Proceedings of the 23rd Annual ACM Symposium on Applied Computing (SAC 2008)},
  pages =     {944--948},
  publisher = {ACM},
  editor =    {L. Liebrock},
  month =     {March},
  year =      {2008},
  address =   {Fortaleza, Ceará, Brazil},
}

Download Paper

PDF file
ACM Digital Library