IMPROVING MULTILABEL CLASSIFICATION BY AVOIDING IMPLICIT NEGATIVITY WITH INCOMPLETE DATA. (18th March 2013)

• Record Type: Journal Article
• Authors: Heath, Derrall; Ventura, Dan
• Is Part Of: Computational intelligence. Volume 30:Number 3(2014:Aug.)
• Page Start: 535
• Page End: 561
• Publication Date: 2013-03-18
• Subjects: Artificial intelligence -- Periodicals; Computational linguistics -- Periodicals; 006.3
• DOI: 10.1111/coin.12006
• Languages: English
• ISSNs: 0824-7935

Abstract

<abstract abstract-type="main" id="coin12006-abs-0001"> <title> <x xml:space="preserve">Abstract</x> </title> <p id="coin12006-para-0001">Many real‐world problems require multilabel classification, in which each training instance is associated with a set of labels. There are many existing learning algorithms for multilabel classification; however, these algorithms assume implicit negativity, where missing labels in the training data are automatically assumed to be negative. Additionally, many of the existing algorithms do not handle incremental learning in which new labels could be encountered later in the learning process. A novel multilabel adaptation of the backpropagation algorithm is proposed that does not assume implicit negativity. In addition, this algorithm can, using a naïve Bayesian approach, infer missing labels in the training data. This algorithm can also be trained incrementally as it dynamically considers new labels. This solution is compared with existing multilabel algorithms using data sets from multiple domains, and the performance is measured with standard multilabel evaluation metrics. It is shown that our algorithm improves classification performance for all metrics by an overall average of 7.4% when at least 40% of the labels are missing from the training data and improves by 18.4% when at least 90% of the labels are missing.</p> </abstract>