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.
The paper introduces group-representative clustering to ensure fair representation of different groups in clusters.
We propose a novel two-phase approach to functional network estimation of multi-subject functional Magnetic Resonance Imaging (fMRI) data, which applies model-based image segmentation to determine a group-representative connectivity map. In our approach, we first improve clustering-based Independent Component Analysis …
We study geodesics on a planar Riemann surface of infinite type having a single infinite end. Of particular interest is the class of geodesics that go out the infinite end in a most efficient manner. We investigate properties of these geodesics and relate them to the structure of the boundary of a Dirichlet polygon for…
Quadratic-time algorithm computes stretch factors and foliations for pseudo-Anosov mapping classes.
We consider the following question: Which parameters in the extension of a rational pleating ray across the boundary of $\Cal M$, the Maskit embedding of the Teichmüller space of once punctured tori correspond to a Kleinian group? Using methods of Keen and Series and Wright we prove a local result, stating that on each…
There are multiple sides to every story, and while statistical topic models have been highly successful at topically summarizing the stories in corpora of text documents, they do not explicitly address the issue of learning the different sides, the viewpoints, expressed in the documents. In this paper, we show how thes…
Factor analysis provides linear factors that describe relationships between individual variables of a data set. We extend this classical formulation into linear factors that describe relationships between groups of variables, where each group represents either a set of related variables or a data set. The model also na…
For a oriented genus g surface with one boundary component, S, the Torelli group is the group of orientation preserving homeomorphisms of S that induce the identity on homology. The Magnus representation of the Torelli group represents the action on F/F" where F=pi_1(S) and F" is the second term of the derived series. …
The paper proves rigidity results for Anosov flows and their orbit equivalences.
Bayesian model transfers knowledge across different engineering fleets.
DMTG groups tasks for multi-task learning in one shot.
A new algorithm reduces frequentist regret in multi-agent bandit problems with sparse hypergraphs.
Convex clustering can only learn convex clusters, with significant gaps between clusters.
Proposes a new clustering method based on expectiles for non-spherical clusters.
CCMM efficiently solves large-scale convex clustering problems.
Discussing issues in robust clustering, especially with Gaussian models.
New indices for determining cluster compactness and separability.
Mode clustering is a nonparametric method for clustering that defines clusters using the basins of attraction of a density estimator's modes. We provide several enhancements to mode clustering: (i) a soft variant of cluster assignment, (ii) a measure of connectivity between clusters, (iii) a technique for choosing the …
Clustering is an essential data mining tool that aims to discover inherent cluster structure in data. For most applications, applying clustering is only appropriate when cluster structure is present. As such, the study of clusterability, which evaluates whether data possesses such structure, is an integral part of clus…
In this paper, a similarity-driven cluster merging method is proposed for unsuper-vised fuzzy clustering. The cluster merging method is used to resolve the problem of cluster validation. Starting with an overspecified number of clusters in the data, pairs of similar clusters are merged based on the proposed similarity-…
Clustering ensemble, or consensus clustering, has emerged as a powerful tool for improving both the robustness and the stability of results from individual clustering methods. Weighted clustering ensemble arises naturally from clustering ensemble. One of the arguments for weighted clustering ensemble is that elements (…
In many practical applications of clustering, the objects to be clustered evolve over time, and a clustering result is desired at each time step. In such applications, evolutionary clustering typically outperforms traditional static clustering by producing clustering results that reflect long-term trends while being ro…
Study examines how cluster number affects short-text clustering, introducing a stability metric.
Convex clustering, a convex relaxation of k-means clustering and hierarchical clustering, has drawn recent attentions since it nicely addresses the instability issue of traditional nonconvex clustering methods. Although its computational and statistical properties have been recently studied, the performance of convex c…
Cluster LOCO: A model-agnostic feature importance score for interpreting cluster outputs
Clustering is a central approach for unsupervised learning. After clustering is applied, the most fundamental analysis is to quantitatively compare clusterings. Such comparisons are crucial for the evaluation of clustering methods as well as other tasks such as consensus clustering. It is often argued that, in order to…
Clustering is one of the most universal approaches for understanding complex data. A pivotal aspect of clustering analysis is quantitatively comparing clusterings; clustering comparison is the basis for many tasks such as clustering evaluation, consensus clustering, and tracking the temporal evolution of clusters. In p…
A new distributed clustering framework using distributional kernel.
Skeleton clustering detects clusters in high-dimensional data without needing prototypes.
Determining the number of clusters present in a dataset is an important problem in cluster analysis. Conventional clustering techniques generally assume this parameter to be provided up front. %user supplied. %Recently, robustness of any given clustering algorithm is analyzed to measure cluster stability/instability wh…
Typically clustering algorithms provide clustering solutions with prespecified number of clusters. The lack of a priori knowledge on the true number of underlying clusters in the dataset makes it important to have a metric to compare the clustering solutions with different number of clusters. This article quantifies a …
A novel approach ODAR detects outliers for clustering.
Exact cluster recovery with same-cluster queries for arbitrary ellipsoidal clusters.
Paper proposes a new co-clustering method for overlapping clusters and outliers.
Network Lasso clusters sparse graph clusters efficiently.
The paper connects two clustering methods by showing gradient ascent flow can move up the cluster tree.
Paper proposes a new clustering model that preserves cluster recovery with fewer dimensions.
Recently, deep clustering, which is able to perform feature learning that favors clustering tasks via deep neural networks, has achieved remarkable performance in image clustering applications. However, the existing deep clustering algorithms generally need the number of clusters in advance, which is usually unknown in…
Clustering is a widely used unsupervised learning method for finding structure in the data. However, the resulting clusters are typically presented without any guarantees on their robustness; slightly changing the used data sample or re-running a clustering algorithm involving some stochastic component may lead to comp…
FCA improves fair clustering by optimizing utility and fairness.
New algorithm clusters hyperspectral images at multiple scales.
FBC clusters data fairly without needing cluster count.
New SDP algorithm recovers large clusters in SBM with small clusters of any size.
A main task in data analysis is to organize data points into coherent groups or clusters. The stochastic block model is a probabilistic model for the cluster structure. This model prescribes different probabilities for the presence of edges within a cluster and between different clusters. We assume that the cluster ass…
With inspiration from Random Forests (RF) in the context of classification, a new clustering ensemble method---Cluster Forests (CF) is proposed. Geometrically, CF randomly probes a high-dimensional data cloud to obtain "good local clusterings" and then aggregates via spectral clustering to obtain cluster assignments fo…
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…
A clustering may be considered as fair on pre-specified sensitive attributes if the proportions of sensitive attribute groups in each cluster reflect that in the dataset. In this paper, we consider the task of fair clustering for scenarios involving multiple multi-valued or numeric sensitive attributes. We propose a fa…
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…