145 search results - page 4 / 29 » Mining closed relational graphs with connectivity constraint... |
99
Voted
KDD
2009
ACM
16 years 5 days ago
2009
ACM
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
127
Voted
KDD
2012
ACM
13 years 2 months ago
2012
ACM
We present TOURVIZ, a system that helps its users to interactively visualize and make sense in large network datasets. In particular, it takes as input a set of nodes the user spe...
123
click to vote
DIALM
2008
ACM
15 years 1 months ago
2008
ACM
A random geometric graph G(n, r) is a graph resulting from placing n points uniformly at random on the unit area disk, and connecting two points iff their Euclidean distance is at ...
97
Voted
KDD
2009
ACM
16 years 5 days ago
2009
ACM
Effective diagnosis of Alzheimer's disease (AD), the most common type of dementia in elderly patients, is of primary importance in biomedical research. Recent studies have de...
102
click to vote
CP
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. We study the lattice structure of sets (monoids) of surjective hyper-operations on an n-element domain. Through a Galois connection, these monoids form the algebraic coun...