Zobrazeno 1 - 10
of 112
pro vyhledávání: '"Shabbir, Mudassir"'
Network control theory (NCT) offers a robust analytical framework for understanding the influence of network topology on dynamic behaviors, enabling researchers to decipher how certain patterns of external control measures can steer system dynamics t
Externí odkaz:
http://arxiv.org/abs/2405.03706
In this paper, we study the problem of unsupervised graph representation learning by harnessing the control properties of dynamical networks defined on graphs. Our approach introduces a novel framework for contrastive learning, a widely prevalent tec
Externí odkaz:
http://arxiv.org/abs/2403.04923
Graph Neural Networks (GNNs) have shown remarkable merit in performing various learning-based tasks in complex networks. The superior performance of GNNs often correlates with the availability and quality of node-level features in the input networks.
Externí odkaz:
http://arxiv.org/abs/2310.12169
This paper studies the controllability backbone problem in dynamical networks defined over graphs. The main idea of the controllability backbone is to identify a small subset of edges in a given network such that any subnetwork containing those edges
Externí odkaz:
http://arxiv.org/abs/2309.02649
Graph unlearning emerges as a crucial advancement in the pursuit of responsible AI, providing the means to remove sensitive data traces from trained models, thereby upholding the right to be forgotten. It is evident that graph machine learning exhibi
Externí odkaz:
http://arxiv.org/abs/2310.02164
Autor:
Said, Anwar, Bayrak, Roza G., Derr, Tyler, Shabbir, Mudassir, Moyer, Daniel, Chang, Catie, Koutsoukos, Xenofon
Machine learning provides a valuable tool for analyzing high-dimensional functional neuroimaging data, and is proving effective in predicting various neurological conditions, psychiatric disorders, and cognitive patterns. In functional magnetic reson
Externí odkaz:
http://arxiv.org/abs/2306.06202
A dominating set of a graph $\mathcal{G=(V, E)}$ is a subset of vertices $S\subseteq\mathcal{V}$ such that every vertex $v\in \mathcal{V} \setminus S$ outside the dominating set is adjacent to a vertex $u\in S$ within the set. The minimum dominating
Externí odkaz:
http://arxiv.org/abs/2306.03434
Vulnerability identification constitutes a task of high importance for cyber security. It is quite helpful for locating and fixing vulnerable functions in large applications. However, this task is rather challenging owing to the absence of reliable a
Externí odkaz:
http://arxiv.org/abs/2306.05375
Publikováno v:
In Computer Speech & Language January 2025 89
Feature extraction is an essential task in graph analytics. These feature vectors, called graph descriptors, are used in downstream vector-space-based graph analysis models. This idea has proved fruitful in the past, with spectral-based graph descrip
Externí odkaz:
http://arxiv.org/abs/2109.01494