Pattern Clustering using Cooperative Game Theory

Details Pattern Clustering using Cooperative Game Theory Pattern Clustering using Cooperative Game Theory

2012-01-02

arxiv.org/abs/1201.0461v1

Computer Science

Computer Science and Game Theory

6 pages, 6 figures, published in Proceedings of Centenary Conference - Department of Electrical Engineering, Indian Institute

Scientific paper

In this paper, we approach the classical problem of clustering using solution concepts from cooperative game theory such as Nucleolus and Shapley value. We formulate the problem of clustering as a characteristic form game and develop a novel algorithm DRAC (Density-Restricted Agglomerative Clustering) for clustering. With extensive experimentation on standard data sets, we compare the performance of DRAC with that of well known algorithms. We show an interesting result that four prominent solution concepts, Nucleolus, Shapley value, Gately point and \tau-value coincide for the defined characteristic form game. This vindicates the choice of the characteristic function of the clustering game and also provides strong intuitive foundation for our approach.

Affiliated with

Also associated with

No associations

Rating

Pattern Clustering using Cooperative Game Theory does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Pattern Clustering using Cooperative Game Theory, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Pattern Clustering using Cooperative Game Theory will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-55497