Clustering is a very important topic in the field of pattern recognition and artificial intelligence. Also it has become popular in newer application areas like communication networking, data mining, bio-informatics, web mining, mobile computing etc. This article describes a network clustering technique based on PAM or k-medoid algorithm with appropriate modification. This algorithm works faster than the classical k-medoid based algorithms designed for networks and provides better results. A better final cluster structure is obtained as the sum of within cluster spreads, i.e., the clustering metric has improved drastically. The result has compared with those obtained by a graph k-medoid and a geodesic distance based (considering only highest degree nodes) network clustering algorithms. We have shown that the degree of a node is a significant contributor for better clustering.
[1]
Albert-László Barabási,et al.
Scale-free networks
,
2008,
Scholarpedia.
[2]
Aidong Zhang,et al.
Clustering Methods in a Protein–Protein Interaction Network
,
2007
.
[3]
Anil K. Jain,et al.
Data clustering: a review
,
1999,
CSUR.
[4]
J. MacQueen.
Some methods for classification and analysis of multivariate observations
,
1967
.
[5]
Anil K. Jain,et al.
Algorithms for Clustering Data
,
1988
.
[6]
Jiawei Han,et al.
Mining scale-free networks using geodesic clustering
,
2004,
KDD.
[7]
Linking Aldridge.
Scale-Free Networks Using Local Information for Preferential
,
2005
.