320 search results - page 2 / 64 » Overlapping cluster planarity |
ICDM
2006
IEEE
13 years 11 months ago
2006
IEEE
Most clustering algorithms are partitional in nature, assigning each data point to exactly one cluster. However, several real world datasets have inherently overlapping clusters i...
IAJIT
2008
13 years 5 months ago
2008
: The fuzzy c-means clustering algorithm has been widely used to obtain the fuzzy k-partitions. This algorithm requires that the user gives the number of clusters k. To find automa...
GD
1999
Springer
13 years 9 months ago
1999
Springer
In this paper we present a novel approach for cluster-based drawing of large planar graphs that maintains planarity. Our technique works for arbitrary planar graphs and produces a ...
ICPR
2008
IEEE
13 years 11 months ago
2008
IEEE
This paper deals with overlapping clustering, a trade off between crisp and fuzzy clustering. It has been motivated by recent applications in various domains such as information r...
SIGOPS
2008
13 years 5 months ago
2008
Many scientific applications use parallel I/O to meet the low latency and high bandwidth I/O requirement. Among many available parallel I/O operations, collective I/O is one of th...