Configurable hyperdimensional graph representation
Graph analysis has emerged as a crucial field, offering versatile solutions for real-world data representation, from social networks to biological systems. However, the intricate nature of graphs often necessitates a degree of processing, such as learning mappings to a vector space, to perform analysis tasks like node classification and link prediction. A promising approach to this is Hyperdimensional Computing (HDC), inspired by neuroscience and mathematics. HDC utilizes high-dimensional vectors to efficiently manipulate complex data structures and perform operations like superposition and association, enhancing knowledge graph representations with contextual and semantic information. Nevertheless, addressing limitations in existing HDC-based approaches to graph representation is essential. This paper thoroughly explores these methods and presents ConfiGR: Configurable Graph Representation, a novel framework that introduces an adjustable design, enhancing its versatility across various graph types and tasks, ultimately boosting performance in multiple graph-related tasks.
Authors
- Ali Zakeri (ORCID: https://orcid.org/0000-0002-0354-6127)
- Mohsen Imani (ORCID: https://orcid.org/0000-0002-5761-0622)
- Zhuowen Zou (ORCID: https://orcid.org/0000-0001-9057-8815)
- Hanning Chen (ORCID: https://orcid.org/0000-0003-1956-5135)
Institutions
- University of California, Irvine (US)
Publication Details
- Journal
- Artificial Intelligence
- Published
- 2025-06-13
- DOI
- https://doi.org/10.1016/j.artint.2025.104384
- Primary Topic
- Graph Theory and Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Science Foundation
- Semiconductor Research Corporation
- Defense Advanced Research Projects Agency
- Office of Naval Research
- Defense Sciences Office, DARPA
- Air Force Office of Scientific Research