2013 | OriginalPaper | Buchkapitel
A Purity Measure Based Transductive Learning Algorithm
verfasst von : João Roberto Bertini Junior, Liang Zhao
Erschienen in: Advances in Neural Networks – ISNN 2013
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
The increasing on the human ability to gather data has led to an increasing effort on labeling them to be used in specific applications such as classification and regression. Therefore, automatic labeling methods such as semi-supervised transdutive learning algorithms are of a major concern on the machine learning and data mining community nowadays. This paper proposes a graph-based algorithm which uses the purity measure to help spreading the labels throughout the graph. The purity measure determines how intertwined are different subspaces of data regarding its classes. As high values of purity indicate low mixture among patterns of different classes, its maximization helps finding well-separated connected subgraphs; which facilitates the label spreading process. Results on benchmark data sets comparing to state-of-the-art methods show the potential of the proposed algorithm.