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

Databases and Information Systems Commons™

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

Research Collection School Of Computing and Information Systems

Discipline
Keyword
Publication Year

Articles 901 - 930 of 3441

Full-Text Articles in Databases and Information Systems

Holistic Prediction For Public Transport Crowd Flows: A Spatio Dynamic Graph Network Approach, Bingjie He, Shukai Li, Chen Zhang, Baihua Zheng, Fugee Tsung Sep 2021

Holistic Prediction For Public Transport Crowd Flows: A Spatio Dynamic Graph Network Approach, Bingjie He, Shukai Li, Chen Zhang, Baihua Zheng, Fugee Tsung

Research Collection School Of Computing and Information Systems

This paper targets at predicting public transport in-out crowd flows of different regions together with transit flows between them in a city. The main challenge is the complex dynamic spatial correlation of crowd flows of different regions and origin-destination (OD) paths. Different from road traffic flows whose spatial correlations mainly depend on geographical distance, public transport crowd flows significantly relate to the region’s functionality and connectivity in the public transport network. Furthermore, influenced by commuters’ time-varying travel patterns, the spatial correlations change over time. Though there exist many works focusing on either predicting in-out flows or OD transit flows of …


Semi-Supervised Semantic Visualization For Networked Documents, Delvin Ce Zhang, Hady W. Lauw Sep 2021

Semi-Supervised Semantic Visualization For Networked Documents, Delvin Ce Zhang, Hady W. Lauw

Research Collection School Of Computing and Information Systems

Semantic interpretability and visual expressivity are important objectives in exploratory analysis of text. On the one hand, while some documents may have explicit categories, we could develop a better understanding of a corpus by studying its finer-grained structures, which may be latent. By inferring latent topics and discovering keywords associated with each topic, one obtains a semantic interpretation of the corpus. One the other hand, by visualizing documents, latent topics, and category labels on the same plot, one gains a bird’s eye view of the relationships among documents, topics, and various categories. Semantic visualization is a class of methods that …


Precision Public Health Campaign: Delivering Persuasive Messages To Relevant Segments Through Targeted Advertisements On Social Media, Jisun An, Haewoon Kwak, Hanya M. Qureshi, Ingmar Weber Sep 2021

Precision Public Health Campaign: Delivering Persuasive Messages To Relevant Segments Through Targeted Advertisements On Social Media, Jisun An, Haewoon Kwak, Hanya M. Qureshi, Ingmar Weber

Research Collection School Of Computing and Information Systems

Although established marketing techniques have been applied to design more effective health campaigns, more often than not, the same message is broadcasted to large populations, irrespective of unique characteristics. As individual digital device use has increased, so have individual digital footprints, creating potential opportunities for targeted digital health interventions. We propose a novel precision public health campaign framework to structure and standardize the process of designing and delivering tailored health messages to target particular population segments using social media–targeted advertising tools. Our framework consists of five stages: defining a campaign goal, priority audience, and evaluation metrics; splitting the target audience …


Redesigning Patient Flow In Paediatric Eye Clinic For Pandemic Using Simulation, Kar Way Tan, Bee Keow Goh, Aldy Gunawan Sep 2021

Redesigning Patient Flow In Paediatric Eye Clinic For Pandemic Using Simulation, Kar Way Tan, Bee Keow Goh, Aldy Gunawan

Research Collection School Of Computing and Information Systems

This study proposes a systematic approach to the construction of a simulation model to support decision-making concerning the capacity limit and staffing configurations at the paediatric eye clinic in Singapore under the COVID-19 pandemic situation. During the pandemic, the clinic must ensure that the operations are aligned to the safe-distancing regulations put in place by the Ministry of Health while coping with the demand. We developed simulation models to examine the ‘asis’ process and proposed numerous ‘to-be’ processes for new clinic configurations to operate under the pandemic conditions. We combined scenario-thinking and simulation optimization to determine the additional manpower and …


