30 search results - page 6 / 6 » Algorithms for Cluster Busting in Anchored Graph Drawing |
NIPS
2001
13 years 7 months ago
2001
Drawing on the correspondence between the graph Laplacian, the Laplace-Beltrami operator on a manifold, and the connections to the heat equation, we propose a geometrically motiva...
GECCO
2004
Springer
13 years 11 months ago
2004
Springer
This paper describes a continuous estimation of distribution algorithm (EDA) to solve decomposable, real-valued optimization problems quickly, accurately, and reliably. This is the...
WWW
2002
ACM
14 years 6 months ago
2002
ACM
The Web graph is a giant social network whose properties have been measured and modeled extensively in recent years. Most such studies concentrate on the graph structure alone, an...
SDM
2009
SIAM
14 years 2 months ago
2009
SIAM
Biclustering refers to simultaneous clustering of objects and their features. Use of biclustering is gaining momentum in areas such as text mining, gene expression analysis and co...
BMCBI
2007
13 years 5 months ago
2007
Background: Construction and interpretation of phylogenetic trees has been a major research topic for understanding the evolution of genes. Increases in sequence data and complexi...