IEEE Transactions on Multimedia · 2020 · 138 citations · 52 references
ComputingComputer ScienceComputer VisionFeature EngineeringMachine LearningDimension ReductionDimensionality ReductionFeature SelectionImage AnnotationMulti-view GeometryRepresentation LearningMulti-label Feature SelectionMulti-view Representation LearningMultiple View GeometryRedundant FeaturesSparse CodingSparse Feature RepresentationSparse Feature SelectionViews
In image analysis, image samples are always represented by multiple view features and associated with multiple class labels for better interpretation. However, multiple view data may include noisy, irrelevant and redundant features, while multiple class labels can be noisy and incomplete. Due to the special data characteristic, it is hard to perform feature selection on multi-view multi-label data. To address these challenges, in this paper, we propose a novel multi-view multi-label sparse feature selection (MSFS) method, which exploits both view relations and label correlations to select discriminative features for further learning. Specifically, the multi-labeled information is decomposed into a reduced latent label representation to capture higher level concepts and correlations among multiple labels. Multiple local geometric structures are constructed to exploit visual similarities and relations for different views. By taking full advantage of the latent label representation and multiple local geometric structures, the sparse regression model with an l <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2,1</sub> -norm and an Frobenius norm (F-norm) penalty terms is utilized to perform hierarchical feature selection, where the F-norm penalty performs high-level (i.e., view-wise) feature selection to preserve the informative views and the l <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2,1</sub> -norm penalty conducts low-level (i.e., row-wise) feature selection to remove noisy features. To solve the proposed formulation, we also devise a simple yet efficient iterative algorithm. Experiments and comparisons on real-world image datasets demonstrate the effectiveness and potential of MSFS.
52
Combining labeled and unlabeled data with co-training
Avrim Blum, Tom M. Mitchell · 1998 · 5.6K 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
Classifier chains for multi-label classification
Jesse Read, Bernhard Pfahringer, Geoffrey Holmes et al. · Machine Learning · 2011 · 2.3K citations · Full text
Laplacian Score for Feature Selection
Xiaofei He, Deng Cai, Partha Niyogi · 2005 · 1.8K citations