paper-with-me

Papers

An Improved EM algorithm

2013-05-03 · Fu-qiang Chen

In this paper, we firstly give a brief introduction of expectation maximization (EM) algorithm, and then discuss the initial value sensitivity of expectation maximization algorithm. Subsequently, we give a short proof of EM's convergence. Then, we implement experiments with the expectation maximization algorithm (We implement all the experiments on Gaussion mixture model (GMM)). Our experiment with expectation maximization is performed in the following three cases: initialize randomly; initialize with result of K-means; initialize with result of K-medoids. The experiment result shows that expectation maximization algorithm depend on its initial state or parameters. And we found that EM initialized with K-medoids performed better than both the one initialized with K-means and the one initialized randomly.

📄 PDF Abstract BibTeX arXiv:1305.0626

Code (0)

등록된 구현이 없습니다.

Tasks

Sensitivity

Similar Papers 제목 키워드 기반

An Improved Dung Beetle Optimizer for Random Forest Optimization

2024-11-24 · Lianghao Tan, Xiaoyi Liu, Dong Liu, Shubing Liu 외

To improve the convergence speed and optimization accuracy of the Dung Beetle Optimizer (DBO), this paper proposes an improved algorithm based on circle mapping and longitudinal-horizontal crossover strategy (CICRDBO). F…

Binary ClassificationDiversityPosition

Adapting Improved Upper Confidence Bounds for Monte-Carlo Tree Search

2015-05-11 · Yun-Ching Liu, Yoshimasa Tsuruoka

The UCT algorithm, which combines the UCB algorithm and Monte-Carlo Tree Search (MCTS), is currently the most widely used variant of MCTS. Recently, a number of investigations into applying other bandit algorithms to MCT…

Optimization of Resource Service Composition in Cloud Manufacture Based on Improved Genetic and Ant Colony Algorithm

2022-02-01 · Advances in Intelligent Systems and Computing, Smart Innovation, Systems and Technologies 268 2022 2 · Wang Zhengcheng

Aiming at resource service composition optimization under cloud manufacturing, a service composition and optimization objective function model for cloud manufacturing resource based on quality of service was established…

Service Composition

An Improved Three-Weight Message-Passing Algorithm

2013-05-08 · Nate Derbinsky, José Bento, Veit Elser, Jonathan S. Yedidia

We describe how the powerful "Divide and Concur" algorithm for constraint satisfaction can be derived as a special case of a message-passing version of the Alternating Direction Method of Multipliers (ADMM) algorithm for…

An Improved Multi-Agent Algorithm for Cooperative and Competitive Environments by Identifying and Encouraging Cooperation among Agents

2025-08-19 · Junjie Qi, Siqi Mao, Tianyi Tan arxiv

We propose an improved algorithm by identifying and encouraging cooperative behavior in multi-agent environments. First, we analyze the shortcomings of existing algorithms in addressing multi-agent reinforcement learning…

Multi-agent Reinforcement Learning