Enhancing Project Based Learning With Unsupervised Learning Of Project Reflections, Hua Leong Fwa Sep 2021

Enhancing Project Based Learning With Unsupervised Learning Of Project Reflections, Hua Leong Fwa

Research Collection School Of Computing and Information Systems

Natural Language Processing (NLP) is an area of research and application that uses computers to analyze human text. It has seen wide adoption within several industries but few studies have investigated it for use in evaluating the effectiveness of educational interventions and pedagogies. Pedagogies such as Project based learning (PBL) centers on learners solving an authentic problem or challenge which leads to knowledge creation and higher engagement. PBL also lends itself well in plugging the gap between what is taught in classrooms and applying the knowledge gained to the real working environment. In this study, we seek to investigate how …


Dynamic Heterogeneous Graph Embedding Via Heterogeneous Hawkes Process, Yugang Ji, Tianrui Jia, Yuan Fang, Chuan Shi Sep 2021

Dynamic Heterogeneous Graph Embedding Via Heterogeneous Hawkes Process, Yugang Ji, Tianrui Jia, Yuan Fang, Chuan Shi

Research Collection School Of Computing and Information Systems

Graph embedding, aiming to learn low-dimensional representations of nodes while preserving valuable structure information, has played a key role in graph analysis and inference. However, most existing methods deal with static homogeneous topologies, while graphs in real-world scenarios are gradually generated with different-typed temporal events, containing abundant semantics and dynamics. Limited work has been done for embedding dynamic heterogeneous graphs since it is very challenging to model the complete formation process of heterogeneous events. In this paper, we propose a novel Heterogeneous Hawkes Process based dynamic Graph Embedding (HPGE) to handle this problem. HPGE effectively integrates the Hawkes process into …


Quantum Computing For Supply Chain Finance, Paul R. Griffin, Ritesh Sampat Sep 2021

Quantum Computing For Supply Chain Finance, Paul R. Griffin, Ritesh Sampat

Research Collection School Of Computing and Information Systems

Applying quantum computing to real world applications to assess the potential efficacy is a daunting task for non-quantum specialists. This paper shows an implementation of two quantum optimization algorithms applied to portfolios of trade finance portfolios and compares the selections to those chosen by experienced underwriters and a classical optimizer. The method used is to map the financial risk and returns for a trade finance portfolio to an optimization function of a quantum algorithm developed in a Qiskit tutorial. The results show that whilst there is no advantage seen by using the quantum algorithms, the performance of the quantum algorithms …


Cosy: Counterfactual Syntax For Cross-Lingual Understanding, Sicheng Yu, Hao Zhang, Yulei Niu, Qianru Sun, Jing Jiang Aug 2021

Cosy: Counterfactual Syntax For Cross-Lingual Understanding, Sicheng Yu, Hao Zhang, Yulei Niu, Qianru Sun, Jing Jiang

Research Collection School Of Computing and Information Systems

Pre-trained multilingual language models, e.g., multilingual-BERT, are widely used in cross-lingual tasks, yielding the state-of-the-art performance. However, such models suffer from a large performance gap between source and target languages, especially in the zero-shot setting, where the models are fine-tuned only on English but tested on other languages for the same task. We tackle this issue by incorporating language-agnostic information, specifically, universal syntax such as dependency relations and POS tags, into language models, based on the observation that universal syntax is transferable across different languages. Our approach, named COunterfactual SYntax (COSY), includes the design of SYntax-aware networks as well as …


Learning From Miscellaneous Other-Class Words For Few-Shot Named Entity Recognition, Meihan Tong, Shuai Wang, Bin Xu, Yixin Cao, Minghui Liu, Lei Hou, Juanzi Li Aug 2021

Learning From Miscellaneous Other-Class Words For Few-Shot Named Entity Recognition, Meihan Tong, Shuai Wang, Bin Xu, Yixin Cao, Minghui Liu, Lei Hou, Juanzi Li

Research Collection School Of Computing and Information Systems

