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…
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.
169,051 papers · 148 categories
Trend · papers per month
48 results for “computer crime”
Predictive policing models can be biased by differential crime reporting rates.
problem Bias in predictive policing models due to differential crime reporting.
method Simulation based on Bogotá, Colombia's victimization and crime reporting data.
result Differential crime reporting rates can lead to misallocation of police patrols.
New model detects crime linkages from text, time, and space.
problem Detecting crime linkages from limited information.
method Spatio-temporal-textual Hawkes processes with text embeddings.
result Joint modeling of space, time, and text enhances crime linkage detection.
Deep learning improves crime prediction accuracy.
problem Improving crime prediction accuracy using deep learning.
method Comparative study of 10 deep learning methods on crime data.
result Deep learning methods outperform existing methods in crime prediction.
The paper introduces a US crime index to assess financial losses from property and cyber crimes.
problem Lack of indices evaluating crime's financial impact on investments.
method Developed an index-based insurance portfolio using FBI financial losses data.
result Real estate, ransomware, and government impersonation are major risk contributors.
Paper aims to use AI for detecting financial crimes, focusing on money laundering.
problem Financial institutions need better technologies to detect and predict financial crimes.
method Study recent works, develop a novel model for money laundering detection.
result Demonstrates a model for detecting money laundering cases with minimal human intervention.
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.
problem Predicting and preventing crime activities.
method Supervised learning with decision tree, k-nearest neighbor, Random Forest, and Adaboost algorithms.
result The system predicts crimes with better accuracy using historical data.
The paper models crime risk using Foursquare check-ins and mobility data.
problem Understanding and predicting crime risk in urban areas.
method Directed graph of aggregated movement data, region risk factor derivation, DIFFER features.
result Reliable correlations between DIFFER features and crime count observed.
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…
The study improves crime prediction using Foursquare and streetlight data with demographic info.
problem Improving crime prediction models using diverse data sources.
method Combining Foursquare and streetlight data with demographic info for crime prediction.
result The proposed model enhances classification performance in crime prediction.
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.
problem Predicting crime and terrorism events with high accuracy and interpretability.
method Granger Network inference for local transport rules learning.
result Achieved AUC of ~90% for crime predictions and ~80% for terrorism predictions.
This study predicts crime trends in Denver using machine learning.
problem Predicting crime patterns to aid law enforcement and resource allocation.
method Statistical analysis, data visualization, and various classification algorithms.
result Ensemble Model 4 achieved the highest accuracy in predicting crime.
Law responds to adversarial machine learning threats.
problem Adversarial machine learning attacks and their legal implications.
method Scenarios and legal analysis of adversarial ML attacks.
result Some attacks are more likely to result in liability.
CRIMED optimizes regret in bandits with unbounded stochastic corruption.
problem Minimizing regret in bandits with arbitrary unbounded corruptions.
method Introduces CRIMED, an asymptotically-optimal algorithm for Gaussian distributions with known variance.
result Achieves exact lower bound on regret for Gaussian distributions with high corruption probability.
CASTNet forecasts opioid overdoses using crime patterns.
problem Forecasting opioid overdose occurrences.
method Community-attentive spatio-temporal networks incorporating multi-head attention.
result Superior forecasting performance and interpretable community contributions.
Paper proposes a federated graph learning platform to improve financial crime detection.
problem Current financial crime detection methods are ineffective and costly.
method Federated graph learning platform combining federated learning and graph learning.
result Federated model outperforms local model by 20%.
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 propose a generic spatiotemporal event forecasting method, which we developed for the National Institute of Justice's (NIJ) Real-Time Crime Forecasting Challenge. Our method is a spatiotemporal forecasting model combining scalable randomized Reproducing Kernel Hilbert Space (RKHS) methods for approximating Gaussian …
Paper explores how unsupervised learning reduces financial crime risks.
problem Identifying high-risk financial groups from complex data.
method Combines clustering and dimensionality reduction techniques.
result KPCA outperforms other techniques in reducing financial crime risks.
New framework models time-uncertain point processes for better event prediction.
problem Uncertainty in event times in point processes.
method Formulated and discretized continuous-time Hawkes processes with time grid, enabling optimization methods for inference.
result Parameter recovery with convergence rate using gradient descent and VI.
New fair-by-design model reduces bias in recidivism prediction.
problem Discriminatory bias in recidivism prediction models.
method Prototype-based, locally learned, data distribution extraction.
result Reduces bias and provides interpretable rules.
Nested model averaging improves high-dimensional linear regression performance.
problem High-dimensional linear regression with predictor ordering impact.
method Combining model averaging with regularized estimators on the solution path.
result Nested model averaging with lasso and SLOPE outperforms competing methods.
Machine learning improves risk assessment for gender-based violence victims.
problem Accurately predicting recidivism risk in gender-based crime victims.
method Applied machine learning techniques to create models predicting recidivism risk.
result Proposed ML method outperforms classical statistical methods.
New model helps identify suspect footwear from crime scene prints.
problem Identifying a suspect's footwear from crime scene prints among thousands of similar shoes.
method Developed a hierarchical Bayesian model with spatially varying coefficients.
result Improved accuracy and reliability in forensic shoe print analysis.
Paper proposes SOTL framework for improving transfer learning accuracy and efficiency.
problem Statistical bias and computational efficiency in multi-source domain adaptation.
method Sparse Optimization for Transfer Learning (SOTL) with L0-regularization.
result SOTL significantly improves estimation accuracy and computational speed, especially under adversarial conditions.
Settings such as lending and policing can be modeled by a centralized agent allocating a resource (loans or police officers) amongst several groups, in order to maximize some objective (loans given that are repaid or criminals that are apprehended). Often in such problems fairness is also a concern. A natural notion of…
New method reconstructs networks from spatiotemporal data.
problem Network reconstruction from spatiotemporal data.
method Multivariate Hawkes processes using both temporal and spatial information.
result Spatiotemporal approach yields improved network reconstruction.
Consider a multi-variate time series where which may represent spike train responses for multiple neurons in a brain, crime event data across multiple regions, and many others. An important challenge associated with these time series models is to estimate an influence network be…
Estimates network structure from incomplete event data.
problem Estimating network structure from incomplete event data.
method Developed a novel approach using an unbiased estimator of the complete data log-likelihood function.
result Proposed a computationally efficient estimation algorithm.
We propose an efficient method for estimating covariate effects in doubly-stochastic spatial models.
problem Computational demands and restrictive assumptions in existing doubly-stochastic spatial models.
method Penalized regression method for estimating covariate effects in doubly-stochastic point processes.
result Consistency and asymptotic normality of the covariate effect estimates achieved despite model misspecification.
Survey of robust clustering methods for hotspot detection.
problem Detecting false positives in spatial hotspot mapping.
method Statistically rigorous clustering techniques.
result Survey of models and algorithms for robust clustering.
Novel framework for spatio-temporal event analysis using Hawkes processes.
problem Inference of dynamics in spatio-temporal event sequences.
method Randomized Fourier feature-based transformations and gradient descent.
result Improved fitting capability in synthetic and real datasets.
We observe standard transfer learning can improve prediction accuracies of target tasks at the cost of lowering their prediction fairness -- a phenomenon we named discriminatory transfer. We examine prediction fairness of a standard hypothesis transfer algorithm and a standard multi-task learning algorithm, and show th…
The paper proposes a machine learning framework for detecting DeFi fraud across multiple blockchain chains.
problem Early detection of financial crimes in decentralized finance (DeFi) ecosystems.
method Extracting features from different blockchain chains, employing XGBoost and Neural Network for fraud detection.
result Introduction of novel DeFi-related features significantly improves fraud detection accuracy.
We present a generic framework for spatio-temporal (ST) data modeling, analysis, and forecasting, with a special focus on data that is sparse in both space and time. Our multi-scaled framework is a seamless coupling of two major components: a self-exciting point process that models the macroscale statistical behaviors …
A recent paper of Arnold, Falk, and Winther [Bull AMS, 47 (2010)] showed that a large class of mixed finite element methods can be formulated naturally on Hilbert complexes, where using a Galerkin-like approach, one solves a variational problem on a finite-dimensional subcomplex. In a seemingly unrelated research direc…
Statistical and Computational Efficiency for Smooth Tensor Estimation with Unknown Permutationsmath.ST
We tackle tensor denoising with unknown permutations, achieving optimal recovery with polynomial estimators.
problem Structured tensor denoising with unknown permutations in recommendation systems, neuroimaging, etc.
method Developed a constrained least-squares estimator in a block-wise polynomial family.
result Achieved the minimax error bound with polynomial estimators of degree up to .
Paper proposes a method to estimate truncated density models using Score Matching.
problem Estimating parameters of truncated probability densities.
method Score Matching with a novel weight function derived from Stein discrepancy.
result The proposed method minimizes a weighted Fisher divergence and corrects outlier-trimming bias.
SP-SPCA improves sparse PCA by adaptively adjusting variable penalties, enhancing interpretability and stability.
problem Poor interpretability and variable redundancy in PCA for high-dimensional data.
method Introduces a single equilibrium parameter to adaptively adjust variable penalties in the L2 regularization framework.
result Consistently outperforms standard sparse PCA methods in identifying sparse loading patterns and preserving cumulative variance.
Develops a fast BMF approach for binary matrices.
problem Finding patterns in binary matrices for various applications.
method MEBF (Median Expansion for Boolean Factorization) using geometric segmentation and heuristic submatrix identification.
result Superior performance in reconstruction error and computational efficiency compared to existing methods.
Maximal correlation framework improves fairness in machine learning algorithms.
problem Ensuring fairness in machine learning algorithms.
method Introducing maximal correlation framework for fairness constraints and deriving regularizers.
result The approach provides smooth performance-fairness tradeoff curves and competitive performance.
Advances in deep learning for spatio-temporal event modeling.
problem Limitations of traditional parametric models in capturing nonstationary dynamics.
method Integration of deep neural architectures to model conditional intensity function and influence kernels.
result Deep influence kernel approach enhances expressiveness and statistical explainability.
We present a novel subset scan method to detect if a probabilistic binary classifier has statistically significant bias -- over or under predicting the risk -- for some subgroup, and identify the characteristics of this subgroup. This form of model checking and goodness-of-fit test provides a way to interpretably detec…