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

Physical Sciences and Mathematics Commons™

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

Research Collection School Of Computing and Information Systems

Discipline
Keyword
Publication Year
File Type

Articles 1321 - 1350 of 6891

Full-Text Articles in Physical Sciences and Mathematics

Robust Bipoly-Matching For Multi-Granular Entities, Ween Jiann Lee, Maksim Tkachenko, Hady W. Lauw Dec 2021

Robust Bipoly-Matching For Multi-Granular Entities, Ween Jiann Lee, Maksim Tkachenko, Hady W. Lauw

Research Collection School Of Computing and Information Systems

Entity matching across two data sources is a prevalent need in many domains, including e-commerce. Of interest is the scenario where entities have varying granularity, e.g., a coarse product category may match multiple finer categories. Previous work in one-to-many matching generally presumes the `one' necessarily comes from a designated source and the `many' from the other source. In contrast, we propose a novel formulation that allows concurrent one-to-many bidirectional matching in any direction. Beyond flexibility, we also seek matching that is more robust to noisy similarity values arising from diverse entity descriptions, by introducing receptivity and reclusivity notions. In addition …

Go to article

Degree Doesn't Matter: Identifying The Drivers Of Interaction In Software Development Ecosystem, Amrita Bhattacharjee, Subhajit Datta, Subhashis Majumder Dec 2021

Degree Doesn't Matter: Identifying The Drivers Of Interaction In Software Development Ecosystem, Amrita Bhattacharjee, Subhajit Datta, Subhashis Majumder

Research Collection School Of Computing and Information Systems

Large scale software development ecosystems represent one of the most complex human enterprises. In such settings, developers are embedded in a web of shared concerns, responsibilities, and objectives at individual and collective levels. A deep understanding of the factors that influence developers to connect with one another is crucial in appreciating the challenges of such ecosystems as well as formulating strategies to overcome those challenges. We use real world data from multiple software development ecosystems to construct developer interaction networks and examine the mechanisms of such network formation using statistical models to identify developer attributes that have maximal influence on …

Go to article

Channel Integration Services In Online Healthcare Communities, Anqi Zhao, Qian Tang Dec 2021

Channel Integration Services In Online Healthcare Communities, Anqi Zhao, Qian Tang

Research Collection School Of Computing and Information Systems

In online healthcare communities, channel integration services have become the bridge between online and offline channels, enabling patients to easily migrate across channels. Different from pure online services, online-to-offline (On2Off) and offline-to-online (Off2On) channel integration services involve both channels. This study examines the interrelationships between pure online services and channel integration services. Using a panel dataset composed of data from an online healthcare community, we find that pure online services decrease patients’ demand for On2Off integration services but increase their use of Off2On integration services. Our findings suggest that providing healthcare services online can reduce online patients’ needs to visit …

Go to article

Canita: Faster Rates For Distributed Convex Optimization With Communication Compression, Zhize Li, Peter Richtarik Dec 2021

Canita: Faster Rates For Distributed Convex Optimization With Communication Compression, Zhize Li, Peter Richtarik

Research Collection School Of Computing and Information Systems

Due to the high communication cost in distributed and federated learning, methods relying on compressed communication are becoming increasingly popular. Besides, the best theoretically and practically performing gradient-type methods invariably rely on some form of acceleration/momentum to reduce the number of communications (faster convergence), e.g., Nesterov's accelerated gradient descent (Nesterov, 1983, 2004) and Adam (Kingma and Ba, 2014). In order to combine the benefits of communication compression and convergence acceleration, we propose a \emph{compressed and accelerated} gradient method based on ANITA (Li, 2021) for distributed optimization, which we call CANITA. Our CANITA achieves the \emph{first accelerated rate} $O\bigg(\sqrt{\Big(1+\sqrt{\frac{\omega^3}{n}}\Big)\frac{L}{\epsilon}} + \omega\big(\frac{1}{\epsilon}\big)^{\frac{1}{3}}\bigg)$, …

Go to article

Towards Understanding Why Lookahead Generalizes Better Than Sgd And Beyond, Pan Zhou, Hanshu Yan, Xiaotong Yuan, Jiashi Feng, Shuicheng Yan Dec 2021

