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.
Hierarchical clustering uses OWA operators to generalize linkage methods and avoid dendrogram inversions.
A new clustering method versatile linkage improves on existing strategies.
New bounds improve linkage methods for clustering, distinguishing complete-link from single-link.
Paper introduces a method for supervised hierarchical clustering with Exponential Linkage.
Novel bistable structures made from four-bar linkages, proving existence and construction.
Paper addresses limitations of traditional hierarchical clustering methods.
Develops comparison-based hierarchical clustering algorithms without object representations.
Genie clusters faster and resists outliers.
New framework estimates staged tree models using hierarchical clustering on the probability simplex.
New method for estimating firm linkages using CVLs and QCML.
This paper proposes a simple but effective graph-based agglomerative algorithm, for clustering high-dimensional data. We explore the different roles of two fundamental concepts in graph theory, indegree and outdegree, in the context of clustering. The average indegree reflects the density near a sample, and the average…
The geometric, topological, and symplectic properties of moduli spaces (spaces of configurations modulo rotations and translations) of polygonal linkages have been studied by Kapovich, Millson, and Kamiyama, et. al. One can form a polygonal linkage by taking two free linkages and identifying initial and terminal vertic…
Minimax linkage improves clustering interpretability by minimizing maximum distance to prototypes.
This paper studies the configuration space of all possible positions of a linkage in R^n. For example, it shows that for every compact algebraic set, there is a linkage whose configuration space is analytically isomorphic to a finite number of copies of the algebraic set. If flexible edges are allowed, any compact set …
New closed linkage mechanisms with Möbius strip properties.
Two solutions for multi-modal record linkage using Deep Learning inspired by Visual Question Answering.
Cryptocurrencies are becoming more linked in their returns and volatilities.
New model detects crime linkages from text, time, and space.
New method extracts all reliable linkages in agglomerative clustering.
Paper analyzes a three-loop linkage, showing it's overconstrained and shaky.
Moduli spaces of planar polygonal linkages admit a cell structure which can be realized as a surgery on the permutohedron. We present a 3D visualization of the result of the surgery for all types of non-degenerate pentagonal linkages.
We prove realizability theorems for vector-valued polynomial mappings, real-algebraic sets and compact smooth manifolds by moduli spaces of planar linkages. We also establish a relation between universality theorems for moduli spaces of mechanical linkages and projective arrangements.
A mechanical linkage is a mechanism made of rigid rods linked together by flexible joints, in which some vertices are fixed and others may move. The partial configuration space of a linkage is the set of all the possible positions of a subset of the vertices. We characterize the possible partial configuration spaces of…
RLINK uses deep reinforcement learning to improve user identity linkage across social networks.
Study examines insurance sector linkages and systemic risk using dynamic spanning trees.
A linkage is a finite graph with lengths assigned to each edge. A planar realization is a map to the plane which preserves edge lengths. It can be thought of as a mechanical device formed from stiff rods and rotating joints. We look at the configuration space of all planar realizations of a linkage (following work of K…
Paper studies how discrete space curves with constant torsion deform to model linkage motions.
A mechanical linkage is a mechanism made of rigid rods linked together by flexible joints, in which some vertices are fixed and others may move. The partial configuration space of a linkage is the set of all the possible positions of a subset of the vertices. We characterize the possible partial configuration spaces of…
Record linkage involves merging records in large, noisy databases to remove duplicate entities. It has become an important area because of its widespread occurrence in bibliometrics, public health, official statistics production, political science, and beyond. Traditional linkage methods directly linking records to one…
Study explores financial market linkages between Japan and US markets.
The task of matching co-referent records is known among other names as rocord linkage. For large record-linkage problems, often there is little or no labeled data available, but unlabeled data shows a reasonable clear structure. For such problems, unsupervised or semi-supervised methods are preferable to supervised met…
We study configuration spaces of linkages whose underlying graph are polygons with diagonal constrains, or more general, partial two-trees. We show that (with an appropriate definition) the oriented area is a Bott-Morse function on the configuration space. Its critical points are described and Bott-Morse indices are co…
We study spaces of realisations of linkages (weighted graphs) whose underlying graph is a series parallel graph. In particular, we describe an algorithm for determining whether or not such spaces are connected.
We prove diffeomorphisms of polygonal linkage moduli spaces to Euclidean spaces.
Study maps interdependence of SDGs, finds complex, dynamic linkages.
Knowledge graphs have emerged as an important model for studying complex multi-relational data. This has given rise to the construction of numerous large scale but incomplete knowledge graphs encoding information extracted from various resources. An effective and scalable approach to jointly learn over multiple graphs …
Grinch efficiently clusters large datasets with complex structures.
This paper characterizes which subsets of C^n can be the set of positions of n points on a linkage in the complex plane C. For example, assuming compactness they are just compact semialgebraic sets. Noncompact configuration spaces are semialgebraics sets invariant under the Euclidean group, with compact quotient.
An efficient method to compute a single linkage dendrogram.
Any smooth surface in R^3 may be flattened along the z-axis, and the flattened surface becomes close to a billiard table in R^2 . We show that, under some hypotheses, the geodesic flow of this surface converges locally uniformly to the billiard flow. Moreover, if the billiard is dispersive and has finite horizon, then …
Proposes a novel classifier for probabilistic record linkage.
Proposes a revenue function to evaluate dendrograms from comparisons.
In this short paper, the Electre Tri-Machine Learning Method, generally used to solve ordinal classification problems, is proposed for solving the Record Linkage problem. Preliminary experimental results show that, using the Electre Tri method, high accuracy can be achieved and more than 99% of the matches and nonmatch…
We study topology of configuration spaces of planar linkages having one leg of variable length. Such telescopic legs are common in modern robotics where they are used for shock absorbtion and serve a variety of other purposes. Using a Morse theoretic technique, we compute explicitly, in terms of the metric data, the Be…
The oriented area function is (generically) a Morse function on the space of planar configurations of a polygonal linkage. We are lucky to have an easy description of its critical points as cyclic polygons and a simple formula for the Morse index of a critical point. However, for planar polygons, the function i…
New approach approximates c-space geometry of multi-loop linkages.
We study the topological and differentiable singularities of the configuration space C(Γ) of a mechanical linkage Γin d-dimensional Euclidean space, defining an inductive sufficient condition to determine when a configuration is singular. We show that this condition holds for generic singularities, provide a mechanical…
This work proposes a novel solution to the problem of internal covariate shift and dying neurons using the concept of linked neurons. We define the neuron linkage in terms of two constraints: first, all neuron activations in the linkage must have the same operating point. That is to say, all of them share input weights…