Few-shot Named Entity Recognition (NER) exploits only a handful of annotations to identify and classify named entity mentions. Prototypical network shows superior performance on few-shot NER. However, existing prototypical methods fail to differentiate rich semantics in other-class words, which will aggravate overfitting under few shot scenario. To address the issue, we propose a novel model, Mining Undefined Classes from Other-class (MUCO), that can automatically induce different undefined classes from the other class to improve few-shot NER. With these extra-labeled undefined classes, our method will improve the discriminative ability of NER classifier and enhance the understanding of predefined classes with stand-by …


How Knowledge Graph And Attention Help? A Qualitative Analysis Into Bag-Level Relation Extraction, Zikun Hu, Yixin Cao, Lifu Huang, Tat-Seng Chua Aug 2021

How Knowledge Graph And Attention Help? A Qualitative Analysis Into Bag-Level Relation Extraction, Zikun Hu, Yixin Cao, Lifu Huang, Tat-Seng Chua

Research Collection School Of Computing and Information Systems

Knowledge Graph (KG) and attention mechanism have been demonstrated effective in introducing and selecting useful information for weakly supervised methods. However, only qualitative analysis and ablation study are provided as evidence. In this paper, we contribute a dataset and propose a paradigm to quantitatively evaluate the effect of attention and KG on bag-level relation extraction (RE). We find that (1) higher attention accuracy may lead to worse performance as it may harm the model’s ability to extract entity mention features; (2) the performance of attention is largely influenced by various noise distribution patterns, which is closely related to real-world datasets; …


Mining Informal And Short Weekly Student Self-Reflections For Improving Student Learning Experience, Gottipati Swapna, Rafael Jose Barros Barrios, Kyong Jin Shim Aug 2021

Mining Informal And Short Weekly Student Self-Reflections For Improving Student Learning Experience, Gottipati Swapna, Rafael Jose Barros Barrios, Kyong Jin Shim

Research Collection School Of Computing and Information Systems

Having students write short self-reflections at the end of each weekly session enables them to reflect on what they have learned in the session and what concepts they find challenging. Analyzing these selfreflections provides instructors with insights on how to address the missing conceptions and misconceptions of the students and appropriately plan and deliver the next session. In this paper, we study the impact of informal and short weekly self-reflections on students’ learning. Our methodology includes an approach to effective collection and mining of the textual reflections based on Google survey forms and TIBCO Spotfire. To evaluate our research questions, …


Towards Generative Aspect-Based Sentiment Analysis, Wenxuan Zhang, Xin Li, Yang Deng, Lidong Bing, Wai Lam Aug 2021

Towards Generative Aspect-Based Sentiment Analysis, Wenxuan Zhang, Xin Li, Yang Deng, Lidong Bing, Wai Lam

Research Collection School Of Computing and Information Systems

Aspect-based sentiment analysis (ABSA) has received increasing attention recently. Most existing work tackles ABSA in a discriminative manner, designing various task-specific classification networks for the prediction. Despite their effectiveness, these methods ignore the rich label semantics in ABSA problems and require extensive task-specific designs. In this paper, we propose to tackle various ABSA tasks in a unified generative framework. Two types of paradigms, namely annotation-style and extraction-style modeling, are designed to enable the training process by formulating each ABSA task as a text generation problem. We conduct experiments on four ABSA tasks across multiple benchmark datasets where our proposed generative …


A Survey On Ml4vis: Applying Machine Learning Advances To Data Visualization, Qianwen Wang, Zhutian Chen, Yong Wang, Huamin Qu Aug 2021

A Survey On Ml4vis: Applying Machine Learning Advances To Data Visualization, Qianwen Wang, Zhutian Chen, Yong Wang, Huamin Qu

Research Collection School Of Computing and Information Systems

