Open Access. Powered by Scholars. Published by Universities.®

Databases and Information Systems Commons™

Open Access. Powered by Scholars. Published by Universities.®

Singapore Management University

Discipline
Keyword
Publication Year
Publication
Publication Type

Articles 571 - 600 of 3555

Full-Text Articles in Databases and Information Systems

Generalization Bounds For Inductive Matrix Completion In Low-Noise Settings, Antoine Ledent, Rodrigo Alves, Yunwen Lei, Yann Guermeur, Marius Kloft Feb 2023

Generalization Bounds For Inductive Matrix Completion In Low-Noise Settings, Antoine Ledent, Rodrigo Alves, Yunwen Lei, Yann Guermeur, Marius Kloft

Research Collection School Of Computing and Information Systems

We study inductive matrix completion (matrix completion with side information) under an i.i.d. subgaussian noise assumption at a low noise regime, with uniform sampling of the entries. We obtain for the first time generalization bounds with the following three properties: (1) they scale like the standard deviation of the noise and in particular approach zero in the exact recovery case; (2) even in the presence of noise, they converge to zero when the sample size approaches infinity; and (3) for a fixed dimension of the side information, they only have a logarithmic dependence on the size of the matrix. Differently …

Go to article

Contrastive Learning Approach To Word-In-Context Task For Low-Resource Languages, Pei-Chi Lo, Yang-Yin Lee, Hsien-Hao Chen, Agus Trisnajaya Kwee, Ee-Peng Lim Feb 2023

Contrastive Learning Approach To Word-In-Context Task For Low-Resource Languages, Pei-Chi Lo, Yang-Yin Lee, Hsien-Hao Chen, Agus Trisnajaya Kwee, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

Word in context (WiC) task aims to determine whether a target word’s occurrences in two sentences share the same sense. In this paper, we propose a Contrastive Learning WiC (CLWiC) framework to improve the learning of sentence/word representations and classification of target word senses in the sentence pair when performing WiC on lowresource languages. In representation learning, CLWiC trains a pre-trained language model’s ability to cope with lowresource languages using both unsupervised and supervised contrastive learning. The WiC classifier learning further finetunes the language model with WiC classification loss under two classifier architecture options, SGBERT and WiSBERT, which use single-encoder …

Go to article

Cross-Domain Graph Anomaly Detection Via Anomaly-Aware Contrastive Alignment, Qizhou Wang, Guansong Pang, Mahsa Salehi, Wray Buntine, Christopher Leckie Feb 2023

Cross-Domain Graph Anomaly Detection Via Anomaly-Aware Contrastive Alignment, Qizhou Wang, Guansong Pang, Mahsa Salehi, Wray Buntine, Christopher Leckie

Research Collection School Of Computing and Information Systems

Cross-domain graph anomaly detection (CD-GAD) describes the problem of detecting anomalous nodes in an unlabelled target graph using auxiliary, related source graphs with labelled anomalous and normal nodes. Although it presents a promising approach to address the notoriously high false positive issue in anomaly detection, little work has been done in this line of research. There are numerous domain adaptation methods in the literature, but it is difficult to adapt them for GAD due to the unknown distributions of the anomalies and the complex node relations embedded in graph data. To this end, we introduce a novel domain adaptation approach, …

Go to article

On Generalized Degree Fairness In Graph Neural Networks, Zemin Liu, Trung Kien Nguyen, Yuan Fang Feb 2023

On Generalized Degree Fairness In Graph Neural Networks, Zemin Liu, Trung Kien Nguyen, Yuan Fang

Research Collection School Of Computing and Information Systems

Conventional graph neural networks (GNNs) are often confronted with fairness issues that may stem from their input, including node attributes and neighbors surrounding a node. While several recent approaches have been proposed to eliminate the bias rooted in sensitive attributes, they ignore the other key input of GNNs, namely the neighbors of a node, which can introduce bias since GNNs hinge on neighborhood structures to generate node representations. In particular, the varying neighborhood structures across nodes, manifesting themselves in drastically different node degrees, give rise to the diverse behaviors of nodes and biased outcomes. In this paper, we first define …

