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 691 - 720 of 3555

Full-Text Articles in Databases and Information Systems

Trajectory Optimization For Safe Navigation In Maritime Traffic Using Historical Data, Chaithanya Basrur, Arambam James Singh, Arunesh Sinha, Akshat Kumar, T. K. Satish Kumar Aug 2022

Trajectory Optimization For Safe Navigation In Maritime Traffic Using Historical Data, Chaithanya Basrur, Arambam James Singh, Arunesh Sinha, Akshat Kumar, T. K. Satish Kumar

Research Collection School Of Computing and Information Systems

Increasing maritime trade often results in congestion in busy ports, thereby necessitating planning methods to avoid close quarter risky situations among vessels. Rapid digitization and automation of port operations and vessel navigation provide unique opportunities for significantly improving navigation safety. Our key contributions are as follows. First, given a set of future candidate trajectories for vessels in a traffic hotspot zone, we develop a multiagent trajectory optimization method to choose trajectories that result in the best overall close quarter risk reduction. Our novel MILP-based optimization method is more than an order-of-magnitude faster than a standard MILP for this problem, and …

Go to article

Simple And Optimal Stochastic Gradient Methods For Nonsmooth Nonconvex Optimization, Zhize Li, Jian Li Aug 2022

Simple And Optimal Stochastic Gradient Methods For Nonsmooth Nonconvex Optimization, Zhize Li, Jian Li

Research Collection School Of Computing and Information Systems

We propose and analyze several stochastic gradient algorithms for finding stationary points or local minimum in nonconvex, possibly with nonsmooth regularizer, finite-sum and online optimization problems. First, we propose a simple proximal stochastic gradient algorithm based on variance reduction called ProxSVRG+. We provide a clean and tight analysis of ProxSVRG+, which shows that it outperforms the deterministic proximal gradient descent (ProxGD) for a wide range of minibatch sizes, hence solves an open problem proposed in Reddi et al. (2016b). Also, ProxSVRG+ uses much less proximal oracle calls than ProxSVRG (Reddi et al., 2016b) and extends to the online setting by …

Go to article

Efficient Resource Allocation With Fairness Constraints In Restless Multi-Armed Bandits, Dexun Li, Pradeep Varakantham Aug 2022

Efficient Resource Allocation With Fairness Constraints In Restless Multi-Armed Bandits, Dexun Li, Pradeep Varakantham

Research Collection School Of Computing and Information Systems

Restless Multi-Armed Bandits (RMAB) is an apt model to represent decision-making problems in public health interventions (e.g., tuberculosis, maternal, and child care), anti-poaching planning, sensor monitoring, personalized recommendations and many more. Existing research in RMAB has contributed mechanisms and theoretical results to a wide variety of settings, where the focus is on maximizing expected value. In this paper, we are interested in ensuring that RMAB decision making is also fair to different arms while maximizing expected value. In the context of public health settings, this would ensure that different people and/or communities are fairly represented while making public health intervention …

Go to article

Systems And Methods For Contrastive Learning With Self-Labeling Refinement, Pan Zhou, Caiming Xiong, Steven Hoi Aug 2022

Systems And Methods For Contrastive Learning With Self-Labeling Refinement, Pan Zhou, Caiming Xiong, Steven Hoi

Research Collection School Of Computing and Information Systems

Embodiments described herein provide a contrastive learning mechanism with self - labeling refinement , which iteratively employs the network and data themselves to generate more accurate and informative soft labels for contrastive learning . Specifically , the contrastive learning framework includes a self - labeling refinery module to explicitly generate accurate labels , and a momentum mix - up module to increase similarity between a query and its positive , which in turn implicitly improves label accuracy.

Go to article

Reflection As An Agile Course Evaluation Tool, Siaw Ling Lo, Pei Hua Cher, Fernando Bello Jul 2022

Reflection As An Agile Course Evaluation Tool, Siaw Ling Lo, Pei Hua Cher, Fernando Bello

Research Collection School Of Computing and Information Systems

