Massive Quasi-Clique Detection

Authors:
James Abello;Mauricio G. C. Resende;Sandra Sudarsky
Affiliations:
-;-;-
Venue:
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Year:
2002

Citing 7
Cited 47

Approximating clique is almost NP-complete (preliminary version)

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Adaptation in natural and artificial systems

Adaptation in natural and artificial systems
Probabilistic checking of proofs: a new characterization of NP

Journal of the ACM (JACM)
External memory algorithms

External memory algorithms
A Functional Approach to External Graph Algorithms

ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Handbook of massive data sets

Handbook of massive data sets
Proof verification and hardness of approximation problems

SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science

On mining cross-graph quasi-cliques

Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Discovering large dense subgraphs in massive graphs

VLDB '05 Proceedings of the 31st international conference on Very large data bases
Efficiently clustering transactional data with weighted coverage density

CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Metaheuristics for optimization problems in computer communications

Computer Communications
Ortholog Clustering on a Multipartite Graph

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Out-of-core coherent closed quasi-clique mining from large dense graph databases

ACM Transactions on Database Systems (TODS)
Detectives: detecting coalition hit inflation attacks in advertising networks streams

Proceedings of the 16th international conference on World Wide Web
Extraction and classification of dense communities in the web

Proceedings of the 16th international conference on World Wide Web
Community detection in large-scale social networks

Proceedings of the 9th WebKDD and 1st SNA-KDD 2007 workshop on Web mining and social network analysis
CSV: visualizing and mining cohesive subgraphs

Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Effective Pruning Techniques for Mining Quasi-Cliques

ECML PKDD '08 Proceedings of the European conference on Machine Learning and Knowledge Discovery in Databases - Part II
Mining frequent cross-graph quasi-cliques

ACM Transactions on Knowledge Discovery from Data (TKDD)
On Effectively Finding Maximal Quasi-cliques in Graphs

Learning and Intelligent Optimization
Finding Dense Subgraphs with Size Bounds

WAW '09 Proceedings of the 6th International Workshop on Algorithms and Models for the Web-Graph
Extraction and classification of dense implicit communities in the Web graph

ACM Transactions on the Web (TWEB)
Community detection in complex networks

Journal of Computer Science and Technology
Fixed-Parameter Algorithms for Graph-Modeled Date Clustering

TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
On perturbation theory and an algorithm for maximal clique enumeration in uncertain and noisy graphs

Proceedings of the 1st ACM SIGKDD Workshop on Knowledge Discovery from Uncertain Data
Editing Graphs into Disjoint Unions of Dense Clusters

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
SCALE: a scalable framework for efficiently clustering transactional data

Data Mining and Knowledge Discovery
Clustering social networks

WAW'07 Proceedings of the 5th international conference on Algorithms and models for the web-graph
Distributed discovery of large near-cliques

DISC'09 Proceedings of the 23rd international conference on Distributed computing
Structural correlation pattern mining for large graphs

Proceedings of the Eighth Workshop on Mining and Learning with Graphs
A case study on financial ratios via cross-graph quasi-bicliques

Information Sciences: an International Journal
The impact of unlinkability on adversarial community detection: effects and countermeasures

PETS'10 Proceedings of the 10th international conference on Privacy enhancing technologies
On dense pattern mining in graph streams

Proceedings of the VLDB Endowment
On triangulation-based dense neighborhood graph discovery

Proceedings of the VLDB Endowment
Discovery and analysis of tightly knit communities in telecom social networks

IBM Journal of Research and Development
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems

ACM Transactions on Computation Theory (TOCT)
Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem

Operations Research
On fast enumeration of pseudo bicliques

IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Transactional Database Transformation and Its Application in Prioritizing Human Disease Genes

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
The max quasi-independent set problem

Journal of Combinatorial Optimization
Computational challenges with cliques, quasi-cliques and clique partitions in graphs

SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Subgraph mining on directed and weighted graphs

PAKDD'10 Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part II
The max quasi-independent set problem

CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Dense subgraph maintenance under streaming edge weight updates for real-time story identification

Proceedings of the VLDB Endowment
Finding maximal k-edge-connected subgraphs from a large graph

Proceedings of the 15th International Conference on Extending Database Technology
Truss decomposition in massive networks

Proceedings of the VLDB Endowment
On the maximum quasi-clique problem

Discrete Applied Mathematics
An integrated methodology for the analysis of collaboration in industry networks

Journal of Intelligent Manufacturing
Modeling affiliations in networks

Proceedings of the Winter Simulation Conference
Mining Web Browsing Log by Using Relaxed Biclique Enumeration Algorithm in MapReduce

WI-IAT '12 Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 03
Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees

Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Redundancy-aware maximal cliques

Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Semantically meaningful group detection within sub-communities of Twitter blogosphere: a topic oriented multi-objective clustering approach

Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
Over-Fitting and Error Detection for Online Role Mining

International Journal of Web Services Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

We describe techniques that are useful for the detection of dense subgraphs (quasi-cliques) in massive sparse graphs whose vertex set, but not the edge set, fits in RAM. The algorithms rely on efficient semi-external memory algorithms used to preprocess the input and on greedy randomized adaptive search procedures (GRASP) to extract the dense subgraphs. A software platform was put together allowing graphs with hundreds of millions of nodes to be processed. Computational results illustrate the effectiveness of the proposed methods.