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
Finding Regular Simple Paths in Graph Databases
SIAM Journal on Computing
Trawling the Web for emerging cyber-communities
WWW '99 Proceedings of the eighth international conference on World Wide Web
Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
Complete Mining of Frequent Patterns from Graphs: Mining Graph Data
Machine Learning
Conceptual Knowledge Discovery in Databases Using Formal Concept Analysis Methods
PKDD '98 Proceedings of the Second European Symposium on Principles of Data Mining and Knowledge Discovery
gSpan: Graph-Based Substructure Pattern Mining
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
Efficient Mining of Frequent Subgraphs in the Presence of Isomorphism
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
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
CloseGraph: mining closed frequent graph patterns
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
Scalable mining of large disk-based graph databases
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
SPIN: mining maximal frequent subgraphs from graph databases
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
An Efficient Algorithm for Discovering Frequent Subgraphs
IEEE Transactions on Knowledge and Data Engineering
Biclustering Algorithms for Biological Data Analysis: A Survey
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Discovery of User Communities from Web Audience Measurement Data
WI '04 Proceedings of the 2004 IEEE/WIC/ACM International Conference on Web Intelligence
GREW-A Scalable Frequent Subgraph Discovery Algorithm
ICDM '04 Proceedings of the Fourth IEEE International Conference on Data Mining
Consensus algorithms for the generation of all maximal bicliques
Discrete Applied Mathematics - The fourth international colloquium on graphs and optimisation (GO-IV)
Substructure similarity search in graph databases
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
On mining cross-graph quasi-cliques
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Mining closed relational graphs with connectivity constraints
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Fast Algorithms for Frequent Itemset Mining Using FP-Trees
IEEE Transactions on Knowledge and Data Engineering
Generating bicliques of a graph in lexicographic order
Theoretical Computer Science
Towards a formal concept analysis approach to exploring communities on the world wide web
ICFCA'05 Proceedings of the Third international conference on Formal Concept Analysis
A framework for mining top-k frequent closed itemsets using order preserving generators
Proceedings of the 2nd Bangalore Annual Compute Conference
Cartesian contour: a concise representation for a collection of frequent sets
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Towards bipartite graph data management
CloudDB '10 Proceedings of the second international workshop on Cloud data management
A game theoretic framework for heterogenous information network clustering
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Antibody-Specified B-Cell Epitope Prediction in Line with the Principle of Context-Awareness
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Mining direct antagonistic communities in explicit trust networks
Proceedings of the 20th ACM international conference on Information and knowledge management
Transactional Database Transformation and Its Application in Prioritizing Human Disease Genes
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Similarity measures in formal concept analysis
Annals of Mathematics and Artificial Intelligence
Mining direct antagonistic communities in signed social networks
Information Processing and Management: an International Journal
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Enumerating maximal bicliques in bipartite graphs with favorable degree sequences
Information Processing Letters
| Hi-index | 0.00 |
Enumerating maximal biclique subgraphs from a graph is a computationally challenging problem. In this paper, we efficiently enumerate them through the use of closed patterns of the adjacency matrix of the graph. For an undirected graph $G$ without self-loops, we prove that: (i) the number of closed patterns in the adjacency matrix of $G$ is even; and (ii) for every maximal biclique subgraph, there always exists a unique pair of closed patterns that matches the two vertex sets of the subgraph. Therefore, the problem of enumerating maximal bicliques can be solved by using efficient algorithms for mining closed patterns, which are algorithms extensively studied in the data mining field. However, this direct use of existing algorithms causes a duplicated enumeration. To achieve high efficiency, we propose an $O(mn)$ time delay algorithm for a non-duplicated enumeration, in particular for enumerating those maximal bicliques with a large size, where $m$ and $n$ are the number of edges and vertices of the graph respectively. We evaluate the high efficiency of our algorithm by comparing it to state-of-the-art algorithms on many graphs.