Reflection is often used as a tool to analyse student learning, be it for internalizing of acquired knowledge or as a form of seeking help through expression of doubts or misconceptions. However, it can be a challenge to extract relevant information from the free-form reflection text. Often times the workload of manually analyzing the reflection text can be a form of deterrence instead of providing insights in the course delivery for instructors, let alone improving the learning experience. In this paper, we review the current usage of reflection and propose an automated reflection framework, together with an end-to-end analysis of …

Go to article

Using Constraint Programming And Graph Representation Learning For Generating Interpretable Cloud Security Policies, Mikhail Kazdagli, Mohit Tiwari, Akshat Kumar Jul 2022

Using Constraint Programming And Graph Representation Learning For Generating Interpretable Cloud Security Policies, Mikhail Kazdagli, Mohit Tiwari, Akshat Kumar

Research Collection School Of Computing and Information Systems

Modern software systems rely on mining insights from business sensitive data stored in public clouds. A data breach usually incurs signifcant (monetary) loss for a commercial organization. Conceptually, cloud security heavily relies on Identity Access Management (IAM) policies that IT admins need to properly confgure and periodically update. Security negligence and human errors often lead to misconfguring IAM policies which may open a backdoor for attackers. To address these challenges, frst, we develop a novel framework that encodes generating optimal IAM policies using constraint programming (CP). We identify reducing dormant permissions of cloud users as an optimality criterion, which intuitively …

Go to article

Self-Guided Learning To Denoise For Robust Recommendation, Yunjun Gao, Yuntao Du, Yujia Hu, Lu Chen, Xinjun Zhu, Ziquan Fang, Baihua Zheng Jul 2022

Self-Guided Learning To Denoise For Robust Recommendation, Yunjun Gao, Yuntao Du, Yujia Hu, Lu Chen, Xinjun Zhu, Ziquan Fang, Baihua Zheng

Research Collection School Of Computing and Information Systems

The ubiquity of implicit feedback makes them the default choice to build modern recommender systems. Generally speaking, observed interactions are considered as positive samples, while unobserved interactions are considered as negative ones. However, implicit feedback is inherently noisy because of the ubiquitous presence of noisy-positive and noisy-negative interactions. Recently, some studies have noticed the importance of denoising implicit feedback for recommendations, and enhanced the robustness of recommendation models to some extent. Nonetheless, they typically fail to (1) capture the hard yet clean interactions for learning comprehensive user preference, and (2) provide a universal denoising solution that can be applied to …

Go to article

Lead1.0: A Large-Scale Annotated Dataset For Energy Anomaly Detection In Commercial Buildings, Manoj Gulati, Pandarasamy Arjunan Jul 2022

Lead1.0: A Large-Scale Annotated Dataset For Energy Anomaly Detection In Commercial Buildings, Manoj Gulati, Pandarasamy Arjunan

Research Collection School Of Computing and Information Systems

Modern buildings are densely equipped with smart energy meters, which periodically generate a massive amount of time-series data yielding a few million data points every day. This data can be leveraged to discover the underlying load and infer their energy consumption patterns, inter-dependencies on environmental factors, and the building’s operational properties. Furthermore, it allows us to simultaneously identify anomalies present in the electricity consumption profiles, which is a big step towards saving energy and achieving global sustainability. However, to date, the lack of large-scale annotated energy consumption datasets hinders the ongoing research in anomaly detection. We contribute to this effort …

Go to article

Towards Aligning Slides And Video Snippets: Mitigating Sequence And Content Mismatches, Ziyuan Liu, Hady W. Lauw Jul 2022

Towards Aligning Slides And Video Snippets: Mitigating Sequence And Content Mismatches, Ziyuan Liu, Hady W. Lauw

Research Collection School Of Computing and Information Systems

Slides are important form of teaching materials used in various courses at academic institutions. Due to their compactness, slides on their own may not stand as complete reference materials. To aid students’ understanding, it would be useful to supplement slides with other materials such as online videos. Given a deck of slides and a related video, we seek to align each slide in the deck to a relevant video snippet, if any. While this problem could be formulated as aligning two time series (each involving a sequence of text contents), we anticipate challenges in generating matches arising from differences in …

