Open Access. Powered by Scholars. Published by Universities.®
Numerical Analysis and Scientific Computing Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Databases and Information Systems (661)
- Social and Behavioral Sciences (156)
- Artificial Intelligence and Robotics (111)
- Communication (89)
- Social Media (78)
-
- Engineering (65)
- Business (57)
- Software Engineering (56)
- Operations Research, Systems Engineering and Industrial Engineering (54)
- Theory and Algorithms (50)
- Public Affairs, Public Policy and Public Administration (46)
- Transportation (39)
- Graphics and Human Computer Interfaces (20)
- E-Commerce (19)
- Asian Studies (18)
- International and Area Studies (18)
- Education (17)
- Information Security (16)
- Medicine and Health Sciences (16)
- Finance and Financial Management (12)
- Environmental Sciences (11)
- Data Science (9)
- Communication Technology and New Media (8)
- Computer Engineering (7)
- Educational Assessment, Evaluation, and Research (7)
- Higher Education (7)
- Arts and Humanities (6)
- Keyword
-
- Social media (28)
- Data mining (26)
- Twitter (22)
- Query processing (19)
- Machine learning (18)
-
- Online learning (16)
- Classification (15)
- Deep learning (15)
- Sentiment analysis (14)
- Feature extraction (13)
- Neural networks (13)
- Reinforcement learning (13)
- Algorithms (12)
- MITB student (12)
- Algorithm (10)
- Artificial intelligence (10)
- Natural language processing (10)
- Text mining (10)
- Visualization (9)
- Analytics (8)
- Data structures (8)
- Spatial databases (8)
- Topic model (8)
- Clustering (7)
- Deep Learning (7)
- Location-based services (7)
- Optimization (7)
- Recommender systems (7)
- Spatial database (7)
- Data analysis (6)
- Publication Year
Articles 271 - 300 of 1024
Full-Text Articles in Numerical Analysis and Scientific Computing
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
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 …
A Hybrid Framework Using A Qubo Solver For Permutation-Based Combinatorial Optimization, Siong Thye Goh, Sabrish Gopalakrishnan, Jianyuan Bo, Hoong Chuin Lau
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 …
A Unified Framework For Sparse Online Learning, Peilin Zhao, Dayong Wong, Pengcheng Wu, Steven C. H. Hoi
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 …
Accelerating Exact Constrained Shortest Paths On Gpus, Shengliang Lu, Bingsheng He, Yuchen Li, Hao Fu
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 …
A Systematic Density-Based Clustering Method Using Anchor Points, Yizhang Wang, Di Wang, Wei Pang, Ah-Hwee Tan, You Zhou
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 …
Intersentiment: Combining Deep Neural Models On Interaction And Sentiment For Review Rating Prediction, Shi Feng, Kaisong Song, Daling Wang, Wei Gao, Yifei Zhang
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 …
Next-Term Grade Prediction: A Machine Learning Approach, Audrey Tedja Widjaja, Lei Wang, Nghia Truong Trong, Aldy Gunawan, Ee-Peng Lim
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 …
A Systematic Media Frame Analysis Of 1.5 Million New York Times Articles From 2000 To 2017, Haewoon Kwak, Jisun An
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 …
Gpu-Accelerated Subgraph Enumeration On Partitioned Graphs, Wentian Guo, Yuchen Li, Mo Sha, Bingsheng He, Xiaokui Xiao, Kian-Lee Tan
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 …
Adaptive Loss-Aware Quantization For Multi-Bit Networks, Zhongnan Qu, Zimu Zhou, Yun Cheng, Lothar Thiele
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 …
Empirical Evaluation Of Three Common Assumptions In Building Political Media Bias Datasets, Soumen Ganguly, Juhi Kulshrestha, Jisun An, Haewoon Kwak
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.
Are These Comments Triggering? Predicting Triggers Of Toxicity In Online Discussions, Hind Almerekhi, Haewoon Kwak, Joni Salminen, Bernard J. Jansen
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 …
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
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 …
Incorporating A Reverse Logistics Scheme In A Vehicle Routing Problem With Cross-Docking Network: A Modelling Approach, Audrey Tedja Widjaja, Aldy Gunawan, Panca Jodiawan, Vincent F. Yu
Incorporating A Reverse Logistics Scheme In A Vehicle Routing Problem With Cross-Docking Network: A Modelling Approach, Audrey Tedja Widjaja, Aldy Gunawan, Panca Jodiawan, Vincent F. Yu
Research Collection School Of Computing and Information Systems
Reverse logistics has been implemented by various companies because of its ability to gain more profit and maintain the competitiveness of the company. However, extensive studies on the vehicle routing problem with cross-docking (VRPCD) only considered the forward flow instead of the reverse flow. Motivated by the ability of a VRPCD network to minimize the distribution cost in the forward flow, this research incorporates the reverse logistics scheme in a VRPCD network, namely the VRP with reverse cross-docking (VRP-RCD). We propose a VRP-RCD mathematical model for a four-level supply chain network that involves suppliers, cross-dock, customers, and outlets. The main …
Designing A Smart Internet Of Things Solution For Point Of Use Water Filtration Management System In Residential, Commercial And Public Settings, Tristan Lim, Hwee-Pink Tan, Chin Sin Ong, Rahul Belani, Siddhant S. K. Agrawal
Designing A Smart Internet Of Things Solution For Point Of Use Water Filtration Management System In Residential, Commercial And Public Settings, Tristan Lim, Hwee-Pink Tan, Chin Sin Ong, Rahul Belani, Siddhant S. K. Agrawal
Research Collection School Of Computing and Information Systems
The use of water filtration Point-of-Use (POU) systems are extensive, ranging from water dispensers in public estates, to household POU water systems. Manufacturers typically recommend filtration cartridges to be changed (i) after their useful life, or (ii) when the water flow volume have exceeded certain capacity, whichever is earlier. However, filtration mechanisms are typically not changed with sufficient regularity. Overused filters can result in negative health effects, over and above the deterioration and loss of filtration benefits of the POU water system. Presently most existing water purification systems do not have smart connected Internet of Things (IoT) means of informing …
Statistical Modeling Of Harassment Against Reddit Moderators, Hamad Bin Khalifa University, Haewoon Kwak
Statistical Modeling Of Harassment Against Reddit Moderators, Hamad Bin Khalifa University, Haewoon Kwak
Research Collection School Of Computing and Information Systems
Despite the dedication that some volunteer moderators of online communities display when performing their moderation duties, they become targets of hate and harassment by other users. To understand what causes the change in moderator role from heroes to victims, we analyze the responses of 1,818 moderators on Reddit to an online survey about moderation practices and harassment. We built a statistical model and found 6 significant independent variables that affect harassment on moderators, such as the knowledge of community norms, which increases harassment on moderators the most. Our findings imply that vulnerable moderators in toxic communities need countermeasures against harassment.
Heartquake: Accurate Low-Cost Non-Invasive Ecg Monitoring Using Bed-Mounted Geophones, Jaeyeon Park, Hyeon Cho, Rajesh Krishna Balan, Jeonggil Ko
Heartquake: Accurate Low-Cost Non-Invasive Ecg Monitoring Using Bed-Mounted Geophones, Jaeyeon Park, Hyeon Cho, Rajesh Krishna Balan, Jeonggil Ko
Research Collection School Of Computing and Information Systems
This work presents HeartQuake, a low cost, accurate, non-intrusive, geophone-based sensing system for extracting accurate electrocardiogram (ECG) patterns using heartbeat vibrations that penetrate through a bed mattress. In HeartQuake, cardiac activity-originated vibration patterns are captured on a geophone and sent to a server, where the data is filtered to remove the sensor's internal noise and passed on to a bidirectional long short term memory (Bi-LSTM) deep learning model for ECG waveform estimation. To the best of our knowledge, this is the first solution that can non-intrusively provide accurate ECG waveform characteristics instead of more basic abstract features such as the …
Pokeme: Applying Context-Driven Notifications To Increase Worker Engagement In Mobile Crowd-Sourcing, Thivya Kandappu, Abhinav Mehrotra, Archan Misra, Mirco Musolesi, Shih-Fen Cheng, Lakmal Buddika Meegahapola
Pokeme: Applying Context-Driven Notifications To Increase Worker Engagement In Mobile Crowd-Sourcing, Thivya Kandappu, Abhinav Mehrotra, Archan Misra, Mirco Musolesi, Shih-Fen Cheng, Lakmal Buddika Meegahapola
Research Collection School Of Computing and Information Systems
In mobile crowd-sourcing systems, simply relying on people to opportunistically select and perform tasks typically leads to drawbacks such as low task acceptance/completion rates and undesirable spatial skews. In this paper, we utilize data from "Smart Campus", a campus-based mobile crowd-sourcing platform, to empirically study and discover whether and how various context-aware notification strategies can help overcome such drawbacks. We first study worker interactions, in the absence of any notifications, to discover some spatio-temporal properties of task acceptance and completion. Based on these insights, we then experimentally demonstrate the effectiveness of two novel, non-personal, context-driven notification strategies, comparing the outcomes …
The Search For Optimal Oxygen Saturation Targets In Critically Ill: Patients Observational Data From Large Icu Databases, Willem Van Den Boom, Michael Hoy, Jagadish Sankaran, Mengru Liu, Haroun Chahed, Mengling Feng, Kay Choong See
The Search For Optimal Oxygen Saturation Targets In Critically Ill: Patients Observational Data From Large Icu Databases, Willem Van Den Boom, Michael Hoy, Jagadish Sankaran, Mengru Liu, Haroun Chahed, Mengling Feng, Kay Choong See
Research Collection School Of Computing and Information Systems
Background: Although low oxygen saturations are generally regarded as deleterious, recent studies in ICU patients have shown that a liberal oxygen strategy increases mortality. However, the optimal oxygen saturation target remains unclear. The goal of this study was to determine the optimal range by using real-world data. Methods: Replicate retrospective analyses were conducted of two electronic medical record databases: the eICU Collaborative Research Database (eICU-CRD) and the Medical Information Mart for Intensive Care III database (MIMIC). Only patients with at least 48 h of oxygen therapy were included. Nonlinear regression was used to analyze the association between median pulse oximetry-derived …
Predicting Student Performance In Interactive Online Question Pools Using Mouse Interaction Features, Huan Wei, Haotian Li, Meng Xia, Yong Wang, Huamin Qu
Predicting Student Performance In Interactive Online Question Pools Using Mouse Interaction Features, Huan Wei, Haotian Li, Meng Xia, Yong Wang, Huamin Qu
Research Collection School Of Computing and Information Systems
Modeling student learning and further predicting the performance is a well-established task in online learning and is crucial to personalized education by recommending different learning resources to different students based on their needs. Interactive online question pools (e.g., educational game platforms), an important component of online education, have become increasingly popular in recent years. However, most existing work on student performance prediction targets at online learning platforms with a well-structured curriculum, predefined question order and accurate knowledge tags provided by domain experts. It remains unclear how to conduct student performance prediction in interactive online question pools without such well-organized question …
Social Influence Does Matter: User Action Prediction For In-Feed Advertising., Hongyang Wang, Qingfei Meng, Ju Fan, Yuchen Li, Laizhong Cui, Xiaoman Zhao, Chong Peng, Gong Chen Chen, Xiaoyong Du
Social Influence Does Matter: User Action Prediction For In-Feed Advertising., Hongyang Wang, Qingfei Meng, Ju Fan, Yuchen Li, Laizhong Cui, Xiaoman Zhao, Chong Peng, Gong Chen Chen, Xiaoyong Du
Research Collection School Of Computing and Information Systems
Social in-feed advertising delivers ads that seamlessly fit insidea user’s feed, and allows users to engage in social actions(likes or comments) with the ads. Many businesses payhigher attention to “engagement marketing” that maximizessocial actions, as social actions can effectively promote brandawareness. This paper studies social action prediction for infeedadvertising. Most existing works overlook the social influenceas a user’s action may be affected by her friends’actions. This paper introduces an end-to-end approach thatleverages social influence for action prediction, and focuseson addressing the high sparsity challenge for in-feed ads. Wepropose to learn influence structure that models who tendsto be influenced. We extract …
Multi-Level Head-Wise Match And Aggregation In Transformer For Textual Sequence Matching, Shuohang Wang, Yunshi Lan, Yi Tay, Jing Jiang, Jingjing Liu
Multi-Level Head-Wise Match And Aggregation In Transformer For Textual Sequence Matching, Shuohang Wang, Yunshi Lan, Yi Tay, Jing Jiang, Jingjing Liu
Research Collection School Of Computing and Information Systems
Transformer has been successfully applied to many natural language processing tasks. However, for textual sequence matching, simple matching between the representation of a pair of sequences might bring in unnecessary noise. In this paper, we propose a new approach to sequence pair matching with Transformer, by learning head-wise matching representations on multiple levels. Experiments show that our proposed approach can achieve new state-of-the-art performance on multiple tasks that rely only on pre-computed sequence-vectorrepresentation, such as SNLI, MNLI-match, MNLI-mismatch, QQP, and SQuAD-binary
Neural Approximate Dynamic Programming For On-Demand Ride-Pooling, Sanket Shah, Meghna Lowalekar, Pradeep Varakantham
Neural Approximate Dynamic Programming For On-Demand Ride-Pooling, Sanket Shah, Meghna Lowalekar, Pradeep Varakantham
Research Collection School Of Computing and Information Systems
On-demand ride-pooling (e.g., UberPool, LyftLine, GrabShare) has recently become popular because of its ability to lower costs for passengers while simultaneously increasing revenue for drivers and aggregation companies (e.g., Uber). Unlike in Taxi on Demand (ToD) services – where a vehicle is assigned one passenger at a time – in on-demand ride-pooling, each vehicle must simultaneously serve multiple passengers with heterogeneous origin and destination pairs without violating any quality constraints. To ensure near real-time response, existing solutions to the real-time ride-pooling problem are myopic in that they optimise the objective (e.g., maximise the number of passengers served) for the current …
Interpretable Rumor Detection In Microblogs By Attending To User Interactions, Ling Min Serena Khoo, Hai Leong Chieu, Zhong Qian, Jing Jiang
Interpretable Rumor Detection In Microblogs By Attending To User Interactions, Ling Min Serena Khoo, Hai Leong Chieu, Zhong Qian, Jing Jiang
Research Collection School Of Computing and Information Systems
We address rumor detection by learning to differentiate between the community’s response to real and fake claims in microblogs. Existing state-of-the-art models are based on tree models that model conversational trees. However, in social media, a user posting a reply might be replying to the entire thread rather than to a specific user. We propose a post-level attention model (PLAN) to model long distance interactions between tweets with the multi-head attention mechanism in a transformer network. We investigated variants of this model: (1) a structure aware self-attention model (StA-PLAN) that incorporates tree structure information in the transformer network, and (2) …
Entity-Sensitive Attention And Fusion Network For Entity-Level Multimodal Sentiment Classification, Jianfei Yu, Jing Jiang
Entity-Sensitive Attention And Fusion Network For Entity-Level Multimodal Sentiment Classification, Jianfei Yu, Jing Jiang
Research Collection School Of Computing and Information Systems
Entity-level (aka target-dependent) sentiment analysis of social media posts has recently attracted increasing attention, and its goal is to predict the sentiment orientations over individual target entities mentioned in users' posts. Most existing approaches to this task primarily rely on the textual content, but fail to consider the other important data sources (e.g., images, videos, and user profiles), which can potentially enhance these text-based approaches. Motivated by the observation, we study entity-level multimodal sentiment classification in this article, and aim to explore the usefulness of images for entity-level sentiment detection in social media posts. Specifically, we propose an Entity-Sensitive Attention …
Teacher-Student Networks With Multiple Decoders For Solving Math Word Problem, Jipeng Zhang, Roy Ka-Wei Lee, Ee-Peng Lim, Wei Qin, Lei Wang, Jie Shao, Qianru Sun
Teacher-Student Networks With Multiple Decoders For Solving Math Word Problem, Jipeng Zhang, Roy Ka-Wei Lee, Ee-Peng Lim, Wei Qin, Lei Wang, Jie Shao, Qianru Sun
Research Collection School Of Computing and Information Systems
Math word problem (MWP) is challenging due to the limitation in training data where only one “standard” solution is available. MWP models often simply fit this solution rather than truly understand or solve the problem. The generalization of models (to diverse word scenarios) is thus limited. To address this problem, this paper proposes a novel approach, TSN-MD, by leveraging the teacher network to integrate the knowledge of equivalent solution expressions and then to regularize the learning behavior of the student network. In addition, we introduce the multiple-decoder student network to generate multiple candidate solution expressions by which the final answer …
Vietnamese Punctuation Prediction Using Deep Neural Networks, Thuy Pham, Nhu Nguyen, Hong Quang Pham, Han Cao, Binh Nguyen
Vietnamese Punctuation Prediction Using Deep Neural Networks, Thuy Pham, Nhu Nguyen, Hong Quang Pham, Han Cao, Binh Nguyen
Research Collection School Of Computing and Information Systems
Adding appropriate punctuation marks into text is an essential step in speech-to-text where such information is usually not available. While this has been extensively studied for English, there is no large-scale dataset and comprehensive study in the punctuation prediction problem for the Vietnamese language. In this paper, we collect two massive datasets and conduct a benchmark with both traditional methods and deep neural networks. We aim to publish both our data and all implementation codes to facilitate further research, not only in Vietnamese punctuation prediction but also in other related fields. Our project, including datasets and implementation details, is publicly …
Clustering Models For Topic Analysis In Graduate Discussion Forums, Mallika Gokarn Nitin, Swapna Gottipati, Venky Shankararaman
Clustering Models For Topic Analysis In Graduate Discussion Forums, Mallika Gokarn Nitin, Swapna Gottipati, Venky Shankararaman
Research Collection School Of Computing and Information Systems
Discussion forums provide the base content for creating a knowledge repository. It contains discussion threads related to key course topics that are debated by the students. In order to better understand the student learning experience, the instructor needs to analyse these discussion threads. This paper proposes the use of clustering models and interactive visualizations to conduct a qualitative analysis of graduate discussion forums. Our goal is to identify the sub-topics and topic evolutions in the discussion forums by applying text mining techniques. Our approach generates insights into the topic analysis in the forums and discovers the students’ cognitive understanding within …
Tracking Political Events In Social Media: A Case Study Of Hong Kong Protests, Haodi Qi, Hanyu Jiang, Wende Bu, Chengzi Zhang, Kyong Jin Shim
Tracking Political Events In Social Media: A Case Study Of Hong Kong Protests, Haodi Qi, Hanyu Jiang, Wende Bu, Chengzi Zhang, Kyong Jin Shim
Research Collection School Of Computing and Information Systems
In this study, we analyze social conversations about Hong Kong Protests, a series of events that were widely seen and debated in social media in 2019. Our system collects data from Twitter and Reddit using their APIs. It performs sentiment analysis, and the analysis results show changes in public sentiment around major events. Social network analysis reveals influencers - users that are in the center of social conversations. Our interactive Tableau dashboard allows the user to easily monitor live social conversations about Hong Kong protests.
Learning To Self-Train For Semi-Supervised Few-Shot Classification, Xinzhe Li, Qianru Sun, Yaoyao Liu, Shibao Zheng, Qin Zhou, Tat-Seng Chua, Bernt Schiele
Learning To Self-Train For Semi-Supervised Few-Shot Classification, Xinzhe Li, Qianru Sun, Yaoyao Liu, Shibao Zheng, Qin Zhou, Tat-Seng Chua, Bernt Schiele
Research Collection School Of Computing and Information Systems
Few-shot classification (FSC) is challenging due to the scarcity of labeled training data (e.g. only one labeled data point per class). Meta-learning has shown to achieve promising results by learning to initialize a classification model for FSC. In this paper we propose a novel semi-supervised meta-learning method called learning to self-train (LST) that leverages unlabeled data and specifically meta-learns how to cherry-pick and label such unsupervised data to further improve performance. To this end, we train the LST model through a large number of semi-supervised few-shot tasks. On each task, we train a few-shot model to predict pseudo labels for …