• DocumentCode
    2403378
  • Title

    Attribute reduction using backward elimination algorithm

  • Author

    Karnan, M. ; Kalyani, P.

  • Author_Institution
    Dept. of Comput. Sci., Tamilnadu Eng. Coll., Coimbatore, India
  • fYear
    2010
  • fDate
    28-29 Dec. 2010
  • Firstpage
    1
  • Lastpage
    4
  • Abstract
    Attribute reduction of an information system is a key problem in rough set theory and its applications. This paper proposes a new feature selection mechanism based on backward elimination algorithm to solve the attribute reduction problem in roughest theory. It is the most promising technique in the Rough set theory, a new mathematical approach to reduct car and cancer dataset using backward elimination algorithm. This technique was originally proposed to avoid the calculation of discernibility functions or positive regions, which can be computationally expensive. And more number of reduct is possible to compare forward selection algorithm. This paper analyses the efficiency of the proposed backward elimination algorithm against forward selection algorithm. The experiments are carried out on car data sets of UCI machine learning repository and the real breast cancer data set.
  • Keywords
    data mining; feature extraction; information systems; learning (artificial intelligence); rough set theory; UCI machine learning repository; attribute reduction; backward elimination algorithm; discernibility functions; feature selection mechanism; forward selection algorithm; information system; rough set theory; Algorithm design and analysis; Breast cancer; Databases; Mathematical model; Performance analysis; Safety; Set theory; Backward elimination; Feature selection; Forward selection; Knowledge discovery; Rough set theory;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computational Intelligence and Computing Research (ICCIC), 2010 IEEE International Conference on
  • Conference_Location
    Coimbatore
  • Print_ISBN
    978-1-4244-5965-0
  • Electronic_ISBN
    978-1-4244-5967-4
  • Type

    conf

  • DOI
    10.1109/ICCIC.2010.5705893
  • Filename
    5705893