arrow
返回

Efficient supervised optimum-path forest classification for large datasets

delete2012-01-01
delete198
PRE
AI
J
João Paulo Papa
A
Alexandre X. Falcão
V
Victor Hugo C. de Albuquerque
J
João Manuel R. S. Tavares *
DOI:10.1016/j.patcog.2011.07.013delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Today data acquisition technologies come up with large datasets with millions of samples for statistical analysis. This creates a tremendous challenge for pattern recognition techniques, which need to be more efficient without losing their effectiveness. We have tried to circumvent the problem by reducing it into the fast computation of an optimum-path forest (OPF) in a graph derived from the training samples. In this forest, each class may be represented by multiple trees rooted at some representative samples. The forest is a classifier that assigns to a new sample the label of its most strongly connected root. The methodology has been successfully used with different graph topologies and learning techniques. In this work, we have focused on one of the supervised approaches, which has offered considerable advantages over Support Vector Machines and Artificial Neural Networks to handle large datasets. We propose (i) a new algorithm that speeds up classification and (ii) a solution to reduce the training set size with negligible effects on the accuracy of classification, therefore further increasing its efficiency. Experimental results show the improvements with respect to our previous approach and advantages over other existing methods, which make the new method a valuable contribution for large dataset analysis. (C) 2011 Elsevier Ltd. All rights reserved.
Keyword:
Optimum-path forest classifiers
Support vector machines
Artificial neural networks
Pattern recognition
Machine learning
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Pattern Recognition 封面图
Pattern Recognition
IF:
7.6
论文数:
1.3W
被引数:
4.5W

机构

U
Universidade Estadual Paulista
学者数:
3.2W
论文数: 2.1W
被引数: 24
U
universidade fortaleza
学者数:
1.1K
论文数: 726
被引数: 3
U
universidade estadual de campinas
学者数:
3.3W
论文数: 2.3W
被引数: 19
U
Universidade do Porto
学者数:
3.0W
论文数: 2.9W
被引数: 34
学者 查看更多机构
引用论文

引用论文

Spoken emotion recognition through optimum-path forest classification using glottal features
err2010-07-01
err69
PREAI
errIliev, Alexander I.; Scordilis, Michael S.; Papa, Joao P.; Falcao, Alexandre X.
err分享
err收藏
Differential Requirement for the Stress-Activated Protein Kinase/c-Jun NH2-Terminal Kinase in RNA Damage-Induced Apoptosis in Primary and in Immortalized Fibroblasts
err2000-08-01
err0
PREAI
errMihail S Iordanov; John Wong; Dianne L Newton; Susanna M Rybak; Robert K Bright; Richard A Flavell; Roger J Davis; Bruce E Magun
err分享
err收藏
How the amount of greenery in city parks impacts visitor preferences in the context of naturalness, legibility and perceived danger
err2022-12-01
err0
PREAI
errAleksandra Lis; Karolina Zalewska; Łukasz Pardela; Ewa Adamczak; Alicja Cenarska; Klaudia Bławicka; Barbara Brzegowa; Anastasiia Matiiuk
err分享
err收藏
Evaluation of multilayer perceptron and self-organizing map neural network topologies applied on microstructure segmentation from metallographic images
err2009-10-01
err85
PREAI
errde Albuquerque, Victor Hugo C.; de Alexandria, Auzuir Ripardo; Cortez, Paulo Cesar; Tavares, Joao Manuel R. S.
err分享
err收藏
Data Clustering as an Optimum-Path Forest Problem with Applications in Image Analysis
err2009-05-13
err94
errOAAI
errRocha, Leonardo Marques; Cappabianco, Fabio A. M.; Falcao, Alexandre Xavier
err分享
err收藏
Structure-based validation can drastically under-estimate error rate in proteome-wide cross-linking mass spectrometry studies
err
IF0
err2019-04-24
err0
errOAAI
errKumar Yugandhar; Ting-Yi Wang; Shayne D. Wierbowski; Elnur Elyar Shayhidin; Haiyuan Yu
err分享
err收藏
Support-vector networks支持向量网络
err1995-09-01
err0
errOAAI
errCorinna Cortes; Vladimir Vapnik
err分享
err收藏
学者 查看更多内容