A parameter estimation algorithm of the continuous hidden Markov model isintroduced and the rigorous proof of its convergence is also included. The algorithm uses theViterbi algorithm instead of K-means clustering use...A parameter estimation algorithm of the continuous hidden Markov model isintroduced and the rigorous proof of its convergence is also included. The algorithm uses theViterbi algorithm instead of K-means clustering used in the segmental K-means algorithm to determineoptimal state and branch sequences. Based on the optimal sequence, parameters are estimated withmaximum-likelihood as objective functions. Comparisons with the traditional Baum-Welch and segmentalK-means algorithms on various aspects, such as optimal objectives and fundamentals, are made. Allthree algorithms are applied to face recognition. Results indicate that the proposed algorithm canreduce training time with comparable recognition rate and it is least sensitive to the training set.So its average performance exceeds the other two.展开更多
The estimation of generalized exponential distribution based on progressive censoring with binomial removals is presented, where the number of units removed at each failure time follows a binomial distribution. Maximu...The estimation of generalized exponential distribution based on progressive censoring with binomial removals is presented, where the number of units removed at each failure time follows a binomial distribution. Maximum likelihood estimators of the parameters and their confidence intervals are derived. The expected time required to complete the life test under this censoring scheme is investigated. Finally, the numerical examples are given to illustrate some theoretical results by means of Monte-Carlo simulation.展开更多
文摘A parameter estimation algorithm of the continuous hidden Markov model isintroduced and the rigorous proof of its convergence is also included. The algorithm uses theViterbi algorithm instead of K-means clustering used in the segmental K-means algorithm to determineoptimal state and branch sequences. Based on the optimal sequence, parameters are estimated withmaximum-likelihood as objective functions. Comparisons with the traditional Baum-Welch and segmentalK-means algorithms on various aspects, such as optimal objectives and fundamentals, are made. Allthree algorithms are applied to face recognition. Results indicate that the proposed algorithm canreduce training time with comparable recognition rate and it is least sensitive to the training set.So its average performance exceeds the other two.
基金supported by the National Natural Science Foundation of China(70471057)
文摘The estimation of generalized exponential distribution based on progressive censoring with binomial removals is presented, where the number of units removed at each failure time follows a binomial distribution. Maximum likelihood estimators of the parameters and their confidence intervals are derived. The expected time required to complete the life test under this censoring scheme is investigated. Finally, the numerical examples are given to illustrate some theoretical results by means of Monte-Carlo simulation.
