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

Databases and Information Systems Commons™

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

Research Collection School Of Computing and Information Systems

Discipline
Keyword
Publication Year

Articles 991 - 1020 of 3441

Full-Text Articles in Databases and Information Systems

Guest Editorial: Non-Iid Outlier Detection In Complex Contexts, Guansong Pang, Fabrizio Angiulli, Mihai Cucuringu, Huan Liu May 2021

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, …

Go to article

How Do Software Developers Use Github Actions To Automate Their Workflows?, Timothy Kinsman, Mairieli Wessel, Marco Gerosa, Christoph Treude May 2021

How Do Software Developers Use Github Actions To Automate Their Workflows?, Timothy Kinsman, Mairieli Wessel, Marco Gerosa, Christoph Treude

Research Collection School Of Computing and Information Systems

Automated tools are frequently used in social coding repositories to perform repetitive activities that are part of the distributed software development process. Recently, GitHub introduced GitHub Actions, a feature providing automated work-flows for repository maintainers. Although several Actions have been built and used by practitioners, relatively little has been done to evaluate them. Understanding and anticipating the effects of adopting such kind of technology is important for planning and management. Our research is the first to investigate how developers use Actions and how several activity indicators change after their adoption. Our results indicate that, although only a small subset of …

Go to article

Learning Index Policies For Restless Bandits With Application To Maternal Healthcare, Arpita Biswas, Gaurav Aggarwal, Pradeep Varakantham, Milind Tambe May 2021

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 …

Go to article

Action Selection For Composable Modular Deep Reinforcement Learning, Vaibhav Gupta, Daksh Anand, Praveen Paruchuri, Akshat Kumar May 2021

Action Selection For Composable Modular Deep Reinforcement Learning, Vaibhav Gupta, Daksh Anand, Praveen Paruchuri, Akshat Kumar

Research Collection School Of Computing and Information Systems

In modular reinforcement learning (MRL), a complex decision making problem is decomposed into multiple simpler subproblems each solved by a separate module. Often, these subproblems have conflicting goals, and incomparable reward scales. A composable decision making architecture requires that even the modules authored separately with possibly misaligned reward scales can be combined coherently. An arbitrator should consider different module's action preferences to learn effective global action selection. We present a novel framework called GRACIAS that assigns fine-grained importance to the different modules based on their relevance in a given state, and enables composable decision making based on modern deep RL …

Go to article

Tripdecoder: Study Travel Time Attributes And Route Preferences Of Metro Systems From Smart Card Data, Xiancai Tian, Baihua Zheng, Yazhe Wang, Hsao-Ting Huang, Chih-Cheng Hung May 2021

Tripdecoder: Study Travel Time Attributes And Route Preferences Of Metro Systems From Smart Card Data, Xiancai Tian, Baihua Zheng, Yazhe Wang, Hsao-Ting Huang, Chih-Cheng Hung

Research Collection School Of Computing and Information Systems

In this paper, we target at recovering the exact routes taken by commuters inside a metro system that are not captured by an Automated Fare Collection (AFC) system and hence remain unknown. We strategically propose two inference tasks to handle the recovering, one to infer the travel time of each travel link that contributes to the total duration of any trip inside a metro network and the other to infer the route preferences based on historical trip records and the travel time of each travel link inferred in the previous inference task. As these two inference tasks have interrelationship, most …

Go to article

Efficient Retrieval Of Matrix Factorization-Based Top-K Recommendations: A Survey Of Recent Approaches, Dung D. Le, Hady W. Lauw Apr 2021

Efficient Retrieval Of Matrix Factorization-Based Top-K Recommendations: A Survey Of Recent Approaches, Dung D. Le, Hady W. Lauw

Research Collection School Of Computing and Information Systems

Top-k recommendation seeks to deliver a personalized list of k items to each individual user. An established methodology in the literature based on matrix factorization (MF), which usually represents users and items as vectors in low-dimensional space, is an effective approach to recommender systems, thanks to its superior performance in terms of recommendation quality and scalability. A typical matrix factorization recommender system has two main phases: preference elicitation and recommendation retrieval. The former analyzes user-generated data to learn user preferences and item characteristics in the form of latent feature vectors, whereas the latter ranks the candidate items based on the …

Go to article

Research Commentary On Is/It Role In Emergency And Pandemic Management: Current And Future Research, W. L. Shiau, Keng Siau, Y. Yu, J. Guo Apr 2021

Research Commentary On Is/It Role In Emergency And Pandemic Management: Current And Future Research, W. L. Shiau, Keng Siau, Y. Yu, J. Guo

