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 421 - 450 of 3436

Full-Text Articles in Databases and Information Systems

Generative Model-Based Testing On Decision-Making Policies, Zhuo Li, Xiongfei Wu, Derui Zhu, Mingfei Cheng, Siyuan Chen, Fuyuan Zhang, Xiaofei Xie, Lei Ma, Jianjun Zhao Sep 2023

Generative Model-Based Testing On Decision-Making Policies, Zhuo Li, Xiongfei Wu, Derui Zhu, Mingfei Cheng, Siyuan Chen, Fuyuan Zhang, Xiaofei Xie, Lei Ma, Jianjun Zhao

Research Collection School Of Computing and Information Systems

The reliability of decision-making policies is urgently important today as they have established the fundamentals of many critical applications, such as autonomous driving and robotics. To ensure reliability, there have been a number of research efforts on testing decision-making policies that solve Markov decision processes (MDPs). However, due to the deep neural network (DNN)-based inherit and infinite state space, developing scalable and effective testing frameworks for decision-making policies still remains open and challenging.In this paper, we present an effective testing framework for decision-making policies. The framework adopts a generative diffusion model-based test case generator that can easily adapt to different …

Go to article

Personalized Fashion Outfit Generation With User Coordination Preference Learning, Yujuan Ding, P.Y. Mok, Yunshan Ma, Yi Bin Sep 2023

Personalized Fashion Outfit Generation With User Coordination Preference Learning, Yujuan Ding, P.Y. Mok, Yunshan Ma, Yi Bin

Research Collection School Of Computing and Information Systems

This paper focuses on personalized outfit generation, aiming to generate compatible fashion outfits catering to given users. Personalized recommendation by generating outfits of compatible items is an emerging task in the recommendation community with great commercial value but less explored. The task requires to explore both user-outfit personalization and outfit compatibility, any of which is challenging due to the huge learning space resulted from large number of items, users, and possible outfit options. To specify the user preference on outfits and regulate the outfit compatibility modeling, we propose to incorporate coordination knowledge in fashion. Inspired by the fact that users …

Go to article

Rosas: Deep Semi-Supervised Anomaly Detection With Contamination-Resilient Continuous Supervision, Hongzuo Xu, Yijie Wang, Guansong Pang, Songlei Jian, Ning Liu, Yongjun Wang Sep 2023

Rosas: Deep Semi-Supervised Anomaly Detection With Contamination-Resilient Continuous Supervision, Hongzuo Xu, Yijie Wang, Guansong Pang, Songlei Jian, Ning Liu, Yongjun Wang

Research Collection School Of Computing and Information Systems

Semi-supervised anomaly detection methods leverage a few anomaly examples to yield drastically improved performance compared to unsupervised models. However, they still suffer from two limitations: 1) unlabeled anomalies (i.e., anomaly contamination) may mislead the learning process when all the unlabeled data are employed as inliers for model training; 2) only discrete supervision information (such as binary or ordinal data labels) is exploited, which leads to suboptimal learning of anomaly scores that essentially take on a continuous distribution. Therefore, this paper proposes a novel semi-supervised anomaly detection method, which devises contamination-resilient continuous supervisory signals. Specifically, we propose a mass interpolation method …

Go to article

Continual Collaborative Filtering Through Gradient Alignment, Dinh Hieu Do, Hady Wirawan Lauw Sep 2023

Continual Collaborative Filtering Through Gradient Alignment, Dinh Hieu Do, Hady Wirawan Lauw

Research Collection School Of Computing and Information Systems

A recommender system operates in a dynamic environment where new items emerge and new users join the system, resulting in ever-growing user-item interactions over time. Existing works either assume a model trained offline on a static dataset (requiring periodic re-training with ever larger datasets); or an online learning setup that favors recency over history. As privacy-aware users could hide their histories, the loss of older information means that periodic retraining may not always be feasible, while online learning may lose sight of users' long-term preferences. In this work, we adopt a continual learning perspective to collaborative filtering, by compartmentalizing users …

Go to article

When Routing Meets Recommendation: Solving Dynamic Order Recommendations Problem In Peer-To-Peer Logistics Platforms, Zhiqin Zhang, Waldy Joe, Yuyang Er, Hoong Chuin Lau Sep 2023

