New validity index for fuzzy-possibilistic c-means clustering.
problem Conflicting results in determining the optimal number of clusters due to noisy data points and outliers.
method Introducing a new validity index (FP index) for fuzzy-possibilistic c-means clustering.
result FP index works well in datasets with varying cluster shapes and densities.
A novel weighted distance improves fuzzy c-means clustering accuracy.
problem Improving fuzzy c-means clustering performance with weighted distances.
method Proposed Canberra Weighted Distance to enhance FCM algorithm.
result Experimental results show superior performance of the proposed method.
This paper uses fuzzy C-Means clustering and sonification to analyze heart rate variability.
problem Identifying suitable features from HRV analysis for sonification.
method Unsupervised machine learning (fuzzy C-Means clustering) and sonification techniques.
result Improves sonification interpretability by selecting appropriate HRV features.
CAF-HFCM automatically forms a cluster hierarchy and optimizes the number of clusters without trial-and-validation.
problem Challenges in determining the optimal number of clusters in fuzzy c-means.
method CAF-HFCM, an auto-fused hierarchical fuzzy c-means method.
result Automatic agglomeration and optimal number of clusters without validity indices.
Distributional (or distribution-valued) data are a new type of data arising from several sources and are considered as realizations of distributional variables. A new set of fuzzy c-means algorithms for data described by distributional variables is proposed. The algorithms use the L2 Wasserstein distance between dist…
A new hybrid fuzzy-crisp clustering algorithm addresses imbalanced cluster sizes.
problem Imbalanced influence in fuzzy c-means clustering for large vs. small clusters.
method Hybrid fuzzy-crisp algorithm combining linear and quadratic membership functions, setting exact zero membership for sufficiently distant points.
result The hybrid algorithm outperforms conventional fuzzy and crisp clustering methods on imbalanced datasets.
Robust clustering methods for multivariate time series data.
problem Clustering multivariate time series data robustly to outliers.
method Quantile-based fuzzy C-means with metric, noise, and trimmed approaches.
result Robust methods outperform alternatives in handling outlying series.
A novel fuzzy clustering method for multivariate time series.
problem Clustering multivariate time series with varying dependencies and dynamics.
method Quantile-based cross-spectral features, PCA, fuzzy C-means, fuzzy C-medoids.
result Substantially outperforms existing methods in various evaluation schemes.
FCM clustering adapts to persistence diagrams for topological data analysis.
problem Integrating topological data into machine learning workflows.
method Adapting Fuzzy c-Means to persistence diagrams.
result FCM clustering captures topological structure without additional processing.
A new fuzzy clustering method using hyperbolic smoothing for large datasets.
problem Building fuzzy clusters for large data sets efficiently.
method A novel smoothing numerical approach to relax the sum-of-squares criterion, converting the problem into a differentiable optimization problem.
result The method produces better fuzzy partitions compared to traditional fuzzy C-means. Proposes PKM for soft K-means clustering.
problem Soft K-means (m=1) unsolved since 1981.
method Probabilistic K-Means (PKM) via nonlinear programming.
result Proposed methods solve PKM efficiently.
New cluster validity index detects optimal number of clusters and secondary options.
problem Determining the optimal number of clusters in fuzzy clustering.
method Correlation-based fuzzy cluster validity index (WP index) using fuzzy c-means algorithm.
result WP index outperforms existing indexes in detecting optimal number of clusters and secondary options.
Synthetic aperture sonar (SAS) imagery can generate high resolution images of the seafloor. Thus, segmentation algorithms can be used to partition the images into different seafloor environments. In this paper, we compare two possibilistic segmentation approaches. Possibilistic approaches allow for the ability to detec…
SESSC clusters fuzzy rules for TSK classifiers, improving performance with label info.
problem Lack of supervised clustering for TSK fuzzy classifiers.
method SESSC integrates within-cluster compactness, between-cluster separation, and label information.
result SESSC initialization outperforms other clustering methods, especially for small rule numbers.
Proposes ITISC for clustering with minimized worst-case expected distortions.
problem Real-world clustering data distribution mismatch.
method Information theoretical importance sampling, constrained minimax optimization, Lagrange method.
result Validation of ITISC on synthetic and real-world datasets.
Clustering is an extensive research area in data science. The aim of clustering is to discover groups and to identify interesting patterns in datasets. Crisp (hard) clustering considers that each data point belongs to one and only one cluster. However, it is inadequate as some data points may belong to several clusters…
A new clustering method learns shared hidden space and fuzzy partition between multi-view data.
problem Effective exploitation of relationship between different views in multi-view data.
method Hidden space sharing multi-view fuzzy clustering (HSS-MVFC) method based on fuzzy c-means.
result The proposed method outperforms many related clustering methods in experiments.
Cluster analysis is widely used in the areas of machine learning and data mining. Fuzzy clustering is a particular method that considers that a data point can belong to more than one cluster. Fuzzy clustering helps obtain flexible clusters, as needed in such applications as text categorization. The performance of a clu…
Paper uses ANFIS to predict cryptocurrency prices.
problem Predicting cryptocurrency prices for seven days.
method Adaptive Network Based Fuzzy Inference System (ANFIS) with hybrid and backpropagation algorithms.
result The method can predict cryptocurrency prices in a short time.
In this paper, we take a new look at the possibilistic c-means (PCM) and adaptive PCM (APCM) clustering algorithms from the perspective of uncertainty. This new perspective offers us insights into the clustering process, and also provides us greater degree of flexibility. We analyze the clustering behavior of PCM-based…
This paper compares spike sorting techniques for rat brain neuronal activity.
problem Improving the accuracy of spike sorting for neuronal activity analysis.
method Three-step spike sorting process: detection, feature extraction, and clustering. Various methods are compared.
result Kernel PCA outperforms in feature extraction, leading to better spike sorting results.
Develops a new fuzzy model using QPs and ewl2 regularization to improve local region behavior.
problem Inability of constant and linear functions to accurately describe local regions in fuzzy models.
method Applied Fuzzy C-Means for structure identification, used QPs as consequents, introduced ewl2 regularization.
result Improved model's ability to describe local regions without overfitting.
Centroid-based methods including k-means and fuzzy c-means are known as effective and easy-to-implement approaches to clustering purposes in many applications. However, these algorithms cannot be directly applied to supervised tasks. This paper thus presents a generative model extending the centroid-based clustering ap…
Proposes a fuzzy rule-based method for data visualization.
problem Preserving neighborhood relationships and handling non-linear manifolds in data visualization.
method Uses a first-order Takagi-Sugeno model with clusters and Geodesic c-means clustering for rule generation and parameter estimation.
result Behaves desirably and performs better than or comparable to other methods.
The paper proposes a novel Kernelized image segmentation scheme for noisy images that utilizes the concept of Smallest Univalue Segment Assimilating Nucleus (SUSAN) and incorporates spatial constraints by computing circular colour map induced weights. Fuzzy damping coefficients are obtained for each nucleus or center p…
Pixel intensity is a widely used feature for clustering and segmentation algorithms, the resulting segmentation using only intensity values might suffer from noises and lack of spatial context information. Wavelet transform is often used for image denoising and classification. We proposed a novel method to incorporate …
Multi-view data clustering refers to categorizing a data set by making good use of related information from multiple representations of the data. It becomes important nowadays because more and more data can be collected in a variety of ways, in different settings and from different sources, so each data set can be repr…
Estimates statistical power for cluster analysis in biomedical research.
problem Lack of established methods to compute a priori statistical power for cluster analysis.
method Simulation studies varying subgroup size, number, separation, and covariance structure.
result Sufficient statistical power achieved with small samples (N=20-30) for large effect sizes.
Paper simulates LR fuzzy intervals with interval-valued cores.
problem Generating random fuzzy intervals with interval-valued cores.
method Developed algorithms for simulating LR fuzzy numbers with interval-valued cores.
result Numerically efficient algorithm for simulating fuzzy values.
In this paper, we have tried to apply the concepts of fuzzy sets to Lie groups and its relative concepts. First, we define a C1 fuzzy submanifold after reviewing C1−fuzzy manifold definition. In main section, we defined the Lie group and some its relative concepts such as fuzzy transformation group,…
Fuzzy eIX method evolves classifiers for online data streams.
problem Handling time-varying classifiers in online data streams.
method Develops evolving Internal-eXternal Fuzzy granules for numerical data.
result Fuzzy eIX maintains high accuracy in dynamic scenarios.
A new clustering algorithm REFCMFS improves K-Means efficiency and robustness.
problem Efficiently clustering data with outliers and L0-norm constraints. method REFCMFS uses L2,1-norm robust loss and L0-norm constraint on membership matrix. result REFCMFS achieves more promising performance and efficient optimization.
Fuzzy prediction sets generalize binary predictions to include elements at varying confidence levels.
problem Binary prediction sets are limited; fuzzy prediction sets offer richer guarantees.
method Generalize prediction sets to fuzzy sets, showing they are e-values with merging properties.
result Optimal e-values lead to optimal fuzzy prediction sets, including optimal conformal prediction.
Paper defines kernels for fuzzy sets, useful in machine learning.
problem Uncertainty in data with fuzzy set membership.
method Defined cross product, intersection, non-singleton, and distance-based kernels.
result Kernels improve machine learning tasks with fuzzy data.
SCOPE-FE improves feature engineering efficiency for high-dimensional datasets.
problem Expanding and reducing feature space in tabular learning becomes computationally expensive with increased dimensionality.
method SCOPE-FE controls the search space by regulating operator and feature-pair spaces, using OperatorProbing and FeatureClustering.
result SCOPE-FE reduces feature engineering time while maintaining competitive predictive performance.
Enhanced fuzzy system predicts chaotic time series with improved accuracy.
problem Forecasting chaotic time series with high uncertainty.
method Combines evolving fuzzy systems, participatory learning, KRLS, and type-2 fuzzy sets.
result Proposed model outperforms other methods in accuracy and complexity.
A new adaptive binarization technique using fuzzy integrals improves image quality.
problem Improving image thresholding quality.
method FLAT (Fuzzy Local Adaptive Thresholding) based on fuzzy integrals.
result The proposed FLAT method produces better image quality than traditional algorithms and neural networks.
Paper investigates differentiable fuzzy implications and their suitability for learning.
problem Analyzing differentiable fuzzy implications and their suitability for learning.
method Investigates the properties of fuzzy implications in a differentiable setting and introduces a new family of fuzzy implications.
result Various fuzzy implications are unsuitable for differentiable learning, and a new family of fuzzy implications is introduced.
A deep convolutional fuzzy system (DCFS) on a high-dimensional input space is a multi-layer connection of many low-dimensional fuzzy systems, where the input variables to the low-dimensional fuzzy systems are selected through a moving window across the input spaces of the layers. To design the DCFS based on input-outpu…
Study predicts heart failure patient survival using stacked ensemble ML.
problem Predicting survival of heart failure patients.
method Collect and analyze patient data, apply SMOTE, use K-Means, Fuzzy C-Means clustering, Random Forest, XGBoost, Decision Tree, and propose a stacked ensemble model.
result Supervised ML algorithms outperform unsupervised models, achieving high accuracy and F1 score.
In this paper we use fuzzy systems theory to convert the technical trading rules commonly used by stock practitioners into excess demand functions which are then used to drive the price dynamics. The technical trading rules are recorded in natural languages where fuzzy words and vague expressions abound. In Part I of t…
In most gene expression data, the number of training samples is very small compared to the large number of genes involved in the experiments. However, among the large amount of genes, only a small fraction is effective for performing a certain task. Furthermore, a small subset of genes is desirable in developing gene e…
Takagi-Sugeno-Kang (TSK) fuzzy systems are very useful machine learning models for regression problems. However, to our knowledge, there has not existed an efficient and effective training algorithm that ensures their generalization performance, and also enables them to deal with big data. Inspired by the connections b…
Unified probabilistic foundation for fuzzy simplicial sets in dimensionality reduction.
problem Lack of clear probabilistic interpretation in fuzzy simplicial sets.
method Introducing a probabilistic framework explaining fuzzy simplicial sets as marginals of probability measures on simplicial sets.
result Unified probabilistic theoretical foundation for fuzzy simplicial sets.
Fuzzy clustering reduces text data dimensions effectively.
problem Sparsity and high dimensionality in document-term frequency matrices.
method Fuzzy clustering applied as a new unsupervised feature transformation method.
result Fuzzy clustering outperforms PCA and SVD in reducing text data dimensions.
TSK-Streams learns fuzzy rules from data streams.
problem Adaptive learning from evolving data streams.
method Combines AMRules principles with fuzzy rule advantages.
result TSK-Streams performs highly competitively in experiments.
Proposes new random models for fuzzy clustering similarity measures.
problem Challenges in choosing a random model for fuzzy clustering similarity measures.
method Introduces three intuitive and explainable random models for fuzzy clusterings.
result Each random model has distinct behavior, emphasizing the importance of accurate model selection.
Optimized fuzzy entropy framework improves feature selection and classification performance.
problem Improving feature selection and classification in fuzzy entropy frameworks.
method Implemented and compared combinations of ideal vectors, maximal similarity classifiers, and fuzzy entropy functions.
result Optimized combination of ideal vector, similarity classifier, and fuzzy entropy function achieved the most stable performance for all three datasets.