Skip to Main Content
Skip Nav Destination
ASME Press Select Proceedings

International Conference on Computer and Electrical Engineering 4th (ICCEE 2011)

Jianhong Zhou
Jianhong Zhou
Search for other works by this author on:
No. of Pages:
ASME Press
Publication date:

This paper introduces an improved evolutionary algorithm based on the Imperialist Competitive Algorithm (ICA) called Clustering Imperialists Algorithm (CIA). The Imperialist Competitive Algorithm that was recently introduced is used to optimize problems and has shown its reliable performance. This novel optimization algorithm is inspired by socio-political process of imperialistic competition in the real world. In the ICA, there are two categories of countries: Imperialists and Colonies that each Imperialist observes its colonies by absorption policy. In the proposed algorithm the changed ICA is used for clustering data. In the CIA, according to the number of considered clusters, the Imperialists will be created, and they act like Imperialists in the ICA and absorb their colonies. In this process which colonies move toward Imperialists, the Imperialists borders are specified and by this way whole region is clustered into the number of Imperialists. In addition to absorption policy, another policy which is named Repulsion Policy is added to algorithm that cause colonies get away from Imperialist and distribute in the region. Finally, the proposed algorithm is used for clustering an image based on its pixels' Intensity and a desired result obtained.

This content is only available via PDF.
You do not currently have access to this chapter.
Close Modal

or Create an Account

Close Modal
Close Modal