2010 · 103 citations · 21 references
ComputingComputer ScienceFeature EngineeringInformation RetrievalMachine LearningClassificationDimensionality ReductionMeta-learningRepresentation LearningSupport Vector MachinesBenchmark DatasetsCategory LabelsComplexityLearning To RankLogistic RegressionModel ComplexityModel Complexity ControlMultilabel Classification
Effective learning in multi-label classification (MLC) requires an appropriate level of abstraction for representing the relationship between each instance and multiple categories. Current MLC methods have been focused on learning-to-map from instances to ranked lists of categories in a relatively high-dimensional space. The fine-grained features in such a space may not be sufficiently expressive for characterizing discriminative patterns, and worse, make the model complexity unnecessarily high. This paper proposes an alternative approach by transforming conventional representations of instances and categories into a relatively small set of link-based meta-level features, and leveraging successful learning-to-rank retrieval algorithms (e.g., SVM-MAP) over this reduced feature space. Controlled experiments on multiple benchmark datasets show strong empirical evidence for the strength of the proposed approach, as it significantly outperformed several state-of-the-art methods, including Rank-SVM, ML-kNN and IBLR-ML (Instance-based Logistic Regression for Multi-label Classification) in most cases.
21
Mark Hall, Eibe Frank, Geoffrey Holmes et al. · ACM SIGKDD Explorations Newsletter · 2009 · 17.8K citations
Statistical Comparisons of Classifiers over Multiple Data Sets
Janez Demšar · 2006 · 11.2K citations
A Comparative Study on Feature Selection in Text Categorization
Yiming Yang, Jan Pedersen · 1997 · 4.8K citations
Making Large-Scale SVM Learning Practical
Thorsten Joachims · Technical reports · 2006 · 4.3K citations · Full text
ML-KNN: A lazy learning approach to multi-label learning
Min-Ling Zhang, Zhi‐Hua Zhou · Pattern Recognition · 2007 · 3.5K citations