scholarly journals Extended Traffic Crash Modelling through Precision and Response Time Using Fuzzy Clustering Algorithms Compared with Multi-layer Perceptron

1970 ◽  
Vol 24 (6) ◽  
pp. 455-467 ◽  
Author(s):  
Iman Aghayan ◽  
Nima Noii ◽  
Mehmet Metin Kunt
Keyword(s):  
Response Time ◽  
Fuzzy Clustering ◽  
Prediction Models ◽  
Clustering Algorithms ◽  
Subtractive Clustering ◽  
Multi Layer Perceptron ◽  
Traffic Crash ◽  
Fuzzy C Means ◽  
Fuzzy C Means Clustering ◽  
R Value

This paper compares two fuzzy clustering algorithms – fuzzy subtractive clustering and fuzzy C-means clustering – to a multi-layer perceptron neural network for their ability to predict the severity of crash injuries and to estimate the response time on the traffic crash data. Four clustering algorithms – hierarchical, K-means, subtractive clustering, and fuzzy C-means clustering – were used to obtain the optimum number of clusters based on the mean silhouette coefficient and R-value before applying the fuzzy clustering algorithms. The best-fit algorithms were selected according to two criteria: precision (root mean square, R-value, mean absolute errors, and sum of square error) and response time (t). The highest R-value was obtained for the multi-layer perceptron (0.89), demonstrating that the multi-layer perceptron had a high precision in traffic crash prediction among the prediction models, and that it was stable even in the presence of outliers and overlapping data. Meanwhile, in comparison with other prediction models, fuzzy subtractive clustering provided the lowest value for response time (0.284 second), 9.28 times faster than the time of multi-layer perceptron, meaning that it could lead to developing an on-line system for processing data from detectors and/or a real-time traffic database. The model can be extended through improvements based on additional data through induction procedure.

scholarly journals Robust Semisupervised Kernelized Fuzzy Local Information C-Means Clustering for Image Segmentation

2020 ◽  
Vol 2020 ◽  
pp. 1-22
Author(s):  
Yao Yang ◽  
Chengmao Wu ◽  
Yawen Li ◽  
Shaoyu Zhang
Keyword(s):  
Image Segmentation ◽  
Fuzzy Clustering ◽  
Clustering Algorithms ◽  
Feature Space ◽  
Iterative Solution ◽  
Segmentation Algorithm ◽  
Gaussian Kernel ◽  
Fuzzy C Means ◽  
Different Types ◽  
Fuzzy C Means Clustering

To improve the effectiveness and robustness of the existing semisupervised fuzzy clustering for segmenting image corrupted by noise, a kernel space semisupervised fuzzy C-means clustering segmentation algorithm combining utilizing neighborhood spatial gray information with fuzzy membership information is proposed in this paper. The mean intensity information of neighborhood window is embedded into the objective function of the existing semisupervised fuzzy C-means clustering, and the Lagrange multiplier method is used to obtain its iterative expression corresponding to the iterative solution of the optimization problem. Meanwhile, the local Gaussian kernel function is used to map the pixel samples from the Euclidean space to the high-dimensional feature space so that the cluster adaptability to different types of image segmentation is enhanced. Experiment results performed on different types of noisy images indicate that the proposed segmentation algorithm can achieve better segmentation performance than the existing typical robust fuzzy clustering algorithms and significantly enhance the antinoise performance.

Construct Knowledge Structure of Linear Algebra

2011 ◽  
Vol 211-212 ◽  
pp. 793-797
Author(s):  
Chin Chun Chen ◽  
Yuan Horng Lin ◽  
Jeng Ming Yih ◽  
Sue Fen Huang
Keyword(s):  
Knowledge Management ◽  
Linear Algebra ◽  
Fuzzy Clustering ◽  
Mahalanobis Distance ◽  
Clustering Algorithms ◽  
Knowledge Structure ◽  
Interpretive Structural Modeling ◽  
Cognitive Characteristics ◽  
Fuzzy C Means ◽  
Fuzzy C Means Algorithm