When Routing Meets Recommendation: Solving Dynamic Order Recommendations Problem In Peer-To-Peer Logistics Platforms, Zhiqin Zhang, Waldy Joe, Yuyang Er, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

Peer-to-Peer (P2P) logistics platforms, unlike traditional last-mile logistics providers, do not have dedicated delivery resources (both vehicles and drivers). Thus, the efficiency of such operating model lies in the successful matching of demand and supply, i.e., how to match the delivery tasks with suitable drivers that will result in successful assignment and completion of the tasks. We consider a Same-Day Delivery Problem (SDDP) involving a P2P logistics platform where new orders arrive dynamically and the platform operator needs to generate a list of recommended orders to the crowdsourced drivers. We formulate this problem as a Dynamic Order Recommendations Problem (DORP). …

Go to article

Graph-Level Anomaly Detection Via Hierarchical Memory Networks, Chaoxi Niu, Guansong Pang, Ling Chen Sep 2023

Graph-Level Anomaly Detection Via Hierarchical Memory Networks, Chaoxi Niu, Guansong Pang, Ling Chen

Research Collection School Of Computing and Information Systems

Graph-level anomaly detection aims to identify abnormal graphs that exhibit deviant structures and node attributes compared to the majority in a graph set. One primary challenge is to learn normal patterns manifested in both fine-grained and holistic views of graphs for identifying graphs that are abnormal in part or in whole. To tackle this challenge, we propose a novel approach called Hierarchical Memory Networks (HimNet), which learns hierarchical memory modules---node and graph memory modules---via a graph autoencoder network architecture. The node-level memory module is trained to model fine-grained, internal graph interactions among nodes for detecting locally abnormal graphs, while the …

Go to article

Real: A Representative Error-Driven Approach For Active Learning, Cheng Chen, Yong Wang, Lizi Liao, Yueguo Chen, Xiaoyong Du Sep 2023

Real: A Representative Error-Driven Approach For Active Learning, Cheng Chen, Yong Wang, Lizi Liao, Yueguo Chen, Xiaoyong Du

Research Collection School Of Computing and Information Systems

Given a limited labeling budget, active learning (al) aims to sample the most informative instances from an unlabeled pool to acquire labels for subsequent model training. To achieve this, al typically measures the informativeness of unlabeled instances based on uncertainty and diversity. However, it does not consider erroneous instances with their neighborhood error density, which have great potential to improve the model performance. To address this limitation, we propose Real, a novel approach to select data instances with Representative Errors for Active Learning. It identifies minority predictions as pseudo errors within a cluster and allocates an adaptive sampling budget for …

Go to article

The Power Of Identity Cues In Text-Based Customer Service: Evidence From Twitter, Yang Gao, Huaxia Rui, Shujing Sun Sep 2023

The Power Of Identity Cues In Text-Based Customer Service: Evidence From Twitter, Yang Gao, Huaxia Rui, Shujing Sun

Research Collection School Of Computing and Information Systems

Text-based customer service is emerging as an important channel through which companies can assist customers. However, the use of few identity cues may cause customers to feel limited social presence and even suspect the human identity of agents, especially in the current age of advanced algorithms. Does such a lack of social presence affect service interactions? We studied this timely question by evaluating the impact of customers’ perceived social presence on service outcomes and customers’ attitudes toward agents. Our identification strategy hinged on Southwest Airlines’ sudden requirement to include a first name in response to service requests on Twitter, which …

Go to article

Literature Review In The Generative Ai Era: How To Make A Compelling Contribution, Shan L. Pan, Rohit Nishant, Tuure Tuunanen, Fiona Fui-Hoon Nah Sep 2023

Literature Review In The Generative Ai Era: How To Make A Compelling Contribution, Shan L. Pan, Rohit Nishant, Tuure Tuunanen, Fiona Fui-Hoon Nah

Research Collection School Of Computing and Information Systems

