Enhancing Brain Storm Optimization Through Optimum-Path Forest

被引:0
|
作者
Sugi Afonso, Luis Claudio [1 ]
Passos, Leandro, Jr. [1 ]
Papa, Joao Paulo [2 ]
机构
[1] UFSCar Fed Univ Sao Carlos, Dept Comp, Sao Carlos, SP, Brazil
[2] UNESP Sao Paulo State Univ, Sch Sci, Bauru, SP, Brazil
基金
巴西圣保罗研究基金会;
关键词
Optimum-Path Forest; Brain Storm Optimization; Clustering; Meta-heuristics; EFFICIENT ALGORITHM;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Among the many interesting meta-heuristic optimization algorithms, one can find those inspired by both the swarm and social behavior of human beings. The Brain Storm Optimization (BSO) is motivated by the brainstorming process performed by human beings to find solutions and solve problems. Such process involves clustering the possible solutions, which can be sensitive to the number of groupings and the clustering technique itself. This work proposes a modification in the BSO working mechanism using the Optimum-Path Forest (OPF) algorithm, which does not require the knowledge about the number of clusters beforehand. Such skill is pretty much relevant when this information is unknown and must be set. The proposed approach is evaluated in a set of six benchmarking functions and showed promising results, outperforming the traditional BSO and a second variant makes use of the well-known Self-Organizing Maps clustering technique.
引用
收藏
页码:183 / 188
页数:6
相关论文
共 50 条
  • [41] Pruning optimum-path forest ensembles using metaheuristic optimization for land-cover classification
    Nachif Fernandes, Silas Evandro
    de Souza, Andre Nunes
    Gastaldello, Danilo Sinkiti
    Pereira, Danillo Roberto
    Papa, Joao Paulo
    INTERNATIONAL JOURNAL OF REMOTE SENSING, 2017, 38 (20) : 5736 - 5762
  • [42] An Optimum-Path Forest framework for intrusion detection in computer networks
    Pereira, Clayton R.
    Nakamura, Rodrigo Y. M.
    Costa, Kelton A. P.
    Papa, Joao P.
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2012, 25 (06) : 1226 - 1234
  • [43] Efficient supervised optimum-path forest classification for large datasets
    Papa, Joao P.
    Falcao, Alexandre X.
    de Albuquerque, Victor Hugo C.
    Tavares, Joao Manuel R. S.
    PATTERN RECOGNITION, 2012, 45 (01) : 512 - 520
  • [44] Barrett's Esophagus Identification Using Optimum-Path Forest
    Souza, Luis A., Jr.
    Afonso, Luis C. S.
    Palm, Christoph
    Papa, Joao P.
    2017 30TH SIBGRAPI CONFERENCE ON GRAPHICS, PATTERNS AND IMAGES (SIBGRAPI), 2017, : 308 - 314
  • [45] Optimum-Path Forest Classifier for Large Scale Biometric Applications
    Afonso, L. C. S.
    Papa, J. P.
    Marana, A. N.
    Poursaberi, A.
    Yanushkevich, S.
    Gavrilova, M.
    2012 THIRD INTERNATIONAL CONFERENCE ON EMERGING SECURITY TECHNOLOGIES (EST), 2012, : 58 - 61
  • [46] Learning to Classify Seismic Images with Deep Optimum-Path Forest
    Afonso, Luis
    Vidal, Alexandre
    Kuroda, Michelle
    Falcao, Alexandre
    Papa, Joao
    2016 29TH SIBGRAPI CONFERENCE ON GRAPHICS, PATTERNS AND IMAGES (SIBGRAPI), 2016, : 401 - 407
  • [47] Face Recognition using Optimum-path Forest Local Analysis
    Amorim, Willian Paraguassu
    de Cavalho, Marcelo Henriques
    Odakura, Valguima V. V. A.
    2013 BRAZILIAN CONFERENCE ON INTELLIGENT SYSTEMS (BRACIS), 2013, : 242 - 248
  • [48] A Fixed-Size Pruning Approach for Optimum-Path Forest
    Costa, Leonardo da Silva
    Barbosa, Gabriel Santos
    da Rocha Neto, Ajalmar Rego
    ADVANCES IN COMPUTATIONAL INTELLIGENCE, IWANN 2019, PT II, 2019, 11507 : 723 - 734
  • [49] Supervised Video Genre Classification Using Optimum-Path Forest
    Martins, Guilherme B.
    Almeida, Jurandy
    Papa, Joao Paulo
    PROGRESS IN PATTERN RECOGNITION, IMAGE ANALYSIS, COMPUTER VISION, AND APPLICATIONS, CIARP 2015, 2015, 9423 : 735 - 742
  • [50] ROBUST AND FAST VOWEL RECOGNITION USING OPTIMUM-PATH FOREST
    Papa, Joao P.
    Marana, Aparecido N.
    Spadotto, Andre A.
    Guido, Rodrigo C.
    Falcao, Alexandre X.
    2010 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, 2010, : 2190 - 2193