Towards Understanding Why Lookahead Generalizes Better Than Sgd And Beyond, Pan Zhou, Hanshu Yan, Xiaotong Yuan, Jiashi Feng, Shuicheng Yan

Research Collection School Of Computing and Information Systems

To train networks, lookahead algorithm [1] updates its fast weights k times via an inner-loop optimizer before updating its slow weights once by using the latest fast weights. Any optimizer, e.g. SGD, can serve as the inner-loop optimizer, and the derived lookahead generally enjoys remarkable test performance improvement over the vanilla optimizer. But theoretical understandings on the test performance improvement of lookahead remain absent yet. To solve this issue, we theoretically justify the advantages of lookahead in terms of the excess risk error which measures the test performance. Specifically, we prove that lookahead using SGD as its inner-loop optimizer can …

Go to article

Checking Smart Contracts With Structural Code Embedding, Zhipeng Gao, Lingxiao Jiang, Xin Xia, David Lo, John Grundy Dec 2021

Checking Smart Contracts With Structural Code Embedding, Zhipeng Gao, Lingxiao Jiang, Xin Xia, David Lo, John Grundy

Research Collection School Of Computing and Information Systems

Smart contracts have been increasingly used together with blockchains to automate financial and business transactions. However, many bugs and vulnerabilities have been identified in many contracts which raises serious concerns about smart contract security, not to mention that the blockchain systems on which the smart contracts are built can be buggy. Thus, there is a significant need to better maintain smart contract code and ensure its high reliability. In this paper, we propose an automated approach to learn characteristics of smart contracts in Solidity, useful for repetitive contract code, bug detection and contract validation. Our new approach is based on …

Go to article

Topic-Aware Heterogeneous Graph Neural Network For Link Prediction, Siyong Xu, Cheng Yang, Yuan Fang, Yuan Fang, Yang Tianchi, Luhao Zhang Nov 2021

Topic-Aware Heterogeneous Graph Neural Network For Link Prediction, Siyong Xu, Cheng Yang, Yuan Fang, Yuan Fang, Yang Tianchi, Luhao Zhang

Research Collection School Of Computing and Information Systems

Heterogeneous graphs (HGs), consisting of multiple types of nodes and links, can characterize a variety of real-world complex systems. Recently, heterogeneous graph neural networks (HGNNs), as a powerful graph embedding method to aggregate heterogeneous structure and attribute information, has earned a lot of attention. Despite the ability of HGNNs in capturing rich semantics which reveal different aspects of nodes, they still stay at a coarse-grained level which simply exploits structural characteristics. In fact, rich unstructured text content of nodes also carries latent but more fine-grained semantics arising from multi-facet topic-aware factors, which fundamentally manifest why nodes of different types would …

Go to article

A Bert-Based Two-Stage Model For Chinese Chengyu Recommendation, Minghuan Tan, Jing Jiang, Bingtian Dai Nov 2021

A Bert-Based Two-Stage Model For Chinese Chengyu Recommendation, Minghuan Tan, Jing Jiang, Bingtian Dai

Research Collection School Of Computing and Information Systems

In Chinese, Chengyu are fixed phrases consisting of four characters. As a type of idioms, their meanings usually cannot be derived from their component characters. In this paper, we study the task of recommending a Chengyu given a textual context. Observing some of the limitations with existing work, we propose a two-stage model, where during the first stage we re-train a Chinese BERT model by masking out Chengyu from a large Chinese corpus with a wide coverage of Chengyu. During the second stage, we fine-tune the retrained, Chengyu-oriented BERT on a specific Chengyu recommendation dataset. We evaluate this method on …

Go to article

Probablistic Verification Of Neural Networks Against Group Fairness, Bing Sun, Jun Sun, Ting Dai, Lijun Zhang Nov 2021

Probablistic Verification Of Neural Networks Against Group Fairness, Bing Sun, Jun Sun, Ting Dai, Lijun Zhang

Research Collection School Of Computing and Information Systems

