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.
Two new Hie-TAN and Hie-TAN-Lite algorithms improve TAN for hierarchical feature spaces.
Hierarchical structure is ubiquitous in data across many domains. There are many hierarchical clustering methods, frequently used by domain experts, which strive to discover this structure. However, most of these methods limit discoverable hierarchies to those with binary branching structure. This limitation, while com…
Locally adaptive clustering for tree delineation.
Method learns hierarchical representations of samples and features simultaneously.
New clustering method recovers hidden tree structure from data.
Interactive steering improves hierarchical clustering for diverse user needs.
Proposes a hierarchical clustering method for positive and negative dissimilarities.
A new hierarchical clustering method selects representative points from sub-minimum-spanning-trees.
We studied the topology of correlation networks among 34 major currencies using the concept of a minimal spanning tree and hierarchical tree for the full years of 2007-2008 when major economic turbulence occurred. We used the USD (US Dollar) and the TL (Turkish Lira) as numeraires in which the USD was the major currenc…
Tree-based variational inference improves PLN model for hierarchical count data.
Tree-SNE combines t-SNE and hierarchical clustering for data visualization.
New framework estimates staged tree models using hierarchical clustering on the probability simplex.
Many data are naturally modeled by an unobserved hierarchical structure. In this paper we propose a flexible nonparametric prior over unknown data hierarchies. The approach uses nested stick-breaking processes to allow for trees of unbounded width and depth, where data can live at any node and are infinitely exchangeab…
We discuss some methods to quantitatively investigate the properties of correlation matrices. Correlation matrices play an important role in portfolio optimization and in several other quantitative descriptions of asset price dynamics in financial markets. Specifically, we discuss how to define and obtain hierarchical …
Dropout is a very effective method in preventing overfitting and has become the go-to regularizer for multi-layer neural networks in recent years. Hierarchical mixture of experts is a hierarchically gated model that defines a soft decision tree where leaves correspond to experts and decision nodes correspond to gating …
We investigate hierarchical structure in various complex systems according to Minimum Spanning Tree methods. Firstly, we investigate stock markets where the graphis obtained from the matrix of correlations coefficient computed between all pairs of assets by considering the synchronous time evolution of the difference o…
Proposes a method to improve hierarchical clustering using set-level structural priors.
Defines hierarchical clustering axioms for various densities.
This work introduces a method for visualizing high-dimensional posteriors using hierarchical tree-valued predictions.
Probabilistic label trees improve XMLC by organizing labels hierarchically.
Paper addresses limitations of traditional hierarchical clustering methods.
Study on embedding tree products into groups, distinguishing them.
Paper presents a new method for learning hyperbolic representations using tree structures.
We investigate hierarchical structures of the European countries by using debt as a percentage of Gross Domestic Product (GDP) of the countries as they change over a certain period of time. We obtain the topological properties among the countries based on debt as a percentage of GDP of European countries over the perio…
A new method for hierarchical clustering using continuous embeddings and optimization.
We define the beta diffusion tree, a random tree structure with a set of leaves that defines a collection of overlapping subsets of objects, known as a feature allocation. A generative process for the tree structure is defined in terms of particles (representing the objects) diffusing in some continuous space, analogou…
Failing to distinguish between a sheepdog and a skyscraper should be worse and penalized more than failing to distinguish between a sheepdog and a poodle; after all, sheepdogs and poodles are both breeds of dogs. However, existing metrics of failure (so-called "loss" or "win") used in textual or visual classification/r…
Hierarchical-CPI improves variable importance measurement for medical data.
Simulation study evaluates tree-based imputation methods for multi-level data.
Hierarchical NMF organizes COVID-19 literature into a searchable tree.
The paper develops a decision support system for hierarchical text classification of conference proceedings.
Agglomerative hierarchical clustering can be implemented with several strategies that differ in the way elements of a collection are grouped together to build a hierarchy of clusters. Here we introduce versatile linkage, a new infinite system of agglomerative hierarchical clustering strategies based on generalized mean…
The paper proposes a new probability distribution for rooted trees.
New A* algorithm improves hierarchical clustering quality.
The paper proposes blending gradient boosted trees and neural networks for hierarchical time series forecasting.
This paper uses two hierarchical techniques, a minimal spanning tree and an ultrametric hierarchical tree, to extract a topological influence map for major currencies from the ultrametric distance matrix for 1996-2001. We find that these two techniques generate a defined and robust scale free network with meaningful ta…
TreeHFD algorithm explains tree ensemble models through hierarchical orthogonality.
We consider the problem of estimating a sparse multi-response regression function, with an application to expression quantitative trait locus (eQTL) mapping, where the goal is to discover genetic variations that influence gene-expression levels. In particular, we investigate a shrinkage technique capable of capturing a…
Many modern clustering methods scale well to a large number of data items, N, but not to a large number of clusters, K. This paper introduces PERCH, a new non-greedy algorithm for online hierarchical clustering that scales to both massive N and K--a problem setting we term extreme clustering. Our algorithm efficiently …
Multicurve stabilizers' extensions are hierarchically hyperbolic.
Grinch efficiently clusters large datasets with complex structures.
We investigate the hierarchical structures of countries based on electricity consumption and economic growth by using the real amounts of their consumption over a certain time period. We use of electricity consumption data to detect the topological properties of 60 countries from 1971 to 2008. These countries are divid…
GAMI-Tree uses model-based trees to fit low-order fANOVA models.
The benefits of diversifying risks are difficult to estimate quantitatively because of the uncertainties in the dependence structure between the risks. Also, the modelling of multidimensional dependencies is a non-trivial task. This paper focuses on one such technique for portfolio aggregation, namely the aggregation o…
Hierarchical clustering is a popular method for analyzing data which associates a tree to a dataset. Hartigan consistency has been used extensively as a framework to analyze such clustering algorithms from a statistical point of view. Still, as we show in the paper, a tree which is Hartigan consistent with a given dens…
We quantify the amount of information filtered by different hierarchical clustering methods on correlations between stock returns comparing it with the underlying industrial activity structure. Specifically, we apply, for the first time to financial data, a novel hierarchical clustering approach, the Directed Bubble Hi…
Loss assigns examples to classes and superclasses in hierarchical data.
We propose a new anytime hierarchical clustering method that iteratively transforms an arbitrary initial hierarchy on the configuration of measurements along a sequence of trees we prove for a fixed data set must terminate in a chain of nested partitions that satisfies a natural homogeneity requirement. Each recursive …