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

Trend · papers per month

60119179238 · Jun 202019922001200920172026
48 results for edge detection

ADSAGE detects anomalies in graph edge sequences for insider threat detection.

problem Detecting insider threats in fine-grained audit logs using graph and text features.
method Anomaly detection at edge level, supporting numeric, categorical, and text attributes.
result ADSAGE detects anomalies in authentications and email communications effectively.

We address the issue of edge detection in Synthetic Aperture Radar imagery. In particular, we propose nonparametric methods for edge detection, and numerically compare them to an alternative method that has been recently proposed in the literature. Our results show that some of the proposed methods display superior res…

2012-07-08abs ↗pdf ↗

Supermarkets need to ensure clean and safe environments for both shoppers and employees. Slips, trips, and falls can result in injuries that have a physical as well as financial cost. Timely detection of hazardous conditions such as spilled liquids or fallen items on supermarket floors can reduce the chances of serious…

2020-02-29abs ↗pdf ↗

New method uses Ricci curvature for hypergraph clustering, outperforming existing techniques.

problem Community detection in hypergraphs with large hyperedges.
method Extending Ricci flow to hypergraphs by defining edge probability measures and transporting them on the line expansion.
result Enhanced sensitivity to hypergraph structure, especially in large hyperedges.

Paper models graph edge dependencies using latent variables for community detection.

problem Graphs' edge dependencies not fully explained by community membership.
method Introduces auxiliary latent variables to model edge dependencies and analyzes conditions for exact recovery.
result Exact recovery possible by semidefinite programming down to maximum likelihood threshold.

Detects dense subhypergraphs in heterogeneous random hypergraphs.

problem Testing for the existence of a dense subhypergraph in heterogeneous random hypergraphs.
method Established detection boundaries and constructed asymptotically powerful and adaptive tests.
result Developed tests for distinguishing between null and alternative hypotheses.

This paper proposes a communication-efficient deep anomaly detection framework for industrial IoT.

problem Accurately detecting anomalies in time-series data from edge devices in industrial IoT.
method A federated learning-based approach with an Attention Mechanism-based Convolutional Neural Network-Long Short Term Memory (AMCNN-LSTM) model and gradient compression.
result The proposed framework accurately and timely detects anomalies with reduced communication overhead.

ACERL embeds networks into a low-dimensional space preserving structural and semantic properties.

problem Challenges in brain connectivity data analysis with subject-specific, high-dimensional, and sparse networks.
method Contrastive learning of augmented network pairs with adaptive random masking.
result Achieves minimax optimal convergence rate for edge representation learning.

Advances in deep neural networks (DNN) greatly bolster real-time detection of anomalous IoT data. However, IoT devices can barely afford complex DNN models due to limited computational power and energy supply. While one can offload anomaly detection tasks to the cloud, it incurs long delay and requires large bandwidth …

2020-01-10abs ↗pdf ↗

New algorithm detects communities in weighted networks, improving on binary ones.

problem Few methods exist for detecting communities in weighted networks.
method Pseudo-likelihood approach for weighted stochastic block model.
result The method is consistent and works well for both homogeneous and heterogeneous networks.

New test detects differences in heterogeneous datasets.

problem Detecting differences between two samples with unknown heterogeneity.
method Developed a nonparametric testing procedure that handles latent heterogeneity through a composite null.
result The test accurately detects differences in the presence of unknown heterogeneity.

The paper examines how neural network topology affects adversarial robustness.

problem Understanding how neural network topology influences adversarial robustness.
method Investigated the graph of input traversing all layers of a neural network, comparing clean and adversarial inputs.
result Under-optimized edges in neural network graphs are a source of adversarial vulnerability and can be used to detect adversarial inputs.

Semantic boundary and edge detection aims at simultaneously detecting object edge pixels in images and assigning class labels to them. Systematic training of predictors for this task requires the labeling of edges in images which is a particularly tedious task. We propose a novel strategy for solving this task, when pi…

2016-06-29abs ↗pdf ↗

Study reveals limits of detecting local geometry in random graphs.

