NDLI: GAMer: a synthesis of subspace clustering and dense subgraph mining

Content Provider	Springer Nature Link
Author	Günnemann, Stephan Färber, Ines Boden, Brigitte Seidl, Thomas
Copyright Year	2013
Abstract	In this work, we propose a new method to find homogeneous object groups in a single vertex-labeled graph. The basic premise is that many prevalent datasets consist of multiple types of information: graph data to represent the relations between objects and attribute data to characterize the single objects. Analyzing both information types simultaneously can increase the expressiveness of the resulting patterns. Our patterns of interest are sets of objects that are densely connected within the associated graph and as well show high similarity regarding their attributes. As for attribute data it is known that full-space clustering often is futile, we have to analyze the similarity of objects regarding subsets of their attributes. In order to take full advantage of all present information, we combine the paradigms of dense subgraph mining and subspace clustering. For our approach, we face several challenges to achieve a sound combination of the two paradigms. We maximize our twofold clusters according to their density, size, and number of relevant dimensions. The optimization of these three objectives usually is conflicting; thus, we realize a trade-off between these characteristics to obtain meaningful patterns. We develop a redundancy model to confine the clustering to a manageable size by selecting only the most interesting clusters for the result set. We prove the complexity of our clustering model and we particularly focus on the exploration of various pruning strategies to design the efficient algorithm GAMer (Graph & Attribute Miner). In thorough experiments on synthetic and real world data we show that GAMer achieves low runtimes and high clustering qualities. We provide all datasets, measures, executables, and parameter settings on our website http://dme.rwth-aachen.de/gamer .
Starting Page	243
Ending Page	278
Page Count	36
File Format	PDF
ISSN	02191377
Journal	Knowledge and Information Systems
Volume Number	40
Issue Number	2
e-ISSN	02193116
Language	English
Publisher	Springer London
Publisher Date	2013-05-08
Publisher Place	London
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Subspace clustering Dense subgraph mining Pruning techniques Information Systems and Communication Service Business Information Systems
Content Type	Text
Resource Type	Article
Subject	Artificial Intelligence Information Systems Human-Computer Interaction Hardware and Architecture Software

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	Dr. B. Sutradhar bsutra@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	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library 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

Subspace and projected clustering: experimental evaluation and analysis

Robust projected clustering

Query directed clustering

Email mining: tasks, common techniques, and tools

Clustering based on matrix approximation: a unifying view

Non-redundant data clustering

Finding multiple stable clusterings

Sleeved co-clustering of lagged data

LC-mine: a framework for frequent subgraph mining with local consistency techniques

GAMer: a synthesis of subspace clustering and dense subgraph mining

Similar Documents

Subspace and projected clustering: experimental evaluation and analysis

Robust projected clustering

Query directed clustering

Email mining: tasks, common techniques, and tools

Clustering based on matrix approximation: a unifying view

Non-redundant data clustering

Finding multiple stable clusterings

Sleeved co-clustering of lagged data

LC-mine: a framework for frequent subgraph mining with local consistency techniques

GAMer: a synthesis of subspace clustering and dense subgraph mining