As we write this editorial for this special issue, we are amidst the significant technological changes that are continuing to shape society. Since the emergence of ChatGPT in November 2022, humanity has become aware of the potential of generative AI (i.e., AI that can generate content) and large language models (LLMs) (i.e., AI models trained on a massive corpus of unstructured data). There is growing debate and discussion about the promise and perils of generative AI for the future of work, and academia is not immune. Premier journals in the IS domain, such as Information Systems Research, have published editorials …

Go to article

Semantically Constitutive Entities In Knowledge Graphs, Chong Cher Chia, Maksim Tkachenko, Hady Wirawan Lauw Aug 2023

Semantically Constitutive Entities In Knowledge Graphs, Chong Cher Chia, Maksim Tkachenko, Hady Wirawan Lauw

Research Collection School Of Computing and Information Systems

Knowledge graphs are repositories of facts about a world. In this work, we seek to distill the set of entities or nodes in a knowledge graph into a specified number of constitutive nodes, whose embeddings would be retained. Intuitively, the remaining accessory nodes could have their original embeddings “forgotten”, and yet reconstitutable from those of the retained constitutive nodes. The constitutive nodes thus represent the semantically constitutive entities, which retain the core semantics of the knowledge graph. We propose a formulation as well as algorithmic solutions to minimize the reconstitution errors. The derived constitutive nodes are validated empirically both in …

Go to article

Sparsity Brings Vulnerabilities: Exploring New Metrics In Backdoor Attacks, Jianwen Tian, Kefan Qiu, Debin Gao, Zhi Wang, Xiaohui Kuang, Gang Zhao Aug 2023

Sparsity Brings Vulnerabilities: Exploring New Metrics In Backdoor Attacks, Jianwen Tian, Kefan Qiu, Debin Gao, Zhi Wang, Xiaohui Kuang, Gang Zhao

Research Collection School Of Computing and Information Systems

Nowadays, using AI-based detectors to keep pace with the fast iterating of malware has attracted a great attention. However, most AI-based malware detectors use features with vast sparse subspaces to characterize applications, which brings significant vulnerabilities to the model. To exploit this sparsityrelated vulnerability, we propose a clean-label backdoor attack consisting of a dissimilarity metric-based candidate selection and a variation ratio-based trigger construction. The proposed backdoor is verified on different datasets, including a Windows PE dataset, an Android dataset with numerical and boolean feature values, and a PDF dataset. The experimental results show that the attack can slash the accuracy …

Go to article

Balancing Utility And Fairness In Submodular Maximization, Yanhao Wang, Yuchen Li, Francesco Bonchi, Ying Wang Aug 2023

Balancing Utility And Fairness In Submodular Maximization, Yanhao Wang, Yuchen Li, Francesco Bonchi, Ying Wang

Research Collection School Of Computing and Information Systems

Submodular function maximization is a fundamental combinatorial optimization problem with plenty of applications – including data summarization, influence maximization, and recommendation. In many of these problems, the goal is to find a solution that maximizes the average utility over all users, for each of whom the utility is defined by a monotone submodular function. However, when the population of users is composed of several demographic groups, another critical problem is whether the utility is fairly distributed across different groups. Although the utility and fairness objectives are both desirable, they might contradict each other, and, to the best of our knowledge, …

Go to article

Fintech Data Infrastructure For Esg Disclosure Compliance, Randall E. Duran, Peter Tierney Aug 2023

Fintech Data Infrastructure For Esg Disclosure Compliance, Randall E. Duran, Peter Tierney

Research Collection School Of Computing and Information Systems

Regulations related to the disclosure of environmental, governance, and social (ESG) factors are evolving rapidly and are a major concern for financial compliance worldwide. Information technology has the potential to reduce the effort and cost of ESG disclosure compliance. However, comprehensive and accurate ESG data are necessary for disclosures. Currently, the availability and quality of underlying data for ESG disclosures vary widely and are often deficient. The process involved with obtaining ESG data is also often inefficient and prone to error. This paper compares the models used and the evolution of Fintech data infrastructure developed to support financial services with …

Go to article

Single-View View Synthesis With Self-Rectified Pseudo-Stereo, Yang Zhou, Hanjie Wu, Wenxi Liu, Zheng Xiong, Jing Qin, Shengfeng He Aug 2023

Single-View View Synthesis With Self-Rectified Pseudo-Stereo, Yang Zhou, Hanjie Wu, Wenxi Liu, Zheng Xiong, Jing Qin, Shengfeng He

