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

Numerical Analysis and Scientific Computing Commons™

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

Singapore Management University

Discipline
Keyword
Publication Year
Publication
Publication Type

Articles 271 - 300 of 1060

Full-Text Articles in Numerical Analysis and Scientific Computing

Social Media Analytics: A Case Study Of Singapore General Election 2020, Sebastian Zhi Tao Khoo, Leong Hock Ho, Ee Hong Lee, Danston Kheng Boon Goh, Zehao Zhang, Swee Hong Ng, Haodi Qi, Kyong Jin Shim Dec 2020

Social Media Analytics: A Case Study Of Singapore General Election 2020, Sebastian Zhi Tao Khoo, Leong Hock Ho, Ee Hong Lee, Danston Kheng Boon Goh, Zehao Zhang, Swee Hong Ng, Haodi Qi, Kyong Jin Shim

Research Collection School Of Computing and Information Systems

The 2020 Singaporean General Election (GE2020) was a general election held in Singapore on July 10, 2020. In this study, we present an analysis on social conversations about GE2020 during the election period. We analyzed social conversations from popular platforms such as Twitter, HardwareZone, and TR Emeritus.

Go to article

Variational Bayesian Inference For Crowdsourcing Predictions, Desmond Cai, Duc Thien Nguyen, Shiau Hong Lim, Laura Wynter Dec 2020

Variational Bayesian Inference For Crowdsourcing Predictions, Desmond Cai, Duc Thien Nguyen, Shiau Hong Lim, Laura Wynter

Research Collection School Of Computing and Information Systems

Crowdsourcing has emerged as an effective means for performing a number of machine learning tasks such as annotation and labelling of images and other data sets. In most early settings of crowdsourcing, the task involved classification, that is assigning one of a discrete set of labels to each task. Recently, however, more complex tasks have been attempted including asking crowdsource workers to assign continuous labels, or predictions. In essence, this involves the use of crowdsourcing for function estimation. We are motivated by this problem to drive applications such as collaborative prediction, that is, harnessing the wisdom of the crowd to …

Go to article

Analysis Of Online Posts To Discover Student Learning Challenges And Inform Targeted Curriculum Improvement Actions, Michelle L. F. Cheong, Jean Y. C. Chen, Bingtian Dai Dec 2020

Analysis Of Online Posts To Discover Student Learning Challenges And Inform Targeted Curriculum Improvement Actions, Michelle L. F. Cheong, Jean Y. C. Chen, Bingtian Dai

Research Collection School Of Computing and Information Systems

Past research on analysing end-of-term student feedback tend to result in only high-level course improvement suggestions, and some recent research even argued that student feedback is a poor indicator of teaching effectiveness and student learning. Our intelligent Q&A platform with machine learning prediction and engagement features allow students to ask self-directed questions and provide answers in an out-of-class informal setting. By analysing such high quality and truthful posts which represent the students’ queries and knowledge about the course content, we can better identify the exact course topics which the students face learning challenges. We have implemented our Q&A platform for …

Go to article

The Spatial And Temporal Impact Of Agricultural Crop Residual Burning On Local Land Surface Temperature In Three Provinces Across China From 2015 To 2017, Wenting Zhang, Mengmeng Yu, Qingqing He, Tianwei Wang, Lu Lin, Kai Cao, Wei Huang, Peihong Fu, Jiaxin Chen Dec 2020

The Spatial And Temporal Impact Of Agricultural Crop Residual Burning On Local Land Surface Temperature In Three Provinces Across China From 2015 To 2017, Wenting Zhang, Mengmeng Yu, Qingqing He, Tianwei Wang, Lu Lin, Kai Cao, Wei Huang, Peihong Fu, Jiaxin Chen

Research Collection School Of Computing and Information Systems

