• 中文核心期刊要目总览
  • 中国科技核心期刊
  • 中国科学引文数据库(CSCD)
  • 中国科技论文与引文数据库(CSTPCD)
  • 中国学术期刊文摘数据库(CSAD)
  • 中国学术期刊(网络版)(CNKI)
  • 中文科技期刊数据库
  • 万方数据知识服务平台
  • 中国超星期刊域出版平台
  • 国家科技学术期刊开放平台
  • 荷兰文摘与引文数据库(SCOPUS)
  • 日本科学技术振兴机构数据库(JST)
C. Velayutham, K. Thangavel. Unsupervised Quick Reduct Algorithm Using Rough Set Theory[J]. 电子科技大学(英文版), 2011, 9(3): 193-201. DOI: 10.3969/j.issn.1674-862X.2011.03.001
引用本文: C. Velayutham, K. Thangavel. Unsupervised Quick Reduct Algorithm Using Rough Set Theory[J]. 电子科技大学(英文版), 2011, 9(3): 193-201. DOI: 10.3969/j.issn.1674-862X.2011.03.001
C. Velayutham, K. Thangavel. Unsupervised Quick Reduct Algorithm Using Rough Set Theory[J]. Journal of Electronic Science and Technology, 2011, 9(3): 193-201. DOI: 10.3969/j.issn.1674-862X.2011.03.001
Citation: C. Velayutham, K. Thangavel. Unsupervised Quick Reduct Algorithm Using Rough Set Theory[J]. Journal of Electronic Science and Technology, 2011, 9(3): 193-201. DOI: 10.3969/j.issn.1674-862X.2011.03.001

Unsupervised Quick Reduct Algorithm Using Rough Set Theory

Unsupervised Quick Reduct Algorithm Using Rough Set Theory

  • 摘要: 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.

     

    Abstract: 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.

     

/

返回文章
返回