Peng, H, Yang, R orcid.org/0000-0001-6334-4925, Wang, Z orcid.org/0000-0001-6157-0662 et al. (5 more authors) (2021) LIME: Low-Cost Incremental Learning for Dynamic Heterogeneous Information Networks. IEEE Transactions on Computers. ISSN 0018-9340
Abstract
Understanding the interconnected relationships of large-scale information networks like social, scholar and Internet of Things networks is vital for tasks like recommendation and fraud detection. The vast majority of the real-world networks are inherently heterogeneous and dynamic, containing many different types of nodes and edges and can change drastically over time. The dynamicity and heterogeneity make it extremely challenging to reason about the network structure. Unfortunately, existing approaches are inadequate in modeling real-life networks as they require extensive computational resources and do not scale well to large, dynamically evolving networks. We introduce LIME, a better approach for modeling dynamic and heterogeneous information networks. LIME is designed to extract high-quality network representation with significantly lower memory resources and computational time over the state-of-the-art. Unlike prior work that uses a vector to encode each network node, we exploit the semantic relationships among network nodes to encode multiple nodes with similar semantics in shared vectors. We evaluate LIME by applying it to three representative network-based tasks, node classification, node clustering and anomaly detection, performing on three large-scale datasets. Our extensive experiments demonstrate that LIME not only reduces the memory footprint by over 80\% and computational time over 2x when learning network representation but also delivers comparable performance for downstream processing tasks.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © 2021 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. |
Keywords: | Task analysis, Social networking (online) , Heuristic algorithms, Computational modeling, Optimization, Semantics, Recurrent neural networks |
Dates: |
|
Institution: | The University of Leeds |
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) |
Depositing User: | Symplectic Publications |
Date Deposited: | 08 Feb 2021 12:38 |
Last Modified: | 21 Jun 2021 12:33 |
Status: | Published online |
Publisher: | Institute of Electrical and Electronics Engineers |
Identification Number: | 10.1109/TC.2021.3057082 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:170825 |