Sciweavers

3934 search results - page 100 / 787
» A monothetic clustering method
Sort
View
HPCC
2005
Springer
15 years 6 months ago
A Coarse Grained Parallel Algorithm for Closest Larger Ancestors in Trees with Applications to Single Link Clustering
Hierarchical clustering methods are important in many data mining and pattern recognition tasks. In this paper we present an efficient coarse grained parallel algorithm for Single...
Albert Chan, Chunmei Gao, Andrew Rau-Chaplin
89
Voted
CSDA
2007
115views more  CSDA 2007»
15 years 16 days ago
Arbitrarily shaped multiple spatial cluster detection for case event data
An original method is proposed for spatial cluster detection of case event data. A selection order and the distance from the nearest neighbour are attributed to each point, once p...
Christophe Dematteï, Nicolas Molinari, Jean-P...
ANOR
2002
67views more  ANOR 2002»
15 years 13 days ago
Simple Product-Form Bounds for Queueing Networks with Finite Clusters
Queueing networks are studied with finite capacities for clusters of stations, rather than for individual stations. First, an instructive tandem cluster example is studied to show...
Nico M. van Dijk, Erik van der Sluis
82
Voted
ICML
2009
IEEE
16 years 1 months ago
Multi-assignment clustering for Boolean data
Conventional clustering methods typically assume that each data item belongs to a single cluster. This assumption does not hold in general. In order to overcome this limitation, w...
Andreas P. Streich, Mario Frank, David A. Basin, J...
CIKM
2009
Springer
15 years 7 months ago
Fragment-based clustering ensembles
Clustering ensembles combine different clustering solutions into a single robust and stable one. Most of existing methods become highly time-consuming when the data size turns to ...
Ou Wu, Mingliang Zhu, Weiming Hu