Apply interpretive structural modeling to construct knowledge structure of linear algebra. New fuzzy clustering algorithms improved fuzzy c-means algorithm based on Mahalanobis distance has better performance than fuzzy c-means algorithm. Each cluster of data can easily describe features of knowledge structures individually. The results show that there are six clusters and each cluster has its own cognitive characteristics. The methodology can improve knowledge management in classroom more feasible.

scholarly journals A Bi-directional Fuzzy C-Means Clustering Ensemble Algorithm Considering Local Information

2021 ◽  
Vol 14 (1) ◽  
Author(s):  
Chunhua Ren ◽  
Linfu Sun
Keyword(s):  
Clustering Algorithms ◽  
Real Data ◽  
Local Information ◽  
Data Sets ◽  
Clustering Ensemble ◽  
K Nearest Neighbors ◽  
Fuzzy C Means ◽  
Clustering Quality ◽  
Fuzzy C Means Clustering ◽  
Fcm Clustering

AbstractThe classic Fuzzy C-means (FCM) algorithm has limited clustering performance and is prone to misclassification of border points. This study offers a bi-directional FCM clustering ensemble approach that takes local information into account (LI_BIFCM) to overcome these challenges and increase clustering quality. First, various membership matrices are created after running FCM multiple times, based on the randomization of the initial cluster centers, and a vertical ensemble is performed using the maximum membership principle. Second, after each execution of FCM, multiple local membership matrices of the sample points are created using multiple K-nearest neighbors, and a horizontal ensemble is performed. Multiple horizontal ensembles can be created using multiple FCM clustering. Finally, the final clustering results are obtained by combining the vertical and horizontal clustering ensembles. Twelve data sets were chosen for testing from both synthetic and real data sources. The LI_BIFCM clustering performance outperformed four traditional clustering algorithms and three clustering ensemble algorithms in the experiments. Furthermore, the final clustering results has a weak correlation with the bi-directional cluster ensemble parameters, indicating that the suggested technique is robust.

scholarly journals MODEL PEMETAAN EVALUASI PENILAIAN KUALIFIKASI LULUSAN BERBASIS METODE FUZZY C_MEANS CLUSTERING

2014 ◽  
Vol 7 (2) ◽  
Author(s):  
Anif Hanifa Setianingrum
Keyword(s):  
Fuzzy Clustering ◽  
Fuzzy C Means ◽  
Fuzzy C Means Clustering ◽  
Ag Cluster ◽  
Target Output

Dunia pendidikan sering mengalami masalah dengan tidak tercapainya tujuan yang telah ditetapkan dalam visi misi institusi. Banyak faktor yang menyebabkan tidak berjalan atau tidak tercapainya target output yang dihasilkan. Faktor-faktor internal SDM, metode pengajaran, serta kurikulum yang telah dirumuskan kadang tidak dapat memenuhi standarisasi kualifikasi dari pihak stakeholder. Metode evaluasi dan monitoring akan melakukan pemetaan permasalahan metode pengajaran dari para pelaksana institusi. Evaluasi Pemetaan dan Penerapan metode pengajaran dengan menggunakan Metode Fuzzy C-Means Clustering (FCM), dengan mengumpulkan data hasil penilaian dosen terhadap daftar nilai mahasiswa.. Penilaian juga harus dilakukan dengan hasil penilaian stakeholder.Hasil Cluster menyatakan ada Lima (5) cluster pengelompokkan Kualifikasi Mahasiswa (SO1, SO2, SO3) dan Identifikasi Penilaian SKKNI terhadap JRP  Cluster Pertama untuk K,V,AD,AG, Cluster Kedua  : D,H,O,W,AN, Cluster Ketiga untuk Mahasiswa A,M,R,T,AA,AJ, Cluster 4 Y,AC,AI,AK,AO, Cluster 5 E,I,J,N,AL.Ada persamaan dan ketidaksamaan nama mahasiswa dari hasil penilaian internal maupun hasil penilaian eksternal artinya Penilaian internal terhadap kualifikasi kelulusan mahasiswa berbeda dengan kriteria penilaian stakeholder terhadap standarisasi SKKNI.Kata Kunci: Fuzzy, Clustering, Standarisasi SKKNI, FCM