Fairness is crucial for neural networks which are used in applications with important societal implication. Recently, there have been multiple attempts on improving fairness of neural networks, with a focus on fairness testing (e.g., generating individual discriminatory instances) and fairness training (e.g., enhancing fairness through augmented training). In this work, we propose an approach to formally verify neural networks against fairness, with a focus on independence-based fairness such as group fairness. Our method is built upon an approach for learning Markov Chains from a user-provided neural network (i.e., a feed-forward neural network or a recurrent neural network) which is guaranteed …

Go to article

Does Active Service Intervention Drive More Complaints On Social Media? The Roles Of Service Quality And Awareness, Shujing Sun, Yang Gao, Huaxia Rui Nov 2021

Does Active Service Intervention Drive More Complaints On Social Media? The Roles Of Service Quality And Awareness, Shujing Sun, Yang Gao, Huaxia Rui

Research Collection School Of Computing and Information Systems

Despite many advantages of social media as a customer service channel, there is a concern that active service intervention encourages excessive service complaints. Our paper casts doubt on this misconception by examining the dynamics between social media customer complaints and brand service interventions. We find service interventions indeed cause more complaints, yet this increase is driven by service awareness rather than chronic complaining. Due to the publicity and connectivity of social media, customers learn about the new service channel by observing customer service delivery to others – a mechanism that is unique to social media customer service and does not …

Go to article

Binary Classifiers For Noisy Datasets: A Comparative Study Of Existing Quantum Machine Learning Frameworks And Some New Approaches, Nikolaos Schetakis, Davit Aghamalyan, Paul Robert Griffin, Michael Boguslavsky Nov 2021

Binary Classifiers For Noisy Datasets: A Comparative Study Of Existing Quantum Machine Learning Frameworks And Some New Approaches, Nikolaos Schetakis, Davit Aghamalyan, Paul Robert Griffin, Michael Boguslavsky

Research Collection School Of Computing and Information Systems

This technology offer is a quantum machine learning algorithm applied to binary classification models for noisy datasets which are prevalent in financial and other datasets. By combining hybrid-neural networks, quantum parametric circuits, and data re-uploading we have improved the classification of non-convex 2-dimensional figures by understanding learning stability as noise increases in the dataset. The metric we use for assessing the performance of our quantum classifiers is the area under the receiver operator curve (ROC AUC). We are interested to collaborate with partners with use cases for binary classification of noisy data. Also, as quantum technology is still insufficient for …

Go to article

From Community Search To Community Understanding: A Multimodal Community Query Engine, Zhao Li, Pengcheng Zou, Xia Chen, Shichang Hu, Peng Zhang, Yumou Zhou, Bingsheng He, Yuchen Li, Xing Tang Nov 2021

From Community Search To Community Understanding: A Multimodal Community Query Engine, Zhao Li, Pengcheng Zou, Xia Chen, Shichang Hu, Peng Zhang, Yumou Zhou, Bingsheng He, Yuchen Li, Xing Tang

Research Collection School Of Computing and Information Systems

In this demo, we present an online multi-modal community query engine (MQE1 ) on Alibaba’s billion-scale heterogeneous network. MQE has two distinct features in comparison with existing community query engines. Firstly, MQE supports multimodal community search on heterogeneous graphs with keyword and image queries. Secondly, to facilitate community understanding in real business scenarios, MQE generates natural language descriptions for the retrieved community in combination with other useful demographic information. The distinct features of MQE benefit many downstream applications in Alibaba’s e-commerce platform like recommendation. Our experiments confirm the effectiveness and efficiency of MQE on graphs with billions of edges.

Go to article

Span-Level Emotion Cause Analysis With Neural Sequence Tagging, Xiangju Li, Wei Gao, Shi Feng, Daling Wang, Shafiq Joty Nov 2021

Span-Level Emotion Cause Analysis With Neural Sequence Tagging, Xiangju Li, Wei Gao, Shi Feng, Daling Wang, Shafiq Joty

Research Collection School Of Computing and Information Systems