Go to article

Scalable And Globally Optimal Generalized L1 K-Center Clustering Via Constraint Generation In Mixed Integer Linear Programming, Aravinth Chembu, Scott Sanner, Hassan Khurram, Akshat Kumar Feb 2023

Scalable And Globally Optimal Generalized L1 K-Center Clustering Via Constraint Generation In Mixed Integer Linear Programming, Aravinth Chembu, Scott Sanner, Hassan Khurram, Akshat Kumar

Research Collection School Of Computing and Information Systems

The k-center clustering algorithm, introduced over 35 years ago, is known to be robust to class imbalance prevalent in many clustering problems and has various applications such as data summarization, document clustering, and facility location determination. Unfortunately, existing k-center algorithms provide highly suboptimal solutions that can limit their practical application, reproducibility, and clustering quality. In this paper, we provide a novel scalable and globally optimal solution to a popular variant of the k-center problem known as generalized L1 k-center clustering that uses L1 distance and allows the selection of arbitrary vectors as cluster centers. We show that this clustering objective …

Go to article

Learning Relation Prototype From Unlabeled Texts For Long-Tail Relation Extraction, Yixin Cao, Jun Kuang, Ming Gao, Aoying Zhou, Yonggang Wen, Tat-Seng Chua Feb 2023

Learning Relation Prototype From Unlabeled Texts For Long-Tail Relation Extraction, Yixin Cao, Jun Kuang, Ming Gao, Aoying Zhou, Yonggang Wen, Tat-Seng Chua

Research Collection School Of Computing and Information Systems

Relation Extraction (RE) is a vital step to complete Knowledge Graph (KG) by extracting entity relations from texts. However, it usually suffers from the long-tail issue. The training data mainly concentrates on a few types of relations, leading to the lack of sufficient annotations for the remaining types of relations. In this paper, we propose a general approach to learn relation prototypes from unlabeled texts, to facilitate the long-tail relation extraction by transferring knowledge from the relation types with sufficient training data. We learn relation prototypes as an implicit factor between entities, which reflects the meanings of relations as well …

Go to article

Mirror: Mining Implicit Relationships Via Structure-Enhanced Graph Convolutional Networks, Jiaying Liu, Feng Xia, Jing Ren, Bo Xu, Guansong Pang, Lianhua Chi Feb 2023

Mirror: Mining Implicit Relationships Via Structure-Enhanced Graph Convolutional Networks, Jiaying Liu, Feng Xia, Jing Ren, Bo Xu, Guansong Pang, Lianhua Chi

Research Collection School Of Computing and Information Systems

Data explosion in the information society drives people to develop more effective ways to extract meaningful information. Extracting semantic information and relational information has emerged as a key mining primitive in a wide variety of practical applications. Existing research on relation mining has primarily focused on explicit connections and ignored underlying information, e.g., the latent entity relations. Exploring such information (defined as implicit relationships in this article) provides an opportunity to reveal connotative knowledge and potential rules. In this article, we propose a novel research topic, i.e., how to identify implicit relationships across heterogeneous networks. Specially, we first give a …

Go to article

Mitigating Popularity Bias For Users And Items With Fairness-Centric Adaptive Recommendation, Zhongzhou Liu, Yuan Fang, Min Wu Feb 2023

Mitigating Popularity Bias For Users And Items With Fairness-Centric Adaptive Recommendation, Zhongzhou Liu, Yuan Fang, Min Wu

Research Collection School Of Computing and Information Systems

Recommendation systems are popular in many domains. Researchers usually focus on the effectiveness of recommendation (e.g., precision) but neglect the popularity bias that may affect the fairness of the recommendation, which is also an important consideration that could influence the benefits of users and item providers. A few studies have been proposed to deal with the popularity bias, but they often face two limitations. Firstly, most studies only consider fairness for one side - either users or items, without achieving fairness jointly for both. Secondly, existing methods are not sufficiently tailored to each individual user or item to cope with …

Go to article