Fuzzy Clustering

2017 ◽  
pp. 40-61 ◽  
Author(s):  
Mashhour H. Baeshen ◽  
Malcolm J. Beynon ◽  
Kate L. Daunt
Keyword(s):  
Data Analysis ◽  
Service Quality ◽  
Mobile Phone ◽  
Fuzzy Clustering ◽  
Data Set ◽  
Clustering Techniques ◽  
Fuzzy C Means ◽  
Fuzzy Environment ◽  
External Variables ◽  
Fuzzy C Means Clustering

This chapter presents a study of the development of the clustering methodology to data analysis, with particular attention to the analysis from a crisp environment to a fuzzy environment. An applied problem concerning service quality (using SERVQUAL) of mobile phone users, and subsequent loyalty and satisfaction forms the data set to demonstrate the clustering issue. Following details on both the crisp k-means and fuzzy c-means clustering techniques, comparable results from their analysis are shown, on a subset of data, to enable both graphical and statistical elucidation. Fuzzy c-means is then employed on the full SERVQUAL dimensions, and the established results interpreted before tested on external variables, namely the level of loyalty and satisfaction across the different clusters established.

Fuzzy Clustering with Repulsive Prototypes

2010 ◽  
pp. 332-346
Author(s):  
Frank Rehm ◽  
Roland Winkler ◽  
Rudolf Kruse
Keyword(s):  
Data Analysis ◽  
Fuzzy Clustering ◽  
Experimental Results ◽  
Number Of Clusters ◽  
Fuzzy C Means ◽  
Analysis Process ◽  
Fuzzy C Means Clustering ◽  
The Right

A well known issue with prototype-based clustering is the user’s obligation to know the right number of clusters in a dataset in advance or to determine it as a part of the data analysis process. There are different approaches to cope with this non-trivial problem. This chapter follows the approach to address this problem as an integrated part of the clustering process. An extension to repulsive fuzzy c-means clustering is proposed equipping non-Euclidean prototypes with repulsive properties. Experimental results are presented that demonstrate the feasibility of the authors’ technique.

scholarly journals Fuzzy C-Means Clustering Algorithm with Multiple Fuzzification Coefficients

Algorithms ◽  
2020 ◽  
Vol 13 (7) ◽  
pp. 158
Author(s):  
Tran Dinh Khang ◽  
Nguyen Duc Vuong ◽  
Manh-Kien Tran ◽  
Michael Fowler
Keyword(s):  
Fuzzy Clustering ◽  
Clustering Algorithm ◽  
Clustering Methods ◽  
Clustering Method ◽  
Machine Learning Technique ◽  
Practical Applications ◽  
Fuzzy C Means ◽  
Fuzzy Clustering Method ◽  
Learning Technique ◽  
Fuzzy C Means Clustering

Clustering is an unsupervised machine learning technique with many practical applications that has gathered extensive research interest. Aside from deterministic or probabilistic techniques, fuzzy C-means clustering (FCM) is also a common clustering technique. Since the advent of the FCM method, many improvements have been made to increase clustering efficiency. These improvements focus on adjusting the membership representation of elements in the clusters, or on fuzzifying and defuzzifying techniques, as well as the distance function between elements. This study proposes a novel fuzzy clustering algorithm using multiple different fuzzification coefficients depending on the characteristics of each data sample. The proposed fuzzy clustering method has similar calculation steps to FCM with some modifications. The formulas are derived to ensure convergence. The main contribution of this approach is the utilization of multiple fuzzification coefficients as opposed to only one coefficient in the original FCM algorithm. The new algorithm is then evaluated with experiments on several common datasets and the results show that the proposed algorithm is more efficient compared to the original FCM as well as other clustering methods.

Sign in / Sign up

Export Citation Format

Share Document