This paper addresses the task of span-level emotion cause analysis (SECA). It is a finer-grained emotion cause analysis (ECA) task, which aims to identify the specific emotion cause span(s) behind certain emotions in text. In this paper, we formalize SECA as a sequence tagging task for which several variants of neural network-based sequence tagging models to extract specific emotion cause span(s) in the given context. These models combine different types of encoding and decoding approaches. Furthermore, to make our models more "emotionally sensitive'', we utilize the multi-head attention mechanism to enhance the representation of context. Experimental evaluations conducted on two …

Go to article

Flip & Slack – Active Flipped Classroom Learning With Collaborative Slack Interactions, Kyong Jin Shim, Gottipati Swapna, Yi Meng Lau Nov 2021

Flip & Slack – Active Flipped Classroom Learning With Collaborative Slack Interactions, Kyong Jin Shim, Gottipati Swapna, Yi Meng Lau

Research Collection School Of Computing and Information Systems

Active flipped classroom learning is stipulated with faculty structuring the activities involving constructive interactions, either formal or informal. Sharing ideas and responding to ideas improve the cognitive skills of the students. Encouraging peers to contribute to class activities and respecting peers contribute to the development of affective skills. We present an integrated platform for cognitive and affective skills development. A flipped classroom arrangement allows the faculty to focus more on in-class activities such as programming and lab exercises to support active learning in computing courses. We share the design of an innovative flipped classroom model integrated with Slack and present …

Go to article

Automating Developer Chat Mining, Shengyi Pan, Lingfeng Bao, Xiaoxue Ren, Xin Xia, David Lo, Shanping Li Nov 2021

Automating Developer Chat Mining, Shengyi Pan, Lingfeng Bao, Xiaoxue Ren, Xin Xia, David Lo, Shanping Li

Research Collection School Of Computing and Information Systems

Online chatrooms are gaining popularity as a communication channel between widely distributed developers of Open Source Software (OSS) projects. Most discussion threads in chatrooms follow a Q&A format, with some developers (askers) raising an initial question and others (respondents) joining in to provide answers. These discussion threads are embedded with rich information that can satisfy the diverse needs of various OSS stakeholders. However, retrieving information from threads is challenging as it requires a thread-level analysis to understand the context. Moreover, the chat data is transient and unstructured, consisting of entangled informal conversations. In this paper, we address this challenge by …

Go to article

Incbl: Incremental Bug Localization, Zhou Yang, Jieke Shi, Wang Shaowei, David Lo Nov 2021

Incbl: Incremental Bug Localization, Zhou Yang, Jieke Shi, Wang Shaowei, David Lo

Research Collection School Of Computing and Information Systems

Numerous efforts have been invested in improving the effectiveness of bug localization techniques, whereas little attention is paid to making these tools run more efficiently in continuously evolving software repositories. This paper first analyzes the information retrieval model behind a classic bug localization tool, BugLocator, and builds a mathematical foundation illustrating that the model can be updated incrementally when codebase or bug reports evolve. Then, we present IncBL, a tool for Incremental Bug Localization in evolving software repositories. IncBL is evaluated on the Bugzbook dataset, and the results show that IncBL can significantly reduce the running time by 77.79% on …

Go to article

Sofi: Reflection-Augmented Fuzzing For Javascript Engines, Xiaoyu He, Xiaofei Xie, Yuekang Li, Jianwen Sun, Feng Li, Wei Zou, Yang Liu, Lei Yu, Jianhua Zhou, Wenchang Shi, Wei Huo Nov 2021

Sofi: Reflection-Augmented Fuzzing For Javascript Engines, Xiaoyu He, Xiaofei Xie, Yuekang Li, Jianwen Sun, Feng Li, Wei Zou, Yang Liu, Lei Yu, Jianhua Zhou, Wenchang Shi, Wei Huo

Research Collection School Of Computing and Information Systems

JavaScript engines have been shown prone to security vulnerabilities, which can lead to serious consequences due to their popularity. Fuzzing is an effective testing technique to discover vulnerabilities. The main challenge of fuzzing JavaScript engines is to generate syntactically and semantically valid inputs such that deep functionalities can be explored. However, due to the dynamic nature of JavaScript and the special features of different engines, it is quite challenging to generate semantically meaningful test inputs.We observed that state-of-the-art semantic-aware JavaScript fuzzers usually require manually written rules to analyze the semantics for a JavaScript engine, which is labor-intensive, incomplete and engine-specific. …

