Sciweavers

1344 search results - page 13 / 269
» Cluster Analysis of High-Dimensional Data: A Case Study
Sort
View
ISAAC
2009
Springer
175views Algorithms» more  ISAAC 2009»
14 years 2 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
ICDE
2007
IEEE
165views Database» more  ICDE 2007»
14 years 9 months ago
On Randomization, Public Information and the Curse of Dimensionality
A key method for privacy preserving data mining is that of randomization. Unlike k-anonymity, this technique does not include public information in the underlying assumptions. In ...
Charu C. Aggarwal
CVPR
2012
IEEE
11 years 10 months ago
Group action induced distances for averaging and clustering Linear Dynamical Systems with applications to the analysis of dynami
We introduce a framework for defining a distance on the (non-Euclidean) space of Linear Dynamical Systems (LDSs). The proposed distance is induced by the action of the group of o...
Bijan Afsari, Rizwan Chaudhry, Avinash Ravichandra...
KDD
2001
ACM
169views Data Mining» more  KDD 2001»
14 years 8 months ago
Hierarchical cluster analysis of SAGE data for cancer profiling
In this paper we present a method for clustering SAGE (Serial Analysis of Gene Expression) data to detect similarities and dissimilarities between different types of cancer on the...
Jörg Sander, Monica C. Sleumer, Raymond T. Ng
CANDC
2004
ACM
13 years 7 months ago
The difficult interpretation of transcriptome data: the case of the GATC regulatory network
Genomic analyses on part of Escherichia coli's chromosome had suggested the existence of a GATC regulated network. This has recently been confirmed through a transcriptome an...
Alessandra Riva, Marie-Odile Delorme, Tony Chevali...