Open Access. Powered by Scholars. Published by Universities.®
Artificial Intelligence and Robotics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Graph neural networks (3)
- Deep learning (2)
- API documentation (1)
- API evolution (1)
- Abstract syntax tree (1)
-
- Action and behavior recognition (1)
- Analyzing the Impact of Digitization on Business Operations (1)
- Artificial intelligence (1)
- Automated program repair (1)
- Automatic speech recognition (1)
- Benchmark (1)
- Bug dataset (1)
- Categorical Data (1)
- Code snippets (1)
- Contextual relation (1)
- Continual deepfake detection (1)
- Coupling Learning (1)
- Cross-referencing (1)
- Crowd-sourced knowledge (1)
- Customer service (1)
- Dataset purification (1)
- Domain alignment (1)
- Dynamic heterogeneous graph (1)
- Evolution (1)
- Feature Selection (1)
- Few-shot learning (1)
- FiLM (1)
- Graph embedding (1)
- Heterogeneous Hawkes process (1)
- Heterogeneous evolved attention mechanism (1)
Articles 1 - 25 of 25
Full-Text Articles in Artificial Intelligence and Robotics
Rmm: Reinforced Memory Management For Class-Incremental Learning, Yaoyao Liu, Qianru Sun, Qianru Sun
Rmm: Reinforced Memory Management For Class-Incremental Learning, Yaoyao Liu, Qianru Sun, Qianru Sun
Research Collection School Of Computing and Information Systems
Class-Incremental Learning (CIL) [38] trains classifiers under a strict memory budget: in each incremental phase, learning is done for new data, most of which is abandoned to free space for the next phase. The preserved data are exemplars used for replaying. However, existing methods use a static and ad hoc strategy for memory allocation, which is often sub-optimal. In this work, we propose a dynamic memory management strategy that is optimized for the incremental phases and different object classes. We call our method reinforced memory management (RMM), leveraging reinforcement learning. RMM training is not naturally compatible with CIL as the …
Stock Market Trend Forecasting Based On Multiple Textual Features: A Deep Learning Method, Zhenda Hu, Zhaoxia Wang, Seng-Beng Ho, Ah-Hwee Tan
Stock Market Trend Forecasting Based On Multiple Textual Features: A Deep Learning Method, Zhenda Hu, Zhaoxia Wang, Seng-Beng Ho, Ah-Hwee Tan
Research Collection School Of Computing and Information Systems
Stock market trend forecasting is a valuable and challenging research task for both industry and academia. In order to explore the influence of stock news information on the stock market trend, a textual embedding construction method is proposed to encode multiple textual features, including topic features, sentiment features, and semantic features extracted from stock news textual content. In addition, a deep learning method is designed by using financial data and multiple textual features obtained from multiple news textual embeddings for short-term stock market trend prediction. For evaluation, extensive experiments on real stock market data are conducted. The experimental results illustrate …
Weakly-Supervised Video Anomaly Detection With Contrastive Learning Of Long And Short-Range Temporal Features, Yu Tian, Guansong Pang, Yuanhong Chen, Rajvinder Singh, Johan W. Verjans, Gustavo Carneiro
Weakly-Supervised Video Anomaly Detection With Contrastive Learning Of Long And Short-Range Temporal Features, Yu Tian, Guansong Pang, Yuanhong Chen, Rajvinder Singh, Johan W. Verjans, Gustavo Carneiro
Research Collection School Of Computing and Information Systems
Anomaly detection with weakly supervised video-level labels is typically formulated as a multiple instance learning (MIL) problem, in which we aim to identify snippets containing abnormal events, with each video represented as a bag of video snippets. Although current methods show effective detection performance, their recognition of the positive instances, i.e., rare abnormal snippets in the abnormal videos, is largely biased by the dominant negative instances, especially when the abnormal events are subtle anomalies that exhibit only small differences compared with normal events. This issue is exacerbated in many methods that ignore important video temporal dependencies. To address this issue, …
Towards Enriching Responses With Crowd-Sourced Knowledge For Task-Oriented Dialogue, Yingxu He, Lizi Liao, Zheng Zhang, Tat-Seng Chua
Towards Enriching Responses With Crowd-Sourced Knowledge For Task-Oriented Dialogue, Yingxu He, Lizi Liao, Zheng Zhang, Tat-Seng Chua
Research Collection School Of Computing and Information Systems
Task-oriented dialogue agents are built to assist users in completing various tasks. Generating appropriate responses for satisfactory task completion is the ultimate goal. Hence, as a convenient and straightforward way, metrics such as success rate, inform rate etc., have been widely leveraged to evaluate the generated responses. However, beyond task completion, there are several other factors that largely affect user satisfaction, which remain under-explored. In this work, we focus on analyzing different agent behavior patterns that lead to higher user satisfaction scores. Based on the findings, we design a neural response generation model EnRG. It naturally combines the power of …
Dynamic Heterogeneous Graph Embedding Via Heterogeneous Hawkes Process, Yugang Ji, Tianrui Jia, Yuan Fang, Chuan Shi
Dynamic Heterogeneous Graph Embedding Via Heterogeneous Hawkes Process, Yugang Ji, Tianrui Jia, Yuan Fang, Chuan Shi
Research Collection School Of Computing and Information Systems
Graph embedding, aiming to learn low-dimensional representations of nodes while preserving valuable structure information, has played a key role in graph analysis and inference. However, most existing methods deal with static homogeneous topologies, while graphs in real-world scenarios are gradually generated with different-typed temporal events, containing abundant semantics and dynamics. Limited work has been done for embedding dynamic heterogeneous graphs since it is very challenging to model the complete formation process of heterogeneous events. In this paper, we propose a novel Heterogeneous Hawkes Process based dynamic Graph Embedding (HPGE) to handle this problem. HPGE effectively integrates the Hawkes process into …
Node-Wise Localization Of Graph Neural Networks, Zemin Liu, Yuan Fang, Chenghao Liu, Steven C.H. Hoi
Node-Wise Localization Of Graph Neural Networks, Zemin Liu, Yuan Fang, Chenghao Liu, Steven C.H. Hoi
Research Collection School Of Computing and Information Systems
Graph neural networks (GNNs) emerge as a powerful family of representation learning models on graphs. To derive node representations, they utilize a global model that recursively aggregates information from the neighboring nodes. However, different nodes reside at different parts of the graph in different local contexts, making their distributions vary across the graph. Ideally, how a node receives its neighborhood information should be a function of its local context, to diverge from the global GNN model shared by all nodes. To utilize node locality without overfitting, we propose a node-wise localization of GNNs by accounting for both global and local …
Crossasr++: A Modular Differential Testing Framework For Automatic Speech Recognition, Muhammad Hilmi Asyrofi, Zhou Yang, David Lo
Crossasr++: A Modular Differential Testing Framework For Automatic Speech Recognition, Muhammad Hilmi Asyrofi, Zhou Yang, David Lo
Research Collection School Of Computing and Information Systems
Developers need to perform adequate testing to ensure the quality of Automatic Speech Recognition (ASR) systems. However, manually collecting required test cases is tedious and time-consuming. Our recent work proposes CrossASR, a differential testing method for ASR systems. This method first utilizes Text-to-Speech (TTS) to generate audios from texts automatically and then feed these audios into different ASR systems for cross-referencing to uncover failed test cases. It also leverages a failure estimator to find failing test cases more efficiently. Such a method is inherently self-improvable: the performance can increase by leveraging more advanced TTS and ASR systems. So, in this …
Meta-Inductive Node Classification Across Graphs, Zhihao Wen, Yuan Fang, Zemin Liu
Meta-Inductive Node Classification Across Graphs, Zhihao Wen, Yuan Fang, Zemin Liu
Research Collection School Of Computing and Information Systems
Semi-supervised node classification on graphs is an important research problem, with many real-world applications in information retrieval such as content classification on a social network and query intent classification on an e-commerce query graph. While traditional approaches are largely transductive, recent graph neural networks (GNNs) integrate node features with network structures, thus enabling inductive node classification models that can be applied to new nodes or even new graphs in the same feature space. However, inter-graph differences still exist across graphs within the same domain. Thus, training just one global model (e.g., a state-of-the-art GNN) to handle all new graphs, whilst …
Oesense: Employing Occlusion Effect For In-Ear Human Sensing, Dong Ma, Andrea Ferlini, Cecilia Mascolo
Oesense: Employing Occlusion Effect For In-Ear Human Sensing, Dong Ma, Andrea Ferlini, Cecilia Mascolo
Research Collection School Of Computing and Information Systems
Smart earbuds are recognized as a new wearable platform for personal-scale human motion sensing. However, due to the interference from head movement or background noise, commonly-used modalities (e.g. accelerometer and microphone) fail to reliably detect both intense and light motions. To obviate this, we propose OESense, an acoustic-based in-ear system for general human motion sensing. The core idea behind OESense is the joint use of the occlusion effect (i.e., the enhancement of low-frequency components of bone-conducted sounds in an occluded ear canal) and inward-facing microphone, which naturally boosts the sensing signal and suppresses external interference. We prototype OESense as an …
Learning Index Policies For Restless Bandits With Application To Maternal Healthcare, Arpita Biswas, Gaurav Aggarwal, Pradeep Varakantham, Milind Tambe
Learning Index Policies For Restless Bandits With Application To Maternal Healthcare, Arpita Biswas, Gaurav Aggarwal, Pradeep Varakantham, Milind Tambe
Research Collection School Of Computing and Information Systems
In many community health settings, it is crucial to have a systematic monitoring and intervention process to ensure that the patients adhere to healthcare programs, such as periodic health checks or taking medications. When these interventions are expensive, they can be provided to only a fixed small fraction of the patients at any period of time. Hence, it is important to carefully choose the beneficiaries who should be provided with interventions and when. We model this scenario as a restless multi-armed bandit (RMAB) problem, where each beneficiary is assumed to transition from one state to another depending on the intervention …
A Differential Testing Approach For Evaluating Abstract Syntax Tree Mapping Algorithms, Yuanrui Fan, Xin Xia, David Lo, Ahmed E. Hassan, Yuan Wang, Shanping Li
A Differential Testing Approach For Evaluating Abstract Syntax Tree Mapping Algorithms, Yuanrui Fan, Xin Xia, David Lo, Ahmed E. Hassan, Yuan Wang, Shanping Li
Research Collection School Of Computing and Information Systems
Abstract syntax tree (AST) mapping algorithms are widely used to analyze changes in source code. Despite the foundational role of AST mapping algorithms, little effort has been made to evaluate the accuracy of AST mapping algorithms, i.e., the extent to which an algorithm captures the evolution of code. We observe that a program element often has only one best-mapped program element. Based on this observation, we propose a hierarchical approach to automatically compare the similarity of mapped statements and tokens by different algorithms. By performing the comparison, we determine if eachof the compared algorithms generates inaccurate mappings for a statement …
Guest Editorial: Non-Iid Outlier Detection In Complex Contexts, Guansong Pang, Fabrizio Angiulli, Mihai Cucuringu, Huan Liu
Guest Editorial: Non-Iid Outlier Detection In Complex Contexts, Guansong Pang, Fabrizio Angiulli, Mihai Cucuringu, Huan Liu
Research Collection School Of Computing and Information Systems
Outlier detection, also known as anomaly detection, aims at identifying data instances that are rare or significantly different from the majority of instances. Due to its significance in many critical domains like cybersecurity, fintech, healthcare, public security, and AI safety, outlier detection has been one of the most active research areas in various communities, such as machine learning, data mining, computer vision, and statistics. Traditional outlier-detection techniques generally assume that data are independent and identically distributed (IID), which are significantly challenged in complex contexts where data are actually non-IID. These contexts are ubiquitous in not only graph data, sequence data, …
Unveiling The Mystery Of Api Evolution In Deep Learning Frameworks: A Case Study Of Tensorflow 2, Zejun Zhang, Yanming Yang, Xin Xia, David Lo, Xiaoxue Ren, John C. Grundy
Unveiling The Mystery Of Api Evolution In Deep Learning Frameworks: A Case Study Of Tensorflow 2, Zejun Zhang, Yanming Yang, Xin Xia, David Lo, Xiaoxue Ren, John C. Grundy
Research Collection School Of Computing and Information Systems
API developers have been working hard to evolve APIs to provide more simple, powerful, and robust API libraries. Although API evolution has been studied for multiple domains, such as Web and Android development, API evolution for deep learning frameworks has not yet been studied. It is not very clear how and why APIs evolve in deep learning frameworks, and yet these are being more and more heavily used in industry. To fill this gap, we conduct a large-scale and in-depth study on the API evolution of Tensorflow 2, which is currently the most popular deep learning framework. We first extract …
Spectral Tensor Train Parameterization Of Deep Learning Layers, A. Obukhov, M. Rakhuba, A. Liniger, Zhiwu Huang, S. Georgoulis, D. Dai, Van Gool L.
Spectral Tensor Train Parameterization Of Deep Learning Layers, A. Obukhov, M. Rakhuba, A. Liniger, Zhiwu Huang, S. Georgoulis, D. Dai, Van Gool L.
Research Collection School Of Computing and Information Systems
We study low-rank parameterizations of weight matrices with embedded spectral properties in the Deep Learning context. The low-rank property leads to parameter efficiency and permits taking computational shortcuts when computing mappings. Spectral properties are often subject to constraints in optimization problems, leading to better models and stability of optimization. We start by looking at the compact SVD parameterization of weight matrices and identifying redundancy sources in the parameterization. We further apply the Tensor Train (TT) decomposition to the compact SVD components, and propose a non-redundant differentiable parameterization of fixed TT-rank tensor manifolds, termed the Spectral Tensor Train Parameterization (STTP). We …
Homophily Outlier Detection In Non-Iid Categorical Data, Guansong Pang, Longbing Cao, Ling Chen
Homophily Outlier Detection In Non-Iid Categorical Data, Guansong Pang, Longbing Cao, Ling Chen
Research Collection School Of Computing and Information Systems
Most of existing outlier detection methods assume that the outlier factors (i.e., outlierness scoring measures) of data entities (e.g., feature values and data objects) are Independent and Identically Distributed (IID). This assumption does not hold in real-world applications where the outlierness of different entities is dependent on each other and/or taken from different probability distributions (non-IID). This may lead to the failure of detecting important outliers that are too subtle to be identified without considering the non-IID nature. The issue is even intensified in more challenging contexts, e.g., high-dimensional data with many noisy features. This work introduces a novel outlier …
Cross-Topic Rumor Detection Using Topic-Mixtures, Weijieying Ren, Jing Jiang, Ling Min Serena Khoo, Hai Leong Chieu
Cross-Topic Rumor Detection Using Topic-Mixtures, Weijieying Ren, Jing Jiang, Ling Min Serena Khoo, Hai Leong Chieu
Research Collection School Of Computing and Information Systems
There has been much interest in rumor detection using deep learning models in recent years. A well-known limitation of deep learning models is that they tend to learn superficial patterns, which restricts their generalization ability. We find that this is also true for cross-topic rumor detection. In this paper, we propose a method inspired by the “mixture of experts” paradigm. We assume that the prediction of the rumor class label given an instance is dependent on the topic distribution of the instance. After deriving a vector representation for each topic, given an instance, we derive a “topic mixture” vector for …
Mixed Dish Recognition With Contextual Relation And Domain Alignment, Lixi Deng, Jingjing Chen, Chong-Wah Ngo, Qianru Sun, Sheng Tang, Yongdong Zhang, Tat-Seng Chua
Mixed Dish Recognition With Contextual Relation And Domain Alignment, Lixi Deng, Jingjing Chen, Chong-Wah Ngo, Qianru Sun, Sheng Tang, Yongdong Zhang, Tat-Seng Chua
Research Collection School Of Computing and Information Systems
Mixed dish is a food category that contains different dishes mixed in one plate, and is popular in Eastern and Southeast Asia. Recognizing the individual dishes in a mixed dish image is important for health related applications, e.g. to calculate the nutrition values of the dish. However, most existing methods that focus on single dish classification are not applicable to the recognition of mixed dish images. The main challenge of mixed dish recognition comes from three aspects: a wide range of dish types, the complex dish combination with severe overlap between different dishes and the large visual variances of same …
Time Period-Based Top-K Semantic Trajectory Pattern Query, Munkh-Erdene Yadamjav, Farhana Murtaza Choudhury, Zhifeng Bao, Baihua Zheng
Time Period-Based Top-K Semantic Trajectory Pattern Query, Munkh-Erdene Yadamjav, Farhana Murtaza Choudhury, Zhifeng Bao, Baihua Zheng
Research Collection School Of Computing and Information Systems
The sequences of user check-ins form semantic trajectories that represent the movement of users through time, along with the types of POIs visited. Extracting patterns in semantic trajectories can be widely used in applications such as route planning and trip recommendation. Existing studies focus on the entire time duration of the data, which may miss some temporally significant patterns. In addition, they require thresholds to define the interestingness of the patterns. Motivated by the above, we study a new problem of finding top-k semantic trajectory patterns w.r.t. a given time period and categories by considering the spatial closeness of POIs. …
How Do Users Answer Matlab Questions On Q&A Sites? A Case Study On Stack Overflow And Mathworks, Mahshid Naghashzadeh, Amir Hagshenas, Ashkan Sami, David Lo
How Do Users Answer Matlab Questions On Q&A Sites? A Case Study On Stack Overflow And Mathworks, Mahshid Naghashzadeh, Amir Hagshenas, Ashkan Sami, David Lo
Research Collection School Of Computing and Information Systems
MATLAB is an engineering programming language with various toolboxes that has a dedicated Question and Answer (Q&A) platform on the MathWorks website, which is similar to Stack Overflow (SO). Moreover, some MATLAB users ask their questions on SO. This paper aims to compare these two Q&A platforms to see what kind of questions are asked and how developers answer these questions in each platform. The result of our analysis on 80,382 MATLAB questions on SO and 266,367 questions on MathWorks show that MATLAB questions on topics ranging from the MATLAB software installation to questions related to programming received high votes …
Learning To Assess The Quality Of Stroke Rehabilitation Exercises, Min Hun Lee, Daniel P. Siewiorek, Asim Smailagic, Alexandre Bernardino, Sergi Bermúdez I Badia
Learning To Assess The Quality Of Stroke Rehabilitation Exercises, Min Hun Lee, Daniel P. Siewiorek, Asim Smailagic, Alexandre Bernardino, Sergi Bermúdez I Badia
Research Collection School Of Computing and Information Systems
Due to the limited number of therapists, task-oriented exercises are often prescribed for post-stroke survivors as in-home rehabilitation. During in-home rehabilitation, a patient may become unmotivated or confused to comply prescriptions without the feedback of a therapist. To address this challenge, this paper proposes an automated method that can achieve not only qualitative, but also quantitative assessment of stroke rehabilitation exercises. Specifically, we explored a threshold model that utilizes the outputs of binary classifiers to quantify the correctness of a movements into a performance score. We collected movements of 11 healthy subjects and 15 post-stroke survivors using a Kinect sensor …
Is The Ground Truth Really Accurate? Dataset Purification For Automated Program Repair, Deheng Yang, Yan Lei, Xiaoguang Mao, David Lo, Huan Xie, Meng Yan
Is The Ground Truth Really Accurate? Dataset Purification For Automated Program Repair, Deheng Yang, Yan Lei, Xiaoguang Mao, David Lo, Huan Xie, Meng Yan
Research Collection School Of Computing and Information Systems
Datasets of real-world bugs shipped with human-written patches are intensively used in the evaluation of existing automated program repair (APR) techniques, wherein the human-written patches always serve as the ground truth, for manual or automated assessment approaches, to evaluate the correctness of test-suite adequate patches. An inaccurate human-written patch tangled with other code changes will pose threats to the reliability of the assessment results. Therefore, the construction of such datasets always requires much manual effort on isolating real bug fixes from bug fixing commits. However, the manual work is time-consuming and prone to mistakes, and little has been known on …
Relative And Absolute Location Embedding For Few-Shot Node Classification On Graph, Zemin Liu, Yuan Fang, Chenghao Liu, Steven C. H. Hoi
Relative And Absolute Location Embedding For Few-Shot Node Classification On Graph, Zemin Liu, Yuan Fang, Chenghao Liu, Steven C. H. Hoi
Research Collection School Of Computing and Information Systems
Node classification is an important problem on graphs. While recent advances in graph neural networks achieve promising performance, they require abundant labeled nodes for training. However, in many practical scenarios there often exist novel classes in which only one or a few labeled nodes are available as supervision, known as few-shot node classification. Although meta-learning has been widely used in vision and language domains to address few-shot learning, its adoption on graphs has been limited. In particular, graph nodes in a few-shot task are not independent and relate to each other. To deal with this, we propose a novel model …
Accelerating Large-Scale Heterogeneous Interaction Graph Embedding Learning Via Importance Sampling, Yugang Ji, Mingyang Yin, Hongxia Yang, Jingren Zhou, Vincent W. Zheng, Chuan Shi, Yuan Fang
Accelerating Large-Scale Heterogeneous Interaction Graph Embedding Learning Via Importance Sampling, Yugang Ji, Mingyang Yin, Hongxia Yang, Jingren Zhou, Vincent W. Zheng, Chuan Shi, Yuan Fang
Research Collection School Of Computing and Information Systems
In real-world problems, heterogeneous entities are often related to each other through multiple interactions, forming a Heterogeneous Interaction Graph (HIG in short). While modeling HIGs to deal with fundamental tasks, graph neural networks present an attractive opportunity that can make full use of the heterogeneity and rich semantic information by aggregating and propagating information from different types of neighborhoods. However, learning on such complex graphs, often with millions or billions of nodes, edges, and various attributes, could suffer from expensive time cost and high memory consumption. In this paper, we attempt to accelerate representation learning on large-scale HIGs by adopting …
A Continual Deepfake Detection Benchmark: Dataset, Methods, And Essentials, Chuqiao Li, Zhiwu Huang, Danda Pani Paudel, Yabin Wang, Mohamad Shahbazi, Xiaopeng Hong, Van Gool Luc
A Continual Deepfake Detection Benchmark: Dataset, Methods, And Essentials, Chuqiao Li, Zhiwu Huang, Danda Pani Paudel, Yabin Wang, Mohamad Shahbazi, Xiaopeng Hong, Van Gool Luc
Research Collection School Of Computing and Information Systems
There have been emerging a number of benchmarks and techniques for the detection of deepfakes. However, very few works study the detection of incrementally appearing deepfakes in the real-world scenarios. To simulate the wild scenes, this paper suggests a continual deepfake detection benchmark (CDDB) over a new collection of deepfakes from both known and unknown generative models. The suggested CDDB designs multiple evaluations on the detection over easy, hard, and long sequence of deepfake tasks, with a set of appropriate measures. In addition, we exploit multiple approaches to adapt multiclass incremental learning methods, commonly used in the continual visual recognition, …
The Value Of Humanization In Customer Service, Yang Gao, Huaxia Rui, Shujing Sun
The Value Of Humanization In Customer Service, Yang Gao, Huaxia Rui, Shujing Sun
Research Collection School Of Computing and Information Systems
As algorithm-based agents become increasingly capable of handling customer service queries, customers are often uncertain whether they are served by humans or algorithms, and managers are left to question the value of human agents once the technology matures. The current paper studies this question by quantifying the impact of customers' enhanced perception of being served by human agents on customer service interactions. Our identification strategy hinges on the abrupt implementation by Southwest Airlines of a signature policy, which requires the inclusion of an agent's first name in responses on Twitter, thereby making the agent more humanized in the eyes of …