Sciweavers

112 search results - page 4 / 23
» Combining hierarchical clusterings using min-transitive clos...
Sort
View
ICMCS
2006
IEEE
142views Multimedia» more  ICMCS 2006»
13 years 11 months ago
FEMA: A Fast Expectation Maximization Algorithm based on Grid and PCA
EM algorithm is an important unsupervised clustering algorithm, but the algorithm has several limitations. In this paper, we propose a fast EM algorithm (FEMA) to address the limi...
Zhiwen Yu, Hau-San Wong
ICPR
2002
IEEE
14 years 6 months ago
Fast Hierarchical Clustering Based on Compressed Data
: One way to scale up clustering algorithms is to squash the data by some intelligent compression technique and cluster only the compressed data records. Such compressed data recor...
Erendira Rendon, Ricardo Barandela
SAINT
2005
IEEE
13 years 11 months ago
A Case Study in Running a Parallel Branch and Bound Application on the Grid
This paper presents a case study to effectively run a parallel branch and bound application on the Grid. The application discussed in this paper is a fine-grain application and is...
Kento Aida, Tomotaka Osumi
PKDD
2000
Springer
144views Data Mining» more  PKDD 2000»
13 years 8 months ago
Fast Hierarchical Clustering Based on Compressed Data and OPTICS
: One way to scale up clustering algorithms is to squash the data by some intelligent compression technique and cluster only the compressed data records. Such compressed data recor...
Markus M. Breunig, Hans-Peter Kriegel, Jörg S...
ICASSP
2011
IEEE
12 years 9 months ago
Decision tree-based context clustering based on cross validation and hierarchical priors
The standard, ad-hoc stopping criteria used in decision tree-based context clustering are known to be sub-optimal and require parameters to be tuned. This paper proposes a new app...
Heiga Zen, Mark J. F. Gales