Search Results for author:
Found 7 papers, 2 papers with code
Optimizing Polynomial Graph Filters: A Novel Adaptive Krylov Subspace Approach
To bypass eigendecomposition, polynomial graph filters are proposed to approximate graph filters by leveraging various polynomial bases for filter training.
Scalable Continuous-time Diffusion Framework for Network Inference and Influence Estimation
Furthermore, we undertake an analysis of the approximation error of FIM for network inference.
An Effective Universal Polynomial Basis for Spectral Graph Neural Networks
Afterward, we develop an adaptive heterophily basis by incorporating graph heterophily degrees.
CAT: Learning to Collaborate Channel and Spatial Attention from Multi-Information Fusion
Channel and spatial attention mechanism has proven to provide an evident performance boost of deep convolution neural networks (CNNs).
Effective and Scalable Clustering on Massive Attributed Graphs
Given a graph G where each node is associated with a set of attributes, and a parameter k specifying the number of output clusters, k-attributed graph clustering (k-AGC) groups nodes in G into k disjoint clusters, such that nodes within the same cluster share similar topological and attribute characteristics, while those in different clusters are dissimilar.
Efficient Approximation Algorithms for Adaptive Influence Maximization
In this paper, we propose the first practical algorithm for the adaptive IM problem that could provide the worst-case approximation guarantee of $1-\mathrm{e}^{\rho_b(\varepsilon-1)}$, where $\rho_b=1-(1-1/b)^b$ and $\varepsilon \in (0, 1)$ is a user-specified parameter.
Social and Information Networks
Refutations on "Debunking the Myths of Influence Maximization: An In-Depth Benchmarking Study"
In a recent SIGMOD paper titled "Debunking the Myths of Influence Maximization: An In-Depth Benchmarking Study", Arora et al. [1] undertake a performance benchmarking study of several well-known algorithms for influence maximization.
Social and Information Networks
