Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 8 of 8
Full-Text Articles in Computer Sciences
Learning Dynamic Multimodal Implicit And Explicit Networks For Multiple Financial Tasks, Meng Kiat Gary Ang, Ee-Peng Lim
Learning Dynamic Multimodal Implicit And Explicit Networks For Multiple Financial Tasks, Meng Kiat Gary Ang, Ee-Peng Lim
Research Collection School Of Computing and Information Systems
Many financial f orecasting d eep l earning w orks focus on the single task of predicting stock returns for trading with unimodal numerical inputs. Investment and risk management however involves multiple financial t asks - f orecasts o f expected returns, risks and correlations of multiple stocks in portfolios, as well as important events affecting different stocks - to support decision making. Moreover, stock returns are influenced by large volumes of non-stationary time-series information from a variety of modalities and the propagation of such information across inter-company relationship networks. Such networks could be explicit - observed co-occurrences in online …
Mando-Guru: Vulnerability Detection For Smart Contract Source Code By Heterogeneous Graph Embeddings, Huu Hoang Nguyen, Nhat Minh Nguyen, Hong-Phuc Doan, Zahrai Ahmadi, Thanh Nam Doan, Lingxiao Jiang
Mando-Guru: Vulnerability Detection For Smart Contract Source Code By Heterogeneous Graph Embeddings, Huu Hoang Nguyen, Nhat Minh Nguyen, Hong-Phuc Doan, Zahrai Ahmadi, Thanh Nam Doan, Lingxiao Jiang
Research Collection School Of Computing and Information Systems
Smart contracts are increasingly used with blockchain systems for high-value applications. It is highly desired to ensure the quality of smart contract source code before they are deployed. This paper proposes a new deep learning-based tool, MANDO-GURU, that aims to accurately detect vulnerabilities in smart contracts at both coarse-grained contract-level and fine-grained line-level. Using a combination of control-flow graphs and call graphs of Solidity code, we design new heterogeneous graph attention neural networks to encode more structural and potentially semantic relations among different types of nodes and edges of such graphs and use the encoded embeddings of the graphs and …
Mando: Multi-Level Heterogeneous Graph Embeddings For Fine-Grained Detection Of Smart Contract Vulnerabilities, Huu Hoang Nguyen, Nhat Minh Nguyen, Chunyao Xie, Zahra Ahmadi, Daniel Kudenko, Thanh Nam Doan, Lingxiao Jiang
Mando: Multi-Level Heterogeneous Graph Embeddings For Fine-Grained Detection Of Smart Contract Vulnerabilities, Huu Hoang Nguyen, Nhat Minh Nguyen, Chunyao Xie, Zahra Ahmadi, Daniel Kudenko, Thanh Nam Doan, Lingxiao Jiang
Research Collection School Of Computing and Information Systems
Learning heterogeneous graphs consisting of different types of nodes and edges enhances the results of homogeneous graph techniques. An interesting example of such graphs is control-flow graphs representing possible software code execution flows. As such graphs represent more semantic information of code, developing techniques and tools for such graphs can be highly beneficial for detecting vulnerabilities in software for its reliability. However, existing heterogeneous graph techniques are still insufficient in handling complex graphs where the number of different types of nodes and edges is large and variable. This paper concentrates on the Ethereum smart contracts as a sample of software …
Joint Hyperbolic And Euclidean Geometry Contrastive Graph Neural Networks, Xiaoyu Xu, Guansong Pang, Di Wu, Mingsheng Shang
Joint Hyperbolic And Euclidean Geometry Contrastive Graph Neural Networks, Xiaoyu Xu, Guansong Pang, Di Wu, Mingsheng Shang
Research Collection School Of Computing and Information Systems
Graph Neural Networks (GNNs) have demonstrated state-of-the-art performance in a wide variety of analytical tasks. Current GNN approaches focus on learning representations in a Euclidean space, which are effective in capturing non-tree-like structural relations, but they fail to model complex relations in many real-world graphs, such as tree-like hierarchical graph structure. This paper instead proposes to learn representations in both Euclidean and hyperbolic spaces to model these two types of graph geometries. To this end, we introduce a novel approach - Joint hyperbolic and Euclidean geometry contrastive graph neural networks (JointGMC). JointGMC is enforced to learn multiple layer-wise optimal combinations …
Variational Graph Author Topic Modeling, Ce Zhang, Hady Wirawan Lauw
Variational Graph Author Topic Modeling, Ce Zhang, Hady Wirawan Lauw
Research Collection School Of Computing and Information Systems
While Variational Graph Auto-Encoder (VGAE) has presented promising ability to learn representations for documents, most existing VGAE methods do not model a latent topic structure and therefore lack semantic interpretability. Exploring hidden topics within documents and discovering key words associated with each topic allow us to develop a semantic interpretation of the corpus. Moreover, documents are usually associated with authors. For example, news reports have journalists specializing in writing certain type of events, academic papers have authors with expertise in certain research topics, etc. Modeling authorship information could benefit topic modeling, since documents by the same authors tend to reveal …
On Size-Oriented Long-Tailed Graph Classification Of Graph Neural Networks, Zemin Liu, Qiheng Mao, Chenghao Liu, Yuan Fang, Jianling Sun
On Size-Oriented Long-Tailed Graph Classification Of Graph Neural Networks, Zemin Liu, Qiheng Mao, Chenghao Liu, Yuan Fang, Jianling Sun
Research Collection School Of Computing and Information Systems
The prevalence of graph structures attracts a surge of investigation on graph data, enabling several downstream tasks such as multigraph classification. However, in the multi-graph setting, graphs usually follow a long-tailed distribution in terms of their sizes, i.e., the number of nodes. In particular, a large fraction of tail graphs usually have small sizes. Though recent graph neural networks (GNNs) can learn powerful graph-level representations, they treat the graphs uniformly and marginalize the tail graphs which suffer from the lack of distinguishable structures, resulting in inferior performance on tail graphs. To alleviate this concern, in this paper we propose a …
Learning User Interface Semantics From Heterogeneous Networks With Multi-Modal And Positional Attributes, Gary Ang, Ee-Peng Lim
Learning User Interface Semantics From Heterogeneous Networks With Multi-Modal And Positional Attributes, Gary Ang, Ee-Peng Lim
Research Collection School Of Computing and Information Systems
User interfaces (UI) of desktop, web, and mobile applications involve a hierarchy of objects (e.g. applications, screens, view class, and other types of design objects) with multimodal (e.g. textual, visual) and positional (e.g. spatial location, sequence order and hierarchy level) attributes. We can therefore represent a set of application UIs as a heterogeneous network with multimodal and positional attributes. Such a network not only represents how users understand the visual layout of UIs, but also influences how users would interact with applications through these UIs. To model the UI semantics well for different UI annotation, search, and evaluation tasks, this …
Deep Graph-Level Anomaly Detection By Glocal Knowledge Distillation, Rongrong Ma, Guansong Pang, Ling Chen, Anton Van Den Hengel
Deep Graph-Level Anomaly Detection By Glocal Knowledge Distillation, Rongrong Ma, Guansong Pang, Ling Chen, Anton Van Den Hengel
Research Collection School Of Computing and Information Systems
Graph-level anomaly detection (GAD) describes the problem of detecting graphs that are abnormal in their structure and/or the features of their nodes, as compared to other graphs. One of the challenges in GAD is to devise graph representations that enable the detection of both locally- and globally-anomalous graphs, i.e., graphs that are abnormal in their fine-grained (node-level) or holistic (graph-level) properties, respectively. To tackle this challenge we introduce a novel deep anomaly detection approach for GAD that learns rich global and local normal pattern information by joint random distillation of graph and node representations. The random distillation is achieved by …