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

Trend · papers per month

255075100 · Oct 201919922001200920172026
48 results for forensic community

Recently the GAN generated face images are more and more realistic with high-quality, even hard for human eyes to detect. On the other hand, the forensics community keeps on developing methods to detect these generated fake images and try to guarantee the credibility of visual contents. Although researchers have develo…

2019-02-27abs ↗pdf ↗

Recently, image forensics community has paied attention to the research on the design of effective algorithms based on deep learning technology and facts proved that combining the domain knowledge of image forensics and deep learning would achieve more robust and better performance than the traditional schemes. Instead…

2018-03-29abs ↗pdf ↗

Bayesian neural networks improve reliability in multimedia forensics.

problem Challenges with out-of-distribution data in multimedia authentication.
method Proposes Bayesian neural networks (BNN) for forensic tasks.
result BNNs provide distributions for better reliability and out-of-distribution detection.

We introduce a Bayesian solution for the problem in forensic speaker recognition, where there may be very little background material for estimating score calibration parameters. We work within the Bayesian paradigm of evidence reporting and develop a principled probabilistic treatment of the problem, which results in a…

2014-03-24abs ↗pdf ↗

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 a method to locate power grid recordings using ENF sequences.

problem Locating power grid recordings without concurrent power signals.
method Extract ENF sequences from power and audio recordings, develop multi-class SVM model.
result Validation of location authenticity of recordings using ENF sequences.

An important problem in forensic analyses is identifying the provenance of materials at a crime scene, such as biological material on a piece of clothing. This procedure, known as geolocation, is conventionally guided by expert knowledge of the biological evidence and therefore tends to be application-specific, labor-i…

2019-05-28abs ↗pdf ↗

An evolutionary algorithm separates mixed DNA profiles in forensic genetics.

problem Deconvolving mixed DNA profiles from crime samples.
method Multiple population evolutionary algorithm (MEA) with guided mutation.
result The MEA successfully deconvoluted DNA profiles from crime samples.

Matrix-variate distributions can intuitively model the dependence structure of matrix-valued observations that arise in applications with multivariate time series, spatio-temporal or repeated measures. This paper develops an Expectation-Maximization algorithm for discriminant analysis and classification with matrix-var…

2019-07-22abs ↗pdf ↗

Authorship verification (AV) is a research subject in the field of digital text forensics that concerns itself with the question, whether two documents have been written by the same person. During the past two decades, an increasing number of proposed AV approaches can be observed. However, a closer look at the respect…

2019-06-24abs ↗pdf ↗

This research adapts superpixels for Shapley value computation in DNA profile classification.

problem Efficiently computing Shapley values for large, multidimensional time-series data.
method Adapting the concept of superpixels to streamline Shapley value computation for time-series-like data.
result Realistic, accurate, and fast computation of Shapley values for DNA profile classification.

When machine learning systems fail because of adversarial manipulation, how should society expect the law to respond? Through scenarios grounded in adversarial ML literature, we explore how some aspects of computer crime, copyright, and tort law interface with perturbation, poisoning, model stealing and model inversion…

2018-10-25abs ↗pdf ↗

Detection of malware-infected computers and detection of malicious web domains based on their encrypted HTTPS traffic are challenging problems, because only addresses, timestamps, and data volumes are observable. The detection problems are coupled, because infected clients tend to interact with malicious domains. Traff…

2019-06-21abs ↗pdf ↗

Authorship verification tries to answer the question if two documents with unknown authors were written by the same author or not. A range of successful technical approaches has been proposed for this task, many of which are based on traditional linguistic features such as n-grams. These algorithms achieve good results…

2019-08-20abs ↗pdf ↗

The paper proposes a test to assess rater accuracy while accounting for rater covariates.

problem Assessing the accuracy of raters in medical imaging and forensic studies.
method Covariate-adjusted homogeneity test to determine differences in accuracy among multiple rater groups.
result The proposed test identifies statistically significant differences among five participant groups in a face recognition study.

Detects AI-synthesized speech using cepstral and bispectral analysis.

problem Validating the authenticity of speech from AI-generated content.
method Integrates cepstral and bispectral analysis for distinguishing human from AI-synthesized speech.
result Higher-order statistics show less correlation for human speech compared to AI-synthesis, and cepstral analysis reveals unique power components.

Accounting fraud is a global concern representing a significant threat to the financial system stability due to the resulting diminishing of the market confidence and trust of regulatory authorities. Several tricks can be used to commit accounting fraud, hence the need for non-static regulatory interventions that take …

2018-05-08abs ↗pdf ↗

A new framework maximizes influence spread in social networks by accounting for inter-community diffusion.

problem Real-world social networks have inter-community influence that is often overlooked in community-based IM approaches.
method Community-IM++ uses a heuristic based on community-based diffusion degree and progressive budgeting to model and prioritize cross-community diffusion.
result Community-IM++ achieves near-greedy influence spread at up to 100 times lower runtime than existing methods.

