2015
DOI: 10.1016/j.neucom.2015.01.081
|View full text |Cite
|
Sign up to set email alerts
|

Vector quantization based on ε-insensitive mixture models

Abstract: a b s t r a c tLaplacian mixture models have been used to deal with heavy-tailed distributions in data modeling problems. We consider an extension of Laplacian mixture models, which consists of ε-insensitive component distributions. An EM-type learning algorithm is derived for the maximum likelihood estimation of the proposed mixture model. The E-step is formulated in the usual way, while the M-step is formulated as the dual optimization problem instead of the primal optimization problem.Additionally, the conv… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2016
2016
2021
2021

Publication Types

Select...
3
2

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 14 publications
0
3
0
Order By: Relevance
“…The flow of the proof is almost the same as the proof of Theorem 1. We show that the objective function (4) monotonically decreases when the k-th cluster center θ k is newly updated toθ k by (24). More specifically, we prove that,L f (θ k ) ≥L f (θ k ), whereL f (θ k ) is the sum of the terms related to θ k in (4), that is,L…”
Section: Appendix B Update Rules With Newton's Methodsmentioning
confidence: 68%
See 2 more Smart Citations
“…The flow of the proof is almost the same as the proof of Theorem 1. We show that the objective function (4) monotonically decreases when the k-th cluster center θ k is newly updated toθ k by (24). More specifically, we prove that,L f (θ k ) ≥L f (θ k ), whereL f (θ k ) is the sum of the terms related to θ k in (4), that is,L…”
Section: Appendix B Update Rules With Newton's Methodsmentioning
confidence: 68%
“…That is, the algorithm converges in finite iterations for threshold δ. The proof of Theorem 1 is a generalization of the monotonic decreasing property of ei-means (ε = 0) proposed in [24], which corresponds to the case where f (z) = √ z and d φ (x, θ) = x − θ 2 . The proof of Theorem 1 is also interpreted by the Majorization-Minimization algorithm [25].…”
Section: Corollarymentioning
confidence: 98%
See 1 more Smart Citation