Sciweavers

9 search results - page 1 / 2
» CLAN: An Algorithm for Mining Closed Cliques from Large Dens...
Sort
View
ICDE
2006
IEEE
222views Database» more  ICDE 2006»
14 years 5 months ago
CLAN: An Algorithm for Mining Closed Cliques from Large Dense Graph Databases
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
Jianyong Wang, Zhiping Zeng, Lizhu Zhou
KDD
2006
ACM
160views Data Mining» more  KDD 2006»
14 years 4 months ago
Coherent closed quasi-clique discovery from large dense graph databases
Frequent coherent subgraphscan provide valuable knowledgeabout the underlying internal structure of a graph database, and mining frequently occurring coherent subgraphs from large...
Zhiping Zeng, Jianyong Wang, Lizhu Zhou, George Ka...
SIGMOD
2008
ACM
215views Database» more  SIGMOD 2008»
14 years 3 months ago
CSV: visualizing and mining cohesive subgraphs
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
Nan Wang, Srinivasan Parthasarathy, Kian-Lee Tan, ...
IPPS
2008
IEEE
13 years 10 months ago
Parallel mining of closed quasi-cliques
Graph structure can model the relationships among a set of objects. Mining quasi-clique patterns from large dense graph data makes sense with respect to both statistic and applica...
Yuzhou Zhang, Jianyong Wang, Zhiping Zeng, Lizhu Z...
AICCSA
2008
IEEE
292views Hardware» more  AICCSA 2008»
13 years 10 months ago
Enumeration of maximal clique for mining spatial co-location patterns
This paper presents a systematic approach to mine colocation patterns in Sloan Digital Sky Survey (SDSS) data. SDSS Data Release 5 (DR5) contains 3.6 TB of data. Availability of s...
Ghazi Al-Naymat