Multi-label Lazy Associative Classification

  • Authors:
  • Adriano Veloso;Wagner Meira, Jr.;Marcos Gonçalves;Mohammed Zaki

  • Affiliations:
  • Computer Science Department, Universidade Federal de Minas Gerais, Brazil;Computer Science Department, Universidade Federal de Minas Gerais, Brazil;Computer Science Department, Universidade Federal de Minas Gerais, Brazil;Computer Science Department, Rensselaer Polytechnic Institute, USA

  • Venue:
  • PKDD 2007 Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Most current work on classification has been focused on learning from a set of instances that are associated with a single label (i.e., single-label classification). However, many applications, such as gene functional prediction and text categorization, may allow the instances to be associated with multiple labels simultaneously. Multi-label classification is a generalization of single-label classification, and its generality makes it much more difficult to solve.Despite its importance, research on multi-label classification is still lacking. Common approaches simply learn independent binary classifiers for each label, and do not exploit dependencies among labels. Also, several small disjuncts may appear due to the possibly large number of label combinations, and neglecting these small disjuncts may degrade classification accuracy. In this paper we propose a multi-label lazy associative classifier, which progressively exploits dependencies among labels. Further, since in our lazy strategy the classification model is induced on an instance-based fashion, the proposed approach can provide a better coverage of small disjuncts. Gains of up to 24% are observed when the proposed approach is compared against the state-of-the-art multi-label classifiers.