Sciweavers

265 search results - page 10 / 53
» Approximation algorithms for clustering uncertain data
Sort
View
ATAL
2009
Springer
15 years 1 months ago
Improved approximation of interactive dynamic influence diagrams using discriminative model updates
Interactive dynamic influence diagrams (I-DIDs) are graphical models for sequential decision making in uncertain settings shared by other agents. Algorithms for solving I-DIDs fac...
Prashant Doshi, Yifeng Zeng
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
15 years 10 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
14 years 9 months ago
Cleansing uncertain databases leveraging aggregate constraints
— Emerging uncertain database applications often involve the cleansing (conditioning) of uncertain databases using additional information as new evidence for reducing the uncerta...
Haiquan Chen, Wei-Shinn Ku, Haixun Wang
APPROX
2008
Springer
101views Algorithms» more  APPROX 2008»
14 years 11 months ago
Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity
Clustering is a common problem in the analysis of large data sets. Streaming algorithms, which make a single pass over the data set using small working memory and produce a cluster...
Richard Matthew McCutchen, Samir Khuller
JDCTA
2010
228views more  JDCTA 2010»
14 years 4 months ago
Research and Progress of Cluster Algorithms based on Granular Computing
Granular Computing (GrC), a knowledge-oriented computing which covers the theory of fuzzy information granularity, rough set theory, the theory of quotient space and interval comp...
Shifei Ding, Li Xu, Hong Zhu, Liwen Zhang