arrow
返回

Unsupervised probabilistic feature selection using ant colony optimization

delete2016-07-01
delete69
PRE
AI
A
Ali Zakerolhosseini
DOI:10.1016/j.eswa.2016.01.021delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Feature selection (FS) is one of the most important fields in pattern recognition, which aims to pick a subset of relevant and informative features from an original feature set. There are two kinds of FS algorithms depending on the presence of information about dataset class labels: supervised and unsupervised algorithms. Supervised approaches utilize class labels of dataset in the process of feature selection. On the other hand, unsupervised algorithms act in the absence of class labels, which makes their process more difficult. In this paper, we propose unsupervised probabilistic feature selection using ant colony optimization (UPFS). The algorithm looks for the optimal feature subset in an iterative process. In this algorithm, we utilize inter-feature information which shows the similarity between the features that leads the algorithm to decreased redundancy in the final set. In each step of the ACO algorithm, to select the next potential feature, we calculate the amount of redundancy between current feature and all those which have been selected thus far. In addition, we utilize a matrix to hold ant related pheromone which shows the rate of the co-presence of every pair of features in solutions. Afterwards, features are ranked based on a probability function extracted from the matrix; then, their m-top is returned as the final solution. We compare the performance of UPFS with 15 well-known supervised and unsupervised feature selection methods using different classifiers (support vector machine, naive Bayes, and k-nearest neighbor) on 10 well-known datasets. The experimental results show the efficiency of the proposed method compared to the previous related methods. (C) 2016 Elsevier Ltd. All rights reserved.
Keyword:
Feature selection
Unsupervised methods
Filter approaches
Ant colony optimization
Classification accuracy
AI总结

AI总结

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

期刊

Expert Systems with Applications 封面图
Expert Systems with Applications
IF:
7.5
论文数:
2.9W
被引数:
10.2W

机构

S
Shahid Beheshti University
学者数:
7.6K
论文数: 6.8K
被引数: 6.9K
引用论文

引用论文

err分享
err收藏
Clinical-Performance Remediation Program for Dyscompetent Medical Students
err2013-06-30
err0
errOAAI
errSun Jung Myung; Jae-June Yim; Sang Min Park; Jwa Seop Shin
err分享
err收藏
Dimensionality reduction using genetic algorithms
err2000-07-01
err606
PREAI
errRaymer, ML; Punch, WE; Goodman, ED; Kuhn, LA; Jain, AK
err分享
err收藏
The electroneutrality approximation in electrochemistry电化学中的电中性近似
err2011-02-22
err0
PREAI
errEdmund J. F. Dickinson; Juan G. Limon-Petersen; Richard G. Compton
err分享
err收藏
Random subspace method for multivariate feature selection
err2006-07-01
err158
PREAI
errLai, Carmen; Reinders, Marcel J. T.; Wessels, Lodewyk
err分享
err收藏
A new local search based hybrid genetic algorithm for feature selection
err2011-10-01
err208
PREAI
errKabir, Md. Monirul; Shahjahan, Md.; Murase, Kazuyuki
err分享
err收藏
err分享
err收藏
学者 查看更多内容