Accelerating EM Missing Data Filling Algorithm Based on the K-Means

In the whole process of data mining, the EM algorithm is widely applied to dealing with incomplete data for its numerical stability, simplicity of implementation, reliable global convergence. the main disadvantage of the EM is slow convergence speed, the algorithm is highly dependent on the initial...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2018 4th Annual International Conference on Network and Information Systems for Computers (ICNISC) s. 401 - 406
Hlavní autoři: Hua-Yan, SUN, Ye-Li, Li, Yun-Fei, Zi, Xu, Han
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.04.2018
Témata:
Acceleration
Classification algorithms
Clustering algorithms
Convergence
Convergence speed
EM algorithm
Filling
Graphics
Incremental EM algorithm
K-means algorithm clustering
Missing data filling
Partitioning algorithms
Stable clustering
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In the whole process of data mining, the EM algorithm is widely applied to dealing with incomplete data for its numerical stability, simplicity of implementation, reliable global convergence. the main disadvantage of the EM is slow convergence speed, the algorithm is highly dependent on the initial value of the option, In this paper, the clustering results use K-means algorithm as the initial scope of EM algorithm, according to the different choice of different characteristics of mining purposes, then use incremental EM algorithm (IEM) step by step EM iterative refinement repeatedly, it obtains the optimal value of filling missing data quickly and efficiently. it is concluded that the optimal value of filling missing data experimental results show that the algorithm of this paper to speed up the convergence rate, strengthened the stability of clustering, data filling effect is remarkable. Keywords-recommendation systems; collaborative filtering; fuzzy equivalence; cause-effect clustering; threshold value; weighting
DOI:10.1109/ICNISC.2018.00088