SIMULATED ANNEALING ALGORITHM FOR FEATURE SELECTION

Authors

  • Francisca Rosario Head of the Department Arignar Anna (Arts & Science) College Krishnagiri-635 001, Tamilnadu, India
  • Dr. K. Thangadurai Head of the Department Government Arts College (Autonomous) Karur – 639 005, Tamilnadu, India

DOI:

https://doi.org/10.24297/ijct.v15i2.565

Keywords:

Feature Selection, Simulated Annealing, Optimization, Iterations, Crystallize, Stochastic, Attributes, Probability

Abstract

In the process of physical annealing, a solid is heated until all particles randomly arrange themselves forming the liquid state. A slow cooling process is then used to crystallize the liquid. This process is known as simulated annealing. Simulated annealing is stochastic computational technique that searches for global optimum solutions in optimization problems. The main goal here is to give the algorithm more time in the search space exploration by accepting moves, which may degrade the solution quality, with some probability depending on a parameter called temperature. In this discussion the simulated annealing algorithm is implemented in pest and weather data set for feature selection and it reduces the dimension of the attributes through specified iterations.

Downloads

Download data is not yet available.

Author Biographies

  • Francisca Rosario, Head of the Department Arignar Anna (Arts & Science) College Krishnagiri-635 001, Tamilnadu, India

    Department of Computer Applications

  • Dr. K. Thangadurai, Head of the Department Government Arts College (Autonomous) Karur – 639 005, Tamilnadu, India
    PG & Research Department of Computer Science

Downloads

Published

2015-11-02

Issue

Section

Research Articles

How to Cite

SIMULATED ANNEALING ALGORITHM FOR FEATURE SELECTION. (2015). INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY, 15(2), 6471-6479. https://doi.org/10.24297/ijct.v15i2.565

Similar Articles

1-10 of 64

You may also start an advanced similarity search for this article.