Artificial bee colony optimisation-based enhanced Mahalanobis Taguchi system for classification
by Ashif Sikandar Iquebal; Avishek Pal
International Journal of Intelligent Engineering Informatics (IJIEI), Vol. 2, No. 2/3, 2014

Abstract: Mahalanobis Taguchi system (MTS) is a classification technique which is used to group objects into dichotomous or binary categories based on numerical predictor variables. MTS uses threshold values based on Mahalanobis distance to group objects into binary classes. An important step in MTS is feature selection whereby a subset of the original set of predictor variables is selected based on maximisation of signal-to-noise (S/N) ratio. Application of S/N ratio for feature selection in MTS has been criticised for its limitations in handling large number of predictor variables. This research explores the application of artificial bee colony (ABC) optimisation to select features in MTS. The problem of feature selection is formulated as minimisation of total weighted misclassification and solved as a binary integer programme. The optimal subset of features is obtained via the stochastic search mechanism of binary ABC. The methodology is applied for five case studies. Results are compared with those obtained from two other meta-heuristic techniques namely genetic algorithm and particle swarm optimisation.

Online publication date: Sat, 20-Dec-2014

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 Intelligent Engineering Informatics (IJIEI):
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