Research
On-device research index

arXiv research

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.

168,657 papers · 148 categories

Trend · papers per month

4590135180 · Jun 202019922001200920172026
48 results for cluster assessment

C-FAR automates clustering assessment for neural tracking.

problem Manual assessment of clusters by humans is slow and impractical for large datasets.
method C-FAR uses automated feedback queries to select optimal clustering from multiple algorithms.
result C-FAR produces near-perfect clustering on simulated neural data.

This paper addresses clustering with missing data using Rubin's rules.

problem How to pool partitions and assess instability when data are incomplete after multiple imputation.
method Consensus clustering and bootstrap theory are used to address the problem.
result New rules for pooling partitions and assessing instability are proposed and validated.

Proposes ConiVAT for better cluster assessment and clustering with background knowledge.

problem Challenges in cluster assessment and clustering with noise and bridge points.
method Uses background constraints to improve VAT/iVAT for complex datasets.
result Improves clustering accuracy and resolves issues with noise and bridge points.

A cluster tree provides a highly-interpretable summary of a density function by representing the hierarchy of its high-density clusters. It is estimated using the empirical tree, which is the cluster tree constructed from a density estimator. This paper addresses the basic question of quantifying our uncertainty by ass…

2016-05-20abs ↗pdf ↗

We assess cluster stability by trimming extreme points and tracking data range reduction.

problem Assessing stability of one-dimensional clusters.
method Probabilistic method using diameter-shrinkage ratio to track data range reduction.
result Our method achieves higher accuracy than classical tests in small or noisy samples.

Hierarchical graph clustering is a common technique to reveal the multi-scale structure of complex networks. We propose a novel metric for assessing the quality of a hierarchical clustering. This metric reflects the ability to reconstruct the graph from the dendrogram, which encodes the hierarchy. The optimal represent…

2018-07-13abs ↗pdf ↗

In this article we propose a novel measure of systemic risk in the context of financial networks. To this aim, we provide a definition of systemic risk which is based on the structure, developed at different levels, of clustered neighbours around the nodes of the network. The proposed measure incorporates the generaliz…

2018-10-31abs ↗pdf ↗

We present two related methods for deriving connectivity-based brain atlases from individual connectomes. The proposed methods exploit a previously proposed dense connectivity representation, termed continuous connectivity, by first performing graph-based hierarchical clustering of individual brains, and subsequently a…

2018-08-10abs ↗pdf ↗

This research evaluates and introduces new heuristics for clustering Bitcoin blockchain entities.

problem Efficiently analyzing the vast number of Bitcoin blockchain entities.
method Examined and introduced four new heuristics for clustering Bitcoin blockchain entities.
result Introduced clustering ratio to measure heuristic effectiveness.

This study evaluates clustering algorithms on high-dimensional data.

problem Comparing clustering algorithms on high-dimensional datasets.
method Evaluation of K-means, DBSCAN, and Spectral Clustering using PCA, t-SNE, UMAP, and multiple metrics.
result UMAP preprocessing improves clustering quality across all algorithms, with Spectral Clustering excelling.

Software package assesses spherical data distributions and clusters.

problem Assessing and clustering spherical data distributions.
method Innovative goodness-of-fit tests and clustering algorithms using kernel-based quadratic distances.
result Efficient and mathematically sound goodness-of-fit tests for spherical data.

Quality assessments of models in unsupervised learning and clustering verification in particular have been a long-standing problem in the machine learning research. The lack of robust and universally applicable cluster validity scores often makes the algorithm selection and hyperparameter evaluation a tough guess. In t…

2018-03-29abs ↗pdf ↗

Bayesian Supervised Causal Clustering identifies patient subgroups for personalized decision-making.

problem Finding patient subgroups with similar characteristics for personalized decision-making.
method Bayesian Supervised Causal Clustering (BSCC) that identifies homogenous subgroups based on treatment effects.
result BSCC identifies subgroups with similar covariate profiles and treatment effects.

Clustering is a fundamental task in data analysis, and spectral clustering has been recognized as a promising approach to it. Given a graph describing the relationship between data, spectral clustering explores the underlying cluster structure in two stages. The first stage embeds the nodes of the graph in real space, …

2018-05-11abs ↗pdf ↗

Paper models treatment effects by clustering patients with distinct survival characteristics.

problem Estimating treatment efficacy in clinical settings with censored outcomes.
method Latent variable approach to model heterogeneous treatment effects.
result The latent structure can mediate base survival rates and reveal actionable phenotypes.

ClusterLOB clusters market events to identify different trading behaviors.

problem Understanding market microstructure and participant behavior in financial markets.
method ClusterLOB uses K-means++ algorithm to cluster market events based on six time-dependent features.
result ClusterLOB identifies three distinct trading behaviors: directional, opportunistic, and market-making participants.

Model-based clustering is widely-used in a variety of application areas. However, fundamental concerns remain about robustness. In particular, results can be sensitive to the choice of kernel representing the within-cluster data density. Leveraging on properties of pairwise differences between data points, we propose a…

2018-10-19abs ↗pdf ↗

A unified clustering approach that can estimate number of clusters and produce clustering against this number simultaneously is proposed. Average silhouette width (ASW) is a widely used standard cluster quality index. A distance based objective function that optimizes ASW for clustering is defined. The proposed algorit…

2019-10-18abs ↗pdf ↗

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…

2019-02-14abs ↗pdf ↗

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…

2017-01-23abs ↗pdf ↗

Distributed processing over networks relies on in-network processing and cooperation among neighboring agents. Cooperation is beneficial when agents share a common objective. However, in many applications agents may belong to different clusters that pursue different objectives. Then, indiscriminate cooperation will lea…

2014-09-22abs ↗pdf ↗

Advances neural tri-factorization for clustering and discordance analysis of multi-typed data.

problem Challenges in analyzing heterogeneous, multimodal relational data.
method Deep collective matrix tri-factorization for spectral clustering and cluster association learning.
result Demonstrates efficacy over previous non-neural approaches in clustering and discordance analysis.

A recent trend in machine learning has been to enrich learned models with the ability to explain their own predictions. The emerging field of Explainable AI (XAI) has so far mainly focused on supervised learning, in particular, deep neural network classifiers. In many practical problems however, label information is no…

2019-06-18abs ↗pdf ↗

In several application domains, high-dimensional observations are collected and then analysed in search for naturally occurring data clusters which might provide further insights about the nature of the problem. In this paper we describe a new approach for partitioning such high-dimensional data. Our assumption is that…

2012-03-05abs ↗pdf ↗

Study proposes a statistical testing framework for evaluating clustering pipelines.

problem Quantifying the statistical reliability of clustering results from data analysis pipelines.
method Selective inference-based statistical testing framework for clustering pipelines.
result The proposed test controls the type I error rate and is effective in validating clustering results.

Radar sensors provide a unique method for executing environmental perception tasks towards autonomous driving. Especially their capability to perform well in adverse weather conditions often makes them superior to other sensors such as cameras or lidar. Nevertheless, the high sparsity and low dimensionality of the comm…

2019-07-08abs ↗pdf ↗

Paper develops a novel approach to identify clusters of features in multivariate extremes.

problem Understanding the complex structure of multivariate extremes in various fields.
method Optimization-based approach to assess the dependence structure of extremes.
result Estimating clusters of features that best capture the support of extremes.