Related papers: Matern Cluster Process with Holes at the Cluster C…
A novel method, termed Reduced Dimensionality Cluster Identification, RDCI, is presented, for the identification and quantitative description of clusters formed by N objects in three dimensional space. The method consists of finding a path,…
With the membership function being strictly positive, the conventional fuzzy c-means clustering method sometimes causes imbalanced influence when clusters of vastly different sizes exist. That is, an outstandingly large cluster drags to its…
Clustering mixtures of Gaussian distributions is a fundamental and challenging problem that is ubiquitous in various high-dimensional data processing tasks. While state-of-the-art work on learning Gaussian mixture models has focused…
This paper proposes a new distance metric between clusterings that incorporates information about the spatial distribution of points and clusters. Our approach builds on the idea of a Hilbert space-based representation of clusters as a…
The Dirichlet process (DP) is a fundamental mathematical tool for Bayesian nonparametric modeling, and is widely used in tasks such as density estimation, natural language processing, and time series modeling. Although MCMC inference…
On the supercritical percolation cluster with parameter p, the distances between two distant points of the axis are asymptotically increased by a factor 1+(1-p)/2+o(1-p) with respect to the usual distance. The proof is based on an…
Factorial clustering methods have been developed in recent years thanks to the improving of computational power. These methods perform a linear transformation of data and a clustering on transformed data optimizing a common criterion.…
Creating low dimensional representations of a high dimensional data set is an important component in many machine learning applications. How to cluster data using their low dimensional embedded space is still a challenging problem in…
Clustered solutions in oscillator networks provide an important insight into how a system might diversify from a synchronous solution into spatiotemporal complex solutions. They can therefore form a link between fully synchronized and…
Clustering is one of the widely used techniques to find out patterns from a dataset that can be applied in different applications or analyses. K-means, the most popular and simple clustering algorithm, might get trapped into local minima if…
Clustering observations across partially exchangeable groups of data is a routine task in Bayesian nonparametrics. Previously proposed models allow for clustering across groups by sharing atoms in the group-specific mixing measures.…
A model-based approach is developed for clustering categorical data with no natural ordering. The proposed method exploits the Hamming distance to define a family of probability mass functions to model the data. The elements of this family…
We establish sample-path large deviation principles for the centered cumulative functional of marked Poisson cluster processes in the Skorokhod space equipped with the M1 topology, under joint regular variation assumptions on the marks and…
As multipath components (MPCs) are experimentally observed to appear in clusters, cluster-based channel models have been focused in the wireless channel study. However, most of the MPC clustering algorithms for MIMO channels with delay and…
The problem of hadronic cluster production in heavy-ion collisions is studied in search for an observable signature of first-order quark-hadron phase transition. The study is carried out by cellular automata in a two-dimensional model of…
The problem of constrained clustering has attracted significant attention in the past decades. In this paper, we study the balanced $k$-center, $k$-median, and $k$-means clustering problems where the size of each cluster is constrained by…
One key use of k-means clustering is to identify cluster prototypes which can serve as representative points for a dataset. However, a drawback of using k-means cluster centers as representative points is that such points distort the…
Cluster analysis, or clustering, plays a crucial role across numerous scientific and engineering domains. Despite the wealth of clustering methods proposed over the past decades, each method is typically designed for specific scenarios and…
We present results from dynamical Monte Carlo simulations of dense star clusters near the Galactic center. These clusters sink toward the center of the Galaxy by dynamical friction. During their inspiral, they may undergo core collapse and…
In this work, we introduce a novel methodology for divisive hierarchical clustering. Our divisive (``top-down'') approach is motivated by the fact that agglomerative hierarchical clustering (``bottom-up''), which is commonly used for…