China has suffered from severe crop residue burning (CRB) for a long time. As a type of biomass burning, CRB leads to a huge alteration in climate due to the emission of greenhouse gases and particulates in the atmosphere and damages to surface characteristics on land. At present, a growing body of research focuses on the impact of biomass burning (BB) (e.g., forest fire, grass fire, and CRB) on climate change from the aspect of atmospheric process. Meanwhile, a small number of research studies have started to pay attention on the damage caused by BB (e.g. forest fire) on land …

Go to article

Base-Package Recommendation Framework Based On Consumer Behaviours In Iptv Platform, Kuruparan Shanmugalingam, Ruwinda Ranganayanke, Chanka Gunawardhaha, Rajitha Navarathna Nov 2020

Base-Package Recommendation Framework Based On Consumer Behaviours In Iptv Platform, Kuruparan Shanmugalingam, Ruwinda Ranganayanke, Chanka Gunawardhaha, Rajitha Navarathna

Research Collection School Of Computing and Information Systems

Internet Protocol TeleVision (IPTV) provides many services such as live television streaming, time-shifted media, and Video On Demand (VOD). However, many customers do not engage properly with their subscribed packages due to a lack of knowledge and poor guidance. Many customers fail to identify the proper IPTV service package based on their needs and to utilise their current package to the maximum. In this paper, we propose a base-package recommendation model with a novel customer scoring-meter based on customers behaviour. Initially, our paper describes an algorithm to measure customers engagement score, which illustrates a novel approach to track customer engagement …

Go to article

Reducing Estimation Bias Via Triplet-Average Deep Deterministic Policy Gradient, Dongming Wu, Xingping Dong, Jianbing Shen, Steven C. H. Hoi Nov 2020

Reducing Estimation Bias Via Triplet-Average Deep Deterministic Policy Gradient, Dongming Wu, Xingping Dong, Jianbing Shen, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

The overestimation caused by function approximation is a well-known property in Q-learning algorithms, especially in single-critic models, which leads to poor performance in practical tasks. However, the opposite property, underestimation, which often occurs in Q-learning methods with double critics, has been largely left untouched. In this article, we investigate the underestimation phenomenon in the recent twin delay deep deterministic actor-critic algorithm and theoretically demonstrate its existence. We also observe that this underestimation bias does indeed hurt performance in various experiments. Considering the opposite properties of single-critic and double-critic methods, we propose a novel triplet-average deep deterministic policy gradient algorithm that …

Go to article

A Geospatial Analytics Approach To Delineate Trade Areas For Quick Service Restaurants (Qsr) In Singapore, Hui Ting Lim Nov 2020

A Geospatial Analytics Approach To Delineate Trade Areas For Quick Service Restaurants (Qsr) In Singapore, Hui Ting Lim

Research Collection School Of Computing and Information Systems

According to Huff, trade area is defined as “a geographically delineated region containing potential customers for whom there exists a probability greater than zero of their purchasing a given class of products or services offered for sale by a particular firm or by a particular agglomeration of firms”. Several methods to delineate a store trade area have been proposed over the years. For drive-time or travel distance analysis method, the trade area is delineated according to how far or how long the customers are willing to travel to patronise the store. Another commonly used method is the Huff Model which …

Go to article

Using Data Analytics To Predict Students Score, Nang Laik Ma, Gim Hong Chua Nov 2020

Using Data Analytics To Predict Students Score, Nang Laik Ma, Gim Hong Chua

Research Collection School Of Computing and Information Systems

Education is very important to Singapore, and the government has continued to invest heavily in our education system to become one of the world-class systems today. A strong foundation of Science, Technology, Engineering, and Mathematics (STEM) was what underpinned Singapore's development over the past 50 years. PISA is a triennial international survey that evaluates education systems worldwide by testing the skills and knowledge of 15-year-old students who are nearing the end of compulsory education. In this paper, the authors used the PISA data from 2012 and 2015 and developed machine learning techniques to predictive the students' scores and understand the …

Go to article

Learning Personal Conscientiousness From Footprints In E-Learning Systems, Lo Pang-Yun Ting, Shan Yun Teng, Kun Ta Chuang, Ee-Peng Lim Nov 2020

