Sciweavers

3096 search results - page 24 / 620
» Theory and Use of the EM Algorithm
Sort
View
CVPR
2008
IEEE
16 years 3 months ago
Articulated shape matching using Laplacian eigenfunctions and unsupervised point registration
Matching articulated shapes represented by voxel-sets reduces to maximal sub-graph isomorphism when each set is described by a weighted graph. Spectral graph theory can be used to...
Diana Mateus, Radu Horaud, David Knossow, Fabio Cu...
CLASSIFICATION
2007
105views more  CLASSIFICATION 2007»
15 years 1 months ago
Bayesian Regularization for Normal Mixture Estimation and Model-Based Clustering
Normal mixture models are widely used for statistical modeling of data, including cluster analysis. However maximum likelihood estimation (MLE) for normal mixtures using the EM al...
Chris Fraley, Adrian E. Raftery
ICDM
2003
IEEE
99views Data Mining» more  ICDM 2003»
15 years 6 months ago
Scalable Model-based Clustering by Working on Data Summaries
The scalability problem in data mining involves the development of methods for handling large databases with limited computational resources. In this paper, we present a two-phase...
Huidong Jin, Man Leung Wong, Kwong-Sak Leung
WECWIS
2005
IEEE
137views ECommerce» more  WECWIS 2005»
15 years 7 months ago
Using Singular Value Decomposition Approximation for Collaborative Filtering
Singular Value Decomposition (SVD), together with the Expectation-Maximization (EM) procedure, can be used to find a low-dimension model that maximizes the loglikelihood of obser...
Sheng Zhang, Weihong Wang, James Ford, Fillia Make...
IPMI
2009
Springer
16 years 2 months ago
Estimation of Inferential Uncertainty in Assessing Expert Segmentation Performance from STAPLE
The evaluation of the quality of segmentations of an image, and the assessment of intra- and inter-expert variability in segmentation performance, has long been recognized as a dic...
Olivier Commowick, Simon K. Warfield