TCLUST: Trimming Approach of Robust Clustering Method
| Autor: | Robiah Adnan, Muhamad Alias Md. Jedi |
|---|---|
| Rok vydání: | 2014 |
| Předmět: |
Group (mathematics)
General Mathematics General Physics and Astronomy General Chemistry Function (mathematics) Measure (mathematics) General Biochemistry Genetics and Molecular Biology Constraint (information theory) Combinatorics Scatter matrix Trimming General Agricultural and Biological Sciences Cluster analysis Algorithm Eigenvalues and eigenvectors Mathematics |
| Zdroj: | Malaysian Journal of Fundamental and Applied Sciences. 8 |
| ISSN: | 2289-599X 2289-5981 |
| Popis: | TCLUST is a method in statistical clustering technique which is based on modification of trimmed k-means clustering algorithm. It is called “crisp” clustering approach because the observation is can be eliminated or assigned to a group. TCLUST strengthen the group assignment by putting constraint to the cluster scatter matrix. The emphasis in this paper is to restrict on the eigenvalues, λ of the scatter matrix. The idea of imposing constraints is to maximize the log-likelihood function of spurious-outlier model. A review of different robust clustering approach is presented as a comparison to TCLUST methods. This paper will discuss the nature of TCLUST algorithm and how to determine the number of cluster or group properly and measure the strength of group assignment. At the end of this paper, R-package on TCLUST implement the types of scatter restriction, making the algorithm to be more flexible for choosing the number of clusters and the trimming proportion. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|