Learning Personal Conscientiousness From Footprints In E-Learning Systems, Lo Pang-Yun Ting, Shan Yun Teng, Kun Ta Chuang, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

Personality inference has received widespread attention for its potential to infer psychological well being, job satisfaction, romantic relationship success, and professional performance. In this research, we focus on Conscientiousness, one of the well studied Big Five personality traits, which determines if a person is self-disciplined, organized, and hard-working. Research has shown that Conscientiousness is related to a person's academic and workplace success. For an expert to evaluate a person's Conscientiousness, long-term observation of the person's behavior at work place or at home is usually required. To reduce this evaluation effort as well as to cope with the increasing trend of …

Go to article

Federated Topic Discovery: A Semantic Consistent Approach, Yexuan Shi, Yongxin Tong, Zhiyang Su, Di Jiang, Zimu Zhou, Wenbin Zhang Oct 2020

Federated Topic Discovery: A Semantic Consistent Approach, Yexuan Shi, Yongxin Tong, Zhiyang Su, Di Jiang, Zimu Zhou, Wenbin Zhang

Research Collection School Of Computing and Information Systems

General-purpose topic models have widespread industrial applications. Yet high-quality topic modeling is becoming increasingly challenging because accurate models require large amounts of training data typically owned by multiple parties, who are often unwilling to share their sensitive data for collaborative training without guarantees on their data privacy. To enable effective privacy-preserving multiparty topic modeling, we propose a novel federated general-purpose topic model named private and consistent topic discovery (PC-TD). On the one hand, PC-TD seamlessly integrates differential privacy in topic modeling to provide privacy guarantees on sensitive data of different parties. On the other hand, PC-TD exploits multiple sources of …

Go to article

We Mind Your Well-Being: Preventing Depression In Uncertain Social Networks By Sequential Interventions, Aye Phye Phye Aung, Xinrun Wang, Bo An, Xiaoli Li Oct 2020

We Mind Your Well-Being: Preventing Depression In Uncertain Social Networks By Sequential Interventions, Aye Phye Phye Aung, Xinrun Wang, Bo An, Xiaoli Li

Research Collection School Of Computing and Information Systems

Mental health has become a major concern according to WHO who estimates that more than 350 million people worldwide are affected by depression. Studies have shown that interventions and social support can reduce stress and depression. However, counselling centers do not have enough resources to provide counselling and social support to all the participants in their interest. This paper helps social support organizations (e.g., university counselling centers) sequentially select the participants for interventions. Unfortunately, previous works do not consider emotion propagation from other neighbours of the influencees and initial uncertainties of mental states and influence. Moreover, they fail to scale …

Go to article

Efficient Sampling Algorithms For Approximate Temporal Motif Counting, Jingjing Wang, Yanhao Wang, Wenjun Jiang, Yuchen Li, Kian-Lee Tan Oct 2020

Efficient Sampling Algorithms For Approximate Temporal Motif Counting, Jingjing Wang, Yanhao Wang, Wenjun Jiang, Yuchen Li, Kian-Lee Tan

Research Collection School Of Computing and Information Systems

A great variety of complex systems ranging from user interactions in communication networks to transactions in financial markets can be modeled as temporal graphs, which consist of a set of vertices and a series of timestamped and directed edges. Temporal motifs in temporal graphs are generalized from subgraph patterns in static graphs which take into account edge orderings and durations in addition to structures. Counting the number of occurrences of temporal motifs is a fundamental problem for temporal network analysis. However, existing methods either cannot support temporal motifs or suffer from performance issues. In this paper, we focus on approximate …

Go to article

Co2vec: Embeddings Of Co-Ordered Networks Based On Mutual Reinforcement, Meng-Fen Chiang, Ee-Peng Lim, Wang-Chien Lee, Philips Kokoh Prasetyo Oct 2020