Inspired by the great success of machine learning (ML), researchers have applied ML techniques to visualizations to achieve a better design, development, and evaluation of visualizations. This branch of studies, known as ML4VIS, is gaining increasing research attention in recent years. To successfully adapt ML techniques for visualizations, a structured understanding of the integration of ML4VIS is needed. In this article, we systematically survey 88 ML4VIS studies, aiming to answer two motivating questions: “what visualization processes can be assisted by ML?” and “how ML techniques can be used to solve visualization problems? ” This survey reveals seven main processes where …


Vehicle Routing: Review Of Benchmark Datasets, Aldy Gunawan, Graham Kendall, Barry Mccollum, Hsin-Vonn Seow, Lai Soon Lee Aug 2021

Vehicle Routing: Review Of Benchmark Datasets, Aldy Gunawan, Graham Kendall, Barry Mccollum, Hsin-Vonn Seow, Lai Soon Lee

Research Collection School Of Computing and Information Systems

The Vehicle Routing Problem (VRP) was formally presented to the scientific literature in 1959 by Dantzig and Ramser (DOI:10.1287/mnsc.6.1.80). Sixty years on, the problem is still heavily researched, with hundreds of papers having been published addressing this problem and the many variants that now exist. Many datasets have been proposed to enable researchers to compare their algorithms using the same problem instances where either the best known solution is known or, in some cases, the optimal solution is known. In this survey paper, we provide a list of Vehicle Routing Problem datasets, categorized to enable researchers to have easy access …


Forecasting Interaction Order On Temporal Graphs, Wenwen Xia, Yuchen Li, Jianwei Tian, Shenghong Li Aug 2021

Forecasting Interaction Order On Temporal Graphs, Wenwen Xia, Yuchen Li, Jianwei Tian, Shenghong Li

Research Collection School Of Computing and Information Systems

Link prediction is a fundamental task for graph analysis and the topic has been studied extensively for static or dynamic graphs. Essentially, the link prediction is formulated as a binary classification problem about two nodes. However, for temporal graphs, links (or interactions) among node sets appear in sequential orders. And the orders may lead to interesting applications. While a binary link prediction formulation fails to handle such an order-sensitive case. In this paper, we focus on such an interaction order prediction (IOP) problem among a given node set on temporal graphs. For the technical aspect, we develop a graph neural …


Effective Digital Learning Practices For Is Design Courses During Covid-19, Eng Lieh Ouh, Benjamin Gan Aug 2021

Effective Digital Learning Practices For Is Design Courses During Covid-19, Eng Lieh Ouh, Benjamin Gan

Research Collection School Of Computing and Information Systems

The COVID-19 pandemic has pushed educational institutions to adopt digital learning for an extended period. This research studies the effectiveness of digital learning practices based on student feedback data collected for two Information Systems design courses: human interaction design and solution architecture design. This paper leverages the data to analyze the effectiveness of a set of digital learning practices: ZOOM lectures, polling or Kahoot questions, self-reflection, virtual exercises and virtual mentorship. Our research questions are on the effectiveness of these learning practices to keep the student’s interest and learn the course materials. The research compares each learning practice and the …


The 4th Workshop On Heterogeneous Information Network Analysis And Applications (Hena 2021), Chuan Shi, Yuan Fang, Yanfang Ye, Jiawei Zhang Aug 2021

The 4th Workshop On Heterogeneous Information Network Analysis And Applications (Hena 2021), Chuan Shi, Yuan Fang, Yanfang Ye, Jiawei Zhang

Research Collection School Of Computing and Information Systems

The 4th Workshop on Heterogeneous Information Network Analysis and Applications (HENA 2021) is co-located with the 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. The goal of this workshop is to bring together researchers and practitioners in the field and provide a forum for sharing new techniques and applications in heterogeneous information network analysis. This workshop has an exciting program that spans a number of subtopics, such as heterogeneous network embedding and graph neural networks, data mining techniques on heterogeneous information networks, and applications of heterogeneous information network analysis. The workshop program includes several invited speakers, lively discussion …