Go to article

Information Technology And Organizational Learning: Managing Behavioral Change In The Digital Age By Arthur M. Langer, Siu Loon Hoe Nov 2021

Information Technology And Organizational Learning: Managing Behavioral Change In The Digital Age By Arthur M. Langer, Siu Loon Hoe

Research Collection School Of Computing and Information Systems

As the world battles yet another crisis because of the spread of COVID-19, the idea of digitalization brings about a whole new meaning. Many professionals and information technology (IT) managers have remarked that the spread of the coronavirus has accelerated the pace of digital transformation much more so than any effort put forth by C-suite executives. While it is true that most organizations do not accept new technology readily because of embedded legacy systems, changing the corporate cultures does play an important role in affecting the rate of IT adoption. Very often, leaders and senior executives focus on the technological …

Go to article

Is Multi-Hop Reasoning Really Explainable? Towards Benchmarking Reasoning Interpretability, Xin Lv, Yixin Cao, Lei Hou, Juanzi Li, Zhiyuan Liu, Yichi Zhang, Zelin Dai Nov 2021

Is Multi-Hop Reasoning Really Explainable? Towards Benchmarking Reasoning Interpretability, Xin Lv, Yixin Cao, Lei Hou, Juanzi Li, Zhiyuan Liu, Yichi Zhang, Zelin Dai

Research Collection School Of Computing and Information Systems

Multi-hop reasoning has been widely studied in recent years to obtain more interpretable link prediction. However, we find in experiments that many paths given by these models are actually unreasonable, while little work has been done on interpretability evaluation for them. In this paper, we propose a unified framework to quantitatively evaluate the interpretability of multi-hop reasoning models so as to advance their development. In specific, we define three metrics, including path recall, local interpretability, and global interpretability for evaluation, and design an approximate strategy to calculate these metrics using the interpretability scores of rules. We manually annotate all possible …

Go to article

Topic Modeling For Multi-Aspect Listwise Comparison, Delvin Ce Zhang, Hady W. Lauw Nov 2021

Topic Modeling For Multi-Aspect Listwise Comparison, Delvin Ce Zhang, Hady W. Lauw

Research Collection School Of Computing and Information Systems

As a well-established probabilistic method, topic models seek to uncover latent semantics from plain text. In addition to having textual content, we observe that documents are usually compared in listwise rankings based on their content. For instance, world-wide countries are compared in an international ranking in terms of electricity production based on their national reports. Such document comparisons constitute additional information that reveal documents' relative similarities. Incorporating them into topic modeling could yield comparative topics that help to differentiate and rank documents. Furthermore, based on different comparison criteria, the observed document comparisons usually cover multiple aspects, each expressing a distinct …

Go to article

An Economic Analysis Of Rebates Conditional On Positive Reviews, Jianqing Chen, Zhiling Guo, Jian Huang Nov 2021

An Economic Analysis Of Rebates Conditional On Positive Reviews, Jianqing Chen, Zhiling Guo, Jian Huang

Research Collection School Of Computing and Information Systems

Strategic sellers on some online selling platforms have recently been using a conditional-rebate strategy to manipulate product reviews under which only purchasing consumers who post positive reviews online are eligible to redeem the rebate. A key concern for the conditional rebate is that it can easily induce fake reviews, which might be harmful to consumers and society. We develop a microbehavioral model capturing consumers’ review-sharing benefit, review-posting cost, and moral cost of lying to examine the seller’s optimal pricing and rebate decisions. We derive three equilibria: the no-rebate, organic-review equilibrium; the low-rebate, boosted-authentic-review equilibrium; and the high-rebate, partially-fake-review equilibrium. We …

Go to article

Learning Knowledge-Enriched Company Embeddings For Investment Management, Gary Ang, Ee-Peng Lim Nov 2021

Learning Knowledge-Enriched Company Embeddings For Investment Management, Gary Ang, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

