Advanced search
Start date
Betweenand


Automatically Design Distance Functions for Graph-based Semi-Supervised Learning

Full text
Author(s):
Miquilini, Patricia ; Rossi, Rafael G. ; Quiles, Marcos G. ; de Melo, Vinicius V. ; Basgalupp, Marcio P. ; IEEE
Total Authors: 6
Document type: Journal article
Source: 2017 16TH IEEE INTERNATIONAL CONFERENCE ON TRUST, SECURITY AND PRIVACY IN COMPUTING AND COMMUNICATIONS / 11TH IEEE INTERNATIONAL CONFERENCE ON BIG DATA SCIENCE AND ENGINEERING / 14TH IEEE INTERNATIONAL CONFERENCE ON EMBEDDED SOFTWARE AND SYSTEMS; v. N/A, p. 8-pg., 2017-01-01.
Abstract

Automatic data classification is often performed by supervised learning algorithms, producing a model to classify new instances. Reflecting that labeled instances are expensive, semi supervised learning (SSL) methods prove to be an alternative to performing data classification, once the learning demands only a few labeled instances. There are many SSL algorithms, and graph-based ones have significant features. In particular, graph-based models grant to identify classes of different distributions without prior knowledge of statistical model parameters. However, a drawback that might influence their classification performance relays on the construction of the graph, which requires the measurement of distances (or similarities) between instances. Since a particular distance function can enhance the performance for some data sets and decrease to others, here, we introduce a novel approach, called GEAD, a Grammatical Evolution for Automatically designing Distance functions for Graph-based semi-supervised learning. We perform extensive experiments with 100 public data sets to assess the performance of our approach, and we compare it with traditional distance functions in the literature. Results show that GEAD is capable of designing distance functions that significantly outperform the baseline manually-designed ones regarding different predictive measures, such as Micro-F-1, and Macro-F-1. (AU)

FAPESP's process: 16/00868-9 - Grammatical Evolution for automatic construction of similarity functions in the context of semi-supervisioned learning
Grantee:Patrícia Miquilini
Support Opportunities: Scholarships in Brazil - Master
FAPESP's process: 16/02870-0 - Multi-objective hyper-heuristics for automatic design of multi-test decision tree induction algorithms
Grantee:Márcio Porto Basgalupp
Support Opportunities: Regular Research Grants