Instance selection by genetic-based biological algorithm

NCU Institutional Repository > 管理學院 > 資訊管理學系 > 期刊論文 > Item 987654321/106770

請使用永久網址來引用或連結此文件: https://ir.lib.ncu.edu.tw/handle/987654321/106770

題名:	Instance selection by genetic-based biological algorithm
作者:	蔡志豐;Chen, Zong-Yao;Tsai, Chih-Fong;Eberle, William;Lin, Wei-Chao;Ke, Shih-Wen
貢獻者:	管理學院資訊管理學系
關鍵詞:	Accuracy;Artificial Intelligence;Biological evolution;Classification;Computational Intelligence;Computing costs;Control;Data mining;Datasets;Engineering;Genetic algorithms;Heuristic;Machine learning;Mathematical Logic and Foundations;Mechatronics;Methodologies and Application;Mutation;Optimization;Performance enhancement;Robotics
日期:	2015-01-01
上傳時間:	2026-04-23 13:41:48 (UTC+8)
出版者:	Springer Verlag;Berlin/Heidelberg: Springer Berlin Heidelberg
摘要:	摘要： 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. 其他題名： Soft Comput 出版者： Berlin/Heidelberg: Springer Berlin Heidelberg 出版日期： 2015-05-01 出處： Soft computing (Berlin, Germany), 2015-05, Vol.19 (5), p.1269-1282 版權： Springer-Verlag Berlin Heidelberg 2014 版權： Springer-Verlag Berlin Heidelberg 2014. 識別號： ISSN: 1432-7643 識別號： EISSN: 1433-7479 識別號： DOI: 10.1007/s00500-014-1339-0
顯示於類別:	[資訊管理學系] 期刊論文

文件中的檔案:

檔案	描述	大小	格式	瀏覽次數
index.html		0Kb	HTML	25	檢視/開啟

在NCUIR中所有的資料項目都受到原著作權保護.

社群 sharing

資料載入中.....