Go to article

Declaration-Based Prompt Tuning For Visual Question Answering, Yuhang Liu, Wei Wei, Feida Zhu, Feida Zhu Jul 2022

Declaration-Based Prompt Tuning For Visual Question Answering, Yuhang Liu, Wei Wei, Feida Zhu, Feida Zhu

Research Collection School Of Computing and Information Systems

In recent years, the pre-training-then-fine-tuning paradigm has yielded immense success on a wide spectrum of cross-modal tasks, such as visual question answering (VQA), in which a visual-language (VL) model is first optimized via self-supervised task objectives, e.g., masked language modeling (MLM) and image-text matching (ITM), and then fine-tuned to adapt to downstream task (e.g., VQA) via a brand-new objective function, e.g., answer prediction. However, the inconsistency of the objective forms not only severely limits the generalization of pre-trained VL models to downstream tasks, but also requires a large amount of labeled data for fine-tuning. To alleviate the problem, we propose …

Go to article

Multi-Level Cross-View Contrastive Learning For Knowledge-Aware Recommender System, Ding Zou, Wei Wei, Xian-Ling Mao, Ziyang Wang, Minghui Qiu, Feida Zhu, Xin Cao Jul 2022

Multi-Level Cross-View Contrastive Learning For Knowledge-Aware Recommender System, Ding Zou, Wei Wei, Xian-Ling Mao, Ziyang Wang, Minghui Qiu, Feida Zhu, Xin Cao

Research Collection School Of Computing and Information Systems

Knowledge graph (KG) plays an increasingly important role in recommender systems. Recently, graph neural networks (GNNs) based model has gradually become the theme of knowledge-aware recommendation (KGR). However, there is a natural deficiency for GNN-based KGR models, that is, the sparse supervised signal problem, which may make their actual performance drop to some extent. Inspired by the recent success of contrastive learning in mining supervised signals from data itself, in this paper, we focus on exploring the contrastive learning in KG-aware recommendation and propose a novel multi-level cross-view contrastive learning mechanism, named MCCLK. Different from traditional contrastive learning methods which …

Go to article

Finding Top-M Leading Records In Temporal Data, Yiyi Wang Jul 2022

Finding Top-M Leading Records In Temporal Data, Yiyi Wang

Dissertations and Theses Collection (Open Access)

A traditional top-k query retrieves the records that stand out at a certain point in time. On the other hand, a durable top-k query considers how long the records retain their supremacy, i.e., it reports those records that are consistently among the top-k in a given time interval. In this thesis, we introduce a new query to the family of durable top-k formulations. It finds the top-m leading records, i.e., those that rank among the top-k for the longest duration within the query interval. Practically, this query assesses the records based on how long …

Go to article

Contours Of Virtual Enfreakment In Fighting Game Characters, Sercan Sengun, Peter Mawhorter, James Bowie-Wilson, Yusef Audeh, Haewoon Kwak, D. Fox Harrell Jul 2022

Contours Of Virtual Enfreakment In Fighting Game Characters, Sercan Sengun, Peter Mawhorter, James Bowie-Wilson, Yusef Audeh, Haewoon Kwak, D. Fox Harrell

Research Collection School Of Computing and Information Systems

Characters in fighting videogames1 such as Street Fighter V and Tekken7 typically reveal a phenomenon that we define as virtual enfreakment: their bodies, costumes, and fighting styles are exaggerated (1) in a manner that emphasizes perceived exoticism and (2) to enable them to be easily visually and conceptually distinguishable from one another. Here, using both quantitative and qualitative methods, including crowd-sourced surveys and analyses of game mechanics, we report on the contours of virtual enfreakment in those games. We specifically examine differences in character design across gender, national-origin, and skin-color lines. Disappointingly but not surprisingly, we find racism and sexism …

Go to article

Multi-Agent Reinforcement Learning For Traffic Signal Control Through Universal Communication Method, Qize Jiang, Minhao Qin, Shengmin Shi, Weiwei Sun Sun, Baihua Zheng Jul 2022