Co2vec: Embeddings Of Co-Ordered Networks Based On Mutual Reinforcement, Meng-Fen Chiang, Ee-Peng Lim, Wang-Chien Lee, Philips Kokoh Prasetyo

Research Collection School Of Computing and Information Systems

We study the problem of representation learning for multiple types of entities in a co-ordered network where order relations exist among entities of the same type, and association relations exist across entities of different types. The key challenge in learning co-ordered network embedding is to preserve order relations among entities of the same type while leveraging on the general consistency in order relations between different entity types. In this paper, we propose an embedding model, CO2Vec, that addresses this challenge using mutually reinforced order dependencies. Specifically, CO2Vec explores in-direct order dependencies as supplementary evidence to enhance order representation learning across …

Go to article

European Floating Strike Lookback Options: Alpha Prediction And Generation Using Unsupervised Learning, Tristan Lim, Aldy Gunawan, Chin Sin Ong Oct 2020

European Floating Strike Lookback Options: Alpha Prediction And Generation Using Unsupervised Learning, Tristan Lim, Aldy Gunawan, Chin Sin Ong

Research Collection School Of Computing and Information Systems

This research utilized the intrinsic quality of European floating strike lookback call options, alongside selected return and volatility parameters, in a K-means clustering environment, to recommend an alpha generative trading strategy. The result is an elegant easy-to-use alpha strategy based on the option mechanisms which identifies investment assets with high degree of significance. In an upward trending market, the research had identified European floating strike lookback call option as an evaluative criterion and investable asset, which would both allow investors to predict and profit from alpha opportunities. The findings will be useful for (i) buy-side investors seeking alpha generation and/or …

Go to article

Deep Reinforcement Learning Approach To Solve Dynamic Vehicle Routing Problem With Stochastic Customers, Waldy Joe, Hoong Chuin Lau Oct 2020

Deep Reinforcement Learning Approach To Solve Dynamic Vehicle Routing Problem With Stochastic Customers, Waldy Joe, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

In real-world urban logistics operations, changes to the routes and tasks occur in response to dynamic events. To ensure customers’ demands are met, planners need to make these changes quickly (sometimes instantaneously). This paper proposes the formulation of a dynamic vehicle routing problem with time windows and both known and stochastic customers as a route-based Markov Decision Process. We propose a solution approach that combines Deep Reinforcement Learning (specifically neural networks-based TemporalDifference learning with experience replay) to approximate the value function and a routing heuristic based on Simulated Annealing, called DRLSA. Our approach enables optimized re-routing decision to be generated …

Go to article

Learning To Collaborate In Multi-Module Recommendation Via Multi-Agent Reinforcement Learning Without Communication, Xu He, An Bo, Yanghua Li, Haikai Chen, Rundong Wang, Xinrun Wang, Runsheng Yu, Xin Li, Zhirong Wang Sep 2020

Learning To Collaborate In Multi-Module Recommendation Via Multi-Agent Reinforcement Learning Without Communication, Xu He, An Bo, Yanghua Li, Haikai Chen, Rundong Wang, Xinrun Wang, Runsheng Yu, Xin Li, Zhirong Wang

Research Collection School Of Computing and Information Systems

With the rise of online e-commerce platforms, more and more customers prefer to shop online. To sell more products, online platforms introduce various modules to recommend items with different properties such as huge discounts. A web page often consists of different independent modules. The ranking policies of these modules are decided by different teams and optimized individually without cooperation, which might result in competition between modules. Thus, the global policy of the whole page could be sub-optimal. In this paper, we propose a novel multi-agent cooperative reinforcement learning approach with the restriction that different modules cannot communicate. Our contributions are …

Go to article

A Hybrid Framework Using A Qubo Solver For Permutation-Based Combinatorial Optimization, Siong Thye Goh, Sabrish Gopalakrishnan, Jianyuan Bo, Hoong Chuin Lau Sep 2020

