Fleet

Sanei-Mehri, Seyed-Vahid; Sarıyüce, Ahmet Erdem; Tirthapura, Srikanta

doi:10.1145/3357384.3357983

Cited by 21 publications

References 46 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Estimating Descriptors for Large Graphs

Hassan

Shabbir

Khan

et al. 2020

Advances in Knowledge Discovery and Data Mining

View full text Add to dashboard Cite

Embedding networks into a fixed dimensional feature space, while preserving its essential structural properties is a fundamental task in graph analytics. These feature vectors (graph descriptors) are used to measure the pairwise similarity between graphs. This enables applying data mining algorithms (e.g classification, clustering, or anomaly detection) on graph-structured data which have numerous applications in multiple domains. State-of-the-art algorithms for computing descriptors require the entire graph to be in memory, entailing a huge memory footprint, and thus do not scale well to increasing sizes of real-world networks. In this work, we propose streaming algorithms to efficiently approximate descriptors by estimating counts of sub-graphs of order k ≤ 4, and thereby devise extensions of two existing graph comparison paradigms: the Graphlet Kernel and NetSimile. Our algorithms require a single scan over the edge stream, have space complexity that is a fraction of the input size, and approximate embeddings via a simple sampling scheme. Our design exploits the trade-off between available memory and estimation accuracy to provide a method that works well for limited memory requirements. We perform extensive experiments on real-world networks and demonstrate that our algorithms scale well to massive graphs.

show abstract

Estimating Descriptors for Large Graphs

Hassan

Shabbir

Khan

et al. 2020

Advances in Knowledge Discovery and Data Mining

View full text Add to dashboard Cite

show abstract

Accelerated butterfly counting with vertex priority on bipartite graphs

et al. 2022

View full text Add to dashboard Cite

Bipartite graphs are of great importance in many real-world applications. Butterfly, which is a complete $$2 \times 2$$ 2 × 2 biclique, plays a key role in bipartite graphs. In this paper, we investigate the problem of efficient counting the number of butterflies. The most advanced techniques are based on enumerating wedges which is the dominant cost of counting butterflies. Nevertheless, the existing algorithms cannot efficiently handle large-scale bipartite graphs. This becomes a bottleneck in large-scale applications. In this paper, instead of the existing layer-priority-based techniques, we propose a vertex-priority-based paradigm $${\mathsf {BFC}}$$ BFC -$${\mathsf {VP}}$$ VP to enumerate much fewer wedges; this leads to a significant improvement of the time complexity of the state-of-the-art algorithms. In addition, we present cache-aware strategies to further improve the time efficiency while theoretically retaining the time complexity of $${\mathsf {BFC}}$$ BFC -$${\mathsf {VP}}$$ VP . We also show that our proposed techniques can work efficiently in external and parallel contexts. Moreover, we study the butterfly counting problem on batch-dynamic graphs. Specifically, given a bipartite graph G and a batch-update of edges B, we aim to maintain the number of butterflies in G. To tackle this problem, fast vertex-priority-based algorithms are proposed with optimizations for reducing the computation of existing wedges in G. Our extensive empirical studies demonstrate that the proposed techniques significantly outperform the baseline solutions on real datasets.

show abstract

Butterfly counting and bitruss decomposition on uncertain bipartite graphs

Zhou

Wang²,

Chen

2023

The VLDB Journal

View full text Add to dashboard Cite

Uncertain butterflies are one of, if not the, most important graphlet structures on uncertain bipartite networks. In this paper, we examine the uncertain butterfly structure (in which the existential probability of the graphlet is greater than or equal to a threshold parameter), as well as the global Uncertain Butterfly Counting Problem (to count the total number of these instances over an entire network). To solve this task, we propose a non-trivial exact baseline (UBFC), as well as an improved algorithm (IUBFC) which we show to be faster both theoretically and practically. We also design two sampling frameworks (UBS and PES) which can sample either a vertex, edge or wedge from the network uniformly and estimate the global count quickly. Furthermore, a notable butterfly-based community structure which has been examined in the past is the k-bitruss. We adapt this community structure onto the uncertain bipartite graph setting and introduce the Uncertain Bitruss Decomposition Problem (which can be used to directly answer any k-bitruss search query for any k). We then propose an exact algorithm (UBitD) to solve our problem with three variations in deriving the initial uncertain support. Using a range of networks with different edge existential probability distributions, we validate the efficiency and effectiveness of our solutions.

show abstract

Fleet

Cited by 21 publications

References 46 publications

Estimating Descriptors for Large Graphs

Estimating Descriptors for Large Graphs

Accelerated butterfly counting with vertex priority on bipartite graphs

Butterfly counting and bitruss decomposition on uncertain bipartite graphs

Contact Info

Product

Resources

About