Sciweavers

3110 search results - page 221 / 622
» On the initialization of the DNMF algorithm
Sort
View
PCI
2005
Springer
16 years 2 days ago
Gossip-Based Greedy Gaussian Mixture Learning
Abstract. It has been recently demonstrated that the classical EM algorithm for learning Gaussian mixture models can be successfully implemented in a decentralized manner by resort...
Nikos A. Vlassis, Yiannis Sfakianakis, Wojtek Kowa...
SIGIR
2004
ACM
16 years 5 hour ago
Sentence completion
We discuss a retrieval model in which the task is to complete a sentence, given an initial fragment, and given an application specific document collection. This model is motivate...
Korinna Grabski, Tobias Scheffer
FQAS
2004
Springer
126views Database» more  FQAS 2004»
15 years 12 months ago
Cluster Characterization through a Representativity Measure
Clustering is an unsupervised learning task which provides a decomposition of a dataset into subgroups that summarize the initial base and give information about its structure. We ...
Marie-Jeanne Lesot, Bernadette Bouchon-Meunier
ILP
2003
Springer
15 years 11 months ago
Applying Theory Revision to the Design of Distributed Databases
This work presents the application of theory revision to the design of distributed databases to automatically revise a heuristic-based algorithm (called analysis algorithm) through...
Fernanda Araujo Baião, Marta Mattoso, Jude ...
SWAT
2010
Springer
282views Algorithms» more  SWAT 2010»
15 years 11 months ago
Better Bounds on Online Unit Clustering
Unit Clustering is the problem of dividing a set of points from a metric space into a minimal number of subsets such that the points in each subset are enclosable by a unit ball. W...
Martin R. Ehmsen, Kim S. Larsen