Cluster Detection in Noisy Environment by Using the Modified EM Algorithm
The paper studies the problem of a cluster detection in the noisy environment. The solution of this problem is based on the well known Expectation Maximization (EM) algorithm. By utilizing the Mahalanobis distance, and modifying the hidden variable, the rejection procedure is constructed so that it omits data from calculation of the current iteration step. Thus we construct the adaptive framework for solving the above problem. Several numerical examples are presented to illustrate the proposed algorithm.
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).