Related papers: A mini-review on combinatorial solutions to the Ma…
As in other estimation scenarios, likelihood based estimation in the normal mixture set-up is highly non-robust against model misspecification and presence of outliers (apart from being an ill-posed optimization problem). A robust…
Partially recorded data are frequently encountered in many applications and usually clustered by first removing incomplete cases or features with missing values, or by imputing missing values, followed by application of a clustering…
We apply various expansion schemes that may be used to study gravitational clustering to the simple case of the Zeldovich dynamics. Using the well-known exact solution of the Zeldovich dynamics we can compare the predictions of these…
Smoluchowski's coagulation equations can be used as elementary mathematical models for the formation of polymers. We review here some recent contributions on a variation of this model in which the number of aggregations for each atom is a…
This paper deals with nonparametric estimation of conditional den-sities in mixture models in the case when additional covariates are available. The proposed approach consists of performing a prelim-inary clustering algorithm on the…
The cluster expansion formalism used in materials science is reconstructed on an axiomatic basis with the aims of clarifying underlying concepts and improving computational procedures, and without using conventional cluster functions.…
In this article we study an extension of Smoluchowski's discrete coagulation equation, where particle in- and output takes place. This model is frequently used to describe aggregation processes in combination with sedimentation of clusters.…
Smoluchowski's coagulation equation is a mean-field model describing the growth of clusters by successive mergers. Since its derivation in 1916 it has been studied by several authors, using deterministic and stochastic approaches, with a…
We introduce the combinatorial Lyubeznik resolution of monomial ideals. We prove that this resolution is isomorphic to the usual Lyubezbnik resolution. As an application, we give a combinatorial method to determine if an ideal is a…
The processes of simultaneous coagulation and Ostwald ripening of particles in the concluding stage of phase transformation are considered. We solve the integro-differential system of Smoluchowski-type kinetic and mass balance equations…
We present a self consistent method to perfom a joint analysis of Sunyaev-Zel'dovich and weak gravitational lensing observation of galaxy clusters. The spatial distribution of the cluster main constituents is described by a perturbative…
Efficient and stable algorithms for the calculation of spectral quantities and correlation functions are some of the key tools in computational condensed matter physics. In this article we review basic properties and recent developments of…
Clustering functional data is a challenging task due to intrinsic infinite-dimensionality and the need for stable, data-adaptive partitioning. In this work, we propose a clustering framework based on Random Projections, which simultaneously…
Recently, the supersymmetry method was extended from Gaussian ensembles to arbitrary unitarily invariant matrix ensembles by generalizing the Hubbard-Stratonovich transformation. Here, we complete this extension by including arbitrary…
We consider the problem of inferring an unknown number of clusters in replicated multinomial data. Under a model based clustering point of view, this task can be treated by estimating finite mixtures of multinomial distributions with or…
A general framework for dealing with both linear regression and clustering problems is described. It includes Gaussian clusterwise linear regression analysis with random covariates and cluster analysis via Gaussian mixture models with…
Repulsive mixture models have recently gained popularity for Bayesian cluster detection. Compared to more traditional mixture models, repulsive mixture models produce a smaller number of well separated clusters. The most commonly used…
The article contains a preliminary glance at balanced clustering problems. Basic balanced structures and combinatorial balanced problems are briefly described. A special attention is targeted to various balance/unbalance indices (including…
A novel framework for consensus clustering is presented which has the ability to determine both the number of clusters and a final solution using multiple algorithms. A consensus similarity matrix is formed from an ensemble using multiple…
Our previous experiments demonstrated that subsets collections of (short) documents (with several hundred entries) share a common normalized in some way eigenvalue spectrum of combinatorial Laplacian. Based on this insight, we propose a…