Sciweavers

199 search results - page 6 / 40
» Approximating Center Points with Iterated Radon Points
Sort
View
ICPR
2010
IEEE
13 years 5 months ago
On Dynamic Weighting of Data in Clustering with K-Alpha Means
Although many methods of refining initialization have appeared, the sensitivity of K-Means to initial centers is still an obstacle in applications. In this paper, we investigate a...
Sibao Chen, Haixian Wang, Bin Luo
SIAMJO
2010
88views more  SIAMJO 2010»
13 years 2 months ago
A Primal-Dual Exterior Point Method for Nonlinear Optimization
In this paper, a primal dual method for general possible nonconvex nonlinear optimization problems is considered. The method is an exterior point type method which means that it p...
Hiroshi Yamashita, Takahito Tanabe
JCSS
2002
199views more  JCSS 2002»
13 years 7 months ago
A Constant-Factor Approximation Algorithm for the k-Median Problem
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those...
Moses Charikar, Sudipto Guha, Éva Tardos, D...
COMGEO
2010
ACM
13 years 7 months ago
Approximation algorithm for the kinetic robust K-center problem
Clustering is an important problem and has numerous applications. In this paper we consider an important clustering problem, called the k-center problem. We are given a discrete p...
Sorelle A. Friedler, David M. Mount
AI
2006
Springer
13 years 11 months ago
Belief Selection in Point-Based Planning Algorithms for POMDPs
Abstract. Current point-based planning algorithms for solving partially observable Markov decision processes (POMDPs) have demonstrated that a good approximation of the value funct...
Masoumeh T. Izadi, Doina Precup, Danielle Azar