Sciweavers

256 search results - page 6 / 52
» Approximation Algorithms for Hamming Clustering Problems
Sort
View
SDM
2012
SIAM
285views Data Mining» more  SDM 2012»
12 years 12 months ago
A Novel Approximation to Dynamic Time Warping allows Anytime Clustering of Massive Time Series Datasets
Given the ubiquity of time series data, the data mining community has spent significant time investigating the best time series similarity measure to use for various tasks and dom...
Qiang Zhu 0002, Gustavo E. A. P. A. Batista, Thana...
COCOON
2005
Springer
15 years 3 months ago
Algorithmic and Complexity Issues of Three Clustering Methods in Microarray Data Analysis
The complexity, approximation and algorithmic issues of several clustering problems are studied. These non-traditional clustering problems arise from recent studies in microarray ...
Jinsong Tan, Kok Seng Chua, Louxin Zhang
WAOA
2007
Springer
158views Algorithms» more  WAOA 2007»
15 years 3 months ago
Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
We consider ranking and clustering problems related to the aggregation of inconsistent information. Ailon, Charikar, and Newman [1] proposed randomized constant factor approximatio...
Anke van Zuylen, David P. Williamson
SDM
2007
SIAM
137views Data Mining» more  SDM 2007»
14 years 11 months ago
Are approximation algorithms for consensus clustering worthwhile?
Consensus clustering has emerged as one of the principal clustering problems in the data mining community. In recent years the theoretical computer science community has generated...
Michael Bertolacci, Anthony Wirth
ESA
2011
Springer
251views Algorithms» more  ESA 2011»
13 years 9 months ago
Improved Approximation Algorithms for Bipartite Correlation Clustering
In this work we study the problem of Bipartite Correlation Clustering (BCC), a natural bipartite counterpart of the well studied Correlation Clustering (CC) problem. Given a bipart...
Nir Ailon, Noa Avigdor-Elgrabli, Edo Liberty, Anke...