scispace - formally typeset
Search or ask a question
Topic

Dunn index

About: Dunn index is a research topic. Over the lifetime, 150 publications have been published within this topic receiving 24021 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: In this article, the Euclidean distance, the dynamic time warping (DTW) and the generalized summed discrete Frechet dissimilarity were implemented with three linkage strategies ("average," "complete," and "Ward").
Abstract: BACKGROUND Obstructive sleep apnea (OSA) is a chronic disease characterized by recurrent pharyngeal collapses during sleep. In most severe cases, continuous positive airway pressure (CPAP) consists in keeping the airways open by administering mild air pressure. This treatment faces adherence issues. OBJECTIVES Eight hundred and forty-eight subjects were equipped with CPAP prescribed at the Grenoble University Hospital between 2016 and 2018. Their daily CPAP uses have been recorded during the first 3 months. Our aim is to cluster these adherence time series. With hierarchical agglomerative clustering, we focused on the choices of the dissimilarity measure and the internal cluster validation index (CVI). METHODS The Euclidean distance, the dynamic time warping (DTW) and the generalized summed discrete Frechet dissimilarity were implemented with three linkage strategies ("average," "complete," and "Ward"). The performances of each method (dissimilarity and linkage) were evaluated on a simulation study through the adjusted Rand index (ARI). The Ward linkage with DTW dissimilarity provided the best ARI. Then six different internal CVIs (Silhouette, Calinski Harabasz, Davies Bouldin, Modified Davies Bouldin, Dunn, and COP) were compared on their ability to choose the best number of clusters. The Dunn index beat the others. RESULTS CPAP data were clustered with the Ward linkage, the DTW dissimilarity and the Dunn index. It identified six clusters, from a cluster of patients (N = 29 subjects) whose stopped the therapy early on to a cluster (N = 105) with increasing adherence over time. Other clusters were extremely good users (N = 151), good users (N = 150), moderate users (N = 235), and poor adherers (N = 178).

4 citations

Journal ArticleDOI
Tzu-Fu Chiu1
TL;DR: A modified method (IPC-based clustering) has been proposed and applied to strategic planning and suggested strategies for companies have been generated for assisting the decision-making of top management.
Abstract: In order to exploit the professional knowledge of the patent office examiners (implied in the IPC assignment) in the clustering process, a modified method (IPC-based clustering) has been proposed and applied to strategic planning. The performance of the proposed method was evaluated by comparison with two existing methods: K-Means and TwoStep of SPSS Clementine using the DB index and Dunn index. Afterwards, the IPC-based clustering (accompanied by link analysis) was applied to a practical domain (strategic planning) using the patent data of thin-film solar cell, so as to understand the possibility of implementing it in the management areas. According to the experimental results, the technical topics have been identified, and suggested strategies for companies have been generated for assisting the decision-making of top management. Finally, in future work the proposed method will be employed to other kinds of patent data to test its performance and applied to other practical domains to examine its feasibility in different management areas.

4 citations

Proceedings ArticleDOI
01 Oct 2018
TL;DR: Results show that a two-cluster characterization of the kinematic knee data in each plane is quite effective and that the men and women knee patterns are balanced between the two clusters and, for 80% of participants, the right and left knees are in the same cluster.
Abstract: The purpose of this study is to investigate data clustering to determine representative patterns in three-dimensional (3D) knee kinematic data measurements. Kinematic data are high-dimensional vectors to describe the temporal variations of the three fundamental angles of knee rotation during a walking cycle, namely the abduction/adduction angle, with respect to the frontal plane, the flexion/extension angle, with respect to the sagittal plane, and internal/external angle, with respect to the transverse plane. To offset the curse of dimensionality, inherent to high dimensional data pattern analysis, the method reduces dimensionality by isometric mapping without affecting information content. The data thus simplified is then clustered by the DBSCAN algorithm. The method has been tested on a large database of 165 healthy knee kinematic data measurements. Clusters are validated in terms of the silhouette index, the Dunn index, and connectivity. Results show that a two-cluster characterization of the kinematic knee data in each plane is quite effective. A further clinical investigation shows that the men and women knee patterns are balanced between the two clusters and, for 80% of participants, the right and left knees are in the same cluster.

4 citations

Journal ArticleDOI
31 Mar 2021
TL;DR: The best cluster analysis was Agglomerative Ward Linkage which produced three clusters which shall be able to make a better policies of welfare based on the dominant indicators found in each city.
Abstract: The National Medium Term Development Plan 2020-2024 states that one of the visions of national development is to accelerate the distribution of welfare and justice. Cluster analysis is analysis that grouping of objects into several smaller groups where the objects in one group have similar characteristics. This study was conducted to find the best clustering method and to classify cities based on the level of welfare in Java. In this study, the cluster analysis that used was hard clustering such as K-Means, K-Medoids (PAM and CLARA), and Hierarchical Agglomerative as well as soft clustering such as Fuzzy C Means. This study use elbow method, silhouette method, and gap statistics to determine the optimal number of clusters. From the evaluation results of the silhouette coefficient, dunn index, connectivity coefficient, and Sw/Sb ratio, it was found that the best cluster analysis was Agglomerative Ward Linkage which produced three clusters. The first cluster consists of 27 cities with moderate welfare, the second cluster consists of 16 cities with high welfare, the third cluster consists of 76 cities with low welfare. With the best clustering results, the government of cities in Java shall be able to make a better policies of welfare based on the dominant indicators found in each cluster.

4 citations

Journal Article
TL;DR: Large data sets of the accidents of a manufacturing and industrial unit have been studied by applying clustering methods and association rules as data mining methods, finding optimum number of clusters has been determined.
Abstract: Uncertain and stochastic states have been always taken into consideration in the fields of risk management and accident, like other fields of industrial engineering, and have made decision making difficult and complicated for managers in corrective action selection and control measure approach. In this research, huge data sets of the accidents of a manufacturing and industrial unit have been studied by applying clustering methods and association rules as data mining methods. First, the accident data was briefly studied. Then, effective features in an accident were selected while consulting with industry experts and considering production process information. By performing clustering method, data was divided into separate clusters and by using Dunn Index as validator of clustering, optimum number of clusters has been determined. In the next stage, by using the Apriori Algorithm as one of association rule methods, the relations between these fields were identified and the association rules among them were extracted and analyzed. Since managers need precise information for decision making, data mining methods, when to be used properly, may act as a supporting system.

4 citations


Network Information
Related Topics (5)
Feature selection
41.4K papers, 1M citations
70% related
Support vector machine
73.6K papers, 1.7M citations
69% related
Genetic algorithm
67.5K papers, 1.2M citations
68% related
Cluster analysis
146.5K papers, 2.9M citations
68% related
Web service
57.6K papers, 989K citations
66% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202120
202028
201917
201813
201710
201611