5209 search results - page 823 / 1042 » Multiobjective Data Clustering |
143
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We define a novel, basic, unsupervised learning problem learning the the lowest density homogeneous hyperplane separator of an unknown probability distribution. This task...
169
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The k-means method is a widely used clustering algorithm. One of its distinguished features is its speed in practice. Its worst-case running-time, however, is exponential, leaving...
184
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
One property of networks that has received comparatively little attention is hierarchy, i.e., the property of having vertices that cluster together in groups, which then join to f...
169
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. We propose and analyze a new vantage point for the learning of mixtures of Gaussians: namely, the PAC-style model of learning probability distributions introduced by Kear...
173
click to vote
ENDM
2006
15 years 6 months ago
2006
We consider a dynamic planning problem for paratransit transportation. The focus is on a decision to take one day ahead: which requests to serve with own vehicles, and which reque...