problem Detecting local geometry in random graphs with hidden communities.
method Introduced model and used information-theoretic and computational limits to investigate detection.
result Detection threshold determined at d=Θ~(k2k6/n3)d = \widetildeΘ(k^2 \vee k^6/n^3) for fixed pp.

Adaptive anomaly detection for IoT data reduces delay without sacrificing accuracy.

problem Real-time anomaly detection for IoT data in distributed edge computing systems.
method Adaptive anomaly detection approach using contextual bandit and reinforcement learning.
result Significantly reduces detection delay (e.g., 71.4% for univariate data) without sacrificing accuracy.

Enhances community detection in correlated networks with node attributes.

problem Community detection in multiple networks with correlated node attributes and edges.
method Introduced the correlated Contextual Stochastic Block Model (CSBM), developed a two-step matching procedure.
result Algorithm recovers exact node correspondence, enabling enhanced community detection.

As video camera deployments continue to grow, the need to process large volumes of real-time data strains wide area network infrastructure. When per-camera bandwidth is limited, it is infeasible for applications such as traffic monitoring and pedestrian tracking to offload high-quality video streams to a datacenter. Th…

2019-05-24abs ↗pdf ↗

Detecting edge correlation between two graphs sharpens a threshold based on densest subgraph.

problem Detecting edge correlation between two Erdős-Rényi graphs.
method Formulated as a hypothesis testing problem, connecting to densest subgraph detection.
result Sharp information-theoretic threshold established for edge correlation detection.

CRAUM-Net improves salient object detection with context and uncertainty modeling.

problem Accurate salient object detection with precise boundary delineation.
method Contextual Recursive Attention with Uncertainty Modeling, multi-scale context aggregation, attention mechanisms, edge-aware decoder, Monte Carlo Dropout.
result Superior performance in producing accurate and reliable saliency maps.

A new model for detecting overlapping communities in weighted networks.

problem Community detection in overlapping weighted networks with mixed membership and edge weights.
method Mixed membership distribution-free (MMDF) model with an efficient spectral algorithm and fuzzy weighted modularity.
result The MMDF model can estimate community memberships and evaluate community quality for weighted networks.

Model distinguishes homophily and triadic closure in network analysis.

problem Conflated properties of homophily and transitivity in network analysis.
method Generative model with triadic closure edges and inference procedure.
result Can identify mechanisms responsible for network edges and community structure.

Paper explores exact recovery of communities in weighted graphs using Gaussian and exponential distributions.

problem Exact recovery of communities in weighted graphs with Gaussian and exponential distributions.
method Introduces a new semi-metric to describe conditions for exact recovery and analyzes conditions for both complete and incomplete graphs.
result Necessary and sufficient conditions for exact recovery are asymptotically tight and applicable to both complete and incomplete graphs.

We consider the problem of model selection in Gaussian Markov fields in the sample deficient scenario. The benchmark information-theoretic results in the case of d-regular graphs require the number of samples to be at least proportional to the logarithm of the number of vertices to allow consistent graph recovery. When…

2018-02-12abs ↗pdf ↗

StrGNN detects anomalies in dynamic graphs by analyzing subgraphs and temporal features.

problem Detecting anomalies in dynamic graphs with structural changes.
method StrGNN is an end-to-end model that uses structural subgraphs and temporal features for anomaly detection.
result StrGNN effectively detects anomalies in dynamic graphs, as shown by extensive experiments.

Edge language models show bias over time, especially on resource-constrained devices.

problem Bias in edge language models on resource-constrained devices.
method Comparative analysis of text-based bias across edge, cloud, and desktop environments; optimized Llama-2 model on Raspberry Pi 4; feedback loop mechanism to correct bias.
result Llama-2 on Raspberry Pi 4 shows 43.23% and 21.89% more bias over time compared to cloud and desktop models.

Study on signed graphs with random signs, focusing on community detection.

problem Community detection in signed stochastic block models.
method Strong concentration inequalities for adjacency and Laplacian matrices, applied to signed Laplacian matrix.
result The sign of the first eigenvector of the Laplacian matrix defines a weakly consistent estimator for balanced community detection.