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

Databases and Information Systems Commons™

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

Singapore Management University

Discipline
Keyword
Publication Year
Publication
Publication Type

Articles 1201 - 1230 of 3560

Full-Text Articles in Databases and Information Systems

Aim 2020 Challenge On Video Extreme Super-Resolution: Methods And Results, D. Fuoli, Zhiwu Huang, S. Gu, R. Timofte, A. Raventos, A. Esfandiari, S. Karout, X. Xu, X. Li, X. Xiong, J. Wang, Michelini P. Navarrete, W. Zhang, D. Zhang, H. Zhu, D. Xia, H. Chen, J. Gu, Z. Zhang, T. Zhao Aug 2020

Aim 2020 Challenge On Video Extreme Super-Resolution: Methods And Results, D. Fuoli, Zhiwu Huang, S. Gu, R. Timofte, A. Raventos, A. Esfandiari, S. Karout, X. Xu, X. Li, X. Xiong, J. Wang, Michelini P. Navarrete, W. Zhang, D. Zhang, H. Zhu, D. Xia, H. Chen, J. Gu, Z. Zhang, T. Zhao

Research Collection School Of Computing and Information Systems

This paper reviews the video extreme super-resolution challenge associated with the AIM 2020 workshop at ECCV 2020. Common scaling factors for learned video super-resolution (VSR) do not go beyond factor 4. Missing information can be restored well in this region, especially in HR videos, where the high-frequency content mostly consists of texture details. The task in this challenge is to upscale videos with an extreme factor of 16, which results in more serious degradations that also affect the structural integrity of the videos. A single pixel in the lowresolution (LR) domain corresponds to 256 pixels in the high-resolution (HR) domain. …


Measuring Privacy Concerns With Government Surveillance And Right-To-Be-Forgotten In Nomological Net Of Trust And Willingness-To-Share, Gaurav Bansal, Fiona Fui-Hoon Nah Aug 2020

Measuring Privacy Concerns With Government Surveillance And Right-To-Be-Forgotten In Nomological Net Of Trust And Willingness-To-Share, Gaurav Bansal, Fiona Fui-Hoon Nah

Research Collection School Of Computing and Information Systems

In the post Snowden revelations era, concerns related to government surveillance and oversight have come to the forefront. The ability of the Internet to remember “everything” (or forget anything) also raises a privacy concern associated with the “right to be forgotten”. Hence, in this paper, we propose and examine privacy concerns by extending the Hong and Thong’s (2013) model with the addition of two dimensions: right to be forgotten as well as government surveillance and oversight. We tested two different measurement models using privacy concerns as a second-order and a third-order construct within a nomological net that includes trusting beliefs …


Meta-Learning On Heterogeneous Information Networks For Cold-Start Recommendation, Yuanfu Lu, Yuan Fang, Chuan Shi Aug 2020

Meta-Learning On Heterogeneous Information Networks For Cold-Start Recommendation, Yuanfu Lu, Yuan Fang, Chuan Shi

Research Collection School Of Computing and Information Systems

Cold-start recommendation has been a challenging problem due to sparse user-item interactions for new users or items. Existing efforts have alleviated the cold-start issue to some extent, most of which approach the problem at the data level. Earlier methods often incorporate auxiliary data as user or item features, while more recent methods leverage heterogeneous information networks (HIN) to capture richer semantics via higher-order graph structures. On the other hand, recent meta-learning paradigm sheds light on addressing cold-start recommendation at the model level, given its ability to rapidly adapt to new tasks with scarce labeled data, or in the context of …


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 …


Learning Transferrable Parameters For Long-Tailed Sequential User Behavior Modeling, Jianwen Yin, Chenghao Liu, Weiqing Wang, Jianling Sun, Steven C. H. Hoi Aug 2020

Learning Transferrable Parameters For Long-Tailed Sequential User Behavior Modeling, Jianwen Yin, Chenghao Liu, Weiqing Wang, Jianling Sun, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

