English
Related papers

Related papers: Being Corrupt Requires Being Clever, But Detecting…

200 papers

Segment anything model (SAM), as the name suggests, is claimed to be capable of cutting out any object and demonstrates impressive zero-shot transfer performance with the guidance of prompts. However, there is currently a lack of…

Computer Vision and Pattern Recognition · Computer Science 2023-09-06 Yu Qiao , Chaoning Zhang , Taegoo Kang , Donghun Kim , Chenshuang Zhang , Choong Seon Hong

We study the problem of extracting a selective connector for a given set of query vertices $Q \subseteq V$ in a graph $G = (V,E)$. A selective connector is a subgraph of $G$ which exhibits some cohesiveness property, and contains the query…

Social and Information Networks · Computer Science 2017-09-06 Natali Ruchansky , Francesco Bonchi , David Garcia-Soriano , Francesco Gullo , Nicolas Kourtellis

The widespread of Online Social Networks and the opportunity to commercialize popular accounts have attracted a large number of automated programs, known as artificial accounts. This paper focuses on the classification of human and fake…

Social and Information Networks · Computer Science 2021-09-17 Ilia Karpov , Ekaterina Glazkova

Uncertain graphs have been widely used to model complex linked data in many real-world applications, such as guaranteed-loan networks and power grids, where a node or edge may be associated with a probability. In these networks, a node…

Computational Engineering, Finance, and Science · Computer Science 2026-02-27 Dawei Cheng , Chen Chen , Xiaoyang Wang , Sheng Xiang

Robustness is a fundamental property of machine learning classifiers required to achieve safety and reliability. In the field of adversarial robustness of image classifiers, robustness is commonly defined as the stability of a model to all…

Machine Learning · Computer Science 2024-05-28 Georg Siedel , Weijia Shao , Silvia Vock , Andrey Morozov

An ordered graph is a graph enhanced with a linear order on the vertex set. An ordered graph is a core if it does not have an order-preserving homomorphism to a proper subgraph. We say that $H$ is the core of $G$ if (i) $H$ is a core, (ii)…

Computational Complexity · Computer Science 2025-12-01 Michal Čertík , Andreas Emil Feldmann , Jaroslav Nešetřil , Paweł Rzążewski

The stability of communities - whether biological, social, economic, technological or ecological depends on the balance between cooperation and cheating. While cooperation strengthens communities, selfish individuals, or "cheaters," exploit…

Social and Information Networks · Computer Science 2025-07-14 Guoli Yang , Matteo Cavaliere , Mingtao Zhang , Giovanni Masala , Adam Miles , Mengzhu Wang

Detectability describes the property of a system to uniquely determine, after a finite number of observations, the current and subsequent states. In this paper, to reduce the complexity of checking the detectability properties in the…

Systems and Control · Electrical Eng. & Systems 2019-08-27 Hao Lan , Yin Tong , Jin Guo , Carla Seatzu

We initiate the study of combinatorial algorithms for Triangle Detection in $H$-free graphs. The goal is to decide if a graph that forbids a fixed pattern $H$ as a subgraph contains a triangle, using only "combinatorial" methods that…

Data Structures and Algorithms · Computer Science 2025-11-24 Amir Abboud , Ron Safier , Nathan Wallheimer

Network-topology inference from (vertex) signal observations is a prominent problem across data-science and engineering disciplines. Most existing schemes assume that observations from all nodes are available, but in many practical…

Methodology · Statistics 2021-11-11 Andrei Buciulea , Samuel Rey , Antonio G. Marques

We develop a new sampling method to estimate eigenvector centrality on incomplete networks. Our goal is to estimate this global centrality measure having at disposal a limited amount of data. This is the case in many real-world scenarios…

Social and Information Networks · Computer Science 2020-10-29 Nicolò Ruggeri , Caterina De Bacco

In this paper, we study the crucial elements of complex networks, namely nodes, and edges and their properties such as their community structure, which play an important role in dictating the robustness of the network towards structural…

Social and Information Networks · Computer Science 2021-02-04 V. Parimi , A. Pal , S. Ruj , P. Kumaraguru , T. Chakraborty

Even the state-of-the-art deep learning models lack fundamental abilities compared to humans. Multiple comparison paradigms have been proposed to explore the distinctions between humans and deep learning. While most comparisons rely on…

Computer Vision and Pattern Recognition · Computer Science 2022-08-09 Jinyu Fan , Yi Zeng

Graph Neural Networks (GNNs) as deep learning models working on graph-structure data have achieved advanced performance in many works. However, it has been proved repeatedly that, not all edges in a graph are necessary for the training of…

Social and Information Networks · Computer Science 2022-11-11 Zishan Gu , Jintang Li , Liang Chen

In this paper we establish rigorous benchmarks for image classifier robustness. Our first benchmark, ImageNet-C, standardizes and expands the corruption robustness topic, while showing which classifiers are preferable in safety-critical…

Machine Learning · Computer Science 2019-04-30 Dan Hendrycks , Thomas G. Dietterich

Benford's law describes the distribution of the first digit of numbers appearing in a wide variety of numerical data, including tax records, and election outcomes, and has been used to raise "red flags" about potential anomalies in the data…

Social and Information Networks · Computer Science 2022-05-27 Tianyi Chen , Charalampos E. Tsourakakis

This paper introduces a novel algorithm for cardinality, i.e., the number of nodes, estimation in large scale anonymous graphs using statistical inference methods. Applications of this work include estimating the number of sensor devices,…

Information Theory · Computer Science 2015-08-21 Ahmed Douik , Salah A. Aly , Tareq Y. Al-Naffouri , Mohamed-Slim Alouini

Many machine learning methods have been proposed to achieve accurate transaction fraud detection, which is essential to the financial security of individuals and banks. However, most existing methods leverage original features only or…

Machine Learning · Computer Science 2023-07-13 Yue Tian , Guanjun Liu , Jiacun Wang , Mengchu Zhou

Money laundering presents a pervasive challenge, burdening society by financing illegal activities. The use of network information is increasingly being explored to effectively combat money laundering, given it involves connected parties.…

Social and Information Networks · Computer Science 2025-10-09 Bruno Deprez , Toon Vanderschueren , Bart Baesens , Tim Verdonck , Wouter Verbeke

In-context learning enables large language models to perform novel tasks through few-shot demonstrations. However, demonstrations per se can naturally contain noise and conflicting examples, making this capability vulnerable. To understand…

Machine Learning · Computer Science 2026-03-06 Difan Jiao , Di Wang , Lijie Hu
‹ Prev 1 4 5 6 7 8 10 Next ›