Sciweavers

4039 search results - page 263 / 808
» A Method for Dynamic Clustering of Data
Sort
View
IJAR
2007
113views more  IJAR 2007»
15 years 6 months ago
Fuzzy clustering in parallel universes
We present an extension of the fuzzy c-Means algorithm, which operates simultaneously on different feature spaces—so-called parallel universes—and also incorporates noise det...
Bernd Wiswedel, Michael R. Berthold
ISAAC
2009
Springer
175views Algorithms» more  ISAAC 2009»
16 years 1 months ago
Worst-Case and Smoothed Analysis of k-Means Clustering with Bregman Divergences
The k-means algorithm is the method of choice for clustering large-scale data sets and it performs exceedingly well in practice. Most of the theoretical work is restricted to the c...
Bodo Manthey, Heiko Röglin
RECOMB
2005
Springer
16 years 7 months ago
Individual Gene Cluster Statistics in Noisy Maps
Abstract. Identification of homologous chromosomal regions is important for understanding evolutionary processes that shape genome evolution, such as genome rearrangements and larg...
Narayanan Raghupathy, Dannie Durand
DAGSTUHL
2009
15 years 7 months ago
Learning Highly Structured Manifolds: Harnessing the Power of SOMs
Abstract. In this paper we elaborate on the challenges of learning manifolds that have many relevant clusters, and where the clusters can have widely varying statistics. We call su...
Erzsébet Merényi, Kadim Tasdemir, Li...
EDBT
2010
ACM
170views Database» more  EDBT 2010»
15 years 10 months ago
Augmenting OLAP exploration with dynamic advanced analytics
Online Analytical Processing (OLAP) is a popular technique for explorative data analysis. Usually, a fixed set of dimensions (such as time, place, etc.) is used to explore and ana...
Benjamin Leonhardi, Bernhard Mitschang, Rubé...