Future Aware Pricing And Matching For Sustainable On-Demand Ride Pooling, Xianjie Zhang, Pradeep Varakantham, Hao Jiang Feb 2023

Future Aware Pricing And Matching For Sustainable On-Demand Ride Pooling, Xianjie Zhang, Pradeep Varakantham, Hao Jiang

Research Collection School Of Computing and Information Systems

The popularity of on-demand ride pooling is owing to the benefits offered to customers (lower prices), taxi drivers (higher revenue), environment (lower carbon footprint due to fewer vehicles) and aggregation companies like Uber (higher revenue). To achieve these benefits, two key interlinked challenges have to be solved effectively: (a) pricing – setting prices to customer requests for taxis; and (b) matching – assignment of customers (that accepted the prices) to taxis/cars. Traditionally, both these challenges have been studied individually and using myopic approaches (considering only current requests), without considering the impact of current matching on addressing future requests. In this …

Go to article

Real-Time Hierarchical Map Segmentation For Coordinating Multi-Robot Exploration, Tianze Luo, Zichen Chen, Budhitama Subagdja, Ah-Hwee Tan Feb 2023

Real-Time Hierarchical Map Segmentation For Coordinating Multi-Robot Exploration, Tianze Luo, Zichen Chen, Budhitama Subagdja, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Coordinating a team of autonomous agents to explore an environment can be done by partitioning the map of the environment into segments and allocating the segments as targets for the individual agents to visit. However, given an unknown environment, map segmentation must be conducted in a continuous and incremental manner. In this paper, we propose a novel real-time hierarchical map segmentation method for supporting multi-agent exploration of indoor environments, wherein clusters of regions of segments are formed hierarchically from randomly sampled points in the environment. Each cluster is then assigned with a cost-utility value based on the minimum cost possible …

Go to article

Alignment-Enriched Tuning For Patch-Level Pre-Trained Document Image Models, Lei Wang, Jiabang He, Xing Xu, Ning Liu, Hui Liu Feb 2023

Alignment-Enriched Tuning For Patch-Level Pre-Trained Document Image Models, Lei Wang, Jiabang He, Xing Xu, Ning Liu, Hui Liu

Research Collection School Of Computing and Information Systems

Alignment between image and text has shown promising im provements on patch-level pre-trained document image mod els. However, investigating more effective or finer-grained alignment techniques during pre-training requires a large amount of computation cost and time. Thus, a question natu rally arises: Could we fine-tune the pre-trained models adap tive to downstream tasks with alignment objectives and achieve comparable or better performance? In this paper, we pro pose a new model architecture with alignment-enriched tuning (dubbed AETNet) upon pre-trained document image models, to adapt downstream tasks with the joint task-specific super vised and alignment-aware contrastive objective. Specifically, weintroduce an extra …

Go to article

T-Counter: Trustworthy And Efficient Cpu Resource Measurement Using Sgx In The Cloud, Chuntao Dong, Qingni Shen, Xuhua Ding, Daoqing Yu, Wu Luo, Pengfei Wu, Zhonghai Wu Jan 2023

T-Counter: Trustworthy And Efficient Cpu Resource Measurement Using Sgx In The Cloud, Chuntao Dong, Qingni Shen, Xuhua Ding, Daoqing Yu, Wu Luo, Pengfei Wu, Zhonghai Wu

Research Collection School Of Computing and Information Systems

As cloud services have become popular, and their adoption is growing, consumers are becoming more concerned about the cost of cloud services. Cloud Service Providers (CSPs) generally use a pay-per-use billing scheme in the cloud services model: consumers use resources as they needed and are billed for their resource usage. However, CSPs are untrusted and privileged; they have full control of the entire operating system (OS) and may tamper with bills to cheat consumers. So, how to provide a trusted solution that can keep track of and verify the consumers’ resource usage has been a challenging problem. In this paper, …

Go to article

Dashboard Design Mining And Recommendation, Yanna Lin, Haotian Li, Aoyu Wu, Yong Wang, Huamin Qu Jan 2023