Multi-Agent Reinforcement Learning For Traffic Signal Control Through Universal Communication Method, Qize Jiang, Minhao Qin, Shengmin Shi, Weiwei Sun Sun, Baihua Zheng

Research Collection School Of Computing and Information Systems

How to coordinate the communication among intersections effectively in real complex traffic scenarios with multi-intersection is challenging. Existing approaches only enable the communication in a heuristic manner without considering the content/importance of information to be shared. In this paper, we propose a universal communication form UniComm between intersections. UniComm embeds massive observations collected at one agent into crucial predictions of their impact on its neighbors, which improves the communication efficiency and is universal across existing methods. We also propose a concise network UniLight to make full use of communications enabled by UniComm. Experimental results on real datasets demonstrate that UniComm …

Go to article

Ai-Enabled Adaptive Learning Using Automated Topic Alignment And Doubt Detection, Kar Way Tan, Siaw Ling Lo, Eng Lieh Ouh, Wei Leng Neo Jul 2022

Ai-Enabled Adaptive Learning Using Automated Topic Alignment And Doubt Detection, Kar Way Tan, Siaw Ling Lo, Eng Lieh Ouh, Wei Leng Neo

Research Collection School Of Computing and Information Systems

Implementing adaptive learning is often a challenging task at higher learning institutions where the students come from diverse backgrounds and disciplines. In this work, we collected informal learning journals from learners. Using the journals, we trained two machine learning models, an automated topic alignment and a doubt detection model to identify areas of adjustment required for teaching and students who require additional attention. The models form the baseline for a quiz recommender tool to dynamically generate personalized quizzes for each learner as practices to reinforce learning. Our pilot deployment of our AI-enabled Adaptive Learning System showed that our approach delivers …

Go to article

Data-Driven Retail Decision-Making Using Spatial Partitioning And Delineation Of Communities, Ming Hui Tan, Kar Way Tan Jul 2022

Data-Driven Retail Decision-Making Using Spatial Partitioning And Delineation Of Communities, Ming Hui Tan, Kar Way Tan

Research Collection School Of Computing and Information Systems

Urbanisation is resulting in rapid growth in road networks within cities. The evolution of road networks can be indicative of a city's economic growth and it is a field of research gaining prominence in recent years. This paper proposes a framework for spatial partition of large scale road networks that produces appropriately sized geospatial units in order to identify the type of community they serve. To this end, we have developed a three-stage procedure which first partitions the road network using Louvain method, followed by outlining the boundary of each partition using Uber H3 grids before classifying each partition using …

Go to article

Docee: A Large-Scale And Fine-Grained Benchmark For Document-Level Event Extraction, Meihan Tong, Bin Xu, Shuai Wang, Meihuan Han, Yixin Cao, Jiangqi Zhu, Siyu Chen, Lei Hou, Juanzi Li Jul 2022

Docee: A Large-Scale And Fine-Grained Benchmark For Document-Level Event Extraction, Meihan Tong, Bin Xu, Shuai Wang, Meihuan Han, Yixin Cao, Jiangqi Zhu, Siyu Chen, Lei Hou, Juanzi Li

Research Collection School Of Computing and Information Systems

Event extraction aims to identify an event and then extract the arguments participating in the event. Despite the great success in sentencelevel event extraction, events are more naturally presented in the form of documents, with event arguments scattered in multiple sentences. However, a major barrier to promote documentlevel event extraction has been the lack of large-scale and practical training and evaluation datasets. In this paper, we present DocEE, a new document-level event extraction dataset including 27,000+ events, 180,000+ arguments. We highlight three features: largescale manual annotations, fine-grained argument types and application-oriented settings. Experiments show that there is still a big …

Go to article

End-To-End Open-Set Semi-Supervised Node Classification With Out-Of-Distribution Detection, Tiancheng Huang, Donglin Wang, Yuan Fang Jul 2022

End-To-End Open-Set Semi-Supervised Node Classification With Out-Of-Distribution Detection, Tiancheng Huang, Donglin Wang, Yuan Fang

