6,402 research outputs found
Multiorder neurons for evolutionary higher-order clustering and growth
This letter proposes to use multiorder neurons for clustering irregularly shaped data arrangements. Multiorder neurons are an evolutionary extension of the use of higher-order neurons in clustering. Higher-order neurons parametrically model complex neuron shapes by replacing the classic synaptic weight by higher-order tensors. The multiorder neuron goes one step further and eliminates two problems associated with higher-order neurons. First, it uses evolutionary algorithms to select the best neuron order for a given problem. Second, it obtains more information about the underlying data distribution by identifying the correct order for a given cluster of patterns. Empirically we observed that when the correlation of clusters found with ground truth information is used in measuring clustering accuracy, the proposed evolutionary multiorder neurons method can be shown to outperform other related clustering methods. The simulation results from the Iris, Wine, and Glass data sets show significant improvement when compared to the results obtained using self-organizing maps and higher-order neurons. The letter also proposes an intuitive model by which multiorder neurons can be grown, thereby determining the number of clusters in data
Simultaneous Coherent Structure Coloring facilitates interpretable clustering of scientific data by amplifying dissimilarity
The clustering of data into physically meaningful subsets often requires
assumptions regarding the number, size, or shape of the subgroups. Here, we
present a new method, simultaneous coherent structure coloring (sCSC), which
accomplishes the task of unsupervised clustering without a priori guidance
regarding the underlying structure of the data. sCSC performs a sequence of
binary splittings on the dataset such that the most dissimilar data points are
required to be in separate clusters. To achieve this, we obtain a set of
orthogonal coordinates along which dissimilarity in the dataset is maximized
from a generalized eigenvalue problem based on the pairwise dissimilarity
between the data points to be clustered. This sequence of bifurcations produces
a binary tree representation of the system, from which the number of clusters
in the data and their interrelationships naturally emerge. To illustrate the
effectiveness of the method in the absence of a priori assumptions, we apply it
to three exemplary problems in fluid dynamics. Then, we illustrate its capacity
for interpretability using a high-dimensional protein folding simulation
dataset. While we restrict our examples to dynamical physical systems in this
work, we anticipate straightforward translation to other fields where existing
analysis tools require ad hoc assumptions on the data structure, lack the
interpretability of the present method, or in which the underlying processes
are less accessible, such as genomics and neuroscience
Recommended from our members
Fuzzy Image Segmentation using Suppressed Fuzzy C-Means Clustering
Clustering algorithms are highly dependent on the features used and the type of the objects in a particular image. By considering object similar surface variations (SSV) as well as the arbitrariness of the fuzzy c-means (FCM) algorithm for pixellocation, a fuzzy image segmentation considering object surface similarity (FSOS) algorithm was developed, but it was unable to segment objects having SSV satisfactorily. To improve the effectiveness of FSOS in segmenting objects with SSV, thispaper introduces a new fuzzy image segmentation using suppressed fuzzy c-means clustering (FSSC) algorithm, which directly considers object SSV and incorporates the use of suppressed-FCM (SFCM) using pixel location. The algorithmalso perceptually selects the threshold within the range of human visual perception. Both qualitative and quantitative resultsconfirm the improved segmentation performance of FSSC compared with other algorithms including FSOS, FCM,possibilistic c-means (PCM) and SFCM for many different images
- …