scholarly journals A General Framework for Agglomerative Hierarchical Clustering Algorithms

Author(s):  
R.J. Gil-Garcia ◽  
J.M. Badia-Contelles ◽  
A. Pons-Porrata
Mathematics ◽  
2021 ◽  
Vol 9 (4) ◽  
pp. 370
Author(s):  
Shuangsheng Wu ◽  
Jie Lin ◽  
Zhenyu Zhang ◽  
Yushu Yang

The fuzzy clustering algorithm has become a research hotspot in many fields because of its better clustering effect and data expression ability. However, little research focuses on the clustering of hesitant fuzzy linguistic term sets (HFLTSs). To fill in the research gaps, we extend the data type of clustering to hesitant fuzzy linguistic information. A kind of hesitant fuzzy linguistic agglomerative hierarchical clustering algorithm is proposed. Furthermore, we propose a hesitant fuzzy linguistic Boole matrix clustering algorithm and compare the two clustering algorithms. The proposed clustering algorithms are applied in the field of judicial execution, which provides decision support for the executive judge to determine the focus of the investigation and the control. A clustering example verifies the clustering algorithm’s effectiveness in the context of hesitant fuzzy linguistic decision information.


2021 ◽  
Vol 19 ◽  
pp. 310-320
Author(s):  
Suboh Alkhushayni ◽  
Taeyoung Choi ◽  
Du’a Alzaleq

This work aims to expand the knowledge of the area of data analysis through both persistence homology, as well as representations of directed graphs. To be specific, we looked for how we can analyze homology cluster groups using agglomerative Hierarchical Clustering algorithms and methods. Additionally, the Wine data, which is offered in R studio, was analyzed using various cluster algorithms such as Hierarchical Clustering, K-Means Clustering, and PAM Clustering. The goal of the analysis was to find out which cluster's method is proper for a given numerical data set. By testing the data, we tried to find the agglomerative hierarchical clustering method that will be the optimal clustering algorithm among these three; K-Means, PAM, and Random Forest methods. By comparing each model's accuracy value with cultivar coefficients, we came with a conclusion that K-Means methods are the most helpful when working with numerical variables. On the other hand, PAM clustering and Gower with random forest are the most beneficial approaches when working with categorical variables. All these tests can determine the optimal number of clustering groups, given the data set, and by doing the proper analysis. Using those the project, we can apply our method to several industrial areas such that clinical, business, and others. For example, people can make different groups based on each patient who has a common disease, required therapy, and other things in the clinical society. Additionally, for the business area, people can expect to get several clustered groups based on the marginal profit, marginal cost, or other economic indicators.


Author(s):  
Emna Fendri ◽  
Najla Bouarada Ghrab ◽  
Mohamed Hammami

Abnormal event detection has attracted great research attention in video surveillance. In this paper, the authors presented a robust method of trajectories clustering for abnormal event detection. This method is based on two layers and benefits from two well-known clustering algorithms: the agglomerative hierarchical clustering and the k-means clustering. Facing to the challenges related to the trajectories, e.g., different sizes, the authors introduce a preprocessing step to unify their sizes and reduce their dimensionality. The experimental results show the performance and accuracy of their proposed method.


2017 ◽  
Vol 5 (4) ◽  
pp. 1-18
Author(s):  
Emna Fendri ◽  
Najla Bouarada Ghrab ◽  
Mohamed Hammami

Abnormal event detection has attracted great research attention in video surveillance. In this paper, the authors presented a robust method of trajectories clustering for abnormal event detection. This method is based on two layers and benefits from two well-known clustering algorithms: the agglomerative hierarchical clustering and the k-means clustering. Facing to the challenges related to the trajectories, e.g., different sizes, the authors introduce a preprocessing step to unify their sizes and reduce their dimensionality. The experimental results show the performance and accuracy of their proposed method.


2020 ◽  
Vol 9 (4) ◽  
pp. 887
Author(s):  
Suboh Alkhushayni ◽  
Taeyoung Choi ◽  
Du'a Alzaleq

This work aims to expand the knowledge of the area of data analysis through persistence homology and representations of directed graphs. To be specific, we looked for how we can analyze homology cluster groups using agglomerative Hierarchical Clustering algorithms and methods. Additionally, the Wine data, which is offered in R studio, was analyzed using various cluster algorithms such as Hierarchical Clustering, K-Means Clustering, and PAM Clustering. The goal of the analysis was to find out which cluster's method is proper for a given numerical dataset. We tried to find the agglomerative hierarchical clustering method by testing the data that will be the optimal clustering algorithm among these three; K-Means, PAM, and Random Forest methods. By comparing each model's accuracy value with cultivar coefficients, we concluded that K-Means methods are the most helpful when working with numerical variables. On the other hand, PAM clustering and Gower with Random Forest are the most beneficial approaches when using categorical variables. These tests can determine the optimal number of clustering groups, given the data set, and by doing the proper analysis. Using those the project, we can apply our method to several industrial areas such that clinical, business, and others. For example, people can make different groups based on each patient who has a common disease, required therapy, and other things in the clinical society. Additionally, people can expect to get several clustered groups based on the marginal profit, marginal cost, or other economic indicators for the business area.


Sign in / Sign up

Export Citation Format

Share Document