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.
New model detects crime linkages from text, time, and space.
Predictive policing models can be biased by differential crime reporting rates.
The paper introduces a US crime index to assess financial losses from property and cyber crimes.
Paper aims to use AI for detecting financial crimes, focusing on money laundering.
Understanding the causes of crime is a longstanding issue in researcher's agenda. While it is a hard task to extract causality from data, several linear models have been proposed to predict crime through the existing correlations between crime and urban metrics. However, because of non-Gaussian distributions and multic…
Accurate real time crime prediction is a fundamental issue for public safety, but remains a challenging problem for the scientific community. Crime occurrences depend on many complex factors. Compared to many predictable events, crime is sparse. At different spatio-temporal scales, crime distributions display dramatica…
Paper predicts crimes using historical data and machine learning.
The paper models crime risk using Foursquare check-ins and mobility data.
The objective of this work is to take advantage of deep neural networks in order to make next day crime count predictions in a fine-grain city partition. We make predictions using Chicago and Portland crime data, which is augmented with additional datasets covering weather, census data, and public transportation. The c…
In this paper, a detailed study on crime classification and prediction using deep learning architectures is presented. We examine the effectiveness of deep learning algorithms on this domain and provide recommendations for designing and training deep learning systems for predicting crime areas, using open data from pol…
The study improves crime prediction using Foursquare and streetlight data with demographic info.
We present a new approach for detecting related crime series, by unsupervised learning of the latent feature embeddings from narratives of crime record via the Gaussian-Bernoulli Restricted Boltzmann Machines (RBM). This is a drastically different approach from prior work on crime analysis, which typically considers on…
Real-time crime forecasting is important. However, accurate prediction of when and where the next crime will happen is difficult. No known physical model provides a reasonable approximation to such a complex system. Historical crime data are sparse in both space and time and the signal of interests is weak. In this wor…
Predictive policing systems are increasingly used to determine how to allocate police across a city in order to best prevent crime. Discovered crime data (e.g., arrest counts) are used to help update the model, and the process is repeated. Such systems have been empirically shown to be susceptible to runaway feedback l…
New approach predicts crime and terrorism events with high accuracy and transparency.
This study predicts crime trends in Denver using machine learning.
CRIMED optimizes regret in bandits with unbounded stochastic corruption.
We present a novel event embedding algorithm for crime data that can jointly capture time, location, and the complex free-text component of each event. The embedding is achieved by regularized Restricted Boltzmann Machines (RBMs), and we introduce a new way to regularize by imposing a penalty on the conditiona…
CASTNet forecasts opioid overdoses using crime patterns.
Paper proposes a federated graph learning platform to improve financial crime detection.
A new clustering method versatile linkage improves on existing strategies.
New method for estimating firm linkages using CVLs and QCML.
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 …
Paper introduces a method for supervised hierarchical clustering with Exponential Linkage.
New closed linkage mechanisms with Möbius strip properties.
Cryptocurrencies are becoming more linked in their returns and volatilities.
Paper addresses limitations of traditional hierarchical clustering methods.
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.
New bounds improve linkage methods for clustering, distinguishing complete-link from single-link.
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…
Hierarchical clustering uses OWA operators to generalize linkage methods and avoid dendrogram inversions.
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.
Before a person can be prosecuted and convicted for insider trading, he must first execute the overt act of trading. If no sale of security is consummated, no crime is also consummated. However, through a complex and insidious combination of various financial instruments, one can capture the same amount of gains from i…
We prove diffeomorphisms of polygonal linkage moduli spaces to Euclidean spaces.