scholarly journals A clustering algorithm for ipsative variables

DYNA ◽  
2019 ◽  
Vol 86 (211) ◽  
pp. 94-101
Author(s):  
Jesica Rubiano Moreno ◽  
Carlos Alonso Malaver ◽  
Samuel Nucamendi Guillén ◽  
Carlos López Hernández
Keyword(s):  
Clustering Algorithm ◽  
Data Distribution ◽  
Extensive Study ◽  
Clustering Method ◽  
Motivational Profiles ◽  
Random Groups

The aim of this study is to introduce a new clustering method for ipsatives variables. This  method can be used for nominals or ordinals variables for which responses must be mutually exclusive, and it is independent of data distribution. The proposed method is applied to outline motivational profiles for individuals based on a declared preferences set.  A case study is used to analyze the performance of the proposed algorithm by comparing proposed method results versus the PAM method. Results show that proposed method generate a better segmentation and differentiated groups. An extensive study was conducted to validate the performance clustering method against a set of random groups by clustering measures.

scholarly journals Exemplars can Reciprocate Principal Components

2021 ◽  
Vol 20 ◽  
pp. 30-38
Author(s):  
Kieran Greer
Keyword(s):  
Principal Components ◽  
Forest Fires ◽  
Clustering Algorithm ◽  
Family Type ◽  
Clustering Method ◽  
Tree Structures ◽  
Category Type

This paper presents a clustering algorithm that is an extension of the Category Trees algorithm. Category Trees is a clustering method that creates tree structures that branch on category type and not feature. The development in this paper is to consider a secondary order of clustering that is not the category to which the data row belongs, but the tree, representing a single classifier, that it is eventually clustered with. Each tree branches to store subsets of other categories, but the rows in those subsets may also be related. This paper is therefore concerned with looking at that second level of clustering between the category subsets, to try to determine if there is any consistency over it. It is argued that Principal Components may be a related and reciprocal type of structure, and there is an even bigger question about the relation between exemplars and principal components, in general. The theory is demonstrated using the Portugal Forest Fires dataset as a case study. The Category Trees are then combined with other Self-Organising algorithms from the author and it is suggested that they all belong to the same family type, which is an Entropy-style of classifier. Some analysis of classifier types is also presented.

Teknik Data Mining Dalam Clustering Produksi Susu Segar Di Indonesia Dengan Algoritma K-Means

2019 ◽  
Vol 1 (1) ◽  
pp. 31-39
Author(s):  
Ilham Safitra Damanik ◽  
Sundari Retno Andani ◽  
Dedi Sehendro
Keyword(s):  
Data Mining ◽  
Milk Production ◽  
Clustering Algorithm ◽  
Clustering Method ◽  
Data Mining Techniques ◽  
Low Level ◽  
Fresh Milk ◽  
Nutritional Needs ◽  
High Level ◽  
Level Cluster

Milk is an important intake to meet nutritional needs. Both consumed by children, and adults. Indonesia has many producers of fresh milk, but it is not sufficient for national milk needs. Data mining is a science in the field of computers that is widely used in research. one of the data mining techniques is Clustering. Clustering is a method by grouping data. The Clustering method will be more optimal if you use a lot of data. Data to be used are provincial data in Indonesia from 2000 to 2017 obtained from the Central Statistics Agency. The results of this study are in Clusters based on 2 milk-producing groups, namely high-dairy producers and low-milk producing regions. From 27 data on fresh milk production in Indonesia, two high-level provinces can be obtained, namely: West Java and East Java. And 25 others were added in 7 provinces which did not follow the calculation of the K-Means Clustering Algorithm, including in the low level cluster.

Transfer of knowledge in chemical equipment reliability

1989 ◽  
Vol 54 (10) ◽  
pp. 2692-2710 ◽  
Author(s):  
František Babinec ◽  
Mirko Dohnal
Keyword(s):  
Fuzzy Clustering ◽  
Clustering Algorithm ◽  
Chemical Equipment ◽  
Transfer Of Knowledge ◽  
Equipment Reliability ◽  
Fuzzy Clustering Algorithm

The problem of transformation of data on the reliability of chemical equipment obtained in particular conditions to other equipment in other conditions is treated. A fuzzy clustering algorithm is defined for this problem. The method is illustrated on a case study.

scholarly journals Coupling Fuzzy Multi-Criteria Decision-Making and Clustering Algorithm for MSW Landfill Site Selection (Case Study: Lanzhou, China)

2021 ◽  
Vol 10 (6) ◽  
pp. 403
Author(s):  
Jiamin Liu ◽  
Yueshi Li ◽  
Bin Xiao ◽  
Jizong Jiao
Keyword(s):  
Decision Making ◽  
Clustering Algorithm ◽  
Fuzzy Membership Function ◽  
Multi Criteria Decision Making ◽  
Landfill Site Selection ◽  
Spatial Distribution Characteristics ◽  
Criteria Weights ◽  
Spatial Decision Making ◽  
Complex Decision

