Related papers: Data clustering using a model granular magnet
There is a growing interest in characterizing circular data found in biological systems. Such data are wide ranging and varied, from signal phase in neural recordings to nucleotide sequences in round genomes. Traditional clustering…
This paper presents a model for a dynamical system where particles dominate edges in a complex network. The proposed dynamical system is then extended to an application on the problem of community detection and data clustering. In the case…
Binned data often appears in different fields of research, and it is generated after summarizing the original data in a sequence of pairs of bins (or their midpoints) and frequencies. There may exist different reasons to only provide this…
Using analytic and numerical methods, we study a $2d$ Hamiltonian model of interacting particles carrying ferro-magnetically coupled continuous spins which are also locally coupled to their own velocities. This model has been characterised…
The community structure of complex networks reveals both their organization and hidden relationships among their constituents. Most community detection methods currently available are not deterministic, and their results typically depend on…
We present a technique for clustering categorical data by generating many dissimilarity matrices and averaging over them. We begin by demonstrating our technique on low dimensional categorical data and comparing it to several other…
Electron pairing and ferromagnetism in various cluster geometries are studied with emphasis on tetrahedron and square pyramid under variation of interaction strength, electron doping and temperature. These exact calculations of charge and…
In this paper we propose an adaptive approach for clustering and visualization of data by an orthogonalization process. Starting with the data points being represented by a Markov process using the diffusion map framework, the method…
Clustering provides a common means of identifying structure in complex data, and there is renewed interest in clustering as a tool for the analysis of large data sets in many fields. A natural question is how many clusters are appropriate…
In this paper we propose a new approach for Big Data mining and analysis. This new approach works well on distributed datasets and deals with data clustering task of the analysis. The approach consists of two main phases, the first phase…
We consider a regular random network where each node has exactly three neighbours. Ising spins at the network nodes interact antiferromagnetically along the links. The clustering coefficient $C$ is tuned from zero to 1/3 by adding new…
We develop an effective nonhierarchical data clustering method using an analogy to the dynamic coarse graining of a stochastic system. Analyzing the eigensystem of an interitem transition matrix identifies fuzzy clusters corresponding to…
Many simple natural phenomena are characterized by complex motion that appears random at first glance, but that often displays underlying patterns and behavior that can be clustered in groups. The movement of small pieces of paper falling…
Clustering large, mixed data is a central problem in data mining. Many approaches adopt the idea of k-means, and hence are sensitive to initialisation, detect only spherical clusters, and require a priori the unknown number of clusters. We…
The cactus approximation in the cluster variation method is applied to the spin ice system with nearest neighbor ferromagnetic coupling. The temperature dependences of the entropy and the specific heat show qualitatively good agreement with…
This paper introduces a new clustering technique, called {\em dimensional clustering}, which clusters each data point by its latent {\em pointwise dimension}, which is a measure of the dimensionality of the data set local to that point.…
Cluster molecular field approximations represent a substantial progress over the simple Weiss theory where only one spin is considered in the molecular field resulting from all the other spins. In this work we discuss a systematic way of…
We use the coupled cluster method (CCM) to study the ground-state properties and lowest-lying triplet excited state of the spin-half {\it XXZ} antiferromagnet on the square lattice. The CCM is applied to it to high orders of approximation…
In this paper, we propose a new fuzzy clustering algorithm based on the mode-seeking framework. Given a dataset in $\mathbb{R}^d$, we define regions of high density that we call cluster cores. We then consider a random walk on a…
We have studied the spin ordering of a dilute classical Heisenberg model with spin concentration $x$, and with ferromagnetic nearest-neighbor interaction $J_1$ and antiferromagnetic next-nearest-neighbor interaction $J_2$. Magnetic phases…