Cargando…
The next‐generation K‐means algorithm
Typically, when referring to a model‐based classification, the mixture distribution approach is understood. In contrast, we revive the hard‐classification model‐based approach developed by Banfield and Raftery (1993) for which K‐means is equivalent to the maximum likelihood (ML) estimation. The next...
Autor principal: | Demidenko, Eugene |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Wiley Subscription Services, Inc., A Wiley Company
2018
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6062903/ https://www.ncbi.nlm.nih.gov/pubmed/30073045 http://dx.doi.org/10.1002/sam.11379 |
Ejemplares similares
-
The global Minmax k-means algorithm
por: Wang, Xiaoyan, et al.
Publicado: (2016) -
K-Mer Spectrum-Based Error Correction Algorithm for Next-Generation Sequencing Data
por: AlEisa, Hussah N., et al.
Publicado: (2022) -
Reducing the Time Requirement of k-Means Algorithm
por: Osamor, Victor Chukwudi, et al.
Publicado: (2012) -
Blockchain and K-Means Algorithm for Edge AI Computing
por: Qiu, Xiaotian, et al.
Publicado: (2022) -
Finding reproducible cluster partitions for the k-means algorithm
por: Lisboa, Paulo JG, et al.
Publicado: (2013)