Advanced search
Start date
Betweenand


Analysis of Graph Construction Methods in Supervised Data Classification

Full text
Author(s):
Carneiro, Murillo G. ; Zhao, Liang ; IEEE
Total Authors: 3
Document type: Journal article
Source: 2018 7TH BRAZILIAN CONFERENCE ON INTELLIGENT SYSTEMS (BRACIS); v. N/A, p. 6-pg., 2018-01-01.
Abstract

Graph-based methods have attracted a lot of attention in recent years, especially due to its inherent ability to capture properties of the networked data (e.g., structural and dynamical). Clustering, semi-supervised label propagation and, more recently, data classification are examples of tasks in which graph-based learning methods have obtained relevant results. In any of these tasks, the common approach is (i) to transform the feature vector data in a graph and then (ii) exploit some property uncovered by the network structure. However, most works have focused on the development of models to exploit the graph, while the graph construction step has been little explored. In this article, we conduct a preliminary study to evaluate supervised graph construction methods based on k-nearest neighbors (kNN) and epsilon-radius neighborhood (epsilon N) criteria by employing a recently proposed classification technique based on the importance concept of complex networks. Experiments were conducted on artificial and real-world data sets, including the problem of invariant pattern recognition in images. The results show that the graph construction methods under study are able to deal with different configuration of problems (e.g., domain, features, etc). They also suggest that the combination between selective kNN and epsilon N is more suitable in data sets with low level of mixture among the classes, while kNN seems slightly better in problems with higher noise levels. (AU)

FAPESP's process: 13/07375-0 - CeMEAI - Center for Mathematical Sciences Applied to Industry
Grantee:Francisco Louzada Neto
Support Opportunities: Research Grants - Research, Innovation and Dissemination Centers - RIDC
FAPESP's process: 15/50122-0 - Dynamic phenomena in complex networks: basics and applications
Grantee:Elbert Einstein Nehrer Macau
Support Opportunities: Research Projects - Thematic Grants
FAPESP's process: 12/07926-3 - Evolutionary Algorithms to Semantic Role Labeling
Grantee:Murillo Guimarães Carneiro
Support Opportunities: Scholarships in Brazil - Doctorate