Sciweavers

1749 search results - page 31 / 350
» An ICA algorithm for analyzing multiple data sets
Sort
View
KDD
2002
ACM
155views Data Mining» more  KDD 2002»
14 years 9 months ago
SyMP: an efficient clustering approach to identify clusters of arbitrary shapes in large data sets
We propose a new clustering algorithm, called SyMP, which is based on synchronization of pulse-coupled oscillators. SyMP represents each data point by an Integrate-and-Fire oscill...
Hichem Frigui
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
14 years 9 months ago
Searching dynamic point sets in spaces with bounded doubling dimension
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
Richard Cole, Lee-Ad Gottlieb
KDD
2009
ACM
174views Data Mining» more  KDD 2009»
14 years 3 months ago
Visual exploration of categorical and mixed data sets
For categorical data there does not exist any similarity measure which is as straight forward and general as the numerical distance between numerical items. Due to this it is ofte...
Sara Johansson
ICONIP
2008
13 years 10 months ago
Comparison of Cluster Algorithms for the Analysis of Text Data Using Kolmogorov Complexity
In this paper we present a comparison of multiple cluster algorithms and their suitability for clustering text data. The clustering is based on similarities only, employing the Kol...
Tina Geweniger, Frank-Michael Schleif, Alexander H...
BMCBI
2006
159views more  BMCBI 2006»
13 years 9 months ago
MultiSeq: unifying sequence and structure data for evolutionary analysis
Background: Since the publication of the first draft of the human genome in 2000, bioinformatic data have been accumulating at an overwhelming pace. Currently, more than 3 million...
Elijah Roberts, John Eargle, Dan Wright, Zaida Lut...