Instance selection by genetic-based biological algorithm
Gespeichert in:
Verfasser / Beitragende:
[Zong-Yao Chen, Chih-Fong Tsai, William Eberle, Wei-Chao Lin, Shih-Wen Ke]
Ort, Verlag, Jahr:
2015
Enthalten in:
Soft Computing, 19/5(2015-05-01), 1269-1282
Format:
Artikel (online)
Online Zugang:
| LEADER | caa a22 4500 | ||
|---|---|---|---|
| 001 | 605470464 | ||
| 003 | CHVBK | ||
| 005 | 20210128100328.0 | ||
| 007 | cr unu---uuuuu | ||
| 008 | 210128e20150501xx s 000 0 eng | ||
| 024 | 7 | 0 | |a 10.1007/s00500-014-1339-0 |2 doi |
| 035 | |a (NATIONALLICENCE)springer-10.1007/s00500-014-1339-0 | ||
| 245 | 0 | 0 | |a Instance selection by genetic-based biological algorithm |h [Elektronische Daten] |c [Zong-Yao Chen, Chih-Fong Tsai, William Eberle, Wei-Chao Lin, Shih-Wen Ke] |
| 520 | 3 | |a Instance selection is an important research problem of data pre-processing in the data mining field. The aim of instance selection is to reduce the data size by filtering out noisy data, which may degrade the mining performance, from a given dataset. Genetic algorithms have presented an effective instance selection approach to improve the performance of data mining algorithms. However, current approaches only pursue the simplest evolutionary process based on the most reasonable and simplest rules. In this paper, we introduce a novel instance selection algorithm, namely a genetic-based biological algorithm (GBA). GBA fits a "biological evolution” into the evolutionary process, where the most streamlined process also complies with the reasonable rules. In other words, after long-term evolution, organisms find the most efficient way to allocate resources and evolve. Consequently, we can closely simulate the natural evolution of an algorithm, such that the algorithm will be both efficient and effective. Our experiments are based on comparing GBA with five state-of-the-art algorithms over 50 different domain datasets from the UCI Machine Learning Repository. The experimental results demonstrate that GBA outperforms these baselines, providing the lowest classification error rate and the least storage requirement. Moreover, GBA is very computational efficient, which only requires slightly larger computational cost than GA. | |
| 540 | |a Springer-Verlag Berlin Heidelberg, 2014 | ||
| 690 | 7 | |a Instance selection |2 nationallicence | |
| 690 | 7 | |a Data reduction |2 nationallicence | |
| 690 | 7 | |a Data mining |2 nationallicence | |
| 690 | 7 | |a Machine learning |2 nationallicence | |
| 690 | 7 | |a Genetic algorithms |2 nationallicence | |
| 690 | 7 | |a Biological evolution |2 nationallicence | |
| 700 | 1 | |a Chen |D Zong-Yao |u Department of Information Management, National Central University, Jhongli, Taiwan |4 aut | |
| 700 | 1 | |a Tsai |D Chih-Fong |u Department of Information Management, National Central University, Jhongli, Taiwan |4 aut | |
| 700 | 1 | |a Eberle |D William |u Department of Computer Science, Tennessee Technological University, Cookeville, USA |4 aut | |
| 700 | 1 | |a Lin |D Wei-Chao |u Department of Computer Science and Information Engineering, Hwa Hsia Institute of Technology, New Taipei, Taiwan |4 aut | |
| 700 | 1 | |a Ke |D Shih-Wen |u Department of Information and Computer Engineering, Chung Yuan Christian University, Jhongli, Taiwan |4 aut | |
| 773 | 0 | |t Soft Computing |d Springer Berlin Heidelberg |g 19/5(2015-05-01), 1269-1282 |x 1432-7643 |q 19:5<1269 |1 2015 |2 19 |o 500 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/s00500-014-1339-0 |q text/html |z Onlinezugriff via DOI |
| 898 | |a BK010053 |b XK010053 |c XK010000 | ||
| 900 | 7 | |a Metadata rights reserved |b Springer special CC-BY-NC licence |2 nationallicence | |
| 908 | |D 1 |a research-article |2 jats | ||
| 949 | |B NATIONALLICENCE |F NATIONALLICENCE |b NL-springer | ||
| 950 | |B NATIONALLICENCE |P 856 |E 40 |u https://doi.org/10.1007/s00500-014-1339-0 |q text/html |z Onlinezugriff via DOI | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Chen |D Zong-Yao |u Department of Information Management, National Central University, Jhongli, Taiwan |4 aut | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Tsai |D Chih-Fong |u Department of Information Management, National Central University, Jhongli, Taiwan |4 aut | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Eberle |D William |u Department of Computer Science, Tennessee Technological University, Cookeville, USA |4 aut | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Lin |D Wei-Chao |u Department of Computer Science and Information Engineering, Hwa Hsia Institute of Technology, New Taipei, Taiwan |4 aut | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Ke |D Shih-Wen |u Department of Information and Computer Engineering, Chung Yuan Christian University, Jhongli, Taiwan |4 aut | ||
| 950 | |B NATIONALLICENCE |P 773 |E 0- |t Soft Computing |d Springer Berlin Heidelberg |g 19/5(2015-05-01), 1269-1282 |x 1432-7643 |q 19:5<1269 |1 2015 |2 19 |o 500 | ||