By Topic

Evaluating Clustering Algorithms: Cluster Quality and Feature Selection in Content-Based Image Clustering

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Sileshi, M. ; Dept. of Comput. Sci., Addis Ababa Univ., Addis Ababa, Ethiopia ; Gamback, B.

The paper presents an evaluation of four clustering algorithms: k-means, average linkage, complete linkage, and Wardpsilas 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.

Published in:

Computer Science and Information Engineering, 2009 WRI World Congress on  (Volume:6 )

Date of Conference:

March 31 2009-April 2 2009