Sciweavers

256 search results - page 19 / 52
» Approximation Algorithms for Hamming Clustering Problems
Sort
View
NIPS
2008
14 years 11 months ago
Clustering via LP-based Stabilities
A novel center-based clustering algorithm is proposed in this paper. We first formulate clustering as an NP-hard linear integer program and we then use linear programming and the ...
Nikos Komodakis, Nikos Paragios, Georgios Tziritas
SDM
2009
SIAM
114views Data Mining» more  SDM 2009»
15 years 6 months ago
GAD: General Activity Detection for Fast Clustering on Large Data.
In this paper, we propose GAD (General Activity Detection) for fast clustering on large scale data. Within this framework we design a set of algorithms for different scenarios: (...
Jiawei Han, Liangliang Cao, Sangkyum Kim, Xin Jin,...
RECOMB
2008
Springer
15 years 10 months ago
Computation of Median Gene Clusters
Whole genome comparison based on gene order has become a popular approach in comparative genomics. An important task in this field is the detection of gene clusters, i.e. sets of g...
Sebastian Böcker, Katharina Jahn, Julia Mixta...
KDD
2005
ACM
166views Data Mining» more  KDD 2005»
15 years 10 months ago
A general model for clustering binary data
Clustering is the problem of identifying the distribution of patterns and intrinsic correlations in large data sets by partitioning the data points into similarity classes. This p...
Tao Li
CORR
2011
Springer
214views Education» more  CORR 2011»
14 years 1 months ago
K-Median Clustering, Model-Based Compressive Sensing, and Sparse Recovery for Earth Mover Distance
We initiate the study of sparse recovery problems under the Earth-Mover Distance (EMD). Specifically, we design a distribution over m × n matrices A such that for any x, given A...
Piotr Indyk, Eric Price