期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Unsupervised Quick Reduct Algorithm Using Rough Set Theory 被引量:2
1
作者 C. Velayutham K. Thangavel 《Journal of Electronic Science and Technology》 CAS 2011年第3期193-201,共9页
Feature selection (FS) is a process to select features which are more informative. It is one of the important steps in knowledge discovery. The problem is that not all features are important. Some of the features ma... Feature selection (FS) is a process to select features which are more informative. It is one of the important steps in knowledge discovery. The problem is that not all features are important. Some of the features may be redundant, and others may be irrelevant and noisy. The conventional supervised FS methods evaluate various feature subsets using an evaluation function or metric to select only those features which are related to the decision classes of the data under consideration. However, for many data mining applications, decision class labels are often unknown or incomplete, thus indicating the significance of unsupervised feature selection. However, in unsupervised learning, decision class labels are not provided. In this paper, we propose a new unsupervised quick reduct (QR) algorithm using rough set theory. The quality of the reduced data is measured by the classification performance and it is evaluated using WEKA classifier tool. The method is compared with existing supervised methods and the result demonstrates the efficiency of the proposed algorithm. 展开更多
关键词 Index Terms--Data mining rough set supervised and unsupervised feature selection unsupervised quick reduct algorithm.
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部