3068 search results - page 24 / 614 » Clustering with Multiple Graphs |
PKDD
2005
Springer
14 years 1 months ago
2005
Springer
How can we generate realistic graphs? In addition, how can we do so with a mathematically tractable model that makes it feasible to analyze their properties rigorously? Real graphs...
ADBIS
2007
Springer
14 years 2 months ago
2007
Springer
In solving the classification problem in relational data mining, traditional methods, for example, the C4.5 and its variants, usually require data transformations from datasets sto...
EUROSYS
2007
ACM
14 years 5 months ago
2007
ACM
Dryad is a general-purpose distributed execution engine for coarse-grain data-parallel applications. A Dryad application combines computational “vertices” with communication ...
TKDE
2011
13 years 3 months ago
2011
—This work introduces a link-analysis procedure for discovering relationships in a relational database or a graph, generalizing both simple and multiple correspondence analysis. ...
CLUSTER
2009
IEEE
13 years 6 months ago
2009
IEEE
With the advent of high-performance COTS clusters, there is a need for a simple, scalable and faulttolerant parallel programming and execution paradigm. In this paper, we show that...