Sequential user behavior modeling plays a crucial role in online user-oriented services, such as product purchasing, news feed consumption, and online advertising. The performance of sequential modeling heavily depends on the scale and quality of historical behaviors. However, the number of user behaviors inherently follows a long-tailed distribution, which has been seldom explored. In this work, we argue that focusing on tail users could bring more benefits and address the long tails issue by learning transferrable parameters from both optimization and feature perspectives. Specifically, we propose a gradient alignment optimizer and adopt an adversarial training scheme to facilitate knowledge transfer …


An Attention-Based Rumor Detection Model With Tree-Structured Recursive Neural Networks, Jing Ma, Wei Gao, Shafiq Joty, Kam-Fai Wong Aug 2020

An Attention-Based Rumor Detection Model With Tree-Structured Recursive Neural Networks, Jing Ma, Wei Gao, Shafiq Joty, Kam-Fai Wong

Research Collection School Of Computing and Information Systems

Rumor spread in social media severely jeopardizes the credibility of online content. Thus, automatic debunking of rumors is of great importance to keep social media a healthy environment. While facing a dubious claim, people often dispute its truthfulness sporadically in their posts containing various cues, which can form useful evidence with long-distance dependencies. In this work, we propose to learn discriminative features from microblog posts by following their non-sequential propagation structure and generate more powerful representations for identifying rumors. For modeling non-sequential structure, we first represent the diffusion of microblog posts with propagation trees, which provide valuable clues on how …


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 …


An Ensemble Of Epoch-Wise Empirical Bayes For Few-Shot Learning, Yaoyao Liu, Bernt Schiele, Qianru Sun Aug 2020

An Ensemble Of Epoch-Wise Empirical Bayes For Few-Shot Learning, Yaoyao Liu, Bernt Schiele, Qianru Sun

Research Collection School Of Computing and Information Systems

Few-shot learning aims to train efficient predictive models with a few examples. The lack of training data leads to poor models that perform high-variance or low-confidence predictions. In this paper, we propose to meta-learn the ensemble of epoch-wise empirical Bayes models (E3BM) to achieve robust predictions. “Epoch-wise'' means that each training epoch has a Bayes model whose parameters are specifically learned and deployed. ”Empirical'' means that the hyperparameters, e.g., used for learning and ensembling the epoch-wise models, are generated by hyperprior learners conditional on task-specific data. We introduce four kinds of hyperprior learners by considering inductive vs. transductive, and epoch-dependent …


Interface Design Of Web-Based Educational Platforms For Young Students, Lurong He, Fiona Fui-Hoon Nah Aug 2020

Interface Design Of Web-Based Educational Platforms For Young Students, Lurong He, Fiona Fui-Hoon Nah

Research Collection School Of Computing and Information Systems

With the outbreak of the Covid-19 pandemic, almost all the school programs in the United States are closed. Most educational programs have moved online. Both teachers and students are facing challenges adapting to this new teaching and learning mode. This paper will focus on the interface design of webbased educational platforms for students and teachers from elementary and middle schools. The age of students from elementary and middle schools typically ranges from 5 to 13 years old. Their computer literacy level is still preliminary. So traditional online teaching platforms may not be appropriate for them. The design of learning systems …


A Generalised Bound For The Wiener Attack On Rsa, Willy Susilo, Joseph Tonien, Guomin Yang Aug 2020

A Generalised Bound For The Wiener Attack On Rsa, Willy Susilo, Joseph Tonien, Guomin Yang

Research Collection School Of Computing and Information Systems

Since Wiener pointed out that the RSA can be broken if the private exponent d is relatively small compared to the modulus N, it has been a general belief that the Wiener attack works for d


Love A Restaurant? Swipe Right On Foodrecce, Hady W. Lauw, Smu Office Of Research Jul 2020

Love A Restaurant? Swipe Right On Foodrecce, Hady W. Lauw, Smu Office Of Research

Research@SMU Infographics

A bunch of your friends wants to meet for dinner, but nobody can agree on where and what to eat? FoodRecce can help! FoodRecce is an app, developed under the Preferred.AI initiative, that provides recommendations on restaurants based on users' locations and past preferences.