The siting of Municipal Solid Waste (MSW) landfills is a complex decision process. Existing siting methods utilize expert scores to determine criteria weights, however, they ignore the uncertainty of data and criterion weights and the efficacy of results. In this study, a coupled fuzzy Multi-Criteria Decision-Making (MCDM) approach was employed to site landfills in Lanzhou, a semi-arid valley basin city in China, to enhance the spatial decision-making process. Primarily, 21 criteria were identified in five groups through the Delphi method at 30 m resolution, then criteria weights were obtained by DEMATEL and ANP, and the optimal fuzzy membership function was determined for each evaluation criterion. Combined with GIS spatial analysis and the clustering algorithm, candidate sites that satisfied the landfill conditions were identified, and the spatial distribution characteristics were analyzed. These sites were subsequently ranked utilizing the MOORA, WASPAS, COPRAS, and TOPSIS methods to verify the reliability of the results by conducting sensitivity analysis. This study is different from the previous research that applied the MCDM approach in that fuzzy MCDM for weighting criteria is more reliable compared to the other common methods.

scholarly journals A hierarchical clustering method for random intervals based on a similarity measure

2021 ◽  
Author(s):  
Ana Belén Ramos-Guajardo
Keyword(s):  
Hierarchical Clustering ◽  
Similarity Measure ◽  
Clustering Algorithm ◽  
Real Life ◽  
Stopping Criterion ◽  
Clustering Method ◽  
Bootstrap Test ◽  
Empirical Performance ◽  
Random Intervals ◽  
Expected Values

AbstractA new clustering method for random intervals that are measured in the same units over the same group of individuals is provided. It takes into account the similarity degree between the expected values of the random intervals that can be analyzed by means of a two-sample similarity bootstrap test. Thus, the expectations of each pair of random intervals are compared through that test and a p-value matrix is finally obtained. The suggested clustering algorithm considers such a matrix where each p-value can be seen at the same time as a kind of similarity between the random intervals. The algorithm is iterative and includes an objective stopping criterion that leads to statistically similar clusters that are different from each other. Some simulations to show the empirical performance of the proposal are developed and the approach is applied to two real-life situations.

A Novel Locality Sensitive K-Means Clustering Algorithm based on Core Clusters

2013 ◽  
Vol 321-324 ◽  
pp. 1939-1942
Author(s):  
Lei Gu
Keyword(s):  
Clustering Algorithm ◽  
Experimental Results ◽  
Clustering Method ◽  
Neighborhood Graph ◽  
The Core ◽  
Random Samples

The locality sensitive k-means clustering method has been presented recently. Although this approach can improve the clustering accuracies, it often gains the unstable clustering results because some random samples are employed for the initial centers. In this paper, an initialization method based on the core clusters is used for the locality sensitive k-means clustering. The core clusters can be formed by constructing the σ-neighborhood graph and their centers are regarded as the initial centers of the locality sensitive k-means clustering. To investigate the effectiveness of our approach, several experiments are done on three datasets. Experimental results show that our proposed method can improve the clustering performance compared to the previous locality sensitive k-means clustering.

A TRIPARTITE CLUSTERING ANALYSIS ON MICRORNA, GENE AND DISEASE MODEL

2012 ◽  
Vol 10 (01) ◽  
pp. 1240007 ◽  
Author(s):  
CHENGCHENG SHEN ◽  
YING LIU
Keyword(s):  
Gene Expression ◽  
Clustering Algorithm ◽  
Target Genes ◽  
Regulation Of Gene Expression ◽  
Disease Model ◽  
Relational Information ◽  
Microrna Gene ◽  
Research Findings ◽  
Family Based

Alteration of gene expression in response to regulatory molecules or mutations could lead to different diseases. MicroRNAs (miRNAs) have been discovered to be involved in regulation of gene expression and a wide variety of diseases. In a tripartite biological network of human miRNAs, their predicted target genes and the diseases caused by altered expressions of these genes, valuable knowledge about the pathogenicity of miRNAs, involved genes and related disease classes can be revealed by co-clustering miRNAs, target genes and diseases simultaneously. Tripartite co-clustering can lead to more informative results than traditional co-clustering with only two kinds of members and pass the hidden relational information along the relation chain by considering multi-type members. Here we report a spectral co-clustering algorithm for k-partite graph to find clusters with heterogeneous members. We use the method to explore the potential relationships among miRNAs, genes and diseases. The clusters obtained from the algorithm have significantly higher density than randomly selected clusters, which means members in the same cluster are more likely to have common connections. Results also show that miRNAs in the same family based on the hairpin sequences tend to belong to the same cluster. We also validate the clustering results by checking the correlation of enriched gene functions and disease classes in the same cluster. Finally, widely studied miR-17-92 and its paralogs are analyzed as a case study to reveal that genes and diseases co-clustered with the miRNAs are in accordance with current research findings.

Sign in / Sign up

Export Citation Format

Share Document