Research Collection School Of Computing and Information Systems

IS/IT plays an important role in our everyday life, especially in today's Internet era. This article discusses the roles of IS/IT in providing services and support on information gathering, analysis, and management during major public emergencies and pandemic crises such as the battle against the new coronavirus. The five selected papers in this special issue introduce advanced methods on data collection and social media user analysis to deal with the challenges brought by the COVID-19 pandemic. This paper also presents future research directions on the use of IS/IT in emergency and pandemic management such as IS control and governance, intelligent …

Go to article

Dismastd: An Efficient Distributed Multi-Aspect Streaming Tensor Decomposition, Keyu Yang, Yunjun Gao, Yifeng Shen, Baihua Zheng, Lu Chen Apr 2021

Dismastd: An Efficient Distributed Multi-Aspect Streaming Tensor Decomposition, Keyu Yang, Yunjun Gao, Yifeng Shen, Baihua Zheng, Lu Chen

Research Collection School Of Computing and Information Systems

Tensor decomposition is a fundamental multidimensional data analysis tool for many data-driven applications, such as social computing, computer vision, and bioinformatics, to name but a few. However, the rapidly increasing streaming data nowadays introduces new challenges to traditional static tensor decomposition. It requires an efficient distributed dynamic tensor decomposition without re-computing the whole tensor from scratch. In this paper, we propose DisMASTD, an efficient distributed multi-aspect streaming tensor decomposition. First, we prove the optimal tensor partitioning problem is NP-hard. Second, we present two heuristic tensor partitioning approaches to ensure the load balancing. Third, we develop a distributed multi-aspect streaming tensor …

Go to article

Towards Efficient Motif-Based Graph Partitioning: An Adaptive Sampling Approach, Shixun Huang, Yuchen Li, Zhifeng Bao, Zhao Li Apr 2021

Towards Efficient Motif-Based Graph Partitioning: An Adaptive Sampling Approach, Shixun Huang, Yuchen Li, Zhifeng Bao, Zhao Li

Research Collection School Of Computing and Information Systems

In this paper, we study the problem of efficient motif-based graph partitioning (MGP). We observe that existing methods require to enumerate all motif instances to compute the exact edge weights for partitioning. However, the enumeration is prohibitively expensive against large graphs. We thus propose a sampling-based MGP (SMGP) framework that employs an unbiased sampling mechanism to efficiently estimate the edge weights while trying to preserve the partitioning quality. To further improve the effectiveness, we propose a novel adaptive sampling framework called SMGP+. SMGP+ iteratively partitions the input graph based on up-to-date estimated edge weights, and adaptively adjusts the sampling distribution …

Go to article

Newslink: Empowering Intuitive News Search With Knowledge Graphs, Yueji Yang, Yuchen Li, Anthony Tung Apr 2021

Newslink: Empowering Intuitive News Search With Knowledge Graphs, Yueji Yang, Yuchen Li, Anthony Tung

Research Collection School Of Computing and Information Systems

News search tools help end users to identify relevant news stories. However, existing search approaches often carry out in a "black-box" process. There is little intuition that helps users understand how the results are related to the query. In this paper, we propose a novel news search framework, called NEWSLINK, to empower intuitive news search by using relationship paths discovered from open Knowledge Graphs (KGs). Specifically, NEWSLINK embeds both a query and news documents to subgraphs, called subgraph embeddings, in the KG. Their embeddings' overlap induces relationship paths between the involving entities. Two major advantages are obtained by incorporating subgraph …

Go to article

Boundary Precedence Image Inpainting Method Based On Self-Organizing Maps, Haibo Pen, Quan Wang, Zhaoxia Wang Apr 2021

Boundary Precedence Image Inpainting Method Based On Self-Organizing Maps, Haibo Pen, Quan Wang, Zhaoxia Wang

Research Collection School Of Computing and Information Systems

In addition to text data analysis, image analysis is an area that has increasingly gained importance in recent years because more and more image data have spread throughout the internet and real life. As an important segment of image analysis techniques, image restoration has been attracting a lot of researchers’ attention. As one of AI methodologies, Self-organizing Maps (SOMs) have been applied to a great number of useful applications. However, it has rarely been applied to the domain of image restoration. In this paper, we propose a novel image restoration method by leveraging the capability of SOMs, and we name …

Go to article

A Fully Dynamic Algorithm For K-Regret Minimizing Sets, Yanhao Wang, Yuchen Li, Raymond Chi-Wing Wong, Kian-Lee Tan Apr 2021

