Complex objects ranking: a relational data mining approach

  • Authors:
  • Michelangelo Ceci;Annalisa Appice;Corrado Loglisci;Donato Malerba

  • Affiliations:
  • Universita' degli Studi di Bari, Bari, Italy;Universita' degli Studi di Bari, Bari, Italy;Universita' degli Studi di Bari, Bari, Italy;Universita' degli Studi di Bari, Bari, Italy

  • Venue:
  • Proceedings of the 2010 ACM Symposium on Applied Computing
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

A key task in data mining and information retrieval is learning preference relations. Most of methods reported in the literature learn preference relations between objects which are represented by attribute-value pairs or feature vectors (propositional representation). The growing interest in data mining techniques which are able to directly deal with more sophisticated representations of complex objects, motivates the investigation of relational learning methods for learning preference relations. In this paper, we present a probabilistic relational data mining method which permits to model preference relations between complex objects. Preference relations are then used to rank objects. Experiments on two ranking problems for scientific literature mining prove the effectiveness of the proposed method.