4.5 Article

Computing Graph Descriptors on Edge Streams

Related references

Note: Only part of the references are listed.
Article Computer Science, Information Systems

sGrapp: Butterfly Approximation in Streaming Graphs

Aida Sheshbolouki et al.

Summary: This article studies the fundamental problem of butterfly counting in bipartite streaming graphs, introducing an approximate adaptive window-based algorithm, sGrapp, and its optimized version sGrapp-x. Experimental studies show superior performance in terms of both accuracy and efficiency.

ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA (2022)

Article Computer Science, Information Systems

Network Embedding via Motifs

Ping Shao et al.

Summary: Network embedding is an effective method for dealing with downstream tasks. In this work, the LEMON algorithm is proposed to bridge connectivity and structural similarity through motifs, and can handle inductive learning tasks for dynamic graphs. Experimental results demonstrate the significant improvements of LEMON in downstream tasks.

ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA (2022)

Article Computer Science, Artificial Intelligence

Predicting Attributes of Nodes Using Network Structure

Sarwan Ali et al.

Summary: This article explores the prediction of node attributes in social networks by utilizing the complex interdependence between attributes and pairwise interactions, and leveraging network topology information. The proposed method, which involves self- and cross-proclivity measures and feature mapping, outperforms known approaches in terms of prediction accuracy, as demonstrated through extensive experimentation on 10 real-world datasets.

ACM TRANSACTIONS ON INTELLIGENT SYSTEMS AND TECHNOLOGY (2021)

Article Computer Science, Artificial Intelligence

Deep Variational Autoencoder for Mapping Functional Brain Networks

Ning Qiang et al.

Summary: In the field of neuroimaging and brain mapping, researchers have developed various computational methods to map functional brain networks, and deep learning has been shown to outperform traditional machine learning methods when applied to functional MRI data. However, due to lack of labeled data and high dimensionality of MRI images, deep learning often suffers from overfitting. In this study, a novel generative model called deep variational autoencoder was proposed to address the challenge of insufficient data and incomplete supervision, and experimental results demonstrated its superior performance on small datasets.

IEEE TRANSACTIONS ON COGNITIVE AND DEVELOPMENTAL SYSTEMS (2021)

Article Computer Science, Information Systems

Density Guarantee on Finding Multiple Subgraphs and Subtensors

Quang-Huy Duong et al.

Summary: Detection of dense subregions (subgraph & subtensor) is a well-studied area with efficient algorithms, but most existing methods can only estimate one subgraph or subtensor at a time with a low guarantee on its density.

ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA (2021)

Article Computer Science, Information Systems

Mining Largest Maximal Quasi-Cliques

Seyed-Vahid Sanei-Mehri et al.

Summary: Enumerating quasi-cliques in a graph is a challenging problem with important applications in bioinformatics and social network analysis. By proposing a novel heuristic algorithm and conducting experimental validation, quasi-cliques can be enumerated more efficiently from a graph and can scale to larger graphs.

ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA (2021)

Article Computer Science, Information Systems

A multi-cascaded model with data augmentation for enhanced paraphrase detection in short texts

Muhammad Haroon Shakeel et al.

INFORMATION PROCESSING & MANAGEMENT (2020)

Article Computer Science, Information Systems

Combinatorial trace method for network immunization

Muhammad Ahmad et al.

INFORMATION SCIENCES (2020)

Article Computer Science, Information Systems

Interpretable multi-scale graph descriptors via structural compression

Ammar Ahmed et al.

INFORMATION SCIENCES (2020)

Proceedings Paper Computer Science, Artificial Intelligence

Estimating Descriptors for Large Graphs

Zohair Raza Hassan et al.

ADVANCES IN KNOWLEDGE DISCOVERY AND DATA MINING, PAKDD 2020, PT I (2020)

Proceedings Paper Computer Science, Information Systems

Just SLaQ When You Approximate: Accurate Spectral Distances for Web-Scale Graphs

Anton Tsitsulin et al.

WEB CONFERENCE 2020: PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE (WWW 2020) (2020)

Article Computer Science, Artificial Intelligence

Stochastic Graphlet Embedding

Anjan Dutta et al.

IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS (2019)

Proceedings Paper Computer Science, Theory & Methods

FLEET: Butterfly Estimation from a Bipartite Graph Stream

Seyed-Vahid Sanei-Mehri et al.

PROCEEDINGS OF THE 28TH ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT (CIKM '19) (2019)

Proceedings Paper Computer Science, Artificial Intelligence

NetLSD: Hearing the Shape of a Graph

Anton Tsitsulin et al.

KDD'18: PROCEEDINGS OF THE 24TH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY & DATA MINING (2018)

Article Computer Science, Artificial Intelligence

Propagation kernels: efficient graph kernels from propagated information

Marion Neumann et al.

MACHINE LEARNING (2016)

Article Computer Science, Information Systems

DELTACON: Principled Massive-Graph Similarity Function with Attribution

Danai Koutra et al.

ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA (2016)

Article Computer Science, Information Systems

Network Sampling: From Static to Streaming Graphs

Nesreen K. Ahmed et al.

ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA (2014)

Article Mathematics, Applied

The Laplacian of a graph as a density matrix: A basic combinatorial approach to separability of mixed states

Samuel L. Braunstein et al.

ANNALS OF COMBINATORICS (2006)

Article Biochemical Research Methods

The Predictive Toxicology Challenge 2000-2001

C Helma et al.

BIOINFORMATICS (2001)