A Fully Dynamic Algorithm For K-Regret Minimizing Sets, Yanhao Wang, Yuchen Li, Raymond Chi-Wing Wong, Kian-Lee Tan

Research Collection School Of Computing and Information Systems

Selecting a small set of representatives from a large database is important in many applications such as multi-criteria decision making, web search, and recommendation. The k-regret minimizing set (k-RMS) problem was recently proposed for representative tuple discovery. Specifically, for a large database P of tuples with multiple numerical attributes, the k-RMS problem returns a size-r subset Q of P such that, for any possible ranking function, the score of the top-ranked tuple in Q is not much worse than the score of the kth-ranked tuple in P. Although the k-RMS problem has been extensively studied in the literature, existing methods …

Go to article

Dbl: Efficient Reachability Queries On Dynamic Graphs, Qiuyi Lyu, Yuchen Li, Bingsheng He, Bin Gong Apr 2021

Dbl: Efficient Reachability Queries On Dynamic Graphs, Qiuyi Lyu, Yuchen Li, Bingsheng He, Bin Gong

Research Collection School Of Computing and Information Systems

Reachability query is a fundamental problem on graphs, which has been extensively studied in academia and industry. Since graphs are subject to frequent updates in many applications, it is essential to support efficient graph updates while offering good performance in reachability queries. Existing solutions compress the original graph with the Directed Acyclic Graph (DAG) and propose efficient query processing and index update techniques. However, they focus on optimizing the scenarios where the Strong Connected Components (SCCs) remain unchanged and have overlooked the prohibitively high cost of the DAG maintenance when SCCs are updated. In this paper, we propose DBL, an …

Go to article

Spectral Tensor Train Parameterization Of Deep Learning Layers, A. Obukhov, M. Rakhuba, A. Liniger, Zhiwu Huang, S. Georgoulis, D. Dai, Van Gool L. Apr 2021

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 …

Go to article

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 Apr 2021

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 …

Go to article

Tour: Dynamic Topic And Sentiment Analysis Of User Reviews For Assisting App Release, Tianyi Yang, Cuiyun Gao, Jingya Zang, David Lo, Michael R. Lyu Apr 2021

Tour: Dynamic Topic And Sentiment Analysis Of User Reviews For Assisting App Release, Tianyi Yang, Cuiyun Gao, Jingya Zang, David Lo, Michael R. Lyu

Research Collection School Of Computing and Information Systems

App reviews deliver user opinions and emerging issues (e.g., new bugs) about the app releases. Due to the dynamic nature of app reviews, topics and sentiment of the reviews would change along with app release versions. Although several studies have focused on summarizing user opinions by analyzing user sentiment towards app features, no practical tool is released. The large quantity of reviews and noise words also necessitates an automated tool for monitoring user reviews. In this paper, we introduce TOUR for dynamic TOpic and sentiment analysis of User Reviews. TOUR is able to (i) detect and summarize emerging app issues …

Go to article

Sentiment-Oriented Metric Learning For Text-To-Image Retrieval, Quoc Tuan Truong, Hady W. Lauw Apr 2021

Sentiment-Oriented Metric Learning For Text-To-Image Retrieval, Quoc Tuan Truong, Hady W. Lauw

Research Collection School Of Computing and Information Systems

In this era of multimedia Web, text-to-image retrieval is a critical function of search engines and visually-oriented online platforms. Traditionally, the task primarily deals with matching a text query with the most relevant images available in the corpus. To an increasing extent, the Web also features visual expressions of preferences, imbuing images with sentiments that express those preferences. Cases in point include photos in online reviews as well as social media. In this work, we study the effects of sentiment information on text-to-image retrieval. Particularly, we present two approaches for incorporating sentiment orientation into metric learning for cross-modal retrieval. Each …

Go to article

Time Period-Based Top-K Semantic Trajectory Pattern Query, Munkh-Erdene Yadamjav, Farhana Murtaza Choudhury, Zhifeng Bao, Baihua Zheng Apr 2021

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. …

Go to article

Dycuckoo: Dynamic Hash Tables On Gpus, Yuchen Li, Qiwei Zhu, Zheng Lyu, Zhongdong Huang, Jianling Sun Apr 2021

Dycuckoo: Dynamic Hash Tables On Gpus, Yuchen Li, Qiwei Zhu, Zheng Lyu, Zhongdong Huang, Jianling Sun

Research Collection School Of Computing and Information Systems

