Sciweavers

274 search results - page 8 / 55
» The Information Bottleneck EM Algorithm
Sort
View
NIPS
2007
13 years 9 months ago
Convex Relaxations of Latent Variable Training
We investigate a new, convex relaxation of an expectation-maximization (EM) variant that approximates a standard objective while eliminating local minima. First, a cautionary resu...
Yuhong Guo, Dale Schuurmans
ICDM
2003
IEEE
99views Data Mining» more  ICDM 2003»
14 years 23 days 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
CLASSIFICATION
2007
105views more  CLASSIFICATION 2007»
13 years 7 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
ATAL
2007
Springer
14 years 1 months ago
Robust coordination to sustain throughput of an unstable agent network
We present a multi-agent coordination technique to maintain throughput of a large-scale agent network system in the face of failures of agents. Failures do not just deteriorate th...
Rajesh Gautam, Kazuo Miyashita
ALMOB
2006
155views more  ALMOB 2006»
13 years 7 months ago
Refining motifs by improving information content scores using neighborhood profile search
The main goal of the motif finding problem is to detect novel, over-represented unknown signals in a set of sequences (e.g. transcription factor binding sites in a genome). The mo...
Chandan K. Reddy, Yao-Chung Weng, Hsiao-Dong Chian...