Deep Learning For Real-World Object Detection, Xiongwei Wu Jul 2020

Deep Learning For Real-World Object Detection, Xiongwei Wu

Dissertations and Theses Collection (Open Access)

Despite achieving significant progresses, most existing detectors are designed to detect objects in academic contexts but consider little in real-world scenarios. In real-world applications, the scale variance of objects can be significantly higher than objects in academic contexts; In addition, existing methods are designed for achieving localization with relatively low precision, however more precise localization is demanded in real-world scenarios; Existing methods are optimized with huge amount of annotated data, but in certain real-world scenarios, only a few samples are available. In this dissertation, we aim to explore novel techniques to address these research challenges to make object detection algorithms …


Tree-Augmented Cross-Modal Encoding For Complex-Query Video Retrieval, Xun Yang, Jianfeng Dong, Yixin Cao, Xun Wang, Meng Wang, Tat-Seng Chua Jul 2020

Tree-Augmented Cross-Modal Encoding For Complex-Query Video Retrieval, Xun Yang, Jianfeng Dong, Yixin Cao, Xun Wang, Meng Wang, Tat-Seng Chua

Research Collection School Of Computing and Information Systems

The rapid growth of user-generated videos on the Internet has intensified the need for text-based video retrieval systems. Traditional methods mainly favor the concept-based paradigm on retrieval with simple queries, which are usually ineffective for complex queries that carry far more complex semantics. Recently, embedding-based paradigm has emerged as a popular approach. It aims to map the queries and videos into a shared embedding space where semantically-similar texts and videos are much closer to each other. Despite its simplicity, it forgoes the exploitation of the syntactic structure of text queries, making it suboptimal to model the complex queries. To facilitate …


Improving Event Detection Via Open-Domain Event Trigger Knowledge, Meihan Tong, Bin Xu, Shuai Wang, Yixin Cao, Lei Hou, Juanzi Li, Jun Xie Jul 2020

Improving Event Detection Via Open-Domain Event Trigger Knowledge, Meihan Tong, Bin Xu, Shuai Wang, Yixin Cao, Lei Hou, Juanzi Li, Jun Xie

Research Collection School Of Computing and Information Systems

Event Detection (ED) is a fundamental task in automatically structuring texts. Due to the small scale of training data, previous methods perform poorly on unseen/sparsely labeled trigger words and are prone to overfitting densely labeled trigger words. To address the issue, we propose a novel Enrichment Knowledge Distillation (EKD) model to leverage external open-domain trigger knowledge to reduce the in-built biases to frequent trigger words in annotations. Experiments on benchmark ACE2005 show that our model outperforms nine strong baselines, is especially effective for unseen/sparsely labeled trigger words. The source code is released on https://github.com/shuaiwa16/ekd.git.


A Review On Eye-Tracking Metrics For Sleepiness, Debasis Roy, Fiona Fui-Hoon Nah Jul 2020

A Review On Eye-Tracking Metrics For Sleepiness, Debasis Roy, Fiona Fui-Hoon Nah

Research Collection School Of Computing and Information Systems

Sleepiness that can arise from sleep deprivation can increase human errors in task performance and create workplace hazards and accidents. Hence, it is critical to detect sleepiness to minimize hazards and human errors. This paper provides a review of the literature on eye tracking metrics that can be used to detect sleepiness. These metrics include blink duration, blink frequency, saccade latency, saccade peak velocity, saccade accuracy, smooth pursuit velocity gain, fixation rate, pupil size, and latency to pupil constriction.


Expertise Style Transfer: A New Task Towards Better Communication Between Experts And Laymen, Yixin Cao, Ruihao Shui, Liangming Pan, Min-Yen Kan, Zhiyuan Lu, Tat-Seng Chua Jul 2020

Expertise Style Transfer: A New Task Towards Better Communication Between Experts And Laymen, Yixin Cao, Ruihao Shui, Liangming Pan, Min-Yen Kan, Zhiyuan Lu, Tat-Seng Chua