The hash table is a fundamental structure that has been implemented on graphics processing units (GPUs) to accelerate a wide range of analytics workloads. Most existing works have focused on static scenarios and occupy large GPU memory to maximize the insertion efficiency. In many cases, data stored in hash tables get updated dynamically, and existing approaches use unnecessarily large memory resources. One naïve solution is to rebuild a hash table (known as rehashing) whenever it is either filled or mostly empty. However, this approach renders significant overheads for rehashing. In this paper, we propose a novel dynamic cuckoo hash table …

Go to article

Dram Failure Prediction In Aiops: Empirical Evaluation, Challenges And Opportunities, Zhiyue Wu, Hongzuo Xu, Guansong Pang, Fengyuan Yu, Yijie Wang, Songlei Jian, Yongjun Wang Apr 2021

Dram Failure Prediction In Aiops: Empirical Evaluation, Challenges And Opportunities, Zhiyue Wu, Hongzuo Xu, Guansong Pang, Fengyuan Yu, Yijie Wang, Songlei Jian, Yongjun Wang

Research Collection School Of Computing and Information Systems

DRAM failure prediction is a vital task in AIOps, which is crucial to maintain the reliability and sustainable service of large-scale data centers. However, limited work has been done on DRAM failure prediction mainly due to the lack of public available datasets. This paper presents a comprehensive empirical evaluation of diverse machine learning techniques for DRAM failure prediction using a large-scale multisource dataset, including more than three millions of records of kernel, address, and mcelog data, provided by Alibaba Cloud through PAKDD 2021 competition. Particularly, we first formulate the problem as a multiclass classification task and exhaustively evaluate seven popular/stateof-the-art …

Go to article

Cross-Topic Rumor Detection Using Topic-Mixtures, Weijieying Ren, Jing Jiang, Ling Min Serena Khoo, Hai Leong Chieu Apr 2021

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 …

Go to article

Iotbox: Sandbox Mining To Prevent Interaction Threats In Iot Systems, Hong Jin Kang, Sheng Qin Sim, David Lo Apr 2021

Iotbox: Sandbox Mining To Prevent Interaction Threats In Iot Systems, Hong Jin Kang, Sheng Qin Sim, David Lo

Research Collection School Of Computing and Information Systems

Internet of Things (IoT) apps provide great convenience but exposes us to new safety threats. Unlike traditional software systems, threats may emerge from the joint behavior of multiple apps. While prior studies use handcrafted safety and security policies to detect these threats, these policies may not anticipate all usages of the devices and apps in a smart home, causing false alarms. In this study, we propose to use the technique of mining sandboxes for securing an IoT environment. After a set of behaviors are analyzed from a bundle of apps and devices, a sandbox is deployed, which enforces that previously …

Go to article

Learning Network-Based Multi-Modal Mobile User Interface Embeddings, Gary Ang, Ee-Peng Lim Apr 2021

Learning Network-Based Multi-Modal Mobile User Interface Embeddings, Gary Ang, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

Rich multi-modal information - text, code, images, categorical and numerical data - co-exist in the user interface (UI) design of mobile applications. UI designs are composed of UI entities supporting different functions which together enable the application. To support effective search and recommendation applications over mobile UIs, we need to be able to learn UI representations that integrate latent semantics. In this paper, we propose a novel unsupervised model - Multi-modal Attention-based Attributed Network Embedding (MAAN) model. MAAN is designed to capture both multi-modal and structural network information. Based on the encoder-decoder framework, MAAN aims to learn UI representations that …

Go to article

Do Users Care About Ad's Performance Costs? Exploring The Effects Of The Performance Costs Of In-App Ads On User Experience, Cuiyun Gao, Jichuan Zeng, Federica Sarro, David Lo, Irwin King, Michael R. Lyu Apr 2021

Do Users Care About Ad's Performance Costs? Exploring The Effects Of The Performance Costs Of In-App Ads On User Experience, Cuiyun Gao, Jichuan Zeng, Federica Sarro, David Lo, Irwin King, Michael R. Lyu

Research Collection School Of Computing and Information Systems

Context: In-app advertising is the primary source of revenue for many mobile apps. The cost of advertising (ad cost) is non-negligible for app developers to ensure a good user experience and continuous profits. Previous studies mainly focus on addressing the hidden performance costs generated by ads, including consumption of memory, CPU, data traffic, and battery. However, there is no research on analyzing users’ perceptions of ads’ performance costs to our knowledge.Objective: To fill this gap and better understand the effects of performance costs of in-app ads on user experience, we conduct a study on analyzing user concerns about ads’ performance …

Go to article