Relationships between companies serve as key channels through which the effects of past stock price movements and news events propagate and influence future price movements. Such relationships can be implicitly found in knowledge bases or explicitly represented as knowledge graphs. In this paper, we propose KnowledgeEnriched Company Embedding (KECE), a novel multi-stage attentionbased dynamic network embedding model combining multimodal information of companies with knowledge from Wikipedia and knowledge graph relationships from Wikidata to generate company entity embeddings that can be applied to a variety of downstream investment management tasks. Experiments on an extensive set of real-world stock prices and news …

Go to article

Factual Consistency Evaluation For Text Summarization Via Counterfactual Estimation, Yuexiang Xie, Fei Sun, Yang Deng, Yaliang Li, Bolin Ding Nov 2021

Factual Consistency Evaluation For Text Summarization Via Counterfactual Estimation, Yuexiang Xie, Fei Sun, Yang Deng, Yaliang Li, Bolin Ding

Research Collection School Of Computing and Information Systems

Despite significant progress has been achieved in text summarization, factual inconsistency in generated summaries still severely limits its practical applications. Among the key factors to ensure factual consistency, a reliable automatic evaluation metric is the first and the most crucial one. However, existing metrics either neglect the intrinsic cause of the factual inconsistency or rely on auxiliary tasks, leading to an unsatisfied correlation with human judgments or increasing the inconvenience of usage in practice. In light of these challenges, we propose a novel metric to evaluate the factual consistency in text summarization via counterfactual estimation, which formulates the causal relationship …

Go to article

Exploiting Reasoning Chains For Multi-Hop Science Question Answering, Weiwen Xu, Yang Deng, Huihui Zhang, Deng Cai, Wai Lam Nov 2021

Exploiting Reasoning Chains For Multi-Hop Science Question Answering, Weiwen Xu, Yang Deng, Huihui Zhang, Deng Cai, Wai Lam

Research Collection School Of Computing and Information Systems

We propose a novel Chain Guided Retrieverreader (CGR) framework to model the reasoning chain for multi-hop Science Question Answering. Our framework is capable of performing explainable reasoning without the need of any corpus-specific annotations, such as the ground-truth reasoning chain, or humanannotated entity mentions. Specifically, we first generate reasoning chains from a semantic graph constructed by Abstract Meaning Representation of retrieved evidence facts. A Chain-aware loss, concerning both local and global chain information, is also designed to enable the generated chains to serve as distant supervision signals for training the retriever, where reinforcement learning is also adopted to maximize the …

Go to article

On Lexicographic Proof Rules For Probabilistic Termination, Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný, Jiří Zárevucký, Dorde Zikelic Nov 2021

On Lexicographic Proof Rules For Probabilistic Termination, Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný, Jiří Zárevucký, Dorde Zikelic

Research Collection School Of Computing and Information Systems

We consider the almost-sure (a.s.) termination problem for probabilistic programs, which are a stochastic extension of classical imperative programs. Lexicographic ranking functions provide a sound and practical approach for termination of non-probabilistic programs, and their extension to probabilistic programs is achieved via lexicographic ranking supermartingales (LexRSMs). However, LexRSMs introduced in the previous work have a limitation that impedes their automation: all of their components have to be non-negative in all reachable states. This might result in LexRSM not existing even for simple terminating programs. Our contributions are twofold: First, we introduce a generalization of LexRSMs which allows for some components …

Go to article

Wav-Bert: Cooperative Acoustic And Linguistic Representation Learning For Low-Resource Speech Recognition, Guolin Zheng, Yubei Xiao, Ke Gong, Pan Zhou, Xiaodan Liang, Liang Lin Nov 2021

Wav-Bert: Cooperative Acoustic And Linguistic Representation Learning For Low-Resource Speech Recognition, Guolin Zheng, Yubei Xiao, Ke Gong, Pan Zhou, Xiaodan Liang, Liang Lin

Research Collection School Of Computing and Information Systems

Unifying acoustic and linguistic representation learning has become increasingly crucial to transfer the knowledge learned on the abundance of high-resource language data for low-resource speech recognition. Existing approaches simply cascade pre-trained acoustic and language models to learn the transfer from speech to text. However, how to solve the representation discrepancy of speech and text is unexplored, which hinders the utilization of acoustic and linguistic information. Moreover, previous works simply replace the embedding layer of the pre-trained language model with the acoustic features, which may cause the catastrophic forgetting problem. In this work, we introduce Wav-BERT, a cooperative acoustic and linguistic …

