Cellular automata based nearest neighbour rule condensation Online publication date: Mon, 20-Aug-2012
by Li Zhao; Jingkun Liang
International Journal of Computer Applications in Technology (IJCAT), Vol. 44, No. 2, 2012
Abstract: Most of the prototype reduction algorithms process the data in its entirety to yield a consistent subset, which is very useful in nearest neighbour classification. Their main disadvantage is the excessive computational cost when the prototype size is very large. In this paper, we present a cellular automata (CA)-based nearest neighbour rule condensation method to reduce useless points in a given training set. This method retains only the points on the boundary between different classes, and the amount of the reduced rules of the reference set can be revised by the granularity of the CA lattice. The main advantages of the proposed method are, on the one hand, that it is able to condense a given rule set within less time compared to other traditional algorithms. On the other hand, with the proposed algorithm, we can get a consistent subset of the given set in the divide-reduce-coalesce manner. Experiments show successful results when the size of the given dataset is large.
Online publication date: Mon, 20-Aug-2012
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 Computer Applications in Technology (IJCAT):
Login with your Inderscience username and 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 email@example.com