Integration Of Professional Certifications With Information Systems Business Analytics Track Curriculum, Kyong Jin Shim, Gottipati Swapna, Yi Meng Lau Apr 2021

Integration Of Professional Certifications With Information Systems Business Analytics Track Curriculum, Kyong Jin Shim, Gottipati Swapna, Yi Meng Lau

Research Collection School Of Computing and Information Systems

In this study, we showcase a design of an undergraduate Business Analytics track that integrates professional certifications from Amazon Web Services, Google, SAS, and Salesforce with core Business Analytics courses in an Information Systems undergraduate degree program. Certifications provide an excellent way for students to attain practical, experiential, and demonstrable skills which increasingly more employers look for in job candidates' portfolios. In close collaboration with industry partners, curriculum designers and faculty in institutions of higher learning can leverage high quality hands-on training materials provided by the certification vendors and align it with the core academic course content. Excellent teaching by …

Go to article

Escape From An Echo Chamber, Kuan-Chieh Lo, Shih-Chieh Dai, Aiping Xiong, Jing Jiang, Lun-Wei Ku Apr 2021

Escape From An Echo Chamber, Kuan-Chieh Lo, Shih-Chieh Dai, Aiping Xiong, Jing Jiang, Lun-Wei Ku

Research Collection School Of Computing and Information Systems

An echo chamber effect refers to the phenomena that online users revealed selective exposure and ideological segregation on political issues. Prior studies indicate the connection between the spread of misinformation and online echo chambers. In this paper, to help users escape from an echo chamber, we propose a novel news-analysis platform that provides a panoramic view of stances towards a particular event from different news media sources. Moreover, to help users better recognize the stances of news sources which published these news articles, we adopt a news stance classification model to categorize their stances into “agree”, “disagree”, “discuss”, or “unrelated” …

Go to article

Homophily Outlier Detection In Non-Iid Categorical Data, Guansong Pang, Longbing Cao, Ling Chen Apr 2021

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 …

Go to article

Enconter: Entity Constrained Progressive Sequence Generation Via Insertion-Based Transformer, Lee Hsun Hsieh, Yang Yin Lee, Ee-Peng Lim Apr 2021

Enconter: Entity Constrained Progressive Sequence Generation Via Insertion-Based Transformer, Lee Hsun Hsieh, Yang Yin Lee, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

Pretrained using large amount of data, autoregressive language models are able to generate high quality sequences. However, these models do not perform well under hard lexical constraints as they lack fine control of content generation process. Progressive insertion-based transformers can overcome the above limitation and efficiently generate a sequence in parallel given some input tokens as constraint. These transformers however may fail to support hard lexical constraints as their generation process is more likely to terminate prematurely. The paper analyses such early termination problems and proposes the ENtity-CONstrained insertion TransformER (ENCONTER), a new insertion transformer that addresses the above pitfall …

Go to article

Can We Classify Cashless Payment Solution Implementations At The Country Level?, Dennis Ng, Robert J. Kauffman, Paul Robert Griffin Mar 2021

Can We Classify Cashless Payment Solution Implementations At The Country Level?, Dennis Ng, Robert J. Kauffman, Paul Robert Griffin

Research Collection School Of Computing and Information Systems

This research commentary proposes a 3-D implementation classification framework to assist service providers and business leaders in understanding the kinds of contexts in which more or less successful cashless payment solutions are observed at point-of-sale (PoS) settings. Three constructs characterize the framework: the digitalization of the local implementation environment; the relative novelty of a given payment technology solution in a country at a specific point in time; and the development status of the country’s national infrastructure. The framework is motivated by a need to support cross-country research in this domain. We analyze eight country mini-cases based on an eight-facet (2 …

Go to article

Deepis: Susceptibility Estimation On Social Networks, Wenwen Xia, Yuchen Li, Jun Wu, Shenghong Li Mar 2021

Deepis: Susceptibility Estimation On Social Networks, Wenwen Xia, Yuchen Li, Jun Wu, Shenghong Li

Research Collection School Of Computing and Information Systems

Influence diffusion estimation is a crucial problem in social network analysis. Most prior works mainly focus on predicting the total influence spread, i.e., the expected number of influenced nodes given an initial set of active nodes (aka. seeds). However, accurate estimation of susceptibility, i.e., the probability of being influenced for each individual, is more appealing and valuable in real-world applications. Previous methods generally adopt Monte Carlo simulation or heuristic rules to estimate the influence, resulting in high computational cost or unsatisfactory estimation error when these methods are used to estimate susceptibility. In this work, we propose to leverage graph neural …

Go to article

First Prev Next Last