798 search results - page 7 / 160 » Engineering graph clustering: Models and experimental evalua... |
111
click to vote
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
WSC
2008
14 years 11 months ago
2008
Recent advances in high-performance computing have pushed computational capabilities to a petaflop (a thousand trillion operations per second) in a single computing cluster. This ...
ICML
2004
IEEE
15 years 10 months ago
2004
IEEE
A critical problem in cluster ensemble research is how to combine multiple clusterings to yield a final superior clustering result. Leveraging advanced graph partitioning techniqu...
CGF
2010
14 years 9 months ago
2010
Graph visualization systems often exploit opaque metanodes to reduce visual clutter and improve the readability of large graphs. This filtering can be done in a path-preserving wa...
ML
2011
ACM
14 years 4 months ago
2011
ACM
In the last decade, connectionist models have been proposed that can process structured information directly. These methods, which are based on the use of graphs for the representa...