Research Collection School Of Computing and Information Systems

The curse of knowledge can impede communication between experts and laymen. We propose a new task of expertise style transfer and contribute a manually annotated dataset with the goal of alleviating such cognitive biases. Solving this task not only simplifies the professional language, but also improves the accuracy and expertise level of laymen descriptions using simple words. This is a challenging task, unaddressed in previous work, as it requires the models to have expert intelligence in order to modify text with a deep understanding of domain knowledge and structures. We establish the benchmark performance of five state-of-the-art models for style …


Covid-19 Calls For Remote Reskilling And Retraining, C. Zou, W. Zhao, Keng Siau Jul 2020

Covid-19 Calls For Remote Reskilling And Retraining, C. Zou, W. Zhao, Keng Siau

Research Collection School Of Computing and Information Systems

Cui Zou, Wangchuchu Zhao, and Keng Siau respond directly to COVID-19 by framing the skills and training necessary to survive crises. The authors focus on the importance of helping organizations prepare beyond the current pandemic by teaching everyone how to use the technology tools -- and exploit the processes -- around remote working.


Interactive Entity Linking Using Entity-Word Representations, Pei Chi Lo, Ee-Peng Lim Jul 2020

Interactive Entity Linking Using Entity-Word Representations, Pei Chi Lo, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

To leverage on entity and word semantics in entity linking, embedding models have been developed to represent entities, words and their context such that candidate entities for each mention can be determined and ranked accurately using their embeddings. To leverage on entity and word semantics in entity linking, embedding models have been developed to represent entities, words and their context such that candidate entities for each mention can be determined and ranked accurately using their embeddings. In this paper, we leverage on human intelligence for embedding-based interactive entity linking. We adopt an active learning approach to select mentions for human …


Graph-To-Tree Learning For Solving Math Word Problems, Jipeng Zhang, Lei Wang, Roy Ka-Wei Lee, Yi Bin, Yan Wang, Jie Shao, Ee-Peng Lim Jul 2020

Graph-To-Tree Learning For Solving Math Word Problems, Jipeng Zhang, Lei Wang, Roy Ka-Wei Lee, Yi Bin, Yan Wang, Jie Shao, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

While the recent tree-based neural models have demonstrated promising results in generating solution expression for the math word problem (MWP), most of these models do not capture the relationships and order information among the quantities well. This results in poor quantity representations and incorrect solution expressions. In this paper, we propose Graph2Tree, a novel deep learning architecture that combines the merits of the graph-based encoder and tree-based decoder to generate better solution expressions. Included in our Graph2Tree framework are two graphs, namely the Quantity Cell Graph and Quantity Comparison Graph, which are designed to address limitations of existing methods by …


Trajectory Similarity Learning With Auxiliary Supervision And Optimal Matching, Hanyuan Zhang, Xingyu Zhang, Qize Jiang, Baihua Zheng, Zhenbang Sun, Weiwei Sun, Changhu Wang Jul 2020

Trajectory Similarity Learning With Auxiliary Supervision And Optimal Matching, Hanyuan Zhang, Xingyu Zhang, Qize Jiang, Baihua Zheng, Zhenbang Sun, Weiwei Sun, Changhu Wang

Research Collection School Of Computing and Information Systems

Trajectory similarity computation is a core problem in the field of trajectory data queries. However, the high time complexity of calculating the trajectory similarity has always been a bottleneck in real-world applications. Learning-based methods can map trajectories into a uniform embedding space to calculate the similarity of two trajectories with embeddings in constant time. In this paper, we propose a novel trajectory representation learning framework Traj2SimVec that performs scalable and robust trajectory similarity computation. We use a simple and fast trajectory simplification and indexing approach to obtain triplet training samples efficiently. We make the framework more robust via taking full …


Big Data, Spatial Optimization, And Planning, Kai Cao, Wenwen Li, Richard Church Jul 2020

