Sciweavers

265 search results - page 8 / 53
» Approximation algorithms for clustering uncertain data
Sort
View
COCOON
2005
Springer
14 years 1 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
SUM
2010
Springer
13 years 6 months ago
Event Modelling and Reasoning with Uncertain Information for Distributed Sensor Networks
CCTV and sensor based surveillance systems are part of our daily lives now in this modern society due to the advances in telecommunications technology and the demand for better sec...
Jianbing Ma, Weiru Liu, Paul Miller
ICDE
2009
IEEE
214views Database» more  ICDE 2009»
14 years 9 months ago
Ranking with Uncertain Scores
Large databases with uncertain information are becoming more common in many applications including data integration, location tracking, and Web search. In these applications, ranki...
Mohamed A. Soliman, Ihab F. Ilyas
ALT
2009
Springer
14 years 4 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
PSIVT
2009
Springer
139views Multimedia» more  PSIVT 2009»
14 years 3 days ago
Recovery Rate of Clustering Algorithms
This article provides a simple and general way for defining the recovery rate of clustering algorithms using a given family of old clusters for evaluating the performance of the a...
Fajie Li, Reinhard Klette