Sciweavers

9 search results - page 2 / 2
» CLAN: An Algorithm for Mining Closed Cliques from Large Dens...
Sort
View
KDD
2005
ACM
127views Data Mining» more  KDD 2005»
13 years 10 months ago
Mining closed relational graphs with connectivity constraints
Relational graphs are widely used in modeling large scale networks such as biological networks and social networks. In this kind of graph, connectivity becomes critical in identif...
Xifeng Yan, Xianghong Jasmine Zhou, Jiawei Han
ICDE
2003
IEEE
146views Database» more  ICDE 2003»
14 years 6 months ago
Generalized Closed Itemsets for Association Rule Mining
The output of boolean association rule mining algorithms is often too large for manual examination. For dense datasets, it is often impractical to even generate all frequent items...
Vikram Pudi, Jayant R. Haritsa
WWW
2007
ACM
14 years 5 months ago
Extraction and classification of dense communities in the web
The World Wide Web (WWW) is rapidly becoming important for society as a medium for sharing data, information and services, and there is a growing interest in tools for understandi...
Yon Dourisboure, Filippo Geraci, Marco Pellegrini
KDD
2008
ACM
193views Data Mining» more  KDD 2008»
14 years 5 months ago
A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
Luh Yen, Marco Saerens, Amin Mantrach, Masashi Shi...