In recent past, tremendous work has been done to find optimal number of clusters at run time for partitional clustering algorithms. Various Evolutionary Computation techniques have been used by researchers to evolve most appropriate number of clusters for different clustering problems. In this paper, we attempt to apply a new variant of adaptive differential evolution technique on a real world data set to find optimal number of clusters at runtime. The DCADE algorithm has been applied on Home Interview Survey (HIS) data related to a Transportation Project. Later clusters are formed and analyzed which are in accordance with the domain expert. © 2012 Springer-Verlag GmbH Berlin Heidelberg.
CITATION STYLE
Sai Hanuman, A., Anand, S., Vinaya Babu, A., & Govardhan, A. (2012). Application of dynamic clustering using ADE to transportation planning. In Advances in Intelligent and Soft Computing (Vol. 132 AISC, pp. 669–678). Springer Verlag. https://doi.org/10.1007/978-3-642-27443-5_77
Mendeley helps you to discover research relevant for your work.