Dashboard Design Mining And Recommendation, Yanna Lin, Haotian Li, Aoyu Wu, Yong Wang, Huamin Qu

Research Collection School Of Computing and Information Systems

Dashboards, which comprise multiple views on a single display, help analyze and communicate multiple perspectives of data simultaneously. However, creating effective and elegant dashboards is challenging since it requires careful and logical arrangement and coordination of multiple visualizations. To solve the problem, we propose a data-driven approach for mining design rules from dashboards and automating dashboard organization. Specifically, we focus on two prominent aspects of the organization: , which describes the position, size, and layout of each view in the display space; and, which indicates the interaction between pairwise views. We build a new dataset containing 854 dashboards crawled online, …

Go to article

Champions For Social Good: How Can We Discover Social Sentiment And Attitude-Driven Patterns In Prosocial Communication?, Raghava Rao Mukkamala, Robert J. Kauffman, Helle Zinner Henriksen Jan 2023

Champions For Social Good: How Can We Discover Social Sentiment And Attitude-Driven Patterns In Prosocial Communication?, Raghava Rao Mukkamala, Robert J. Kauffman, Helle Zinner Henriksen

Research Collection School Of Computing and Information Systems

The UN High Commissioner on Refugees (UNHCR) is pursuing a social media strategy to inform people about displaced populations and refugee emergencies. It is actively engaging public figures to increase awareness through its prosocial communications and improve social informedness and support for policy changes in its services. We studied the Twitter communications of UNHCR social media champions and investigated their role as high-profile influencers. In this study, we offer a design science research and data analytics framework and propositions based on the social informedness theory we propose in this paper to assess communication about UNHCR’s mission. Two variables—refugee-emergency and champion …

Go to article

Causal Interventional Training For Image Recognition, Wei Qin, Hanwang Zhang, Richang Hong, Ee-Peng Lim, Qianru Sun Jan 2023

Causal Interventional Training For Image Recognition, Wei Qin, Hanwang Zhang, Richang Hong, Ee-Peng Lim, Qianru Sun

Research Collection School Of Computing and Information Systems

Deep learning models often fit undesired dataset bias in training. In this paper, we formulate the bias using causal inference, which helps us uncover the ever-elusive causalities among the key factors in training, and thus pursue the desired causal effect without the bias. We start from revisiting the process of building a visual recognition system, and then propose a structural causal model (SCM) for the key variables involved in dataset collection and recognition model: object, common sense, bias, context, and label prediction. Based on the SCM, one can observe that there are “good” and “bad” biases. Intuitively, in the image …

Go to article

El-Vit: Probing Vision Transformer With Interactive Visualization, Hong Zhou, Rui Zhang, Peifeng Lai, Chaoran Guo, Yong Wang, Zhida Sun, Junjie Li Jan 2023

El-Vit: Probing Vision Transformer With Interactive Visualization, Hong Zhou, Rui Zhang, Peifeng Lai, Chaoran Guo, Yong Wang, Zhida Sun, Junjie Li

Research Collection School Of Computing and Information Systems

Nowadays, Vision Transformer (ViT) is widely utilized in various computer vision tasks, owing to its unique self-attention mechanism. However, the model architecture of ViT is complex and often challenging to comprehend, leading to a steep learning curve. ViT developers and users frequently encounter difficulties in interpreting its inner workings. Therefore, a visualization system is needed to assist ViT users in understanding its functionality. This paper introduces EL-VIT, an interactive visual analytics system designed to probe the Vision Transformer and facilitate a better understanding of its operations. The system consists of four layers of visualization views. The first three layers include …

Go to article

Dual-View Preference Learning For Adaptive Recommendation, Zhongzhou Liu, Yuan Fang, Min Wu Jan 2023

Dual-View Preference Learning For Adaptive Recommendation, Zhongzhou Liu, Yuan Fang, Min Wu

Research Collection School Of Computing and Information Systems