We introduce the concept of community trees that summarizes topological structures within a network. A community tree is a tree structure representing clique communities from the clique percolation method (CPM). The community tree also generates a persistent diagram. Community trees and persistent diagrams reveal topol…

2017-10-11abs ↗pdf ↗

We introduce a new paradigm that is important for community detection in the realm of network analysis. Networks contain a set of strong, dominant communities, which interfere with the detection of weak, natural community structure. When most of the members of the weak communities also belong to stronger communities, t…

2017-02-24abs ↗pdf ↗

Study exact community detection in k-community Gaussian mixtures with different intensities.

problem Community detection in k-community Gaussian mixtures with varying intensities.
method Explicitly find the threshold for exact recovery of maximum likelihood estimation.
result Threshold for exact recovery of maximum likelihood estimation is identified.

This paper examines anomalies and frauds in blockchain networks and proposes detection techniques.

problem Anomalies and frauds undermine blockchain networks' integrity and security.
method Statistical and machine learning methods, game-theoretic solutions, digital forensics, reputation-based systems, and risk assessment techniques.
result Practical applications and insights for enhancing blockchain network security.

The paper introduces a method for detecting principal communities and embedding vertices.

problem Detecting and embedding vertices in graphs with community structure.
method Principal graph encoder embedding method that detects principal communities and produces vertex embeddings.
result The method successfully detects principal communities and produces accurate vertex embeddings.

Improved distributed learning with reduced communication costs.

problem Efficient communication in resource-constrained environments for distributed learning.
method Proposed a cost-effective partial communication protocol.
result Communication cost is reduced to O(logT)O(\log T), improving significantly on full communication.

Inspection-L detects illicit cryptocurrency transactions using GNNs and self-supervised learning.

problem Detect illicit cryptocurrency transactions for anti-money laundering.
method Graph Neural Network (GNN) framework based on self-supervised Deep Graph Infomax (DGI) and Graph Isomorphism Network (GIN) with supervised learning algorithms.
result Inspection-L outperforms state-of-the-art methods in key classification metrics.

Statistical estimates can often be improved by fusion of data from several different sources. One example is so-called ensemble methods which have been successfully applied in areas such as machine learning for classification and clustering. In this paper, we present an ensemble method to improve community detection by…

2013-09-01abs ↗pdf ↗

MACC learns communication protocols by adapting counterfactual reasoning.

problem Credit assignment and non-stationarity in communication environments.
method Adapts counterfactual reasoning to overcome credit assignment and uses action policy and Q-function of other agents to handle non-stationarity.
result MACC outperforms state-of-the-art baselines in four scenarios.

A novel framework for adaptive multi-agent communication in reinforcement learning.

problem Manual specification of communication structures in multi-agent reinforcement learning.
method Learning Structured Communication (LSC) framework using hierarchical graph neural networks.
result Adaptive hierarchical formations and efficient message propagation among agents.

In this work we investigate tick-by-tick data provided by the TRTH database for several stocks on three different exchanges (Paris - Euronext, London and Frankfurt - Deutsche Börse) and on a 5-year span. We use a simple algorithm that helps the synchronization of the trades and quotes data sources, providing enhancemen…

2016-04-10abs ↗pdf ↗

A framework for multi-agent communication over noisy channels in reinforcement learning.

problem Effective communication between multiple agents in a noisy environment.
method A novel multi-agent partially observable Markov decision process (MA-POMDP) framework considering noisy communication channels.
result Jointly learned policies outperform separate learning of communication and decision making.

Formulates approach for guiding explanation types based on user specifications.

problem Creating explainable AI components from user-defined specifications.
method Develops a method for generating explanations based on user-defined specifications.
result Demonstrates feasibility of user-defined explanations for complex models like Bayesian networks and graph neural networks.

Real-world networks usually have community structure, that is, nodes are grouped into densely connected communities. Community detection is one of the most popular and best-studied research topics in network science and has attracted attention in many different fields, including computer science, statistics, social sci…

2018-08-26abs ↗pdf ↗

GRADE models evolving graph dynamics by learning node and community representations.

problem Lack of tools to study temporal community dynamics in evolving graphs.
method GRADE is a probabilistic model that learns evolving node and community representations via a random walk prior and variational inference.
result GRADE outperforms baselines in dynamic link prediction and dynamic community detection.

Paper studies fundamental limits of communication in distributed learning.

problem Communication efficiency in model aggregation for distributed learning.
method Rate-Distortion approach to model aggregation as a vector Gaussian CEO problem.
result Derives rate region bound and sum-rate-distortion function for model aggregation.

Study recovers community structure from coarse graph measurements.

problem Community recovery from low-resolution graph measurements.
method Formalized coarsening process of graph measurements, developed conditions for perfect recovery.
result Simple and closed-form asymptotic conditions for perfect recovery of coarse graph communities.