Robust Maximum Entropy Clustering Algorithm RMEC and Its Outlier Labeling

Deng Zhaohong,Wang Shitong,Wu Xisheng,Hu Dewen

Strategic Study of CAE ›› 2004, Vol. 6 ›› Issue (9) : 38 -45.

PDF (4176KB)
Strategic Study of CAE ›› 2004, Vol. 6 ›› Issue (9) : 38 -45.
Academic Papers

Robust Maximum Entropy Clustering Algorithm RMEC and Its Outlier Labeling

Author information +
History +
PDF (4176KB)

Abstract

In this paper, the novel robust maximum entropy clustering algorithm RMEC, as the improved version of the maximum entropy algorithm MEC, is presented to overcome its drawbacks: very sensitive to outliers and uneasy to label them. With the introduction of Vapnik's ε-insensitive loss function and the new weight factors, the new objective function is re-constructed, and consequently, its new update rules are derived according to the Lagrangian optimization theory. Compared with algorithm MEC, the main contributions of algorithm RMEC exist in its much better robustness for outliers and the fact that it can effectively label outliers in the dataset using the obtained weight factors. The experimental results demonstrate its superior performance in enhancing the robustness and labeling outliers in the dataset.

Keywords

entropy / clustering / robustness / outliers / ε-insensitive loss function / weight factors

Cite this article

Download citation ▾
Deng Zhaohong,Wang Shitong,Wu Xisheng,Hu Dewen. Robust Maximum Entropy Clustering Algorithm RMEC and Its Outlier Labeling. Strategic Study of CAE, 2004, 6(9): 38-45 DOI:

登录浏览全文

4963

注册一个新账户 忘记密码

References

AI Summary AI Mindmap
PDF (4176KB)

254

Accesses

0

Citation

Detail

Sections
Recommended

AI思维导图

/