NDLI: Finding maximal homogeneous clique sets

Content Provider	Springer Nature Link
Author	Mougel, Pierre Nicolas Rigotti, Christophe Plantevit, Marc Gandrillon, Olivier
Copyright Year	2013
Abstract	Many datasets can be encoded as graphs with sets of labels associated with the vertices. We consider this kind of graphs and we propose to look for patterns called maximal homogeneous clique sets, where such a pattern is a subgraph that is structured in several large cliques and where all vertices share enough labels. We present an algorithm based on graph enumeration to compute all patterns satisfying user-defined constraints on the number of separated cliques, on the size of these cliques, and on the number of labels shared by all the vertices. Our approach is tested on real datasets based on a social network of scientific collaborations and on a biological network of protein–protein interactions. The experiments show that the patterns are useful to exhibit subgraphs organized in several core modules of interactions. Performances are reported on real data and also on synthetic ones, showing that the approach can be applied on different kinds of large datasets.
Starting Page	579
Ending Page	608
Page Count	30
File Format	PDF
ISSN	02191377
Journal	Knowledge and Information Systems
Volume Number	39
Issue Number	3
e-ISSN	02193116
Language	English
Publisher	Springer London
Publisher Date	2013-03-27
Publisher Place	London
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Graph mining Interaction network Attributed graph Clique set Homogeneous cliques Scientific collaborations Protein interactions Gene expression 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

Attributed graph mining in the presence of automorphism

Frequent pattern mining in attributed trees: algorithms and applications

Centrality measures-based algorithm to visualize a maximal common induced subgraph in large communication networks

Online mining of frequent sets in data streams with error guarantee

Finding top- $$k\, r$$ -cliques for keyword search from graphs in polynomial delay

Attributed graph mining in the presence of automorphism

Graph mining for discovering infrastructure patterns in configuration management databases

A general framework for relation graph clustering

Boosting for graph classification with universum

Finding maximal homogeneous clique sets

Similar Documents

Attributed graph mining in the presence of automorphism

Frequent pattern mining in attributed trees: algorithms and applications

Centrality measures-based algorithm to visualize a maximal common induced subgraph in large communication networks

Online mining of frequent sets in data streams with error guarantee

Finding top- $$k\, r$$ -cliques for keyword search from graphs in polynomial delay

Attributed graph mining in the presence of automorphism

Graph mining for discovering infrastructure patterns in configuration management databases

A general framework for relation graph clustering

Boosting for graph classification with universum

Finding maximal homogeneous clique sets