Combining heterogeneous classifiers for relational databases

  • Authors:
  • Geetha Manjunath;M. Narasimha Murty;Dinkar Sitaram

  • Affiliations:
  • Department of CSA, Indian Institute of Science, Bangalore 560012, India;Department of CSA, Indian Institute of Science, Bangalore 560012, India;STSD, Hewlett Packard Company, Bangalore, India

  • Venue:
  • Pattern Recognition
  • Year:
  • 2013

Quantified Score

Hi-index 0.01

Visualization

Abstract

Practical usage of machine learning is gaining strategic importance in enterprises looking for business intelligence. However, most enterprise data is distributed in multiple relational databases with expert-designed schema. Using traditional single-table machine learning techniques over such data not only incur a computational penalty for converting to a flat form (mega-join), even the human-specified semantic information present in the relations is lost. In this paper, we present a practical, two-phase hierarchical meta-classification algorithm for relational databases with a semantic divide and conquer approach. We propose a recursive, prediction aggregation technique over heterogeneous classifiers applied on individual database tables. The proposed algorithm was evaluated on three diverse datasets, namely TPCH, PKDD and UCI benchmarks and showed considerable reduction in classification time without any loss of prediction accuracy.