115 search results - page 13 / 23 » Fast approximate spectral clustering |
KAIS
2011
13 years 2 months ago
2011
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
HPDC
2007
IEEE
14 years 1 months ago
2007
IEEE
Adapting to the network is the key to achieving high performance for communication-intensive applications, including scientific computing, data intensive computing, and multicast...
FIMH
2009
Springer
14 years 2 months ago
2009
Springer
Cardiac fibre architecture plays a key role in heart function. Recently, the estimation of fibre structure has been simplified with diffusion tensor MRI (DT-MRI). In order to as...
NIPS
2008
13 years 9 months ago
2008
By attempting to simultaneously partition both the rows (examples) and columns (features) of a data matrix, Co-clustering algorithms often demonstrate surprisingly impressive perf...
CORR
2012
Springer
12 years 3 months ago
2012
Springer
Graphs and networks are used to model interactions in a variety of contexts, and there is a growing need to be able to quickly assess the qualities of a graph in order to understa...