Discovery Of Mental Wellness Via Social Analytics For Liveability In An Urban City, Kar Way Tan Aug 2021

Discovery Of Mental Wellness Via Social Analytics For Liveability In An Urban City, Kar Way Tan

Research Collection School Of Computing and Information Systems

Smart cities, are often perceived as urban areas that use technologies to manage resources, improve economy and enhance community livelihood. In this paper, we share an approach which uses multiple sources of data for evidence-based analysis of the public's views, concerns and sentiments on the topic related to mental wellness. We hope to bring forth a better understanding of the existing concerns of the citizens and available social support. Our study leverages on social sensing via text mining and social network analysis to listen to the voices of the citizens through revealed content from web data sources, such as social …


An Empirical Study Of The Discreteness Prior In Low-Rank Matrix Completion, Rodrigo Alves, Antoine Ledent, Renato Assunção, Marius And Kloft Aug 2021

An Empirical Study Of The Discreteness Prior In Low-Rank Matrix Completion, Rodrigo Alves, Antoine Ledent, Renato Assunção, Marius And Kloft

Research Collection School Of Computing and Information Systems

A reasonable assumption in recommender systems is that the rows (users) and columns (items) of the rating matrix can be split into groups (communities) with the following property: each entry of the matrix is the sum of components corresponding to community behavior and a purely low-rank component corresponding to individual behavior. We investigate (1) whether such a structure is present in real-world datasets, (2) whether the knowledge of the existence of such structure alone can improve performance, without explicit information about the community memberships. To these ends, we formulate a joint optimization problem over all (completed matrix, set of communities) …


Thunderrw: An In-Memory Graph Random Walk Engine, Shixuan Sun, Yuhang Chen, Shengliang Lu, Bingsheng He, Yuchen Li Aug 2021

Thunderrw: An In-Memory Graph Random Walk Engine, Shixuan Sun, Yuhang Chen, Shengliang Lu, Bingsheng He, Yuchen Li

Research Collection School Of Computing and Information Systems

As random walk is a powerful tool in many graph processing, mining and learning applications, this paper proposes an efficient inmemory random walk engine named ThunderRW. Compared with existing parallel systems on improving the performance of a single graph operation, ThunderRW supports massive parallel random walks. The core design of ThunderRW is motivated by our profiling results: common RW algorithms have as high as 73.1% CPU pipeline slots stalled due to irregular memory access, which suffers significantly more memory stalls than the conventional graph workloads such as BFS and SSSP. To improve the memory efficiency, we first design a generic …


Context-Aware Outstanding Fact Mining From Knowledge Graphs, Yueji Yang, Yuchen Li, Panagiotis Karras, Anthony Tung Aug 2021

Context-Aware Outstanding Fact Mining From Knowledge Graphs, Yueji Yang, Yuchen Li, Panagiotis Karras, Anthony Tung

Research Collection School Of Computing and Information Systems

An Outstanding Fact (OF) is an attribute that makes a target entity stand out from its peers. The mining of OFs has important applications, especially in Computational Journalism, such as news promotion, fact-checking, and news story finding. However, existing approaches to OF mining: (i) disregard the context in which the target entity appears, hence may report facts irrelevant to that context; and (ii) require relational data, which are often unavailable or incomplete in many application domains. In this paper, we introduce the novel problem of mining Contextaware Outstanding Facts (COFs) for a target entity under a given context specified by …


Are Missing Links Predictable? An Inferential Benchmark For Knowledge Graph Completion, Yixin Cao, Xiang Ji, Xin Lv, Juanzi Li, Yonggang Wen, Hanwang Zhang Aug 2021

Are Missing Links Predictable? An Inferential Benchmark For Knowledge Graph Completion, Yixin Cao, Xiang Ji, Xin Lv, Juanzi Li, Yonggang Wen, Hanwang Zhang

Research Collection School Of Computing and Information Systems

