A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Probabilistic fair clustering tackles uncertain group membership.
This paper introduces Bounded Fuzzy Possibilistic Method (BFPM) by addressing several issues that previous clustering/classification methods have not considered. In fuzzy clustering, object's membership values should sum to 1. Hence, any object may obtain full membership in at most one cluster. Possibilistic clustering…
Robust Trimmed k-means improves clustering with outliers and mixed data.
A new hybrid fuzzy-crisp clustering algorithm addresses imbalanced cluster sizes.
New method for mixed memberships using symmetrized Laplacian inverse matrix.
Dynamic clustering for time series data with evolving memberships.
In the present paper, we studied a Dynamic Stochastic Block Model (DSBM) under the assumptions that the connection probabilities, as functions of time, are smooth and that at most nodes can switch their class memberships between two consecutive time points. We estimate the edge probability tensor by a kernel-type p…
A new method for community detection in networks is presented.
Robust fuzzy clustering for EEG driver alertness with outlier detection.
A new clustering method uses nonparametric smoothing to estimate cluster membership functions.
A new LDA model with covariates for mixed-membership clusters.
BFPM improves machine learning accuracy by considering object types and memberships flexibly.
New model integrates community and link clustering for network data.
MultiwayPAM clusters LLM-as-a-Judge scores to reveal evaluator bias.
The paper introduces curvature-based clustering algorithms for graph analysis.
Study provides selective inference method for latent block models.
New algorithms improve spectral clustering for finite mixture models.
Algorithm tackles clustered contextual bandits with resource constraints.
A new method clusters data from multiple sources using a mixture of multilayer SBMs.
EGMM improves clustering by better handling uncertainty with evidential framework.
A method to control false membership rate in unsupervised mixture models.
Sparse spectral decomposition identifies overlapping communities in networks.
Paper tackles Byzantine attacks in Federated Learning by clustering and robustifying.
Many graph clustering quality functions suffer from a resolution limit, the inability to find small clusters in large graphs. So called resolution-limit-free quality functions do not have this limit. This property was previously introduced for hard clustering, that is, graph partitioning. We investigate the resolution-…
Transactional network data can be thought of as a list of one-to-many communications(e.g., email) between nodes in a social network. Most social network models convert this type of data into binary relations between pairs of nodes. We develop a latent mixed membership model capable of modeling richer forms of transacti…
In this paper, we investigate community detection in networks in the presence of node covariates. In many instances, covariates and networks individually only give a partial view of the cluster structure. One needs to jointly infer the full cluster structure by considering both. In statistics, an emerging body of work …
The classical -means algorithm for partitioning points in into clusters is one of the most popular and widely spread clustering methods. The need to respect prescribed lower bounds on the cluster sizes has been observed in many scientific and business applications. In this paper, we present an…
Proposes methods to handle missing data in clustering models.
Many approaches have been proposed to discover clusters within networks. Community finding field encompasses approaches which try to discover clusters where nodes are tightly related within them but loosely related with nodes of other clusters. However, a community network configuration is not the only possible latent …
We are often interested in clustering objects that evolve over time and identifying solutions to the clustering problem for every time step. Evolutionary clustering provides insight into cluster evolution and temporal changes in cluster memberships while enabling performance superior to that achieved by independently c…
Paper improves robust spectral clustering for noisy data.
We consider the problem of Gaussian mixture clustering in the high-dimensional limit where the data consists of points in dimensions, and stays finite. Using exact but non-rigorous methods from statistical physics, we determine the critical value of and the distance between…
Data of the form of event times arise in various applications. A simple model for such data is a non-homogeneous Poisson process (NHPP) which is specified by a rate function that depends on time. We consider the problem of having access to multiple independent observations of event time data, observed on a common inter…
Here, we propose a clustering technique for general clustering problems including those that have non-convex clusters. For a given desired number of clusters , we use three stages to find a clustering. The first stage uses a hybrid clustering technique to produce a series of clusterings of various sizes (randomly se…
The hybrid clustering-classification neural network is proposed. This network allows increasing a quality of information processing under the condition of overlapping classes due to the rational choice of a learning rate parameter and introducing a special procedure of fuzzy reasoning in the clustering process, which o…
We develop a data driven approach to perform clustering and end-to-end feature learning simultaneously for streaming data that can adaptively detect novel clusters in emerging data. Our approach, Adaptive Nonparametric Variational Autoencoder (AdapVAE), learns the cluster membership through a Bayesian Nonparametric (BN…
We investigate the tendency for financial instruments to form clusters when there are multiple factors influencing the correlation structure. Specifically, we consider a stock portfolio which contains companies from different industrial sectors, located in several different countries. Both sector membership and geograp…
Paper proposes a new clustering model that preserves cluster recovery with fewer dimensions.
Quantum Clustering is a powerful method to detect clusters in data with mixed density. However, it is very sensitive to a length parameter that is inherent to the Schrödinger equation. In addition, linking data points into clusters requires local estimates of covariance that are also controlled by length parameters. Th…
The rebmix package provides R functions for random univariate and multivariate finite mixture model generation, estimation, clustering and classification. The paper is focused on multivariate normal mixture models with unrestricted variance-covariance matrices. The objective is to show how to generate datasets for a kn…
The stochastic block model (SBM) is a flexible probabilistic tool that can be used to model interactions between clusters of nodes in a network. However, it does not account for interactions of time varying intensity between clusters. The extension of the SBM developed in this paper addresses this shortcoming through a…
New RESK distributions improve robust clustering of skewed data.
Biological and social systems consist of myriad interacting units. The interactions can be represented in the form of a graph or network. Measurements of these graphs can reveal the underlying structure of these interactions, which provides insight into the systems that generated the graphs. Moreover, in applications s…
State-of-the-art clustering algorithms use heuristics to partition the feature space and provide little insight into the rationale for cluster membership, limiting their interpretability. In healthcare applications, the latter poses a barrier to the adoption of these methods since medical researchers are required to pr…
HIV RNA viral load (VL) is an important outcome variable in studies of HIV infected persons. There exists only a handful of methods which classify patients by viral load patterns. Most methods place limits on the use of viral load measurements, are often specific to a particular study design, and do not account for com…
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…
New methods identify local clusters in graphs with few labels.
Data clustering is a fundamental problem with a wide range of applications. Standard methods, eg the -means method, usually require solving a non-convex optimization problem. Recently, total variation based convex relaxation to the -means model has emerged as an attractive alternative for data clustering. However…