Big Data, Spatial Optimization, And Planning, Kai Cao, Wenwen Li, Richard Church

Research Collection School Of Computing and Information Systems

Spatial optimization represents a set of powerful spatial analysis techniques that can be used to identify optimal solution(s) and even generate a large number of competitive alternatives. The formulation of such problems involves maximizing or minimizing one or more objectives while satisfying a number of constraints. Solution techniques range from exact models solved with such approaches as linear programming and integer programming, or heuristic algorithms, i.e. Tabu Search, Simulated Annealing, and Genetic Algorithms. Spatial optimization techniques have been utilized in numerous planning applications, such as location-allocation modeling/site selection, land use planning, school districting, regionalization, routing, and urban design. These methods …


Keen2act: Activity Recommendation In Online Social Collaborative Platforms, Roy Ka-Wei Lee, Thong Hoang, Richard J. Oentaryo, David Lo Jul 2020

Keen2act: Activity Recommendation In Online Social Collaborative Platforms, Roy Ka-Wei Lee, Thong Hoang, Richard J. Oentaryo, David Lo

Research Collection School Of Computing and Information Systems

Social collaborative platforms such as GitHub and Stack Overflow have been increasingly used to improve work productivity via collaborative efforts. To improve user experiences in these platforms, it is desirable to have a recommender system that can suggest not only items (e.g., a GitHub repository) to a user, but also activities to be performed on the suggested items (e.g., forking a repository). To this end, we propose a new approach dubbed Keen2Act, which decomposes the recommendation problem into two stages: the Keen and Act steps. The Keen step identifies, for a given user, a (sub)set of items in which he/she …


Geoprune: Efficiently Matching Trips In Ride-Sharing Through Geometric Properties, Yixin Xu, Jianzhong Qi, Renata Borovica-Gajic Jul 2020

Geoprune: Efficiently Matching Trips In Ride-Sharing Through Geometric Properties, Yixin Xu, Jianzhong Qi, Renata Borovica-Gajic

Research Collection School Of Computing and Information Systems

On-demand ride-sharing is rapidly growing. Matching trip requests to vehicles efficiently is critical for the service quality of ride-sharing. To match trip requests with vehicles, a prune-And-select scheme is commonly used. The pruning stage identifies feasible vehicles that can satisfy the trip constraints (e.g., trip time). The selection stage selects the optimal one(s) from the feasible vehicles. The pruning stage is crucial to lowering the complexity of the selection stage and to achieve efficient matching. We propose an effective and efficient pruning algorithm called GeoPrune. GeoPrune represents the time constraints of trip requests using circles and ellipses, which can be …


Acceleration For Compressed Gradient Descent In Distributed And Federated Optimization, Zhize Li, Dmitry Kovalev, Xun Qian, Peter Richtarik Jul 2020

Acceleration For Compressed Gradient Descent In Distributed And Federated Optimization, Zhize Li, Dmitry Kovalev, Xun Qian, Peter Richtarik

Research Collection School Of Computing and Information Systems

Due to the high communication cost in distributed and federated learning problems, methods relying on compression of communicated messages are becoming increasingly popular. While in other contexts the best performing gradient-type methods invariably rely on some form of acceleration/momentum to reduce the number of iterations, there are no methods which combine the benefits of both gradient compression and acceleration. In this paper, we remedy this situation and propose the first accelerated compressed gradient descent (ACGD) methods. In the single machine regime, we prove that ACGD enjoys the rate $O\Big((1+\omega)\sqrt{\frac{L}{\mu}}\log \frac{1}{\epsilon}\Big)$ for $\mu$-strongly convex problems and $O\Big((1+\omega)\sqrt{\frac{L}{\epsilon}}\Big)$ for convex problems, respectively, …


Deep Learning Of Facial Embeddings And Facial Landmark Points For The Detection Of Academic Emotions, Hua Leong Fwa Jul 2020

Deep Learning Of Facial Embeddings And Facial Landmark Points For The Detection Of Academic Emotions, Hua Leong Fwa

Research Collection School Of Computing and Information Systems