A Hybrid Framework Using A Qubo Solver For Permutation-Based Combinatorial Optimization, Siong Thye Goh, Sabrish Gopalakrishnan, Jianyuan Bo, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

In this paper, we propose a hybrid framework to solve large-scale permutation-based combinatorial problems effectively using a high-performance quadratic unconstrained binary optimization (QUBO) solver. To do so, transformations are required to change a constrained optimization model to an unconstrained model that involves parameter tuning. We propose techniques to overcome the challenges in using a QUBO solver that typically comes with limited numbers of bits. First, to smooth the energy landscape, we reduce the magnitudes of the input without compromising optimality. We propose a machine learning approach to tune the parameters for good performance effectively. To handle possible infeasibility, we introduce …

Go to article

A Unified Framework For Sparse Online Learning, Peilin Zhao, Dayong Wong, Pengcheng Wu, Steven C. H. Hoi Aug 2020

A Unified Framework For Sparse Online Learning, Peilin Zhao, Dayong Wong, Pengcheng Wu, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

The amount of data in our society has been exploding in the era of big data. This article aims to address several open challenges in big data stream classification. Many existing studies in data mining literature follow the batch learning setting, which suffers from low efficiency and poor scalability. To tackle these challenges, we investigate a unified online learning framework for the big data stream classification task. Different from the existing online data stream classification techniques, we propose a unified Sparse Online Classification (SOC) framework. Based on SOC, we derive a second-order online learning algorithm and a cost-sensitive sparse online …

Go to article

Accelerating Exact Constrained Shortest Paths On Gpus, Shengliang Lu, Bingsheng He, Yuchen Li, Hao Fu Aug 2020

Accelerating Exact Constrained Shortest Paths On Gpus, Shengliang Lu, Bingsheng He, Yuchen Li, Hao Fu

Research Collection School Of Computing and Information Systems

The recently emerging applications such as software-defined networks and autonomous vehicles require efficient and exact solutions for constrained shortest paths (CSP), which finds the shortest path in a graph while satisfying some user-defined constraints. Compared with the common shortest path problems without constraints, CSP queries have a significantly larger number of subproblems. The most widely used labeling algorithm becomes prohibitively slow and impractical. Other existing approaches tend to find approximate solutions and build costly indices on graphs for fast query processing, which are not suitable for emerging applications with the requirement of exact solutions. A natural question is whether and …

Go to article

A Systematic Density-Based Clustering Method Using Anchor Points, Yizhang Wang, Di Wang, Wei Pang, Ah-Hwee Tan, You Zhou Aug 2020

A Systematic Density-Based Clustering Method Using Anchor Points, Yizhang Wang, Di Wang, Wei Pang, Ah-Hwee Tan, You Zhou

Research Collection School Of Computing and Information Systems

Clustering is an important unsupervised learning method in machine learning and data mining. Many existing clustering methods may still face the challenge in self-identifying clusters with varying shapes, sizes and densities. To devise a more generic clustering method that considers all the aforementioned properties of the natural clusters, we propose a novel clustering algorithm named Anchor Points based Clustering (APC). The anchor points in APC are characterized by having a relatively large distance from data points with higher densities. We take anchor points as centers to obtain intermediate clusters, which can divide the whole dataset more appropriately so as to …

Go to article

Intersentiment: Combining Deep Neural Models On Interaction And Sentiment For Review Rating Prediction, Shi Feng, Kaisong Song, Daling Wang, Wei Gao, Yifei Zhang Aug 2020

Intersentiment: Combining Deep Neural Models On Interaction And Sentiment For Review Rating Prediction, Shi Feng, Kaisong Song, Daling Wang, Wei Gao, Yifei Zhang

Research Collection School Of Computing and Information Systems