While recommendation systems have been widely deployed, most existing approaches only capture user preferences in the , i.e., the user's general interest across all kinds of items. However, in real-world scenarios, user preferences could vary with items of different natures, which we call the . Both views are crucial for fully personalized recommendation, where an underpinning macro-view governs a multitude of finer-grained preferences in the micro-view. To model the dual views, in this paper, we propose a novel model called Dual-View Adaptive Recommendation (DVAR). In DVAR, we formulate the micro-view based on item categories, and further integrate it with the …

Go to article

Contextual Path Retrieval: A Contextual Entity Relation Embedding-Based Approach, Pei-Chi Lo, Ee-Peng Lim Jan 2023

Contextual Path Retrieval: A Contextual Entity Relation Embedding-Based Approach, Pei-Chi Lo, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

Contextual path retrieval (CPR) refers to the task of finding contextual path(s) between a pair of entities in a knowledge graph that explains the connection between them in a given context. For this novel retrieval task, we propose the Embedding-based Contextual Path Retrieval (ECPR) framework. ECPR is based on a three-component structure that includes a context encoder and path encoder that encode query context and path, respectively, and a path ranker that assigns a ranking score to each candidate path to determine the one that should be the contextual path. For context encoding, we propose two novel context encoding methods, …

Go to article

Learning Large Neighborhood Search For Vehicle Routing In Airport Ground Handling, Jianan Zhou, Yaoxin Wu, Zhiguang Cao, Wen Song, Jie Zhang, Zhenghua Chen Jan 2023

Learning Large Neighborhood Search For Vehicle Routing In Airport Ground Handling, Jianan Zhou, Yaoxin Wu, Zhiguang Cao, Wen Song, Jie Zhang, Zhenghua Chen

Research Collection School Of Computing and Information Systems

Dispatching vehicle fleets to serve flights is a key task in airport ground handling (AGH). Due to the notable growth of flights, it is challenging to simultaneously schedule multiple types of operations (services) for a large number of flights, where each type of operation is performed by one specific vehicle fleet. To tackle this issue, we first represent the operation scheduling as a complex vehicle routing problem and formulate it as a mixed integer linear programming (MILP) model. Then given the graph representation of the MILP model, we propose a learning assisted large neighborhood search (LNS) method using data generated …

Go to article

Efficient Approximate Range Aggregation Over Large-Scale Spatial Data Federation, Yexuan Shi, Yongxin Tong, Yuxiang Zeng, Zimu Zhou, Bolin Ding, Lei Chen Jan 2023

Efficient Approximate Range Aggregation Over Large-Scale Spatial Data Federation, Yexuan Shi, Yongxin Tong, Yuxiang Zeng, Zimu Zhou, Bolin Ding, Lei Chen

Research Collection School Of Computing and Information Systems

Range aggregation is a primitive operation in spatial data applications and there is a growing demand to support such operations over a data federation, where the entire spatial data are separately held by multiple data providers (a.k.a., data silos). Data federations notably increase the amount of data available for data-intensive applications such as smart mobility planning and public health emergency responses. Yet they also challenge the conventional implementation of range aggregation queries because the raw data cannot be shared within the federation and the data partition at each data silo is fixed during query processing. These constraints limit the design …

Go to article

Neighbor-Anchoring Adversarial Graph Neural Networks, Zemin Liu, Yuan Fang, Yong Liu, Vincent W. Zheng Jan 2023

Neighbor-Anchoring Adversarial Graph Neural Networks, Zemin Liu, Yuan Fang, Yong Liu, Vincent W. Zheng

Research Collection School Of Computing and Information Systems

Graph neural networks (GNNs) have witnessed widespread adoption due to their ability to learn superior representations for graph data. While 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 …

Go to article

Reks: Role-Based Encrypted Keyword Search With Enhanced Access Control For Outsourced Cloud Data, Yibin Miao, Feng Li, Xiaohua Jia, Huaxiong Wang, Ximeng Liu, Kim-Kwang Raymond Choo, Robert H. Deng Jan 2023

Reks: Role-Based Encrypted Keyword Search With Enhanced Access Control For Outsourced Cloud Data, Yibin Miao, Feng Li, Xiaohua Jia, Huaxiong Wang, Ximeng Liu, Kim-Kwang Raymond Choo, Robert H. Deng