Research Collection School Of Computing and Information Systems

Out-Of-Distribution (OOD) samples are prevalent in real-world applications. The OOD issue becomes even more severe on graph data, as the effect of OOD nodes can be potentially amplified by propagation through the graph topology. Recent works have considered the OOD detection problem, which is critical for reducing the uncertainty in learning and improving the robustness. However, no prior work considers simultaneously OOD detection and node classification on graphs in an end-to-end manner. In this paper, we study a novel problem of end-to-end open-set semisupervised node classification (OSSNC) on graphs, which deals with node classification in the presence of OOD nodes. …

Go to article

Learning To Ask Critical Questions For Assisting Product Search, Zixuan Li, Lizi Liao, Tat-Seng Chua Jul 2022

Learning To Ask Critical Questions For Assisting Product Search, Zixuan Li, Lizi Liao, Tat-Seng Chua

Research Collection School Of Computing and Information Systems

Product search plays an essential role in eCommerce. It was treated as a special type of information retrieval problem. Most existing works make use of historical data to improve the search performance, which do not take the opportunity to ask for user’s current interest directly. Some session-aware methods take the user’s clicks within the session as implicit feedback, but it is still just a guess on user’s preference. To address this problem, recent conversational or question-based search models interact with users directly for understanding the user’s interest explicitly. However, most users do not have a clear picture on what to …

Go to article

A Weakly Supervised Propagation Model For Rumor Verification And Stance Detection With Multiple Instance Learning, Ruichao Yang, Jing Ma, Hongzhan Lin, Wei Gao Jul 2022

A Weakly Supervised Propagation Model For Rumor Verification And Stance Detection With Multiple Instance Learning, Ruichao Yang, Jing Ma, Hongzhan Lin, Wei Gao

Research Collection School Of Computing and Information Systems

The diffusion of rumors on social media generally follows a propagation tree structure, which provides valuable clues on how an original message is transmitted and responded by users over time. Recent studies reveal that rumor verification and stance detection are two relevant tasks that can jointly enhance each other despite their differences. For example, rumors can be debunked by cross-checking the stances conveyed by their relevant posts, and stances are also conditioned on the nature of the rumor. However, stance detection typically requires a large training set of labeled stances at post level, which are rare and costly to annotate. …

Go to article

Automatic Noisy Label Correction For Fine-Grained Entity Typing, Weiran Pan, Wei Wei, Feida Zhu Jul 2022

Automatic Noisy Label Correction For Fine-Grained Entity Typing, Weiran Pan, Wei Wei, Feida Zhu

Research Collection School Of Computing and Information Systems

Fine-grained entity typing (FET) aims to assign proper semantic types to entity mentions according to their context, which is a fundamental task in various entity-leveraging applications. Current FET systems usually establish on large-scale weaklysupervised/distantly annotation data, which may contain abundant noise and thus severely hinder the performance of the FET task. Although previous studies have made great success in automatically identifying the noisy labels in FET, they usually rely on some auxiliary resources which may be unavailable in real-world applications (e.g., pre-defined hierarchical type structures, humanannotated subsets). In this paper, we propose a novel approach to automatically correct noisy labels …

Go to article

Traffic Behavior Recognition From Traffic Videos Under Occlusion Condition: A Kalman Filter Approach, Junfeng Jiao, Huihai Wang Jul 2022

Traffic Behavior Recognition From Traffic Videos Under Occlusion Condition: A Kalman Filter Approach, Junfeng Jiao, Huihai Wang

Research Collection College of Integrative Studies

Real-time traffic data at intersections is significant for development of adaptive traffic light control systems. Sensors such as infrared radiation and GPS are not capable of providing detailed traffic information. Compared with these sensors, surveillance cameras have the potential to provide real scenes for traffic analysis. In this research, a You Only Look Once (YOLO)-based algorithm is employed to detect and track vehicles from traffic videos, and a predefined road mask is used to determine traffic flow and turning events in different roads. A Kalman filter is used to estimate and predict vehicle speed and location under the condition of …

Go to article

