A correspondence between maximal complete bipartite subgraphs and closed patterns

Authors:
Jinyan Li;Haiquan Li;Donny Soh;Limsoon Wong
Affiliations:
Institute for Infocomm Research, Singapore;Institute for Infocomm Research, Singapore;Institute for Infocomm Research, Singapore;Institute for Infocomm Research, Singapore
Venue:
PKDD'05 Proceedings of the 9th European conference on Principles and Practice of Knowledge Discovery in Databases
Year:
2005

Citing 10
Cited 3

Mining association rules between sets of items in large databases

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Arboricity and bipartite subgraph listing algorithms

Information Processing Letters
Trawling the Web for emerging cyber-communities

WWW '99 Proceedings of the eighth international conference on World Wide Web
Graph structure in the Web

Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
Discovering Frequent Closed Itemsets for Association Rules

ICDT '99 Proceedings of the 7th International Conference on Database Theory
Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets

CL '00 Proceedings of the First International Conference on Computational Logic
CLOSET+: searching for the best strategies for mining frequent closed itemsets

Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
State of the art of graph-based data mining

ACM SIGKDD Explorations Newsletter
Discovery of User Communities from Web Audience Measurement Data

WI '04 Proceedings of the 2004 IEEE/WIC/ACM International Conference on Web Intelligence
Predicting protein--peptide interactions via a network-based motif sampler

Bioinformatics

A case study on financial ratios via cross-graph quasi-bicliques

Information Sciences: an International Journal
Efficient mining of large maximal bicliques

DaWaK'06 Proceedings of the 8th international conference on Data Warehousing and Knowledge Discovery
A survey on enhanced subspace clustering

Data Mining and Knowledge Discovery

Quantified Score

Hi-index	0.00

Visualization

Abstract

For an undirected graph G without self-loop, we prove: (i) that the number of closed patterns in the adjacency matrix of G is even; (ii) that the number of the closed patterns is precisely double the number of maximal complete bipartite subgraphs of G; (iii) that for every maximal complete bipartite subgraph, there always exists a unique pair of closed patterns that matches the two vertex sets of the subgraph. Therefore, we can enumerate all maximal complete bipartite subgraphs by using efficient algorithms for mining closed patterns which have been extensively studied in the data mining field.