Review rating prediction is commonly approached from the perspective of either Collaborative Filtering (CF) or Sentiment Classification (SC). CF-based approach usually resorts to matrix factorization based on user–item interaction, and does not fully utilize the valuable review text features. In contrast, SC-based approach is focused on mining review content, but can just incorporate some user- and product-level features, and fails to capture sufficient interactions between them represented typically in a sparse matrix as CF can do. In this paper, we propose a novel, extensible review rating prediction model called InterSentiment by bridging the user-product interaction model and the sentiment model …

Go to article

Next-Term Grade Prediction: A Machine Learning Approach, Audrey Tedja Widjaja, Lei Wang, Nghia Truong Trong, Aldy Gunawan, Ee-Peng Lim Jul 2020

Next-Term Grade Prediction: A Machine Learning Approach, Audrey Tedja Widjaja, Lei Wang, Nghia Truong Trong, Aldy Gunawan, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

As students progress in their university programs, they have to face many course choices. It is important for them to receive guidance based on not only their interest, but also the "predicted" course performance so as to improve learning experience and optimise academic performance. In this paper, we propose the next-term grade prediction task as a useful course selection guidance. We propose a machine learning framework to predict course grades in a specific program term using the historical student-course data. In this framework, we develop the prediction model using Factorization Machine (FM) and Long Short Term Memory combined with FM …

Go to article

A Systematic Media Frame Analysis Of 1.5 Million New York Times Articles From 2000 To 2017, Haewoon Kwak, Jisun An Jul 2020

A Systematic Media Frame Analysis Of 1.5 Million New York Times Articles From 2000 To 2017, Haewoon Kwak, Jisun An

Research Collection School Of Computing and Information Systems

Framing is an indispensable narrative device for news media because even the same facts may lead to conflicting understandings if deliberate framing is employed. Therefore, identifying media framing is a crucial step to understanding how news media influence the public. Framing is, however, difficult to operationalize and detect, and thus traditional media framing studies had to rely on manual annotation, which is challenging to scale up to massive news datasets. Here, by developing a media frame classifier that achieves state-of-the-art performance, we systematically analyze the media frames of 1.5 million New York Times articles published from 2000 to 2017. By …

Go to article

Busting Myths And Dispelling Doubts About Covid-19, Mark Findlay Jul 2020

Busting Myths And Dispelling Doubts About Covid-19, Mark Findlay

Research Collection Yong Pung How School Of Law

The Centre for AI and Data Governance (CAIDG) at Singapore Management University (SMU) has embarked over past months on a programme of research designed to confront concerns about the pandemic and its control. Our interest is primarily directed to the ways in which AI-assisted technologies and mass data sharing have become a feature of pandemic control strategies. We want to know what impact these developments are having on community confidence and health safety. In developing this work, we have come across many myths that need busting.

Go to article

Gpu-Accelerated Subgraph Enumeration On Partitioned Graphs, Wentian Guo, Yuchen Li, Mo Sha, Bingsheng He, Xiaokui Xiao, Kian-Lee Tan Jun 2020

Gpu-Accelerated Subgraph Enumeration On Partitioned Graphs, Wentian Guo, Yuchen Li, Mo Sha, Bingsheng He, Xiaokui Xiao, Kian-Lee Tan

Research Collection School Of Computing and Information Systems

Subgraph enumeration is important for many applications such as network motif discovery and community detection. Recent works utilize graphics processing units (GPUs) to parallelize subgraph enumeration, but they can only handle graphs that fit into the GPU memory. In this paper, we propose a new approach for GPU-accelerated subgraph enumeration that can efficiently scale to large graphs beyond the GPU memory. Our approach divides the graph into partitions, each of which fits into the GPU memory. The GPU processes one partition at a time and searches the matched subgraphs of a given pattern (i.e., instances) within the partition as in …

Go to article

Adaptive Loss-Aware Quantization For Multi-Bit Networks, Zhongnan Qu, Zimu Zhou, Yun Cheng, Lothar Thiele Jun 2020

Adaptive Loss-Aware Quantization For Multi-Bit Networks, Zhongnan Qu, Zimu Zhou, Yun Cheng, Lothar Thiele