Multi-Level Cross-View Contrastive Learning For Knowledge-Aware Recommender System, Ding Zou, Wei Wei, Xian-Ling Mao, Ziyang Wang, Minghui Qiu, Feida Zhu, Xin Cao Jul 2022

Multi-Level Cross-View Contrastive Learning For Knowledge-Aware Recommender System, Ding Zou, Wei Wei, Xian-Ling Mao, Ziyang Wang, Minghui Qiu, Feida Zhu, Xin Cao

Research Collection School Of Computing and Information Systems

Knowledge graph (KG) plays an increasingly important role in recommender systems. Recently, graph neural networks (GNNs) based model has gradually become the theme of knowledge-aware recommendation (KGR). However, there is a natural deficiency for GNN-based KGR models, that is, the sparse supervised signal problem, which may make their actual performance drop to some extent. Inspired by the recent success of contrastive learning in mining supervised signals from data itself, in this paper, we focus on exploring the contrastive learning in KG-aware recommendation and propose a novel multi-level cross-view contrastive learning mechanism, named MCCLK. Different from traditional contrastive learning methods which …

Go to article

Efficient Neural Neighborhood Search For Pickup And Delivery Problems, Yining Ma, Jingwen Li, Zhiguang Cao, Wen Song, Hongliang Guo, Yuejiao Gong, Meng Chee Chee Jul 2022

Efficient Neural Neighborhood Search For Pickup And Delivery Problems, Yining Ma, Jingwen Li, Zhiguang Cao, Wen Song, Hongliang Guo, Yuejiao Gong, Meng Chee Chee

Research Collection School Of Computing and Information Systems

We present an efficient Neural Neighborhood Search (N2S) approach for pickup and delivery problems (PDPs). In specific, we design a powerful Synthesis Attention that allows the vanilla self-attention to synthesize various types of features regarding a route solution. We also exploit two customized decoders that automatically learn to perform removal and reinsertion of a pickup-delivery node pair to tackle the precedence constraint. Additionally, a diversity enhancement scheme is leveraged to further ameliorate the performance. Our N2S is generic, and extensive experiments on two canonical PDP variants show that it can produce state-of-the-art results among existing neural methods. Moreover, it even …

Go to article

Hakg: Hierarchy-Aware Knowledge Gated Network For Recommendation, Yuntao Du, Xinjun Zhu, Lu Chen, Baihua Zheng, Yunjun Gao Jul 2022

Hakg: Hierarchy-Aware Knowledge Gated Network For Recommendation, Yuntao Du, Xinjun Zhu, Lu Chen, Baihua Zheng, Yunjun Gao

Research Collection School Of Computing and Information Systems

Knowledge graph (KG) plays an increasingly important role to improve the recommendation performance and interpretability. A recent technical trend is to design end-to-end models based on information propagation mechanism. However, existing propagationbased methods fail to (1) model the underlying hierarchical structures and relations, and (2) capture the high-order collaborative signals of items for learning high-quality user and item representations. In this paper, we propose a new model, called Hierarchy-Aware Knowledge Gated Network (HAKG), to tackle the aforementioned problems. Technically, we model users and items (that are captured by a user-item graph), as well as entities and relations (that are captured …

Go to article

Cross-Lingual Transfer Learning For Statistical Type Inference, Zhiming Li, Xiaofei Xie, Haoliang Li, Zhengzi Xu, Yi Li, Yang Liu Jul 2022

Cross-Lingual Transfer Learning For Statistical Type Inference, Zhiming Li, Xiaofei Xie, Haoliang Li, Zhengzi Xu, Yi Li, Yang Liu

Research Collection School Of Computing and Information Systems

Hitherto statistical type inference systems rely thoroughly on supervised learning approaches, which require laborious manual effort to collect and label large amounts of data. Most Turing-complete imperative languages share similar control- and data-flow structures, which make it possible to transfer knowledge learned from one language to another. In this paper, we propose a cross-lingual transfer learning framework, Plato, for statistical type inference, which allows us to leverage prior knowledge learned from the labeled dataset of one language and transfer it to the others, e.g., Python to JavaScript, Java to JavaScript, etc. Plato is powered by a novel kernelized attention mechanism …

Go to article

Structured And Natural Responses Co-Generation For Conversational Search, Chenchen Ye, Lizi Liao, Fuli Feng, Wei Ji, Tat-Seng Chua Jul 2022

Structured And Natural Responses Co-Generation For Conversational Search, Chenchen Ye, Lizi Liao, Fuli Feng, Wei Ji, Tat-Seng Chua

Research Collection School Of Computing and Information Systems

Generating fluent and informative natural responses while maintaining representative internal states for search optimization is critical for conversational search systems. Existing approaches either 1) predict structured dialog acts first and then generate natural response; or 2) map conversation context to natural responses directly in an end-to-end manner. Both kinds of approaches have shortcomings. The former suffers from error accumulation while the semantic associations between structured acts and natural responses are confined in single direction. The latter emphasizes generating natural responses but fails to predict structured acts. Therefore, we propose a neural co-generation model that generates the two concurrently. The key …

