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,695 papers · 148 categories

Trend · papers per month

52103155206 · Jun 202019922001200920172026
48 results for Correlation Clustering

CCP clusters correlated features and projects them to 1D for efficient dimensionality reduction.

problem Efficiency in handling large datasets with high intrinsic dimensions.
method CCP partitions features into correlated clusters and projects them to 1D based on sample correlations.
result CCP achieves efficient dimensionality reduction without matrix diagonalization.

CSTS benchmarks time series clustering by evaluating correlation structures.

problem Lack of validated ground truth for objectively assessing clustering quality.
method Synthetic benchmark CSTS for evaluating correlation structures in multivariate time series data.
result CSTS enables precise diagnosis of methodological limitations in correlation-based time series clustering.

Active learning optimizes correlation clustering by querying the most informative pairwise comparisons.

problem Efficiently clustering data with limited pairwise similarity information.
method Developed principled active learning approach using information-theoretic acquisition functions.
result Significantly outperforms existing baselines in clustering accuracy and query efficiency.

DynMSA detects market clusters for better portfolio allocation.

problem Identifying stable market clusters for effective portfolio management.
method Combining Random Matrix Theory with modularity optimization and spectral clustering.
result DynMSA outperforms baseline models in intra- and inter-cluster correlation differences.

In this paper, we study correlation clustering under fairness constraints. Fair variants of kk-median and kk-center clustering have been studied recently, and approximation algorithms using a notion called fairlet decomposition have been proposed. We obtain approximation algorithms for fair correlation clustering und…

2020-02-06abs ↗pdf ↗

The study uses DCC for financial market analysis, revealing hidden correlations.

problem Identifying hidden nonlinear correlations in financial markets.
method Agglomerative hierarchical clustering with distance correlation coefficient.
result DCC reveals more information than Pearson correlation for financial data.

New RDPC dissimilarity measure improves time series clustering.

problem Improving time series clustering methods for diverse data.
method Combining weighted Pearson correlation with largest element-wise differences.
result RDPC outperforms existing methods in complex datasets.

In this paper we study the problem of correlation clustering under fairness constraints. In the classic correlation clustering problem, we are given a complete graph where each edge is labeled positive or negative. The goal is to obtain a clustering of the vertices that minimizes disagreements -- the number of negative…

2020-02-10abs ↗pdf ↗

This paper optimizes cryptocurrency portfolios by clustering price correlations and improving risk-return profiles.

problem Volatility and regulatory uncertainty in cryptocurrency markets make portfolio construction challenging.
method The paper combines network analysis, price forecasting, and portfolio theory to identify stable groups of correlated cryptocurrencies.
result Predictive consensus-clustering portfolios maintain positive and stable performance up to a 14-day horizon, with favourable gain-loss asymmetry and tighter tail-risk control.

Cluster GARCH model improves multivariate GARCH for high-dimensional asset returns.

problem Modeling high-dimensional asset returns with flexible tail dependencies and cluster structures.
method Introduced a novel multivariate GARCH model with flexible convolution-t distributions, tractable likelihood and derivatives for dynamic correlation structure.
result Cluster GARCH model outperforms existing models in daily returns of 100 assets, both in-sample and out-of-sample.

A measure called relative cluster entropy distinguishes between correlated and uncorrelated sequences.

problem Distinguishing between sequences with different correlation degrees.
method Minimum relative entropy principle applied to cluster partitions of power-law correlated sequences.
result Optimal Hurst exponents are selected for market price series, indicating non-markovianity.

We describe a new optimization scheme for finding high-quality correlation clusterings in planar graphs that uses weighted perfect matching as a subroutine. Our method provides lower-bounds on the energy of the optimal correlation clustering that are typically fast to compute and tight in practice. We demonstrate our a…

2012-08-02abs ↗pdf ↗

Quantum GBS boosts asset clustering for robust statistical arbitrage portfolios.

problem Identifying co-moving assets from correlation matrices for statistical arbitrage.
method Mapping S&P 500 correlation data to GBS-compatible adjacency matrices, benchmarking classical and quantum clustering algorithms.
result Quantum GBS generates superior alpha during high volatility periods, persisting under low-loss conditions.