Research Collection School Of Computing and Information Systems

Keyword-based search over encrypted data is an important technique to achieve both data confidentiality and utilization in cloud outsourcing services. While commonly used access control mechanisms, such as identity-based encryption and attribute-based encryption, do not generally scale well for hierarchical access permissions. To solve this problem, we propose a Role-based Encrypted Keyword Search (REKS) scheme by using the role-based access control and broadcast encryption. Specifically, REKS allows owners to deploy hierarchical access control by allowing users with parent roles to have access permissions from child roles. Using REKS, we further facilitate token generation preprocessing and efficient user management, thereby significantly …

Go to article

Is A Pretrained Model The Answer To Situational Awareness Detection On Social Media?, Siaw Ling Lo, Kahhe Lee, Yuhao Zhang Jan 2023

Is A Pretrained Model The Answer To Situational Awareness Detection On Social Media?, Siaw Ling Lo, Kahhe Lee, Yuhao Zhang

Research Collection School Of Computing and Information Systems

Social media can be valuable for extracting information about an event or incident on the ground. However, the vast amount of content shared, and the linguistic variants of languages used on social media make it challenging to identify important situational awareness content to aid in decision-making for first responders. In this study, we assess whether pretrained models can be used to address the aforementioned challenges on social media. Various pretrained models, including static word embedding (such as Word2Vec and GloVe) and contextualized word embedding (such as DistilBERT) are studied in detail. According to our findings, a vanilla DistilBERT pretrained language …

Go to article

Taurus: Towards A Unified Force Representation And Universal Solver For Graph Layout, Mingliang Xue, Zhi Wang, Fahai Zhong, Yong Wang, Mingliang Xu, Oliver Deussen, Yunhai Wang Jan 2023

Taurus: Towards A Unified Force Representation And Universal Solver For Graph Layout, Mingliang Xue, Zhi Wang, Fahai Zhong, Yong Wang, Mingliang Xu, Oliver Deussen, Yunhai Wang

Research Collection School Of Computing and Information Systems

Over the past few decades, a large number of graph layout techniques have been proposed for visualizing graphs from various domains. In this paper, we present a general framework, Taurus, for unifying popular techniques such as the spring-electrical model, stress model, and maxent-stress model. It is based on a unified force representation, which formulates most existing techniques as a combination of quotient-based forces that combine power functions of graph-theoretical and Euclidean distances. This representation enables us to compare the strengths and weaknesses of existing techniques, while facilitating the development of new methods. Based on this, we propose a new balanced …

Go to article

Vacsen: A Visualization Approach For Noise Awareness In Quantum Computing, Shaolun Ruan, Yong Wang, Weiwen Jiang, Ying Mao, Qiang Guan Jan 2023

Vacsen: A Visualization Approach For Noise Awareness In Quantum Computing, Shaolun Ruan, Yong Wang, Weiwen Jiang, Ying Mao, Qiang Guan

Research Collection School Of Computing and Information Systems

Quantum computing has attracted considerable public attention due to its exponential speedup over classical computing. Despite its advantages, today's quantum computers intrinsically suffer from noise and are error-prone. To guarantee the high fidelity of the execution result of a quantum algorithm, it is crucial to inform users of the noises of the used quantum computer and the compiled physical circuits. However, an intuitive and systematic way to make users aware of the quantum computing noise is still missing. In this paper, we fill the gap by proposing a novel visualization approach to achieve noise-aware quantum computing. It provides a holistic …

Go to article

Relation Preserving Triplet Mining For Stabilising The Triplet Loss In Re-Identification Systems, Adhiraj Ghosh, Kuruparan Shanmugalingam, Wen-Yan Lin Jan 2023

Relation Preserving Triplet Mining For Stabilising The Triplet Loss In Re-Identification Systems, Adhiraj Ghosh, Kuruparan Shanmugalingam, Wen-Yan Lin

Research Collection School Of Computing and Information Systems

