ASIA unversity:Item 310904400/4749
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 90429/105609 (86%)
造访人次 : 10283378      在线人数 : 97
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    题名: A novel feature selection method for large -scale data set
    作者: W. C. Chen;S. S. Tseng
    贡献者: Department of Information Science and Applications
    关键词: machine learning;knowledge discovery;feature selection;bitmap indexing;rough set
    日期: 2005
    上传时间: 2009-11-30 16:03:24 (UTC+8)
    出版者: Asia University
    摘要: Feature selection is about finding useful (relevant) features to describe an application domain. The problem of finding the minimal subsets of features that can describe all of the concepts in the given data set is NP-hard. In the past, we had proposed a feature selection method, which originated from rough set and bitmap indexing techniques, to select the optimal (minimal) feature set for the given data set efficiently. Although our method is sufficient to guarantee a solution's optimality, the computation cost is very high when the number of features is huge. In this paper, we propose a nearly optimal feature selection method, called bitmap-based feature selection method with discernibility matrix, which employs a discernibility matrix to record the important features during the construction of the cleansing tree to reduce the processing time. And the corresponding indexing and selecting algorithms for such feature selection method are also proposed. Finally, some experiments and comparisons are given and the result shows the efficiency and accuracy of our proposed method.
    關聯: Intelligent Data Analysis 9(3):237-251
    显示于类别:[行動商務與多媒體應用學系] 期刊論文


    档案 描述 大小格式浏览次数
    310904400-4749.doc35KbMicrosoft Word340检视/开启


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回馈