Prototype selection based on multi-objective optimisation and partition strategy
by Juan Li; Yuping Wang
International Journal of Sensor Networks (IJSNET), Vol. 17, No. 3, 2015

Abstract: Prototype selection aims at reducing the storage of datasets and execution time, and improving prediction accuracy and operation efficiency by removing noisy or redundant samples, so the prediction classification accuracy is maximised and the reduction ratio is minimised simultaneously. To achieve this purpose, a two objective optimisation model is set up for prototype selection problem in the paper. To make the model be solved easier, it is transformed to a single objective optimisation model by the division of the two objectives, and a new two-layer genetic algorithm is proposed by using a divide-and-conquer partition strategy. The divide-and-conquer partition can divide the whole dataset into some random sub-datasets to be handled, respectively. The simulations are conducted and the proposed algorithm is compared with several existing algorithms. The results obtained on UCI static datasets and time series datasets indicate that the proposed algorithm is an expedient method in design nearest neighbour classifiers.

Online publication date: Sun, 22-Mar-2015

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 Sensor Networks (IJSNET):
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