Research Collection School Of Computing and Information Systems

Synthesizing novel views from a single view image is a highly ill-posed problem. We discover an effective solution to reduce the learning ambiguity by expanding the single-view view synthesis problem to a multi-view setting. Specifically, we leverage the reliable and explicit stereo prior to generate a pseudo-stereo viewpoint, which serves as an auxiliary input to construct the 3D space. In this way, the challenging novel view synthesis process is decoupled into two simpler problems of stereo synthesis and 3D reconstruction. In order to synthesize a structurally correct and detail-preserved stereo image, we propose a self-rectified stereo synthesis to amend erroneous …

Go to article

The 4th International Workshop On Talent And Management Computing (Tmc'2023): Editorial, Hengshu Zhu, Hui Xiong, Yong Ge, Ee-Peng Lim Aug 2023

The 4th International Workshop On Talent And Management Computing (Tmc'2023): Editorial, Hengshu Zhu, Hui Xiong, Yong Ge, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

In today's competitive and fast-evolving business environment, it is a critical time for organizations to rethink how to deal with the talent and management related tasks in a quantitative manner. Indeed, thanks to the era of big data, the availability of large-scale talent data provides unparalleled opportunities for business leaders to understand the rules of talent and management, which in turn deliver intelligence for effective decision making and management for their organizations. In the past few years, talent and management computing have increasingly attracted attentions from KDD communities, and a number of research/applied data science efforts have been devoted. To …

Go to article

Knowledge Representation For Conceptual, Motivational, And Affective Processes In Natural Language Communication, Seng Beng Ho, Zhaoxia Wang, Boon-Kiat Quek, Erik Cambria Aug 2023

Knowledge Representation For Conceptual, Motivational, And Affective Processes In Natural Language Communication, Seng Beng Ho, Zhaoxia Wang, Boon-Kiat Quek, Erik Cambria

Research Collection School Of Computing and Information Systems

Natural language communication is an intricate and complex process. The speaker usually begins with an intention and motivation of what is to be communicated, and what outcomes are expected from the communication, while taking into consideration the listener’s mental model to concoct an appropriate sentence. Likewise, the listener has to interpret the speaker’s message, and respond accordingly, also with the speaker’s mental model in mind. Doing this successfully entails the appropriate representation of the conceptual, motivational, and affective processes that underlie language generation and understanding. Whereas big-data approaches in language processing (such as chatbots and machine translation) have performed well, …

Go to article

Multi-View Graph Contrastive Learning For Solving Vehicle Routing Problems, Yuan Jiang, Zhiguang Cao, Yaoxin Wu, Jie Zhang Aug 2023

Multi-View Graph Contrastive Learning For Solving Vehicle Routing Problems, Yuan Jiang, Zhiguang Cao, Yaoxin Wu, Jie Zhang

Research Collection School Of Computing and Information Systems

Recently, neural heuristics based on deep learning have reported encouraging results for solving vehicle routing problems (VRPs), especially on independent and identically distributed (i.i.d.) instances, e.g. uniform. However, in the presence of a distribution shift for the testing instances, their performance becomes considerably inferior. In this paper, we propose a multi-view graph contrastive learning (MVGCL) approach to enhance the generalization across different distributions, which exploits a graph pattern learner in a self-supervised fashion to facilitate a neural heuristic equipped with an active search scheme. Specifically, our MVGCL first leverages graph contrastive learning to extract transferable patterns from VRP graphs to …

Go to article

A Survey On Proactive Dialogue Systems: Problems, Methods, And Prospects, Yang Deng, Wenqiang Lei, Wai Lam, Tat-Seng Chua Aug 2023

A Survey On Proactive Dialogue Systems: Problems, Methods, And Prospects, Yang Deng, Wenqiang Lei, Wai Lam, Tat-Seng Chua

Research Collection School Of Computing and Information Systems

Proactive dialogue systems, related to a wide range of real-world conversational applications, equip the conversational agent with the capability of leading the conversation direction towards achieving pre-defined targets or fulfilling certain goals from the system side. It is empowered by advanced techniques to progress to more complicated tasks that require strategical and motivational interactions. In this survey, we provide a comprehensive overview of the prominent problems and advanced designs for conversational agent's proactivity in different types of dialogues. Furthermore, we discuss challenges that meet the real-world application needs but require a greater research focus in the future. We hope that …

Go to article

Evolve Path Tracer: Early Detection Of Malicious Addresses In Cryptocurrency, Ling Cheng, Feida Zhu, Yong Wang, Ruicheng Liang, Huiwen Liu Aug 2023

Evolve Path Tracer: Early Detection Of Malicious Addresses In Cryptocurrency, Ling Cheng, Feida Zhu, Yong Wang, Ruicheng Liang, Huiwen Liu

Research Collection School Of Computing and Information Systems

With the boom of cryptocurrency and its concomitant financial risk concerns, detecting fraudulent behaviors and associated malicious addresses has been drawing significant research effort. Most existing studies, however, rely on the full history features or full-fledged address transaction networks, both of which are unavailable in the problem of early malicious address detection and therefore failing them for the task. To detect fraudulent behaviors of malicious addresses in the early stage, we present Evolve Path Tracer, which consists of Evolve Path Encoder LSTM, Evolve Path Graph GCN, and Hierarchical Survival Predictor. Specifically, in addition to the general address features, we propose …

Go to article

Diffusion Variational Autoencoder For Tackling Stochasticity In Multi-Step Regression Stock Price Prediction, Kelvin J.L. Koa, Yunshan Ma, Ritchie Ng, Tat‑Seng Chua Aug 2023

Diffusion Variational Autoencoder For Tackling Stochasticity In Multi-Step Regression Stock Price Prediction, Kelvin J.L. Koa, Yunshan Ma, Ritchie Ng, Tat‑Seng Chua

Research Collection School Of Computing and Information Systems

Multi-step stock price prediction over a long-term horizon is crucial for forecasting its volatility, allowing financial institutions to price and hedge derivatives, and banks to quantify the risk in their trading books. Additionally, most financial regulators also require a liquidity horizon of several days for institutional investors to exit their risky assets, in order to not materially affect market prices. However, the task of multi-step stock price prediction is challenging, given the highly stochastic nature of stock data. Current solutions to tackle this problem are mostly designed for single-step, classification-based predictions, and are limited to low representation expressiveness. The problem …

Go to article

Decoding The Underlying Meaning Of Multimodal Hateful Memes, Ming Shan Hee, Wen Haw Chong, Roy Ka-Wei Lee Aug 2023

Decoding The Underlying Meaning Of Multimodal Hateful Memes, Ming Shan Hee, Wen Haw Chong, Roy Ka-Wei Lee

Research Collection School Of Computing and Information Systems

Recent studies have proposed models that yielded promising performance for the hateful meme classification task. Nevertheless, these proposed models do not generate interpretable explanations that uncover the underlying meaning and support the classification output. A major reason for the lack of explainable hateful meme methods is the absence of a hateful meme dataset that contains ground truth explanations for benchmarking or training. Intuitively, having such explanations can educate and assist content moderators in interpreting and removing flagged hateful memes. This paper address this research gap by introducing Hateful meme with Reasons Dataset (HatReD), which is a new multimodal hateful meme …

Go to article

Camper: An Effective Framework For Privacy-Aware Deep Entity Resolution, Yuxiang Guo, Lu Chen, Zhengjie Zhou, Baihua Zheng, Ziquan Fang, Zhikun Zhang, Yuren Mao, Yunjun Gao Aug 2023

Camper: An Effective Framework For Privacy-Aware Deep Entity Resolution, Yuxiang Guo, Lu Chen, Zhengjie Zhou, Baihua Zheng, Ziquan Fang, Zhikun Zhang, Yuren Mao, Yunjun Gao

Research Collection School Of Computing and Information Systems

Entity Resolution (ER) is a fundamental problem in data preparation. Standard deep ER methods have achieved state-of-the-art efectiveness, assuming that relations from diferent organizations are centrally stored. However, due to privacy concerns, it can be difcult to centralize data in practice, rendering standard deep ER solutions inapplicable. Despite eforts to develop rule-based privacy-preserving ER methods, they often neglect subtle matching mechanisms and have poor efectiveness as a result. To bridge efectiveness and privacy, in this paper, we propose CampER, an efective framework for privacy-aware deep entity resolution. Specifcally, we frst design a training pair self-generation strategy to overcome the absence …

Go to article

Document-Level Relation Extraction Via Separate Relation Representation And Logical Reasoning, Heyan Huang, Changsen Yuan, Qian Liu, Yixin Cao Aug 2023

Document-Level Relation Extraction Via Separate Relation Representation And Logical Reasoning, Heyan Huang, Changsen Yuan, Qian Liu, Yixin Cao

Research Collection School Of Computing and Information Systems

Document-level relation extraction (RE) extends the identification of entity/mentions’ relation from the single sentence to the long document. It is more realistic and poses new challenges to relation representation and reasoning skills. In this article, we propose a novel model, SRLR, using Separate Relation Representation and Logical Reasoning considering the indirect relation representation and complex reasoning of evidence sentence problems. Specifically, we first expand the judgment of relational facts from the entity-level to the mention-level, highlighting fine-grained information to capture the relation representation for the entity pair. Second, we propose a logical reasoning module to identify evidence sentences and conduct …

Go to article

An Adaptive Large Neighborhood Search For Heterogeneous Vehicle Routing Problem With Time Windows, Minh Pham Kien Nguyen, Aldy Gunawan, Vincent F. Yu, Mustafa Misir Aug 2023

An Adaptive Large Neighborhood Search For Heterogeneous Vehicle Routing Problem With Time Windows, Minh Pham Kien Nguyen, Aldy Gunawan, Vincent F. Yu, Mustafa Misir

Research Collection School Of Computing and Information Systems

The heterogeneous vehicle routing problem with time windows (HVRPTW) employs various vehicles with different capacities to serve upcoming pickup and delivery orders. We introduce a HVRPTW variant for reflecting the practical needs of crowd-shipping by considering the mass-rapid-transit stations, as the additional terminal points. A mixed integer linear programming model is formulated. An Adaptive Large Neighborhood Search based meta-heuristic is also developed by utilizing a basic probabilistic selection strategy, i.e. roulette wheel, and Simulated Annealing. The proposed approach is empirically evaluated on a new set of benchmark instances. The computational results revealed that ALNS shows its clear advantage on the …

Go to article

Deep Weakly-Supervised Anomaly Detection, Guansong Pang, Chunhua Shen, Huidong Jin, Anton Van Den Hengel Aug 2023

Deep Weakly-Supervised Anomaly Detection, Guansong Pang, Chunhua Shen, Huidong Jin, Anton Van Den Hengel

Research Collection School Of Computing and Information Systems

Recent semi-supervised anomaly detection methods that are trained using small labeled anomaly examples and large unlabeled data (mostly normal data) have shown largely improved performance over unsupervised methods. However, these methods often focus on fitting abnormalities illustrated by the given anomaly examples only (i.e., seen anomalies), and consequently they fail to generalize to those that are not, i.e., new types/classes of anomaly unseen during training. To detect both seen and unseen anomalies, we introduce a novel deep weakly-supervised approach, namely Pairwise Relation prediction Network (PReNet), that learns pairwise relation features and anomaly scores by predicting the relation of any two …

Go to article

Survey On Sentiment Analysis: Evolution Of Research Methods And Topics, Jingfeng Cui, Zhaoxia Wang, Seng-Beng Ho, Erik Cambria Aug 2023

Survey On Sentiment Analysis: Evolution Of Research Methods And Topics, Jingfeng Cui, Zhaoxia Wang, Seng-Beng Ho, Erik Cambria

Research Collection School Of Computing and Information Systems

Sentiment analysis, one of the research hotspots in the natural language processing field, has attracted the attention of researchers, and research papers on the field are increasingly published. Many literature reviews on sentiment analysis involving techniques, methods, and applications have been produced using different survey methodologies and tools, but there has not been a survey dedicated to the evolution of research methods and topics of sentiment analysis. There have also been few survey works leveraging keyword co-occurrence on sentiment analysis. Therefore, this study presents a survey of sentiment analysis focusing on the evolution of research methods and topics. It incorporates …

Go to article

Corporate Trade War Uncertainty And Patent Bubble, Xu Yang, Nan Hu, Peng Liang Aug 2023

Corporate Trade War Uncertainty And Patent Bubble, Xu Yang, Nan Hu, Peng Liang

Research Collection School Of Computing and Information Systems

This paper draws upon resource dependence theory and investigates how trade policy uncertainty affects firm strategic innovation management in China. Adopting a machine learning approach called Word2Vec from computational linguistics, we construct and validate a measure of firm-level managers’ perceived trade war uncertainty (TWU). We find that TWU has a positive effect on the number of total patent applications, but this positive effect is totally driven by low-quality patents instead of high-quality patents. Moreover, we document that firms have stronger incentives for such strategic innovation behavior when the underlying firms are more financially constrained, and/or when the management is more …

Go to article

Synthesizing Speech Test Cases With Text-To-Speech? An Empirical Study On The False Alarms In Automated Speech Recognition Testing, Julia Kaiwen Lau, Kelvin Kai Wen Kong, Julian Hao Yong, Per Hoong Tan, Zhou Yang, Zi Qian Yong, Joshua Chern Wey Low, Chun Yong Chong, Mei Kuan Lim, David Lo Jul 2023

Synthesizing Speech Test Cases With Text-To-Speech? An Empirical Study On The False Alarms In Automated Speech Recognition Testing, Julia Kaiwen Lau, Kelvin Kai Wen Kong, Julian Hao Yong, Per Hoong Tan, Zhou Yang, Zi Qian Yong, Joshua Chern Wey Low, Chun Yong Chong, Mei Kuan Lim, David Lo

Research Collection School Of Computing and Information Systems

Recent studies have proposed the use of Text-To-Speech (TTS) systems to automatically synthesise speech test cases on a scale and uncover a large number of failures in ASR systems. However, the failures uncovered by synthetic test cases may not reflect the actual performance of an ASR system when it transcribes human audio, which we refer to as false alarms. Given a failed test case synthesised from TTS systems, which consists of TTS-generated audio and the corresponding ground truth text, we feed the human audio stating the same text to an ASR system. If human audio can be correctly transcribed, an …

Go to article

An Efficient Hybrid Genetic Algorithm For The Quadratic Traveling Salesman Problem, Quang Anh Pham, Hoong Chuin Lau, Minh Hoang Ha, Lam Vu Jul 2023

An Efficient Hybrid Genetic Algorithm For The Quadratic Traveling Salesman Problem, Quang Anh Pham, Hoong Chuin Lau, Minh Hoang Ha, Lam Vu

Research Collection School Of Computing and Information Systems

The traveling salesman problem (TSP) is the most well-known problem in combinatorial optimization which hasbeen studied for many decades. This paper focuses on dealing with one of the most difficult TSP variants named thequadratic traveling salesman problem (QTSP) that has numerous planning applications in robotics and bioinformatics.The goal of QTSP is similar to TSP which finds a cycle visiting all nodes exactly once with minimum total costs. However, the costs in QTSP are associated with three vertices traversed in succession (instead of two like in TSP). This leadsto a quadratic objective function that is much harder to solve.To efficiently solve …

Go to article

Few-Shot Event Detection: An Empirical Study And A Unified View, Yubo Ma, Zehao Wang, Yixin Cao, Aixin Sun Jul 2023

Few-Shot Event Detection: An Empirical Study And A Unified View, Yubo Ma, Zehao Wang, Yixin Cao, Aixin Sun

Research Collection School Of Computing and Information Systems

Few-shot event detection (ED) has been widely studied, while this brings noticeable discrepancies, e.g., various motivations, tasks, and experimental settings, that hinder the understanding of models for future progress. This paper presents a thorough empirical study, a unified view of ED models, and a better unified baseline. For fair evaluation, we compare 12 representative methods on three datasets, which are roughly grouped into prompt-based and prototype-based models for detailed analysis. Experiments consistently demonstrate that prompt-based methods, including ChatGPT, still significantly trail prototype-based methods in terms of overall performance. To investigate their superior performance, we break down their design elements along …

Go to article

First Prev Next Last