115 search results - page 18 / 23 » Scalable Discovery of Best Clusters on Large Graphs |
SDM
2009
SIAM
14 years 4 months ago
2009
SIAM
The increasing availability of network data is creating a great potential for knowledge discovery from graph data. In many applications, feature vectors are given in addition to g...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
Matching articulated shapes represented by voxel-sets reduces to maximal sub-graph isomorphism when each set is described by a weighted graph. Spectral graph theory can be used to...
VLDB
1997
ACM
13 years 11 months ago
1997
ACM
Spatial data mining, i.e., discovery of interesting characteristics and patterns that may implicitly exist in spatial databases, is a challenging task due to the huge amounts of s...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
ABSTRACT. Upon the discovery of power laws [8, 16, 30], a large body of work in complex network analysis has focused on developing generative models of graphs which mimick real-wor...
BMCBI
2007
13 years 7 months ago
2007
Background: Computational methods to predict transcription factor binding sites (TFBS) based on exhaustive algorithms are guaranteed to find the best patterns but are often limite...