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

Pattern clustering using cooperative game theory

Dhamal, Swapnil and Bhat, Satyanath and Anoop, KR and Embar, Varun R (2011) Pattern clustering using cooperative game theory. In: Proceedings of Centenary Conference Department of Electrical Engineering, 2011, Bangalore, India.

[img]
Preview
PDF
Pro_Cen_Con_Dep_Ele_Eng_653_2011.pdf - Published Version

Download (169Kb) | Preview
Official URL: http://arxiv.org/abs/1201.0461

Abstract

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.

Item Type: Conference Paper
Related URLs:
Additional Information: Copyright of this article belongs to Indian Institute of Science.
Keywords: Pattern Clustering;Characteristic form Game;Nucleolus;Shapley Value.
Department/Centre: Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)
Division of Electrical Sciences > Electrical Engineering
Date Deposited: 19 Mar 2013 10:50
Last Modified: 19 Mar 2013 10:50
URI: http://eprints.iisc.ernet.in/id/eprint/46049

Actions (login required)

View Item View Item