Sciweavers

25041 search results - page 199 / 5009
» Algorithms for Clustering Data
Sort
View
SODA
1998
ACM
113views Algorithms» more  SODA 1998»
15 years 6 months ago
Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
David Eppstein
GECCO
2005
Springer
129views Optimization» more  GECCO 2005»
15 years 10 months ago
Post-processing clustering to reduce XCS variability
XCS is a stochastic algorithm, so it does not guarantee to produce the same results when run with the same input. When interpretability matters, obtaining a single, stable result ...
Flavio Baronti, Alessandro Passaro, Antonina Stari...
SAC
2004
ACM
15 years 10 months ago
Time-frequency feature detection for time-course microarray data
Gene clustering based on microarray data provides useful functional information to the working biologists. Many current gene-clustering algorithms rely on Euclidean-based distance...
Jiawu Feng, Paolo Emilio Barbano, Bud Mishra
117
Voted
NIPS
2003
15 years 6 months ago
Clustering with the Connectivity Kernel
Clustering aims at extracting hidden structure in dataset. While the problem of finding compact clusters has been widely studied in the literature, extracting arbitrarily formed ...
Bernd Fischer, Volker Roth, Joachim M. Buhmann
ISBI
2008
IEEE
16 years 5 months ago
An information-based clustering approach for fMRI activation detection
Most clustering algorithms in fMRI analysis implicitly require some nontrivial assumption on data structure. Due to arbitrary distribution of fMRI time series in the temporal doma...
Lijun Bai, Wei Qin, Jimin Liang, Jie Tian