We present InferWiki, a Knowledge Graph Completion (KGC) dataset that improves upon existing benchmarks in inferential ability, assumptions, and patterns. First, each testing sample is predictable with supportive data in the training set. To ensure it, we propose to utilize rule-guided train/test generation, instead of conventional random split. Second, InferWiki initiates the evaluation following the open-world assumption and improves the inferential difficulty of the closed-world assumption, by providing manually annotated negative and unknown triples. Third, we include various inference patterns (e.g., reasoning path length and types) for comprehensive evaluation. In experiments, we curate two settings of InferWiki varying in sizes …


Automating The Removal Of Obsolete Todo Comments, Zhipeng Gao, Xin Xia, David Lo, John C. Grundy, Thomas Zimmermann Aug 2021

Automating The Removal Of Obsolete Todo Comments, Zhipeng Gao, Xin Xia, David Lo, John C. Grundy, Thomas Zimmermann

Research Collection School Of Computing and Information Systems

TODO comments are very widely used by software developers to describe their pending tasks during software development. However, after performing the task developers sometimes neglect or simply forget to remove the TODO comment, resulting in obsolete TODO comments. These obsolete TODO comments can confuse development teams and may cause the introduction of bugs in the future, decreasing the software’s quality and maintainability. Manually identifying obsolete TODO comments is time-consuming and expensive. It is thus necessary to detect obsolete TODO comments and remove them automatically before they cause any unwanted side effects. In this work, we propose a novel model, named …


A Survey On Complex Knowledge Base Question Answering: Methods, Challenges And Solutions, Yunshi Lan, Gaole He, Jinhao Jiang, Jing Jiang, Wayne Xin Zhao, Ji-Rong Wen Aug 2021

A Survey On Complex Knowledge Base Question Answering: Methods, Challenges And Solutions, Yunshi Lan, Gaole He, Jinhao Jiang, Jing Jiang, Wayne Xin Zhao, Ji-Rong Wen

Research Collection School Of Computing and Information Systems

Knowledge base question answering (KBQA) aims to answer a question over a knowledge base (KB). Recently, a large number of studies focus on semantically or syntactically complicated questions. In this paper, we elaborately summarize the typical challenges and solutions for complex KBQA. We begin with introducing the background about the KBQA task. Next, we present the two mainstream categories of methods for complex KBQA, namely semantic parsing-based (SP-based) methods and information retrieval-based (IR-based) methods. We then review the advanced methods comprehensively from the perspective of the two categories. Specifically, we explicate their solutions to the typical challenges. Finally, we conclude …


Crossasr++: A Modular Differential Testing Framework For Automatic Speech Recognition, Muhammad Hilmi Asyrofi, Zhou Yang, David Lo Aug 2021

Crossasr++: A Modular Differential Testing Framework For Automatic Speech Recognition, Muhammad Hilmi Asyrofi, Zhou Yang, David Lo

Research Collection School Of Computing and Information Systems

Developers need to perform adequate testing to ensure the quality of Automatic Speech Recognition (ASR) systems. However, manually collecting required test cases is tedious and time-consuming. Our recent work proposes CrossASR, a differential testing method for ASR systems. This method first utilizes Text-to-Speech (TTS) to generate audios from texts automatically and then feed these audios into different ASR systems for cross-referencing to uncover failed test cases. It also leverages a failure estimator to find failing test cases more efficiently. Such a method is inherently self-improvable: the performance can increase by leveraging more advanced TTS and ASR systems. So, in this …


Pre-Training On Large-Scale Heterogeneous Graph, Xunqiang Jiang, Tianrui Jia, Yuan Fang, Chuan Shi, Zhe Lin, Hui Wang Aug 2021

Pre-Training On Large-Scale Heterogeneous Graph, Xunqiang Jiang, Tianrui Jia, Yuan Fang, Chuan Shi, Zhe Lin, Hui Wang

Research Collection School Of Computing and Information Systems

