Constraint scores for semi-supervised ...
Document type :
Article dans une revue scientifique
Title :
Constraint scores for semi-supervised feature selection: A comparative study
Author(s) :
Kallakech, Mariam [Auteur correspondant]
LAGIS-SI
Biela, Philippe [Auteur]
LAGIS-SI
Macaire, Ludovic [Auteur]
LAGIS-SI
Hamad, Denis [Auteur]
Laboratoire d'Informatique Signal et Image de la Côte d'Opale [LISIC]
LAGIS-SI
Biela, Philippe [Auteur]
LAGIS-SI
Macaire, Ludovic [Auteur]

LAGIS-SI
Hamad, Denis [Auteur]
Laboratoire d'Informatique Signal et Image de la Côte d'Opale [LISIC]
Journal title :
Pattern Recognition Letters
Pages :
656-665
Publisher :
Elsevier
Publication date :
2011-04-01
ISSN :
0167-8655
HAL domain(s) :
Informatique [cs]/Apprentissage [cs.LG]
English abstract : [en]
Recent feature selection scores using pairwise constraints (must-link and cannot-link) have shown better performances than the unsupervised methods and comparable to the supervised ones. However, these scores use only the ...
Show more >Recent feature selection scores using pairwise constraints (must-link and cannot-link) have shown better performances than the unsupervised methods and comparable to the supervised ones. However, these scores use only the pairwise constraints and ignore the available information brought by the unlabeled data. Moreover, these constraint scores strongly depend on the given must-link and cannot-link subsets built by the user. In this paper, we address these problems and propose a new semi-supervised constraint score that uses both pairwise constraints and local properties of the unlabeled data. Experiments using Kendall's coefficient and accuracy rates, show that this new score is less sensitive to the given constraints than the previous scores while providing similar performances.Show less >
Show more >Recent feature selection scores using pairwise constraints (must-link and cannot-link) have shown better performances than the unsupervised methods and comparable to the supervised ones. However, these scores use only the pairwise constraints and ignore the available information brought by the unlabeled data. Moreover, these constraint scores strongly depend on the given must-link and cannot-link subsets built by the user. In this paper, we address these problems and propose a new semi-supervised constraint score that uses both pairwise constraints and local properties of the unlabeled data. Experiments using Kendall's coefficient and accuracy rates, show that this new score is less sensitive to the given constraints than the previous scores while providing similar performances.Show less >
Language :
Anglais
Peer reviewed article :
Oui
Audience :
Internationale
Popular science :
Non
Collections :
Source :
Files
- https://hal.archives-ouvertes.fr/hal-00732484/document
- Open access
- Access the document
- https://hal.archives-ouvertes.fr/hal-00732484/document
- Open access
- Access the document