In correlation clustering, we are given nn objects together with a binary similarity score between each pair of them. The goal is to partition the objects into clusters so to minimise the disagreements with the scores. In this work we investigate correlation clustering as an active learning problem: each similarity sc…

2019-05-28abs ↗pdf ↗

Data de-duplication is the task of detecting multiple records that correspond to the same real-world entity in a database. In this work, we view de-duplication as a clustering problem where the goal is to put records corresponding to the same physical entity in the same cluster and putting records corresponding to diff…

2018-10-10abs ↗pdf ↗

End-to-end deep learning for multi-view clustering improves accuracy across various data types.

problem Limited multi-view clustering methods for general data types and suboptimal two-stage process.
method Permutation-based canonical correlation objective for fused representations; pseudo-labels for clustering; theoretical error bound.
result Proposed model provides meaningful fused representations and effective clustering across multiple views.

Given a similarity graph between items, correlation clustering (CC) groups similar items together and dissimilar ones apart. One of the most popular CC algorithms is KwikCluster: an algorithm that serially clusters neighborhoods of vertices, and obtains a 3-approximation ratio. Unfortunately, KwikCluster in practice re…

2015-07-17abs ↗pdf ↗

VC-PCR improves prediction by clustering correlated variables.

problem Decreased prediction accuracy due to cluster structure in predictor variables.
method Supervised variable selection and clustering to integrate cluster information into a sparse modeling process.
result VC-PCR achieves better prediction, variable selection, and clustering performance.

Spatially relaxed inference tackles high-dimensional linear models with correlated covariates.

problem Accurate inference is challenging in high-dimensional settings with spatially correlated covariates.
method Proposes ensembled clustered inference algorithms that control the δδ-FWER under standard assumptions.
result Ensembled clustered inference algorithms control the δδ-FWER and achieve decent power.

In this work, the possibility of clustering correlated random variables was examined, both because of their mutual similarity and because of their similarity to the principal components. The k-means algorithm and spectral algorithms were used for clustering. For spectral methods, the similarity matrix was both the matr…

2019-09-07abs ↗pdf ↗

New method clusters evolving networks using spatio-temporal graph Laplacian.

problem Clustering communities in time-varying graphs.
method Extends spectral clustering to dynamic graphs using CCA and spatio-temporal graph Laplacian.
result The spatio-temporal graph Laplacian clearly interprets cluster evolution over time.

This study uses moving average cluster entropy to analyze financial market dynamics.

problem Understanding long-range dependence in financial markets.
method Moving average cluster entropy approach applied to ARFIMA and FBM processes.
result Long-range positive correlation in financial markets is linked to the cluster entropy behavior.

We study the structure of locational marginal prices in day-ahead and real-time wholesale electricity markets. In particular, we consider the case of two North American markets and show that the price correlations contain information on the locational structure of the grid. We study various clustering methods and intro…

2017-10-31abs ↗pdf ↗

Researchers have used from 30 days to several years of daily returns as source data for clustering financial time series based on their correlations. This paper sets up a statistical framework to study the validity of such practices. We first show that clustering correlated random variables from their observed values i…

2016-03-13abs ↗pdf ↗

This paper presents a novel application of a clustering algorithm developed for constructing a phylogenetic network to the correlation matrix for 126 stocks listed on the Shanghai A Stock Market. We show that by visualizing the correlation matrix using a Neighbor-Net network and using the circular ordering produced dur…

2015-11-25abs ↗pdf ↗

Develops a new random forest method for clustered data with improved prediction and inference.

problem Improving prediction and inference accuracy for clustered data with within-cluster dependence.
method Clustered Random Forests, using weighted least squares estimators for leaf predictions.
result Optimal prediction and inference weights vary under covariate shift, necessitating user-chosen weights.

The paper explores how macroeconomic variables' correlation structure changes over time and under different scenarios.

problem Understanding the changing correlation structure of macroeconomic variables.
method The paper uses a principal component based algorithm to perform unsupervised clustering on macroeconomic variables.
result The correlation structure of macroeconomic variables changes significantly during financial crises and under hypothetical scenarios.

New method separates market motion from stock correlations.

problem Understanding the dynamics of stock correlations relative to market motion.
method Cluster reduced-rank correlation matrices by subtracting the largest eigenvalue.
result Extracted market states are quasi-stationary over long periods.