✦ LIBER ✦

Iterative convex I-projection algorithms for maximum entropy and minimum cross-entropy computations

✍ Scribed by Burr, R.L.

Book ID: 114539929
Publisher: IEEE
Year: 1989
Tongue: English
Weight: 414 KB
Volume: 35
Category: Article
ISSN: 0018-9448
DOI: 10.1109/18.30998

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An iterative algorithm for minimum cross

An iterative algorithm for minimum cross entropy thresholding

✍ C.H. Li; P.K.S. Tam 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 643 KB

Adaptive Online Learning Algorithms for

Adaptive Online Learning Algorithms for Blind Separation: Maximum Entropy and Minimum Mutual Information

✍ Yang, Howard Hua; Amari, Shun-ichi 📂 Article 📅 1997 🏛 MIT Press 🌐 English ⚖ 533 KB

A regularized minimum cross-entropy algo

A regularized minimum cross-entropy algorithm on mixtures of experts for time series prediction and curve detection

✍ Zhiwu Lu 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 252 KB

The well-known mixtures of experts (ME) model has been used in many different areas to account for nonlinearities and other complexities in the data, such as time series prediction. We usually train ME model by expectation maximization (EM) algorithm for maximum likelihood learning. However, the num

[IEEE First International Conference on

[IEEE First International Conference on Innovative Computing, Information and Control - Volume I (ICICIC'06) - Beijing, China (30-01 Aug. 2006)] First International Conference on Innovative Computing, Information and Control - Volume I (ICICIC'06) - Minimum Entropy Control Algorithm for General Dynamic Stochastic Systems

✍ Jianfang Jia, ; Taiyuan Liu, ; Hong Yue, ; Hong Wang, 📂 Article 📅 2006 🏛 IEEE ⚖ 729 KB