A new hybrid algorithm for feature selection and its application to customer recognition
by Luo Yan, Yu Changrui
International Journal of Services Operations and Informatics (IJSOI), Vol. 4, No. 2, 2009

Abstract: An important problem in customer recognition process is to select the most valid customer features. The authors present a new optimisation algorithm that combines a global optimisation algorithm called the nested partitions algorithm and the simulated annealing method. The resulting hybrid algorithm NP/SA retains the global perspective of the nested partitions algorithm and the local search capabilities of the simulated annealing method. A detailed application of the new algorithm to a customer recognition problem is also presented. The numerical results suggest that the new framework has great computation efficiency and convergence speed and is very efficient for a difficult customer feature selection problem.

Online publication date: Mon, 23-Feb-2009

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Services Operations and Informatics (IJSOI):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com