• DocumentCode
    3076891
  • Title

    NANO: A New Supervised Algorithm for Feature Selection with Discretization

  • Author

    Senthilkumar, J. ; Manjula, D. ; Krishnamoorthy, R.

  • Author_Institution
    Dept. of Comput. Sci. & Eng., Anna Univ., Chennai
  • fYear
    2009
  • fDate
    6-7 March 2009
  • Firstpage
    1515
  • Lastpage
    1520
  • Abstract
    Discretization turns numeric attributes into discrete ones. Feature selection eliminates some irrelevant and/or redundant attributes. Data discretization and feature selection are two important tasks that performed prior to the learning phase of data mining algorithms and significantly reduces the processing effort of the learning algorithm. In this paper, we present a new algorithm, called Nano, that can perform simultaneously data discretization and feature selection. In feature selection process irrelevant and redundant attributes as a measure of inconsistence are eliminated to determine the final number of intervals and to select features. The proposed Nano algorithm aims at keeping the minimal number of intervals with minimal inconsistency and establishes a tradeoff between these measures. The empirical results demonstrate that the proposed Nano algorithm is effective in feature selection and discretization of numeric and ordinal attributes.
  • Keywords
    data mining; learning (artificial intelligence); pattern classification; Nano algorithm; data discretization; data mining algorithms; feature selection; learning phase; pattern classification; supervised algorithm; Classification algorithms; Computer science; Data mining; H infinity control; Input variables; Pattern classification; Pattern recognition; Statistics; Supervised learning; Surgery; Discretization; feature selection; pattern classification;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Advance Computing Conference, 2009. IACC 2009. IEEE International
  • Conference_Location
    Patiala
  • Print_ISBN
    978-1-4244-2927-1
  • Electronic_ISBN
    978-1-4244-2928-8
  • Type

    conf

  • DOI
    10.1109/IADCC.2009.4809243
  • Filename
    4809243