Go to article

What Makes The Story Forward?: Inferring Commonsense Explanations As Prompts For Future Event Generation, Li Lin, Yixin Cao, Lifu Huang, Shu Ang Li, Xuming Hu, Lijie Wen, Jianmin Wang Jul 2022

What Makes The Story Forward?: Inferring Commonsense Explanations As Prompts For Future Event Generation, Li Lin, Yixin Cao, Lifu Huang, Shu Ang Li, Xuming Hu, Lijie Wen, Jianmin Wang

Research Collection School Of Computing and Information Systems

Prediction over event sequences is critical for many real-world applications in Information Retrieval and Natural Language Processing. Future Event Generation (FEG) is a challenging task in event sequence prediction because it requires not only fluent text generation but also commonsense reasoning to maintain the logical coherence of the entire event story. In this paper, we propose a novel explainable FEG framework, Coep. It highlights and integrates two types of event knowledge, sequential knowledge of direct event-event relations and inferential knowledge that reflects the intermediate character psychology between events, such as intents, causes, reactions, which intrinsically pushes the story forward. To …

Go to article

On Measuring Network Robustness For Weighted Networks, Jianbing Zheng, Ming Gao, Ee-Peng Lim, David Lo, Cheqing Jin, Aoying Zhou Jul 2022

On Measuring Network Robustness For Weighted Networks, Jianbing Zheng, Ming Gao, Ee-Peng Lim, David Lo, Cheqing Jin, Aoying Zhou

Research Collection School Of Computing and Information Systems

Network robustness measures how well network structure is strong and healthy when it is under attack, such as vertices joining and leaving. It has been widely used in many applications, such as information diffusion, disease transmission, and network security. However, existing metrics, including node connectivity, edge connectivity, and graph expansion, can be suboptimal for measuring network robustness since they are inefficient to be computed and cannot directly apply to the weighted networks or disconnected networks. In this paper, we define the RR-energy as a new robustness measurement for weighted networks based on the method of spectral analysis. RR-energy can cope …

Go to article

Harnessing Confidence For Report Aggregation In Crowdsourcing Environments, Hadeel Alhosaini, Xianzhi Wang, Lina Yao, Zhong Yang, Farookh Hussain, Ee-Peng Lim Jul 2022

Harnessing Confidence For Report Aggregation In Crowdsourcing Environments, Hadeel Alhosaini, Xianzhi Wang, Lina Yao, Zhong Yang, Farookh Hussain, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

Crowdsourcing is an effective means of accomplishing human intelligence tasks by leveraging the collective wisdom of crowds. Given reports of various accuracy degrees from workers, it is important to make wise use of these reports to derive accurate task results. Intuitively, a task result derived from a sufficient number of reports bears lower uncertainty, and higher uncertainty otherwise. Existing report aggregation research, however, has largely neglected the above uncertainty issue. In this regard, we propose a novel report aggregation framework that defines and incorporates a new confidence measure to quantify the uncertainty associated with tasks and workers, thereby enhancing result …

Go to article

First Prev Next Last