172 search results - page 10 / 35 » Graph-Based Data Clustering with Overlaps |
CANDC
2006
ACM
14 years 9 months ago
2006
ACM
Large-scale experiments and data integration have provided the opportunity to systematically analyze and comprehensively understand the topology of biological networks and biochem...
GFKL
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. The problem of clustering data can be formulated as a graph partitioning problem. In this setting, spectral methods for obtaining optimal solutions have received a lot of...
CEC
2005
IEEE
15 years 3 months ago
2005
IEEE
In previous work, we have proposed a novel approach to data clustering based on the explicit optimization of a partitioning with respect to two complementary clustering objectives ...
ICDM
2002
IEEE
15 years 2 months ago
2002
IEEE
It is well-known that for high dimensional data clustering, standard algorithms such as EM and the K-means are often trapped in local minimum. Many initialization methods were pro...
ISPDC
2007
IEEE
15 years 3 months ago
2007
IEEE
We present a new data partitioning strategy for parallel computing on three interconnected clusters. This partitioning has two advantages over existing partitionings. First it can...