Sciweavers

1603 search results - page 211 / 321
» Universal Confidence Sets for Solutions of Optimization Prob...
Sort
View
NIPS
2001
15 years 7 months ago
Spectral Relaxation for K-means Clustering
The popular K-means clustering partitions a data set by minimizing a sum-of-squares cost function. A coordinate descend method is then used to nd local minima. In this paper we sh...
Hongyuan Zha, Xiaofeng He, Chris H. Q. Ding, Ming ...
AAMAS
2011
Springer
15 years 1 months ago
Long-term fairness with bounded worst-case losses
How does one repeatedly choose actions so as to be fairest to the multiple beneficiaries of those actions? We examine approaches to discovering sequences of actions for which the...
Gabriel Catalin Balan, Dana Richards, Sean Luke
ICIP
2003
IEEE
16 years 8 months ago
A Bayesian framework for Gaussian mixture background modeling
Background subtraction is an essential processing component for many video applications. However, its development has largely been application driven and done in ad hoc manners. I...
Dar-Shyang Lee, Jonathan J. Hull, Berna Erol
DATE
2007
IEEE
127views Hardware» more  DATE 2007»
16 years 24 days ago
A calculator for Pareto points
This paper presents the Pareto Calculator, a tool for compositional computation of Pareto points, based on the algebra of Pareto points. The tool is a useful instrument for multidi...
Marc Geilen, Twan Basten
ADMA
2006
Springer
172views Data Mining» more  ADMA 2006»
16 years 13 days ago
Experimental Comparison of Feature Subset Selection Using GA and ACO Algorithm
Abstract. Practical pattern classification and knowledge discovery problems require selecting a useful subset of features from a much larger set to represent the patterns to be cl...
Keunjoon Lee, Jinu Joo, Jihoon Yang, Vasant Honava...