Sciweavers

3143 search results - page 277 / 629
» Minimization of entropy functionals
Sort
View
NIPS
2007
15 years 6 months ago
Convex Clustering with Exemplar-Based Models
Clustering is often formulated as the maximum likelihood estimation of a mixture model that explains the data. The EM algorithm widely used to solve the resulting optimization pro...
Danial Lashkari, Polina Golland
DAGSTUHL
2000
15 years 6 months ago
Similarity Measure Computation of Convex Polyhedra Revisited
We study the computation of rotation-invariant similarity measures of convex polyhedra, based on Minkowski's theory of mixed volumes. To compute the similarity measure, a (mix...
Jos B. T. M. Roerdink, Henk Bekker
ICASSP
2010
IEEE
15 years 5 months ago
A convex relaxation for approximate maximum-likelihood 2D source localization from range measurements
This paper addresses the problem of locating a single source from noisy range measurements in wireless sensor networks. An approximate solution to the maximum likelihood location ...
Pinar Oguz-Ekim, João Pedro Gomes, Jo&atild...
EOR
2010
99views more  EOR 2010»
15 years 4 months ago
Min sum clustering with penalties
Traditionally, clustering problems are investigated under the assumption that all objects must be clustered. A shortcoming of this formulation is that a few distant objects, calle...
Refael Hassin, Einat Or
CSDA
2006
84views more  CSDA 2006»
15 years 4 months ago
Three-mode partitioning
The three-mode partitioning model is a clustering model for three-way three-mode data sets that implies a simultaneous partitioning of all three modes involved in the data. In the...
Jan Schepers, Iven Van Mechelen, Eva Ceulemans