2040 search results - page 167 / 408 » Approximate Expectation Maximization |
128
Voted
ICTAI
2006
IEEE
15 years 9 months ago
2006
IEEE
We propose two Euclidean minimum spanning tree based clustering algorithms — one a k-constrained, and the other an unconstrained algorithm. Our k-constrained clustering algorith...
110
Voted
SETN
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. This paper elaborates on an efficient approach for clustering discrete data by incrementally building multinomial mixture models through likelihood maximization using the...
118
Voted
IPSN
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. Numerous factors contribute to errors in sensor measurements. In order to be useful, any sensor device must be calibrated to adjust its accuracy against the expected meas...
113
click to vote
WSC
2007
15 years 5 months ago
2007
In this paper we introduce the completed unit algorithm (CU-AL), a probabilistic scheduling methodology for repetitive projects. The algorithm has two main advantages, simplicity ...
117
Voted
CIBCB
2006
IEEE
15 years 5 months ago
2006
IEEE
In recent years, unsupervised gene (feature) selection has become an integral part of microarray analysis because of the large number of genes and complexity in biological systems....