The Community for Technology Leaders
Computer Science and Information Engineering, World Congress on (2009)
Los Angeles, California USA
Mar. 31, 2009 to Apr. 2, 2009
ISBN: 978-0-7695-3507-4
pp: 435-441
The paper presents an evaluation of four clustering algorithms: k-means, average linkage, complete linkage, and Ward’s method, with the latter three being different hierarchical methods. The quality of the clusters created by the algorithms was measured in terms of cluster cohesiveness and semantic cohesiveness, and both quantitative and predicate-based similarity criteria were considered.Two similarity matrices were calculated as weighted sums of a set of selected MPEG-7 color feature descriptors (representing color, texture and shape), to measure the effectiveness of clustering subsets of COREL color photo images. The best quality clusters were formed by the average-linkage hierarchical method. Even though weighted texture and shape similarity measures were used in addition to total color, average-linkage outperformed k-means in the formation of both semantic and cohesive clusters. Notably, though, the addition of texture and shape features degraded cluster quality for all three hierarchical methods.
Clustering, Content-Based Image Retrieval

M. Sileshi and B. Gambäck, "Evaluating Clustering Algorithms: Cluster Quality and Feature Selection in Content-Based Image Clustering," 2009 WRI World Congress on Computer Science and Information Engineering, CSIE(CSIE), Los Angeles, CA, 2009, pp. 435-441.
105 ms
(Ver 3.3 (11022016))