Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Databases and Information Systems (115)
- Software Engineering (76)
- Artificial Intelligence and Robotics (37)
- Engineering (35)
- Computer Engineering (33)
-
- Graphics and Human Computer Interfaces (28)
- Information Security (23)
- Digital Communications and Networking (14)
- Theory and Algorithms (14)
- Social and Behavioral Sciences (13)
- Public Affairs, Public Policy and Public Administration (10)
- Transportation (9)
- Computer and Systems Architecture (7)
- Systems Architecture (6)
- Business (5)
- Numerical Analysis and Scientific Computing (5)
- Programming Languages and Compilers (5)
- Data Storage Systems (4)
- Communication (2)
- Management Information Systems (2)
- Medicine and Health Sciences (2)
- Operations Research, Systems Engineering and Industrial Engineering (2)
- Public Health (2)
- Social Media (2)
- Applied Mathematics (1)
- Asian Studies (1)
- Data Science (1)
- Keyword
-
- Neural networks (12)
- Graph neural networks (10)
- Reinforcement learning (9)
- Task analysis (8)
- Training (8)
-
- Deep learning (7)
- Deep learning testing (5)
- Deep neural networks (5)
- Graph Neural Networks (5)
- Network embedding (5)
- Security (5)
- Adaptive Resonance Theory (4)
- Categorization (4)
- Cloud computing (4)
- Clustering (4)
- Computer architecture (4)
- Networks (4)
- Neural Networks (4)
- Neural network (4)
- Neurons (4)
- Supervised learning (4)
- Uncertainty (4)
- Adaptive resonance theory (3)
- Adaptive systems (3)
- Adversarial attack (3)
- Attention mechanisms (3)
- Data models (3)
- Deep Learning (3)
- Deep neural network (3)
- Embeddings (3)
Articles 61 - 90 of 322
Full-Text Articles in OS and Networks
Win: Weight-Decay-Integrated Nesterov Acceleration For Adaptive Gradient Algorithms, Pan Zhou, Xingyu Xie, Shuicheng Yan
Win: Weight-Decay-Integrated Nesterov Acceleration For Adaptive Gradient Algorithms, Pan Zhou, Xingyu Xie, Shuicheng Yan
Research Collection School Of Computing and Information Systems
Training deep networks on large-scale datasets is computationally challenging. In this work, we explore the problem of “how to accelerate adaptive gradient algorithms in a general manner”, and aim to provide practical efficiency-boosting insights. To this end, we propose an effective and general Weight-decay-Integrated Nesterov acceleration (Win) to accelerate adaptive algorithms. Taking AdamW and Adam as examples, we minimize a dynamical loss per iteration which combines the vanilla training loss and a dynamic regularizer inspired by proximal point method (PPM) to improve the convexity of the problem. To introduce Nesterov-alike-acceleration into AdamW and Adam, we respectively use the first- and …
On-Device Deep Multi-Task Inference Via Multi-Task Zipping, Xiaoxi He, Xu Wang, Zimu Zhou, Jiahang Wu, Zheng Yang, Lothar Thiele
On-Device Deep Multi-Task Inference Via Multi-Task Zipping, Xiaoxi He, Xu Wang, Zimu Zhou, Jiahang Wu, Zheng Yang, Lothar Thiele
Research Collection School Of Computing and Information Systems
Future mobile devices are anticipated to perceive, understand and react to the world on their own by running multiple correlated deep neural networks locally on-device. Yet the complexity of these deep models needs to be trimmed down both within-model and cross-model to fit in mobile storage and memory. Previous studies squeeze the redundancy within a single model. In this work, we aim to reduce the redundancy across multiple models. We propose Multi-Task Zipping (MTZ), a framework to automatically merge correlated, pre-trained deep neural networks for cross-model compression. Central in MTZ is a layer-wise neuron sharing and incoming weight updating scheme …
Resale Hdb Price Prediction Considering Covid-19 Through Sentiment Analysis, Srinaath Anbu Durai, Zhaoxia Wang
Resale Hdb Price Prediction Considering Covid-19 Through Sentiment Analysis, Srinaath Anbu Durai, Zhaoxia Wang
Research Collection School Of Computing and Information Systems
Twitter sentiment has been used as a predictor to predict price values or trends in both the stock market and housing market. The pioneering works in this stream of research drew upon works in behavioural economics to show that sentiment or emotions impact economic decisions. Latest works in this stream focus on the algorithm used as opposed to the data used. A literature review of works in this stream through the lens of data used shows that there is a paucity of work that considers the impact of sentiments caused due to an external factor on either the stock or …
Reinforced Adaptation Network For Partial Domain Adaptation, Keyu Wu, Min Wu, Zhenghua Chen, Ruibing Jin, Wei Cui, Zhiguang Cao, Xiaoli Li
Reinforced Adaptation Network For Partial Domain Adaptation, Keyu Wu, Min Wu, Zhenghua Chen, Ruibing Jin, Wei Cui, Zhiguang Cao, Xiaoli Li
Research Collection School Of Computing and Information Systems
Domain adaptation enables generalized learning in new environments by transferring knowledge from label-rich source domains to label-scarce target domains. As a more realistic extension, partial domain adaptation (PDA) relaxes the assumption of fully shared label space, and instead deals with the scenario where the target label space is a subset of the source label space. In this paper, we propose a Reinforced Adaptation Network (RAN) to address the challenging PDA problem. Specifically, a deep reinforcement learning model is proposed to learn source data selection policies. Meanwhile, a domain adaptation model is presented to simultaneously determine rewards and learn domain-invariant feature …
A Learner-Verifier Framework For Neural Network Controllers And Certificates Of Stochastic Systems, Krishnendu Chatterjee, Thomas A. Henzinger, Dorde Zikelic, Dorde Zikelic
A Learner-Verifier Framework For Neural Network Controllers And Certificates Of Stochastic Systems, Krishnendu Chatterjee, Thomas A. Henzinger, Dorde Zikelic, Dorde Zikelic
Research Collection School Of Computing and Information Systems
Reinforcement learning has received much attention for learning controllers of deterministic systems. We consider a learner-verifer framework for stochastic control systems and survey recent methods that formally guarantee a conjunction of reachability and safety properties. Given a property and a lower bound on the probability of the property being satisfied, our framework jointly learns a control policy and a formal certificate to ensure the satisfaction of the property with a desired probability threshold. Both the control policy and the formal certificate are continuous functions from states to reals, which are learned as parameterized neural networks. While in the deterministic case, …
Rntrajrec: Road Network Enhanced Trajectory Recovery With Spatial-Temporal Trans-Former, Yuqi Chen, Hanyuan Zhang, Weiwei Sun, Baihua Zheng
Rntrajrec: Road Network Enhanced Trajectory Recovery With Spatial-Temporal Trans-Former, Yuqi Chen, Hanyuan Zhang, Weiwei Sun, Baihua Zheng
Research Collection School Of Computing and Information Systems
GPS trajectories are the essential foundations for many trajectory-based applications. Most applications require a large number of high sample rate trajectories to achieve a good performance. However, many real-life trajectories are collected with low sample rate due to energy concern or other constraints. We study the task of trajectory recovery in this paper as a means to increase the sample rate of low sample trajectories. Most existing works on trajectory recovery follow a sequence-to-sequence diagram, with an encoder to encode a trajectory and a decoder to recover real GPS points in the trajectory. However, these works ignore the topology of …
Generalizing Graph Neural Network Across Graphs And Time, Zhihao Wen
Generalizing Graph Neural Network Across Graphs And Time, Zhihao Wen
Research Collection School Of Computing and Information Systems
Graph-structured data widely exist in diverse real-world scenarios, analysis of these graphs can uncover valuable insights about their respective application domains. However, most previous works focused on learning node representation from a single fixed graph, while many real-world scenarios require representations to be quickly generated for unseen nodes, new edges, or entirely new graphs. This inductive ability is essential for high-throughtput machine learning systems. However, this inductive graph representation problem is quite difficult, compared to the transductive setting, for that generalizing to unseen nodes requires new subgraphs containing the new nodes to be aligned to the neural network trained already. …
Learning And Understanding User Interface Semantics From Heterogeneous Networks With Multimodal And Positional Attributes, Meng Kiat Gary Ang, Ee-Peng Lim
Learning And Understanding User Interface Semantics From Heterogeneous Networks With Multimodal And Positional Attributes, Meng Kiat 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 and 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, …
Effective Graph Kernels For Evolving Functional Brain Networks, Xinlei Wang, Jinyi Chen, Bing Tian Dai, Junchang Xin, Yu Gu, Ge Yu
Effective Graph Kernels For Evolving Functional Brain Networks, Xinlei Wang, Jinyi Chen, Bing Tian Dai, Junchang Xin, Yu Gu, Ge Yu
Research Collection School Of Computing and Information Systems
The graph kernel of the functional brain network is an effective method in the field of neuropsychiatric disease diagnosis like Alzheimer's Disease (AD). The traditional static brain networks cannot reflect dynamic changes of brain activities, but evolving brain networks, which are a series of brain networks over time, are able to seize such dynamic changes. As far as we know, the graph kernel method is effective for calculating the differences among networks. Therefore, it has a great potential to understand the dynamic changes of evolving brain networks, which are a series of chronological differences. However, if the conventional graph kernel …
Quantization-Aware Interval Bound Propagation For Training Certifiably Robust Quantized Neural Networks, Mathias Lechner, Dorde Zikelic, Krishnendu Chatterjee, A. Thomas Henzinger, Daniela Rus
Quantization-Aware Interval Bound Propagation For Training Certifiably Robust Quantized Neural Networks, Mathias Lechner, Dorde Zikelic, Krishnendu Chatterjee, A. Thomas Henzinger, Daniela Rus
Research Collection School Of Computing and Information Systems
We study the problem of training and certifying adversarially robust quantized neural networks (QNNs). Quantization is a technique for making neural networks more efficient by running them using low-bit integer arithmetic and is therefore commonly adopted in industry. Recent work has shown that floating-point neural networks that have been verified to be robust can become vulnerable to adversarial attacks after quantization, and certification of the quantized representation is necessary to guarantee robustness. In this work, we present quantization-aware interval bound propagation (QA-IBP), a novel method for training robust QNNs. Inspired by advances in robust learning of non-quantized networks, our training …
Learning Feature Embedding Refiner For Solving Vehicle Routing Problems, Jingwen Li, Yining Ma, Zhiguang Cao, Yaoxin Wu, Wen Song, Jie Zhang, Yeow Meng Chee
Learning Feature Embedding Refiner For Solving Vehicle Routing Problems, Jingwen Li, Yining Ma, Zhiguang Cao, Yaoxin Wu, Wen Song, Jie Zhang, Yeow Meng Chee
Research Collection School Of Computing and Information Systems
While the encoder–decoder structure is widely used in the recent neural construction methods for learning to solve vehicle routing problems (VRPs), they are less effective in searching solutions due to deterministic feature embeddings and deterministic probability distributions. In this article, we propose the feature embedding refiner (FER) with a novel and generic encoder–refiner–decoder structure to boost the existing encoder–decoder structured deep models. It is model-agnostic that the encoder and the decoder can be from any pretrained neural construction method. Regarding the introduced refiner network, we design its architecture by combining the standard gated recurrent units (GRU) cell with two new …
On The Robustness Of Diffusion In A Network Under Node Attacks, Alvis Logins, Yuchen Li, Panagiotis Karras
On The Robustness Of Diffusion In A Network Under Node Attacks, Alvis Logins, Yuchen Li, Panagiotis Karras
Research Collection School Of Computing and Information Systems
How can we assess a network's ability to maintain its functionality under attacks Network robustness has been studied extensively in the case of deterministic networks. However, applications such as online information diffusion and the behavior of networked public raise a question of robustness in probabilistic networks. We propose three novel robustness measures for networks hosting a diffusion under the Independent Cascade or Linear Threshold model, susceptible to attacks by an adversarial attacker who disables nodes. The outcome of such a process depends on the selection of its initiators, or seeds, by the seeder, as well as on two factors outside …
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 …
Segment-Wise Time-Varying Dynamic Bayesian Network With Graph Regularization, Xing Yang, Chen Zhang, Baihua Zheng
Segment-Wise Time-Varying Dynamic Bayesian Network With Graph Regularization, Xing Yang, Chen Zhang, Baihua Zheng
Research Collection School Of Computing and Information Systems
Time-varying dynamic Bayesian network (TVDBN) is essential for describing time-evolving directed conditional dependence structures in complex multivariate systems. In this article, we construct a TVDBN model, together with a score-based method for its structure learning. The model adopts a vector autoregressive (VAR) model to describe inter-slice and intra-slice relations between variables. By allowing VAR parameters to change segment-wisely over time, the time-varying dynamics of the network structure can be described. Furthermore, considering some external information can provide additional similarity information of variables. Graph Laplacian is further imposed to regularize similar nodes to have similar network structures. The regularized maximum a …
Which Neural Network Makes More Explainable Decisions? An Approach Towards Measuring Explainability, Mengdi Zhang, Jun Sun, Jingyi Wang
Which Neural Network Makes More Explainable Decisions? An Approach Towards Measuring Explainability, Mengdi Zhang, Jun Sun, Jingyi Wang
Research Collection School Of Computing and Information Systems
Neural networks are getting increasingly popular thanks to their exceptional performance in solving many real-world problems. At the same time, they are shown to be vulnerable to attacks, difficult to debug and subject to fairness issues. To improve people’s trust in the technology, it is often necessary to provide some human-understandable explanation of neural networks’ decisions, e.g., why is that my loan application is rejected whereas hers is approved? That is, the stakeholder would be interested to minimize the chances of not being able to explain the decision consistently and would like to know how often and how easy it …
Stitching Weight-Shared Deep Neural Networks For Efficient Multitask Inference On Gpu, Zeyu Wang, Xiaoxi He, Zimu Zhou, Xu Wang, Qiang Ma, Xin Miao, Zhuo Liu, Lothar Thiele, Zheng. Yang
Stitching Weight-Shared Deep Neural Networks For Efficient Multitask Inference On Gpu, Zeyu Wang, Xiaoxi He, Zimu Zhou, Xu Wang, Qiang Ma, Xin Miao, Zhuo Liu, Lothar Thiele, Zheng. Yang
Research Collection School Of Computing and Information Systems
Intelligent personal and home applications demand multiple deep neural networks (DNNs) running on resourceconstrained platforms for compound inference tasks, known as multitask inference. To fit multiple DNNs into low-resource devices, emerging techniques resort to weight sharing among DNNs to reduce their storage. However, such reduction in storage fails to translate into efficient execution on common accelerators such as GPUs. Most DNN graph rewriters are blind for multiDNN optimization, while GPU vendors provide inefficient APIs for parallel multi-DNN execution at runtime. A few prior graph rewriters suggest cross-model graph fusion for low-latency multiDNN execution. Yet they request duplication of the shared …
Qvip: An Ilp-Based Formal Verification Approach For Quantized Neural Networks, Yedi Zhang, Zhe Zhao, Guangke Chen, Fu Song, Min Zhang, Taolue Chen, Jun Sun
Qvip: An Ilp-Based Formal Verification Approach For Quantized Neural Networks, Yedi Zhang, Zhe Zhao, Guangke Chen, Fu Song, Min Zhang, Taolue Chen, Jun Sun
Research Collection School Of Computing and Information Systems
Deep learning has become a promising programming paradigm in software development, owing to its surprising performance in solving many challenging tasks. Deep neural networks (DNNs) are increasingly being deployed in practice, but are limited on resource-constrained devices owing to their demand for computational power. Quantization has emerged as a promising technique to reduce the size of DNNs with comparable accuracy as their floating-point numbered counterparts. The resulting quantized neural networks (QNNs) can be implemented energy-efficiently. Similar to their floating-point numbered counterparts, quality assurance techniques for QNNs, such as testing and formal verification, are essential but are currently less explored. In …
Learning Improvement Heuristics For Solving Routing Problems, Yaoxin Wu, Wen Song, Zhiguang Cao, Jie Zhang, Andrew Lim
Learning Improvement Heuristics For Solving Routing Problems, Yaoxin Wu, Wen Song, Zhiguang Cao, Jie Zhang, Andrew Lim
Research Collection School Of Computing and Information Systems
Recent studies in using deep learning to solve routing problems focus on construction heuristics, the solutions of which are still far from optimality. Improvement heuristics have great potential to narrow this gap by iteratively refining a solution. However, classic improvement heuristics are all guided by hand-crafted rules which may limit their performance. In this paper, we propose a deep reinforcement learning framework to learn the improvement heuristics for routing problems. We design a self-attention based deep architecture as the policy network to guide the selection of next solution. We apply our method to two important routing problems, i.e. travelling salesman …
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 …
Self-Checking Deep Neural Networks For Anomalies And Adversaries In Deployment, Yan Xiao, Ivan Beschastnikh, Yun Lin, Rajdeep Singh Hundal, Xiaofei Xie, David S. Rosenblum, Jin Song Dong
Self-Checking Deep Neural Networks For Anomalies And Adversaries In Deployment, Yan Xiao, Ivan Beschastnikh, Yun Lin, Rajdeep Singh Hundal, Xiaofei Xie, David S. Rosenblum, Jin Song Dong
Research Collection School Of Computing and Information Systems
Deep Neural Networks (DNNs) have been widely adopted, yet DNN models are surprisingly unreliable, which raises significant concerns about their use in critical domains. In this work, we propose that runtime DNN mistakes can be quickly detected and properly dealt with in deployment, especially in settings like self-driving vehicles. Just as software engineering (SE) community has developed effective mechanisms and techniques to monitor and check programmed components, our previous work, SelfChecker, is designed to monitor and correct DNN predictions given unintended abnormal test data. SelfChecker triggers an alarm if the decisions given by the internal layer features of the model …
Npc: Neuron Path Coverage Via Characterizing Decision Logic Of Deep Neural Networks, Xiaofei Xie, Tianlin Li, Jian Wang, Lei Ma, Qing Guo, Felix Juefei-Xu, Yang Liu
Npc: Neuron Path Coverage Via Characterizing Decision Logic Of Deep Neural Networks, Xiaofei Xie, Tianlin Li, Jian Wang, Lei Ma, Qing Guo, Felix Juefei-Xu, Yang Liu
Research Collection School Of Computing and Information Systems
Deep learning has recently been widely applied to many applications across different domains, e.g., image classification and audio recognition. However, the quality of Deep Neural Networks (DNNs) still raises concerns in the practical operational environment, which calls for systematic testing, especially in safety-critical scenarios. Inspired by software testing, a number of structural coverage criteria are designed and proposed to measure the test adequacy of DNNs. However, due to the blackbox nature of DNN, the existing structural coverage criteria are difficult to interpret, making it hard to understand the underlying principles of these criteria. The relationship between the structural coverage and …
Enhancing Security Patch Identification By Capturing Structures In Commits, Bozhi Wu, Shangqing Liu, Ruitao Feng, Xiaofei Xie, Jingkai Siow, Shang-Wei Lin
Enhancing Security Patch Identification By Capturing Structures In Commits, Bozhi Wu, Shangqing Liu, Ruitao Feng, Xiaofei Xie, Jingkai Siow, Shang-Wei Lin
Research Collection School Of Computing and Information Systems
With the rapid increasing number of open source software (OSS), the majority of the software vulnerabilities in the open source components are fixed silently, which leads to the deployed software that integrated them being unable to get a timely update. Hence, it is critical to design a security patch identification system to ensure the security of the utilized software. However, most of the existing works for security patch identification just consider the changed code and the commit message of a commit as a flat sequence of tokens with simple neural networks to learn its semantics, while the structure information is …
A3gan: Attribute-Aware Anonymization Networks For Face De-Identification, Liming Zhai, Qing Guo, Xiaofei Xie, Lei Ma, Yi Estelle Wang, Yang Liu
A3gan: Attribute-Aware Anonymization Networks For Face De-Identification, Liming Zhai, Qing Guo, Xiaofei Xie, Lei Ma, Yi Estelle Wang, Yang Liu
Research Collection School Of Computing and Information Systems
Face de-identification (De-ID) removes face identity information in face images to avoid personal privacy leakage. Existing face De-ID breaks the raw identity by cutting out the face regions and recovering the corrupted regions via deep generators, which inevitably affect the generation quality and cannot control generation results according to subsequent intelligent tasks (e.g., facial expression recognition). In this work, for the first attempt, we think the face De-ID from the perspective of attribute editing and propose an attribute-aware anonymization network (A3GAN) by formulating face De-ID as a joint task of semantic suppression and controllable attribute injection. Intuitively, the semantic suppression …
Neighbor-Anchoring Adversarial Graph Neural Networks (Extended Abstract), Zemin Liu, Yuan Fang, Yong Liu, Vincent W. Zheng
Neighbor-Anchoring Adversarial Graph Neural Networks (Extended Abstract), Zemin Liu, Yuan Fang, Yong Liu, Vincent W. Zheng
Research Collection School Of Computing and Information Systems
While graph neural networks (GNNs) exhibit strong discriminative power, they often fall short of learning the underlying node distribution for increased robustness. To deal with this, inspired by generative adversarial networks (GANs), we investigate the problem of adversarial learning on graph neural networks, and propose a novel framework named NAGNN (i.e., Neighbor-anchoring Adversarial Graph Neural Networks) for graph representation learning, which trains not only a discriminator but also a generator that compete with each other. In particular, we propose a novel neighbor-anchoring strategy, where the generator produces samples with explicit features and neighborhood structures anchored on a reference real node, …
Guided Attention Multimodal Multitask Financial Forecasting With Inter-Company Relationships And Global And Local News, Meng Kiat Gary Ang, Ee-Peng Lim
Guided Attention Multimodal Multitask Financial Forecasting With Inter-Company Relationships And Global And Local News, Meng Kiat Gary Ang, Ee-Peng Lim
Research Collection School Of Computing and Information Systems
Most works on financial forecasting use information directly associated with individual companies (e.g., stock prices, news on the company) to predict stock returns for trading. We refer to such company-specific information as local information. Stock returns may also be influenced by global information (e.g., news on the economy in general), and inter-company relationships. Capturing such diverse information is challenging due to the low signal-to-noise ratios, different time-scales, sparsity and distributions of global and local information from different modalities. In this paper, we propose a model that captures both global and local multimodal information for investment and risk management-related forecasting tasks. …
Learning Semantically Rich Network-Based Multi-Modal Mobile User Interface Embeddings, Meng Kiat Gary Ang, Ee-Peng Lim
Learning Semantically Rich Network-Based Multi-Modal Mobile User Interface Embeddings, Meng Kiat Gary Ang, Ee-Peng Lim
Research Collection School Of Computing and Information Systems
Semantically rich information from multiple modalities - text, code, images, categorical and numerical data - co-exist in the user interface (UI) design of mobile applications. Moreover, each UI design is composed of inter-linked UI entities which support different functions of an application, e.g., a UI screen comprising a UI taskbar, a menu and multiple button elements. Existing UI representation learning methods unfortunately are not designed to capture multi-modal and linkage structure between UI entities. To support effective search and recommendation applications over mobile UIs, we need UI representations that integrate latent semantics present in both multi-modal information and linkages between …
Topic-Guided Conversational Recommender In Multiple Domains, Lizi Liao, Ryuichi Takanobu, Yunshan Ma, Xun Yang, Minlie Huang, Tat-Seng Chua
Topic-Guided Conversational Recommender In Multiple Domains, Lizi Liao, Ryuichi Takanobu, Yunshan Ma, Xun Yang, Minlie Huang, Tat-Seng Chua
Research Collection School Of Computing and Information Systems
Conversational systems have recently attracted significant attention. Both the research community and industry believe that it will exert huge impact on human-computer interaction, and specifically, the IR/RecSys community has begun to explore Conversational Recommendation. In real-life scenarios, such systems are often urgently needed in helping users accomplishing different tasks under various situations. However, existing works still face several shortcomings: (1) Most efforts are largely confined in single task setting. They fall short of hands in handling tasks across domains. (2) Aside from soliciting user preference from dialogue history, a conversational recommender naturally has access to the back-end data structure which …
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 …
Pre-Training Graph Neural Networks For Link Prediction In Biomedical Networks, Yahui Long, Min Wu, Yong Liu, Yuan Fang, Chee Kong Kwoh, Jiawei Luo, Xiaoli Li
Pre-Training Graph Neural Networks For Link Prediction In Biomedical Networks, Yahui Long, Min Wu, Yong Liu, Yuan Fang, Chee Kong Kwoh, Jiawei Luo, Xiaoli Li
Research Collection School Of Computing and Information Systems
Motivation: Graphs or networks are widely utilized to model the interactions between different entities (e.g., proteins, drugs, etc) for biomedical applications. Predicting potential links in biomedical networks is important for understanding the pathological mechanisms of various complex human diseases, as well as screening compound targets for drug discovery. Graph neural networks (GNNs) have been designed for link prediction in various biomedical networks, which rely on the node features extracted from different data sources, e.g., sequence, structure and network data. However, it is challenging to effectively integrate these data sources and automatically extract features for different link prediction tasks. Results: In …
Resil: Revivifying Function Signature Inference Using Deep Learning With Domain-Specific Knowledge, Yan Lin, Debin Gao, David Lo
Resil: Revivifying Function Signature Inference Using Deep Learning With Domain-Specific Knowledge, Yan Lin, Debin Gao, David Lo
Research Collection School Of Computing and Information Systems
Function signature recovery is important for binary analysis and security enhancement, such as bug finding and control-flow integrity enforcement. However, binary executables typically have crucial information vital for function signature recovery stripped off during compilation. To make things worse, recent studies show that many compiler optimization strategies further complicate the recovery of function signatures with intended violations to function calling conventions.In this paper, we first perform a systematic study to quantify the extent to which compiler optimizations (negatively) impact the accuracy of existing deep learning techniques for function signature recovery. Our experiments show that a state-of-the-art deep learning technique has …