ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Simulated annealing for selecting optimal initial seeds in the K-means algorithm

Babu, GP and Murty, MN (1994) Simulated annealing for selecting optimal initial seeds in the K-means algorithm. In: Indian Journal of Pure and Applied Mathematics, 25 (1-2). pp. 85-94.

Full text not available from this repository. (Request a copy)

Abstract

Explores the applicability of simulated annealing, a probabilistic search method, for finding optimal partition of the data. A new formulation of the clustering problem is investigated. In order to obtain an optimal partition, a search is undertaken to locate optimal initial seeds, such that the K-means algorithm converges to optimal partition. Search space involved in this process is continuous, so discretization is done and simulated annealing is employed for locating optimal initial seeds. Experimental results substantiate the proposed method. Results obtained with the selected data sets are presented.

Item Type: Journal Article
Department/Centre: Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)
Date Deposited: 16 Nov 2006
Last Modified: 27 Aug 2008 12:18
URI: http://eprints.iisc.ernet.in/id/eprint/8248

Actions (login required)

View Item View Item