Automatic emotion recognition is an actively researched area as emotion plays a pivotal role in effective human communications. Equipping a computer to understand and respond to human emotions has potential applications in many fields including education, medicine, transport and hospitality. In a classroom or online learning context, the basic emotions do not occur frequently and do not influence the learning process itself. The academic emotions such as engagement, frustration, confusion and boredom are the ones which are pivotal to sustaining the motivation of learners. In this study, we evaluated the use of deep learning on FaceNet embeddings and facial landmark …


Hybrid Stochastic-Deterministic Minibatch Proximal Gradient: Less-Than-Single-Pass Optimization With Nearly Optimal Generalization, Pan Zhou, Xiaotong Yuan Jul 2020

Hybrid Stochastic-Deterministic Minibatch Proximal Gradient: Less-Than-Single-Pass Optimization With Nearly Optimal Generalization, Pan Zhou, Xiaotong Yuan

Research Collection School Of Computing and Information Systems

Stochastic variance-reduced gradient (SVRG) algorithms have been shown to work favorably in solving large-scale learning problems. Despite the remarkable success, the stochastic gradient complexity of SVRG-type algorithms usually scales linearly with data size and thus could still be expensive for huge data. To address this deficiency, we propose a hybrid stochastic-deterministic minibatch proximal gradient (HSDMPG) algorithm for strongly-convex problems that enjoys provably improved data-size-independent complexity guarantees.


Recent Advances In Deep Learning For Object Detection, Xiongwei Wu, Doyen Sahoo, Steven C. H. Hoi Jul 2020

Recent Advances In Deep Learning For Object Detection, Xiongwei Wu, Doyen Sahoo, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

Object detection is a fundamental visual recognition problem in computer vision and has been widely studied in the past decades. Visual object detection aims to find objects of certain target classes with precise localization in a given image and assign each object instance a corresponding class label. Due to the tremendous successes of deep learning based image classification, object detection techniques using deep learning have been actively studied in recent years. In this paper, we give a comprehensive survey of recent advances in visual object detection with deep learning. By reviewing a large body of recent related work in literature, …


Probabilistic Value Selection For Space Efficient Model, Gunarto Sindoro Njoo, Baihua Zheng, Kuo-Wei Hsu, Wen-Chih Peng Jul 2020

Probabilistic Value Selection For Space Efficient Model, Gunarto Sindoro Njoo, Baihua Zheng, Kuo-Wei Hsu, Wen-Chih Peng

Research Collection School Of Computing and Information Systems

An alternative to current mainstream preprocessing methods is proposed: Value Selection (VS). Unlike the existing methods such as feature selection that removes features and instance selection that eliminates instances, value selection eliminates the values (with respect to each feature) in the dataset with two purposes: reducing the model size and preserving its accuracy. Two probabilistic methods based on information theory's metric are proposed: PVS and P + VS. Extensive experiments on the benchmark datasets with various sizes are elaborated. Those results are compared with the existing preprocessing methods such as feature selection, feature transformation, and instance selection methods. Experiment results …


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 …


Improving Multimodal Named Entity Recognition Via Entity Span Detection With Unified Multimodal Transformer, Jianfei Yu, Jing Jiang, Li Yang, Rui Xia Jul 2020

Improving Multimodal Named Entity Recognition Via Entity Span Detection With Unified Multimodal Transformer, Jianfei Yu, Jing Jiang, Li Yang, Rui Xia

Research Collection School Of Computing and Information Systems

In this paper, we study Multimodal Named Entity Recognition (MNER) for social media posts. Existing approaches for MNER mainly suffer from two drawbacks: (1) despite generating word-aware visual representations, their word representations are insensitive to the visual context; (2) most of them ignore the bias brought by the visual context. To tackle the first issue, we propose a multimodal interaction module to obtain both image-aware word representations and word-aware visual representations. To alleviate the visual bias, we further propose to leverage purely text-based entity span detection as an auxiliary module, and design a Unified Multimodal Transformer to guide the final …