NDLI: Relational data partitioning using evolutionary game theory

Content Provider	IEEE Xplore Digital Library
Author	Hall, L.O. Chakeri, A.
Copyright Year	2014
Description	Author affiliation: Dept. of Comput. Sci. & Eng., Univ. of South Florida, Tampa, FL, USA (Hall, L.O.; Chakeri, A.)
Abstract	This paper presents a new approach for relational data partitioning using the notion of dominant sets. A dominant set is a subset of data points satisfying the constraints of internal homogeneity and external in-homogeneity, i.e. a cluster. However, since any subset of a dominant set cannot be a dominant set itself, dominant sets tend to be compact sets. Hence, in this paper, we present a novel approach to enumerate well distributed clusters where the number of clusters need not be known. When the number of clusters is known, in order to search the solution space appropriately, after finding each dominant set, data points are partitioned into two disjoint subsets of data points using spectral graph image segmentation methods to enumerate the other well distributed dominant sets. For the latter case, we introduce a new hierarchical approach for relational data partitioning using a new class of evolutionary game theory dynamics called InImDynamics which is very fast and linear, in computational time, with the number of data points. In this regard, at each level of the proposed hierarchy, Dunn's index is used to find the appropriate number of clusters. Then the objects are partitioned based on the projected number of clusters using game theoretic relations. The same method is applied to each partition to extract its underlying structure. Although the resulting clusters exist in their equivalent partitions, they may not be clusters of the entire data. Hence, they are checked for being an actual cluster and if they are not, they are extended to an existing cluster of the data. The approach can also be used to assign unseen data to existing clusters, as well.
Starting Page	113
Ending Page	120
File Size	1621597
Page Count	8
File Format	PDF
ISBN	9781479945184
DOI	10.1109/CIDM.2014.7008656
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2014-12-09
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Clustering algorithms Games Nash equilibrium Vectors Partitioning algorithms Indexes
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Mr. Siddhartha Mukherjee siddhartha@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	ndl-support@iitkgp.ac.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Libarray of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A probabilistic approach for multi-objective clustering using game theory

Dominant Sets as a Framework for Cluster Ensembles: An Evolutionary Game Theory Approach

Evaluation of a clustering technique based on game theory

Multicriteria clustering with weighted Tchebycheff distances for relational data

A novel adaptive agent-based algorithm to find mixed Nash equilibrium in static games

Lorenz Equilibrium: Concept and Evolutionary Detection

A repeated game theoretical approach for clustering in mobile ad hoc networks

Correlation cluster validity

Nash Equilibrium and Evolution by Imitation

Relational data partitioning using evolutionary game theory

Similar Documents

A probabilistic approach for multi-objective clustering using game theory

Dominant Sets as a Framework for Cluster Ensembles: An Evolutionary Game Theory Approach

Evaluation of a clustering technique based on game theory

Multicriteria clustering with weighted Tchebycheff distances for relational data

A novel adaptive agent-based algorithm to find mixed Nash equilibrium in static games

Lorenz Equilibrium: Concept and Evolutionary Detection

A repeated game theoretical approach for clustering in mobile ad hoc networks

Correlation cluster validity

Nash Equilibrium and Evolution by Imitation

Relational data partitioning using evolutionary game theory