Sciweavers

10 search results - page 2 / 2
» Exceeding expectations and clustering uncertain data
Sort
View
COLT
2003
Springer
13 years 10 months ago
Learning from Uncertain Data
The application of statistical methods to natural language processing has been remarkably successful over the past two decades. But, to deal with recent problems arising in this ...
Mehryar Mohri
SIGMOD
2008
ACM
164views Database» more  SIGMOD 2008»
14 years 5 months ago
Finding frequent items in probabilistic data
Computing statistical information on probabilistic data has attracted a lot of attention recently, as the data generated from a wide range of data sources are inherently fuzzy or ...
Qin Zhang, Feifei Li, Ke Yi
IOR
2010
99views more  IOR 2010»
13 years 3 months ago
Dynamic Pricing with a Prior on Market Response
We study a problem of dynamic pricing faced by a vendor with limited inventory, uncertain about demand, aiming to maximize expected discounted revenue over an infinite time horiz...
Vivek F. Farias, Benjamin Van Roy
ICDM
2007
IEEE
119views Data Mining» more  ICDM 2007»
13 years 11 months ago
Reducing UK-Means to K-Means
This paper proposes an optimisation to the UK-means algorithm, which generalises the k-means algorithm to handle objects whose locations are uncertain. The location of each object...
Sau Dan Lee, Ben Kao, Reynold Cheng
ISAAC
2009
Springer
175views Algorithms» more  ISAAC 2009»
13 years 12 months ago
Worst-Case and Smoothed Analysis of k-Means Clustering with Bregman Divergences
The k-means algorithm is the method of choice for clustering large-scale data sets and it performs exceedingly well in practice. Most of the theoretical work is restricted to the c...
Bodo Manthey, Heiko Röglin