English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 94459/94459 (100%)
造訪人次 : 87654821      線上人數 : 259
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋


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


    題名: Genetic algorithms in feature and instance selection
    作者: 蔡志豐;Tsai, Chih-Fong;Eberle, William;Chu, Chi-Yuan
    貢獻者: 管理學院資訊管理學系
    關鍵詞: Accuracy;Data mining;Data preprocessing;Feature selection;Genetic algorithms;Instance selection
    日期: 2013-02-01
    上傳時間: 2026-04-23 13:38:55 (UTC+8)
    出版者: Elsevier;Elsevier B.V
    摘要: 摘要: Feature selection and instance selection are two important data preprocessing steps in data mining, where the former is aimed at removing some irrelevant and/or redundant features from a given dataset and the latter at discarding the faulty data. Genetic algorithms have been widely used for these tasks in related studies. However, these two data preprocessing tasks are generally considered separately in literature. It is unknown what the performance differences would be when feature and instance selection and feature or instance selection are performed individually. Therefore, the aim of this study is to perform feature selection and instance selection based on genetic algorithms using different priorities to examine the classification performances over different domain datasets. The experimental results obtained from four small and large scale datasets containing various numbers of features and data samples show that performing both feature and instance selection usually make the classifiers (i.e., support vector machines and k-nearest neighbor) perform slightly poorer than feature selection or instance selection individually. However, while there is not a significant difference in classification accuracy between these different data preprocessing methods, the combination of feature and instance selection largely reduces the computational effort of training the classifiers, as opposed to performing feature and instance selection individually. Considering both classification effectiveness and efficiency, we demonstrate that performing feature selection first and instance selection second is the optimal solution for data preprocessing in data mining. Both SVM and k-NN classifiers provide similar classification accuracy to the baselines (i.e., those without data preprocessing). The decisions regarding which data preprocessing task to perform for different dataset scales are also discussed.
    出版者: Elsevier B.V
    出版日期: 2013-02
    出處: Knowledge-Based Systems, 2013-02, Vol.39, p.240-247
    資源來源: Elsevier ScienceDirect Journals Complete
    版權: 2012 Elsevier B.V.
    識別號: ISSN: 0950-7051
    識別號: EISSN: 1872-7409
    識別號: DOI: 10.1016/j.knosys.2012.11.005
    顯示於類別:[資訊管理學系] 期刊論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    index.html0KbHTML21檢視/開啟


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

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明