Sciweavers

1971 search results - page 194 / 395
» A clustering method that uses lossy aggregation of data
Sort
View
ALT
2009
Springer
16 years 3 months ago
Approximation Algorithms for Tensor Clustering
Abstract. We present the first (to our knowledge) approximation algorithm for tensor clustering—a powerful generalization to basic 1D clustering. Tensors are increasingly common...
Stefanie Jegelka, Suvrit Sra, Arindam Banerjee
NIPS
2007
15 years 8 months ago
Convex Clustering with Exemplar-Based Models
Clustering is often formulated as the maximum likelihood estimation of a mixture model that explains the data. The EM algorithm widely used to solve the resulting optimization pro...
Danial Lashkari, Polina Golland
PODS
2005
ACM
115views Database» more  PODS 2005»
16 years 6 months ago
A divide-and-merge methodology for clustering
We present a divide-and-merge methodology for clustering a set of objects that combines a top-down "divide" phase with a bottom-up "merge" phase. In contrast, ...
David Cheng, Santosh Vempala, Ravi Kannan, Grant W...
180
Voted
BMCBI
2007
147views more  BMCBI 2007»
15 years 6 months ago
Statistical analysis and significance testing of serial analysis of gene expression data using a Poisson mixture model
Background: Serial analysis of gene expression (SAGE) is used to obtain quantitative snapshots of the transcriptome. These profiles are count-based and are assumed to follow a Bin...
Scott D. Zuyderduyn
ICDM
2006
IEEE
145views Data Mining» more  ICDM 2006»
16 years 22 days ago
Stability Region Based Expectation Maximization for Model-based Clustering
In spite of the initialization problem, the ExpectationMaximization (EM) algorithm is widely used for estimating the parameters in several data mining related tasks. Most popular ...
Chandan K. Reddy, Hsiao-Dong Chiang, Bala Rajaratn...