Object appearances change dramatically with pose variations. This creates a challenge for embedding schemes that seek to map instances with the same object ID to locations that are as close as possible. This issue becomes significantly heightened in complex computer vision tasks such as re-identification(reID). In this paper, we suggest that these dramatic appearance changes are indications that an object ID is composed of multiple natural groups, and it is counterproductive to forcefully map instances from different groups to a common location. This leads us to introduce Relation Preserving Triplet Mining (RPTM), a feature matching guided triplet mining scheme, that …

Go to article

S-Prompts Learning With Pre-Trained Transformers: An Occam's Razor For Domain Incremental Learning, Yabin Wang, Zhiwu Huang, Xiaopeng. Hong Dec 2022

S-Prompts Learning With Pre-Trained Transformers: An Occam's Razor For Domain Incremental Learning, Yabin Wang, Zhiwu Huang, Xiaopeng. Hong

Research Collection School Of Computing and Information Systems

State-of-the-art deep neural networks are still struggling to address the catastrophic forgetting problem in continual learning. In this paper, we propose one simple paradigm (named as S-Prompting) and two concrete approaches to highly reduce the forgetting degree in one of the most typical continual learning scenarios, i.e., domain increment learning (DIL). The key idea of the paradigm is to learn prompts independently across domains with pre-trained transformers, avoiding the use of exemplars that commonly appear in conventional methods. This results in a win-win game where the prompting can achieve the best for each domain. The independent prompting across domains only …

Go to article

Deep Just-In-Time Defect Localization, Fangcheng Qiu, Zhipeng Gao, Xin Xia, David Lo, John Grundy, Xinyu Wang Dec 2022

Deep Just-In-Time Defect Localization, Fangcheng Qiu, Zhipeng Gao, Xin Xia, David Lo, John Grundy, Xinyu Wang

Research Collection School Of Computing and Information Systems

During software development and maintenance, defect localization is an essential part of software quality assurance. Even though different techniques have been proposed for defect localization, i.e., information retrieval (IR)-based techniques and spectrum-based techniques, they can only work after the defect has been exposed, which can be too late and costly to adapt to the newly introduced bugs in the daily development. There are also many JIT defect prediction tools that have been proposed to predict the buggy commit. But these tools do not locate the suspicious buggy positions in the buggy commit. To assist developers to detect bugs in time …

Go to article

Supply Regulation Under The Exclusion Policy In A Ride-Sourcing Market, Xiaonan Li, Xiangyong Li, Hai Wang, Junxin Shi, Yash P. Aneja Dec 2022

Supply Regulation Under The Exclusion Policy In A Ride-Sourcing Market, Xiaonan Li, Xiangyong Li, Hai Wang, Junxin Shi, Yash P. Aneja

Research Collection School Of Computing and Information Systems

On-demand ride-sourcing platforms have quickly emerged and become ubiquitous in our daily lives. Motivated by the rising public concern about service quality in the ride-sourcing market, this paper aims to examine the impact of exclusion policy that can serve as both quality management and supply regulation strategy. With an exclusion policy, the platform excludes low-quality service providers/drivers from the ride-sourcing market by setting a quality threshold of admission (QTA). We propose a model to describe and analyze the market equilibrium under the exclusion policy and present our analytical and numerical results – some of which are non-intuitive and intriguing. Considering …

Go to article

Question-Attentive Review-Level Recommendation Explanation, Trung Hoang Le, Hady Wirawan Lauw Dec 2022

Question-Attentive Review-Level Recommendation Explanation, Trung Hoang Le, Hady Wirawan Lauw

Research Collection School Of Computing and Information Systems

Recommendation explanations help to improve their acceptance by end users. The form of explanation of interest here is presenting an existing review of the recommended item. The challenge is in selecting a suitable review, which is customarily addressed by assessing the relative importance of each review to the recommendation objective. Our focus is on improving review-level explanation by leveraging additional information in the form of questions and answers (QA). The proposed framework employs QA in an attention mechanism that aligns reviews to various QAs of an item and assesses their contribution jointly to the recommendation objective. The benefits are two-fold. …

Go to article

First Prev Next Last