Graph neural networks (GNNs) emerge as the state-of-the-art representation learning methods on graphs and often rely on a large amount of labeled data to achieve satisfactory performance. Recently, in order to relieve the label scarcity issues, some works propose to pre-train GNNs in a self-supervised manner by distilling transferable knowledge from the unlabeled graph structures. Unfortunately, these pre-training frameworks mainly target at homogeneous graphs, while real interaction systems usually constitute large-scale heterogeneous graphs, containing different types of nodes and edges, which leads to new challenges on structure heterogeneity and scalability for graph pre-training. In this paper, we first study the …


Integrating Knowledge Compilation With Reinforcement Learning For Routes, Jiajing Ling, Kushagra Chandak, Akshat Kumar Aug 2021

Integrating Knowledge Compilation With Reinforcement Learning For Routes, Jiajing Ling, Kushagra Chandak, Akshat Kumar

Research Collection School Of Computing and Information Systems

Sequential multiagent decision-making under partial observability and uncertainty poses several challenges. Although multiagent reinforcement learning (MARL) approaches have increased the scalability, addressing combinatorial domains is still challenging as random exploration by agents is unlikely to generate useful reward signals. We address cooperative multiagent pathfinding under uncertainty and partial observability where agents move from their respective sources to destinations while also satisfying constraints (e.g., visiting landmarks). Our main contributions include: (1) compiling domain knowledge such as underlying graph connectivity and domain constraints into propositional logic based decision diagrams, (2) developing modular techniques to integrate such knowledge with deep MARL algorithms, and …


Leveraging Two Types Of Global Graph For Sequential Fashion Recommendation, Yujuan Ding, Yunshan Ma, Wai Keung Wong, Tat‑Seng Chua Aug 2021

Leveraging Two Types Of Global Graph For Sequential Fashion Recommendation, Yujuan Ding, Yunshan Ma, Wai Keung Wong, Tat‑Seng Chua

Research Collection School Of Computing and Information Systems

Sequential fashion recommendation is of great significance in online fashion shopping, which accounts for an increasing portion of either fashion retailing or online e-commerce. The key to building an effective sequential fashion recommendation model lies in capturing two types of patterns: the personal fashion preference of users and the transitional relationships between adjacent items. The two types of patterns are usually related to user-item interaction and item-item transition modeling respectively. However, due to the large sets of users and items as well as the sparse historical interactions, it is difficult to train an effective and efficient sequential fashion recommendation model. …


Modeling Transitions Of Focal Entities For Conversational Knowledge Base Question Answering, Yunshi Lan, Jing Jiang Aug 2021

Modeling Transitions Of Focal Entities For Conversational Knowledge Base Question Answering, Yunshi Lan, Jing Jiang

Research Collection School Of Computing and Information Systems

Conversational KBQA is about answering a sequence of questions related to a KB. Follow-up questions in conversational KBQA often have missing information referring to entities from the conversation history. In this paper, we propose to model these implied entities, which we refer to as the focal entities of the conversation. We propose a novel graph-based model to capture the transitions of focal entities and apply a graph neural network to derive a probability distribution of focal entities for each question, which is then combined with a standard KBQA module to perform answer ranking. Our experiments on two datasets demonstrate the …


Node-Wise Localization Of Graph Neural Networks, Zemin Liu, Yuan Fang, Chenghao Liu, Steven C.H. Hoi Aug 2021

Node-Wise Localization Of Graph Neural Networks, Zemin Liu, Yuan Fang, Chenghao Liu, Steven C.H. Hoi

Research Collection School Of Computing and Information Systems

Graph neural networks (GNNs) emerge as a powerful family of representation learning models on graphs. To derive node representations, they utilize a global model that recursively aggregates information from the neighboring nodes. However, different nodes reside at different parts of the graph in different local contexts, making their distributions vary across the graph. Ideally, how a node receives its neighborhood information should be a function of its local context, to diverge from the global GNN model shared by all nodes. To utilize node locality without overfitting, we propose a node-wise localization of GNNs by accounting for both global and local …