Go to article

Aspect-Based Sentiment Analysis In Question Answering Forums, Wenxuan Zhang, Yang Deng, Xin Li, Lidong Bing, Wai Lam Nov 2021

Aspect-Based Sentiment Analysis In Question Answering Forums, Wenxuan Zhang, Yang Deng, Xin Li, Lidong Bing, Wai Lam

Research Collection School Of Computing and Information Systems

Aspect-based sentiment analysis (ABSA) typically focuses on extracting aspects and predicting their sentiments on individual sentences such as customer reviews. Recently, another kind of opinion sharing platform, namely question answering (QA) forum, has received increasing popularity, which accumulates a large number of user opinions towards various aspects. This motivates us to investigate the task of ABSA on QA forums (ABSA-QA), aiming to jointly detect the discussed aspects and their sentiment polarities for a given QA pair. Unlike review sentences, a QA pair is composed of two parallel sentences, which requires interaction modeling to align the aspect mentioned in the question …

Go to article

Aspect Sentiment Quad Prediction As Paraphrase Generation, Wenxuan Zhang, Yang Deng, Xin Li, Yifei Yuan, Lidong Bing, Wai Lam Nov 2021

Aspect Sentiment Quad Prediction As Paraphrase Generation, Wenxuan Zhang, Yang Deng, Xin Li, Yifei Yuan, Lidong Bing, Wai Lam

Research Collection School Of Computing and Information Systems

Aspect-based sentiment analysis (ABSA) has been extensively studied in recent years, which typically involves four fundamental sentiment elements, including the aspect category, aspect term, opinion term, and sentiment polarity. Existing studies usually consider the detection of partial sentiment elements, instead of predicting the four elements in one shot. In this work, we introduce the Aspect Sentiment Quad Prediction (ASQP) task, aiming to jointly detect all sentiment elements in quads for a given opinionated sentence, which can reveal a more comprehensive and complete aspect-level sentiment structure. We further propose a novel Paraphrase modeling paradigm to cast the ASQP task to a …

Go to article

Where2change: Change Request Localization For App Reviews, Tao Zhang, Jiachi Chen, Xian Zhan, Xiapu Luo, David Lo, He Jiang Nov 2021

Where2change: Change Request Localization For App Reviews, Tao Zhang, Jiachi Chen, Xian Zhan, Xiapu Luo, David Lo, He Jiang

Research Collection School Of Computing and Information Systems

Million of mobile apps have been released to the market. Developers need to maintain these apps so that they can continue to benefit end users. Developers usually extract useful information from user reviews to maintain and evolve mobile apps. One of the important activities that developers need to do while reading user reviews is to locate the source code related to requested changes. Unfortunately, this manual work is costly and time consuming since: (1) an app can receive thousands of reviews, and (2) a mobile app can consist of hundreds of source code files. To address this challenge, Palomba et …

Go to article

Towards Balancing Vr Immersion And Bystander Awareness, Yoshiki Kudo, Anthony Tang, Kazuyuki Fujita, Isamu Endo, Kazuki Takashima, Yoshifumi Kitamura Nov 2021

Towards Balancing Vr Immersion And Bystander Awareness, Yoshiki Kudo, Anthony Tang, Kazuyuki Fujita, Isamu Endo, Kazuki Takashima, Yoshifumi Kitamura

Research Collection School Of Computing and Information Systems

Head-mounted displays (HMDs) increase immersion into virtual worlds. The problem is that this limits headset users' awareness of bystanders: headset users cannot attend to bystanders' presence and activities. We call this the HMD boundary. We explore how to make the HMD boundary permeable by comparing different ways of providing informal awareness cues to the headset user about bystanders. We adapted and implemented three visualization techniques (Avatar View, Radar and Presence++) that share bystanders' location and orientation with headset users. We conducted a hybrid user and simulation study with three different types of VR content (high, medium, low interactivity) with twenty …

Go to article

First Prev Next Last