320 search results - page 3 / 64 » Overlapping cluster planarity |
JDA
2006
13 years 5 months ago
2006
Abstract. Planar drawings of clustered graphs are considered. We introduce the notion of completely connected clustered graphs, i.e. hierarchically clustered graphs that have the p...
KDD
2005
ACM
14 years 6 months ago
2005
ACM
While the vast majority of clustering algorithms are partitional, many real world datasets have inherently overlapping clusters. Several approaches to finding overlapping clusters...
ICRA
2002
IEEE
13 years 10 months ago
2002
IEEE
In this article, we will develop parallel processing of one-sided Radon transform for the detection of the position and the orientation of a planar motion object. Detection of pla...
COLING
2002
13 years 5 months ago
2002
This paper presents a framework for clustering in text-based information retrieval systems. The prominent feature of the proposed method is that documents, terms, and other relate...
SOCIALCOM
2010
13 years 3 months ago
2010
The typical task of unsupervised learning is to organize data, for example into clusters, typically disjoint clusters (eg. the K-means algorithm). One would expect (for example) a...