Research Collection School Of Computing and Information Systems

We investigate the compression of deep neural networks by quantizing their weights and activations into multiple binary bases, known as multi-bit networks (MBNs), which accelerate the inference and reduce the storage for the deployment on low-resource mobile and embedded platforms. We propose Adaptive Loss-aware Quantization (ALQ), a new MBN quantization pipeline that is able to achieve an average bitwidth below one-bit without notable loss in inference accuracy. Unlike previous MBN quantization solutions that train a quantizer by minimizing the error to reconstruct full precision weights, ALQ directly minimizes the quantizationinduced error on the loss function involving neither gradient approximation nor …

Go to article

Empirical Evaluation Of Three Common Assumptions In Building Political Media Bias Datasets, Soumen Ganguly, Juhi Kulshrestha, Jisun An, Haewoon Kwak Jun 2020

Empirical Evaluation Of Three Common Assumptions In Building Political Media Bias Datasets, Soumen Ganguly, Juhi Kulshrestha, Jisun An, Haewoon Kwak

Research Collection School Of Computing and Information Systems

In this work, we empirically validate three common assumptions in building political media bias datasets, which are (i) labelers' political leanings do not affect labeling tasks, (ii) news articles follow their source outlet's political leaning, and (iii) political leaning of a news outlet is stable across different topics. We build a ground-truth dataset of manually annotated article-level political leaning and validate the three assumptions. Our findings warn that the three assumptions could be invalid even for a small dataset. We hope that our work calls attention to the (in)validity of common assumptions in building political media bias datasets.

Go to article

Are These Comments Triggering? Predicting Triggers Of Toxicity In Online Discussions, Hind Almerekhi, Haewoon Kwak, Joni Salminen, Bernard J. Jansen Apr 2020

Are These Comments Triggering? Predicting Triggers Of Toxicity In Online Discussions, Hind Almerekhi, Haewoon Kwak, Joni Salminen, Bernard J. Jansen

Research Collection School Of Computing and Information Systems

Understanding the causes or triggers of toxicity adds a new dimension to the prevention of toxic behavior in online discussions. In this research, we define toxicity triggers in online discussions as a non-toxic comment that lead to toxic replies. Then, we build a neural network-based prediction model for toxicity trigger. The prediction model incorporates text-based features and derived features from previous studies that pertain to shifts in sentiment, topic flow, and discussion context. Our findings show that triggers of toxicity contain identifiable features and that incorporating shift features with the discussion context can be detected with a ROC-AUC score of …

Go to article

Text Analytics, Nlp, And Accounting Research, Richard M. Crowley Apr 2020

Text Analytics, Nlp, And Accounting Research, Richard M. Crowley

Research Collection School Of Accountancy

The presentation covered: What is text analytics and NLP?; How text analytics has evolved in the accounting literature since the 1980s; What current (as of 2020) methods are used in the literature; What methods are on the horizon.

Go to article

Understanding The Relation Between Repeat Developer Interactions And Bug Resolution Times In Large Open Source Ecosystems: A Multisystem Study, Subhajit Datta, Reshma Roychoudhuri, Subhashis Majumder Apr 2020

Understanding The Relation Between Repeat Developer Interactions And Bug Resolution Times In Large Open Source Ecosystems: A Multisystem Study, Subhajit Datta, Reshma Roychoudhuri, Subhashis Majumder

Research Collection School Of Computing and Information Systems

Large‐scale software systems are being increasingly built by distributed teams of developers who interact across geographies and time zones. Ensuring smooth knowledge transfer and the percolation of skills within and across such teams remain key challenges for organizations. Towards addressing this challenge, organizations often grapple with questions around whether and how repeat collaborations between members of a team relate to outcomes of important activities. In the context of this paper, the word ‘repeat interaction’ does not imply a greater number of interactions; it refers to repeat interaction between a pair of developers who have collaborated before. In this paper, we …

Go to article

First Prev Next Last