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 331 - 360 of 3555

Full-Text Articles in Databases and Information Systems

Simulated Annealing With Reinforcement Learning For The Set Team Orienteering Problem With Time Windows, Vincent F. Yu, Nabila Y. Salsabila, Shih-W Lin, Aldy Gunawan Mar 2024

Simulated Annealing With Reinforcement Learning For The Set Team Orienteering Problem With Time Windows, Vincent F. Yu, Nabila Y. Salsabila, Shih-W Lin, Aldy Gunawan

Research Collection School Of Computing and Information Systems

This research investigates the Set Team Orienteering Problem with Time Windows (STOPTW), a new variant of the well-known Team Orienteering Problem with Time Windows and Set Orienteering Problem. In the STOPTW, customers are grouped into clusters. Each cluster is associated with a profit attainable when a customer in the cluster is visited within the customer's time window. A Mixed Integer Linear Programming model is formulated for STOPTW to maximizing total profit while adhering to time window constraints. Since STOPTW is an NP-hard problem, a Simulated Annealing with Reinforcement Learning (SARL) algorithm is developed. The proposed SARL incorporates the core concepts …

Go to article

Non-Monotonic Generation Of Knowledge Paths For Context Understanding, Pei-Chi Lo, Ee-Peng Lim Mar 2024

Non-Monotonic Generation Of Knowledge Paths For Context Understanding, Pei-Chi Lo, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

Knowledge graphs can be used to enhance text search and access by augmenting textual content with relevant background knowledge. While many large knowledge graphs are available, using them to make semantic connections between entities mentioned in the textual content remains to be a difficult task. In this work, we therefore introduce contextual path generation (CPG) which refers to the task of generating knowledge paths, contextual path, to explain the semantic connections between entities mentioned in textual documents with given knowledge graph. To perform CPG task well, one has to address its three challenges, namely path relevance, incomplete knowledge graph, and …

Go to article

Community Similarity Based On User Profile Joins, Konstantinos Theocharidis, Hady Wirawan Lauw Mar 2024

Community Similarity Based On User Profile Joins, Konstantinos Theocharidis, Hady Wirawan Lauw

Research Collection School Of Computing and Information Systems

Similarity joins on multidimensional data are crucial operators for recommendation purposes. The classic ��-join problem finds all pairs of points within �� distance to each other among two ��-dimensional datasets. In this paper, we consider a novel and alternative version of ��-join named community similarity based on user profile joins (CSJ). The aim of CSJ problem is, given two communities having a set of ��-dimensional users, to find how similar are the communities by matching every single pair of users (a user can be matched with at most one other user) having an absolute difference of at most �� per …

Go to article

Hypergraphs With Attention On Reviews For Explainable Recommendation, Theis E. Jendal, Trung Hoang Le, Hady Wirawan Lauw, Matteo Lissandrini, Peter Dolog, Katja Hose Mar 2024

Hypergraphs With Attention On Reviews For Explainable Recommendation, Theis E. Jendal, Trung Hoang Le, Hady Wirawan Lauw, Matteo Lissandrini, Peter Dolog, Katja Hose

Research Collection School Of Computing and Information Systems

Given a recommender system based on reviews, the challenges are how to effectively represent the review data and how to explain the produced recommendations. We propose a novel review-specific Hypergraph (HG) model, and further introduce a model-agnostic explainability module. The HG model captures high-order connections between users, items, aspects, and opinions while maintaining information about the review. The explainability module can use the HG model to explain a prediction generated by any model. We propose a path-restricted review-selection method biased by the user preference for item reviews and propose a novel explanation method based on a review graph. Experiments on …

Go to article

Meta-Interpretive Learning With Reuse, Rong Wang, Jun Sun, Cong Tian, Zhenhua Duan Mar 2024

Meta-Interpretive Learning With Reuse, Rong Wang, Jun Sun, Cong Tian, Zhenhua Duan

Research Collection School Of Computing and Information Systems

Inductive Logic Programming (ILP) is a research field at the intersection between machine learning and logic programming, focusing on developing a formal framework for inductively learning relational descriptions in the form of logic programs from examples and background knowledge. As an emerging method of ILP, Meta-Interpretive Learning (MIL) leverages the specialization of a set of higher-order metarules to learn logic programs. In MIL, the input includes a set of examples, background knowledge, and a set of metarules, while the output is a logic program. MIL executes a depth-first traversal search, where its program search space expands polynomially with the number …

Go to article

Temporal Implicit Multimodal Networks For Investment And Risk Management, Meng Kiat Gary Ang, Ee-Peng Lim Mar 2024

Temporal Implicit Multimodal Networks For Investment And Risk Management, Meng Kiat Gary Ang, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

Many deep learning works on financial time-series forecasting focus on predicting future prices/returns of individual assets with numerical price-related information for trading, and hence propose models designed for univariate, single-task, and/or unimodal settings. Forecasting for investment and risk management involves multiple tasks in multivariate settings: forecasts of expected returns and risks of assets in portfolios, and correlations between these assets. As different sources/types of time-series influence future returns, risks, and correlations of assets in different ways, it is also important to capture time-series from different modalities. Hence, this article addresses financial time-series forecasting for investment and risk management in a …

Go to article

T-Sciq: Teaching Multimodal Chain-Of-Thought Reasoning Via Large Language Model Signals For Science Question Answering, Lei Wang, Yi Hu, Jiabang He, Xing Xu, Ning Liu, Hui Liu, Heng Tao Shen Mar 2024

T-Sciq: Teaching Multimodal Chain-Of-Thought Reasoning Via Large Language Model Signals For Science Question Answering, Lei Wang, Yi Hu, Jiabang He, Xing Xu, Ning Liu, Hui Liu, Heng Tao Shen

Research Collection School Of Computing and Information Systems

Large Language Models (LLMs) have recently demonstrated exceptional performance in various Natural Language Processing (NLP) tasks. They have also shown the ability to perform chain-of-thought (CoT) reasoning to solve complex problems. Recent studies have explored CoT reasoning in complex multimodal scenarios, such as the science question answering task, by fine-tuning multimodal models with high-quality human-annotated CoT rationales. However, collecting high-quality COT rationales is usually time-consuming and costly. Besides, the annotated rationales are hardly accurate due to the external essential information missed. To address these issues, we propose a novel method termed T-SciQ that aims at teaching science question answering with …

Go to article

Xfuzz: Machine Learning Guided Cross-Contract Fuzzing, Yinxing Xue, Jiaming Ye, Wei Zhang, Jun Sun, Lei Ma, Haijun Wang, Jianjun Zhao Mar 2024

Xfuzz: Machine Learning Guided Cross-Contract Fuzzing, Yinxing Xue, Jiaming Ye, Wei Zhang, Jun Sun, Lei Ma, Haijun Wang, Jianjun Zhao

Research Collection School Of Computing and Information Systems

Smart contract transactions are increasingly interleaved by cross-contract calls. While many tools have been developed to identify a common set of vulnerabilities, the cross-contract vulnerability is overlooked by existing tools. Cross-contract vulnerabilities are exploitable bugs that manifest in the presence of more than two interacting contracts. Existing methods are however limited to analyze a maximum of two contracts at the same time. Detecting cross-contract vulnerabilities is highly non-trivial. With multiple interacting contracts, the search space is much larger than that of a single contract. To address this problem, we present xFuzz , a machine learning guided smart contract fuzzing framework. …

Go to article

Pa2blo: Low-Power, Personalized Audio Badge, Hemanth Sabbella, Dulaj Sanjaya Weerakoon, Manoj Gulati, Archan Misra Mar 2024

Pa2blo: Low-Power, Personalized Audio Badge, Hemanth Sabbella, Dulaj Sanjaya Weerakoon, Manoj Gulati, Archan Misra

Research Collection School Of Computing and Information Systems

We present the hardware design and software pipeline for an ultra-low power device, in the form factor of a wearable badge, that supports energy efficient sensing, processing and wireless transfer of human voice commands and interactions. The proposed system, called PA2BLO, is envisioned to support both: (a) real-time, scalable, authorized voice based interaction and control of devices and appliances, and (b) longitudinal, low-power logging of natural voice interactions. PA2BLO in-troduces two key novel capabilities. First, it includes a low power, low-complexity voice authentication module that is able to reliably authenticate an authorized user only using low sampling rate (500 Hz) …

Go to article

Gsword: Gpu-Accelerated Sampling For Subgraph Counting, Chang Ye, Yuchen Li, Shixuan Sun, Wentian Guo Mar 2024

Gsword: Gpu-Accelerated Sampling For Subgraph Counting, Chang Ye, Yuchen Li, Shixuan Sun, Wentian Guo

Research Collection School Of Computing and Information Systems

Subgraph counting is a fundamental component for many downstream applications such as graph representation learning and query optimization. Since obtaining the exact count is often intractable, there have been a plethora of approximation methods on graph sampling techniques. Nonetheless, the state-of-the-art sampling methods still require massive samples to produce accurate approximations on large data graphs. We propose gSWORD, a GPU framework that leverages the massive parallelism of GPUs to accelerate iterative sampling algorithms for subgraph counting. Despite the embarrassingly parallel nature of the samples, there are unique challenges in accelerating subgraph counting due to its irregular computation logic. To address …

Go to article

Improvement Of Flow Coefficient Estimation With Limited Well Test Data For Real-Time Condition Analytics Of Choke Valve, T. Visawameteekul, Tin Seong Kam, P. Thamvechvitee Mar 2024

Improvement Of Flow Coefficient Estimation With Limited Well Test Data For Real-Time Condition Analytics Of Choke Valve, T. Visawameteekul, Tin Seong Kam, P. Thamvechvitee

Research Collection School Of Computing and Information Systems

The study discusses a method for monitoring the internal condition of choke valves to predict sand erosion using flow coefficient (Cv). The method calculates the Cv of the choke valve by utilizing eight parameters and compares it to the newly manufactured value to generate warnings. However, the availability of spot-check well test data can significantly impact the model's efficiency if tests are performed infrequently. To address this issue, the Extended Cv monitoring method is proposed in this paper. The main purpose of this study is to develop a model for estimating Cv value in the absence of well test data. …

Go to article

Faster Rates For Compressed Federated Learning With Client-Variance Reduction, Haoyu Zhao, Konstantin Burlachenko, Zhize Li, Peter Richtarik Mar 2024

Faster Rates For Compressed Federated Learning With Client-Variance Reduction, Haoyu Zhao, Konstantin Burlachenko, Zhize Li, Peter Richtarik

Research Collection School Of Computing and Information Systems

Due to the communication bottleneck in distributed and federated learning applications, algorithms using communication compression have attracted significant attention and are widely used in practice. Moreover, the huge number, high heterogeneity, and limited availability of clients result in high client -variance. This paper addresses these two issues together by proposing compressed and clientvariance reduced methods COFIG and FRECON. We prove an O( (1+\omega)3/2\surdN+ (1+\omega)N2/3 S\epsilon2 S\epsilon2 ) bound on the number of communication rounds of COFIG in the nonconvex setting, where N is the total number of clients, S is the number of clients participating in each round, \epsilon is …

Go to article

Reverse Multi-Choice Dialogue Commonsense Inference With Graph-Of-Thought, Li Zheng, Hao Fei, Fei Li, Bobo Li, Lizi Liao, Donghong Ji, Chong Teng Feb 2024

Reverse Multi-Choice Dialogue Commonsense Inference With Graph-Of-Thought, Li Zheng, Hao Fei, Fei Li, Bobo Li, Lizi Liao, Donghong Ji, Chong Teng

Research Collection School Of Computing and Information Systems

With the proliferation of dialogic data across the Internet, the Dialogue Commonsense Multi-choice Question Answering (DC-MCQ) task has emerged as a response to the challenge of comprehending user queries and intentions. Although prevailing methodologies exhibit effectiveness in addressing single-choice questions, they encounter difficulties in handling multi-choice queries due to the heightened intricacy and informational density. In this paper, inspired by the human cognitive process of progressively excluding options, we propose a three-step Reverse Exclusion Graph-of-Thought (ReX-GoT) framework, including Option Exclusion, Error Analysis, and Combine Information. Specifically, our ReX-GoT mimics human reasoning by gradually excluding irrelevant options and learning the reasons …

Go to article

Handling Long And Richly Constrained Tasks Through Constrained Hierarchical Reinforcement Learning, Yuxiao Lu, Arunesh Sinha, Pradeep Varakantham Feb 2024

Handling Long And Richly Constrained Tasks Through Constrained Hierarchical Reinforcement Learning, Yuxiao Lu, Arunesh Sinha, Pradeep Varakantham

Research Collection School Of Computing and Information Systems

Safety in goal directed Reinforcement Learning (RL) settings has typically been handled through constraints over trajectories and have demonstrated good performance in primarily short horizon tasks. In this paper, we are specifically interested in the problem of solving temporally extended decision making problems such as robots cleaning different areas in a house while avoiding slippery and unsafe areas (e.g., stairs) and retaining enough charge to move to a charging dock; in the presence of complex safety constraints. Our key contribution is a (safety) Constrained Search with Hierarchical Reinforcement Learning (CoSHRL) mechanism that combines an upper level constrained search agent (which …

Go to article

Public Acceptance Of Using Artificial Intelligence-Assisted Weight Management Apps In High-Income Southeast Asian Adults With Overweight And Obesity: A Cross-Sectional Study, Han Shi Jocelyn Chew, Palakorn Achananuparp, Palakorn Achananuparp, Nicholas W. S. Chew, Yip Han Chin, Yujia Gao, Bok Yan Jimmy So, Asim Shabbir, Ee-Peng Lim, Kee Yuan Ngiam Feb 2024

Public Acceptance Of Using Artificial Intelligence-Assisted Weight Management Apps In High-Income Southeast Asian Adults With Overweight And Obesity: A Cross-Sectional Study, Han Shi Jocelyn Chew, Palakorn Achananuparp, Palakorn Achananuparp, Nicholas W. S. Chew, Yip Han Chin, Yujia Gao, Bok Yan Jimmy So, Asim Shabbir, Ee-Peng Lim, Kee Yuan Ngiam

Research Collection School Of Computing and Information Systems

Introduction: With in increase in interest to incorporate artificial intelligence (AI) into weight management programs, we aimed to examine user perceptions of AI-based mobile apps for weight management in adults with overweight and obesity. Methods: 280 participants were recruited between May and November 2022. Participants completed a questionnaire on sociodemographic profiles, Unified Theory of Acceptance and Use of Technology 2 (UTAUT2), and Self-Regulation of Eating Behavior Questionnaire. Structural equation modeling was performed using R. Model fit was tested using maximum-likelihood generalized unweighted least squares. Associations between influencing factors were analyzed using correlation and linear regression. Results: 271 participant responses were …

Go to article

Frameworks For Measuring Population Health: A Scoping Review, Sze Ling Chan, Clement Zhong Hao Ho, Nang Ei Ei Khaing, Ezra Ho, Candelyn Pong, Jia Sheng Guan, Calida Chua, Zongbin Li, Trudi Lim Wenqi, Sean Shao Wei Lam, Lian Leng Low, Choon How How Feb 2024

Frameworks For Measuring Population Health: A Scoping Review, Sze Ling Chan, Clement Zhong Hao Ho, Nang Ei Ei Khaing, Ezra Ho, Candelyn Pong, Jia Sheng Guan, Calida Chua, Zongbin Li, Trudi Lim Wenqi, Sean Shao Wei Lam, Lian Leng Low, Choon How How

Research Collection School Of Computing and Information Systems

Introduction Many regions in the world are using the population health approach and require a means to measure the health of their population of interest. Population health frameworks provide a theoretical grounding for conceptualization of population health and therefore a logical basis for selection of indicators. The aim of this scoping review was to provide an overview and summary of the characteristics of existing population health frameworks that have been used to conceptualize the measurement of population health. Methods We used the Population, Concept and Context (PCC) framework to define eligibility criteria of frameworks. We were interested in frameworks applicable …

Go to article

Hgprompt: Bridging Homogeneous And Heterogeneous Graphs For Few-Shot Prompt Learning, Xingtong Yu, Yuan Fang, Zemin Liu, Xinming Zhang Feb 2024

Hgprompt: Bridging Homogeneous And Heterogeneous Graphs For Few-Shot Prompt Learning, Xingtong Yu, Yuan Fang, Zemin Liu, Xinming Zhang

Research Collection School Of Computing and Information Systems

Graph neural networks (GNNs) and heterogeneous graph neural networks (HGNNs) are prominent techniques for homogeneous and heterogeneous graph representation learning, yet their performance in an end-to-end supervised framework greatly depends on the availability of task-specific supervision. To reduce the labeling cost, pre-training on selfsupervised pretext tasks has become a popular paradigm, but there is often a gap between the pre-trained model and downstream tasks, stemming from the divergence in their objectives. To bridge the gap, prompt learning has risen as a promising direction especially in few-shot settings, without the need to fully fine-tune the pre-trained model. While there has been …

Go to article

Simple Image-Level Classification Improves Open-Vocabulary Object Detection, Ruohuan Fang, Guansong Pang, Xiao Bai Feb 2024

Simple Image-Level Classification Improves Open-Vocabulary Object Detection, Ruohuan Fang, Guansong Pang, Xiao Bai

Research Collection School Of Computing and Information Systems

Open-Vocabulary Object Detection (OVOD) aims to detect novel objects beyond a given set of base categories on which the detection model is trained. Recent OVOD methods focus on adapting the image-level pre-trained vision-language models (VLMs), such as CLIP, to a region-level object detection task via, eg., region-level knowledge distillation, regional prompt learning, or region-text pre-training, to expand the detection vocabulary. These methods have demonstrated remarkable performance in recognizing regional visual concepts, but they are weak in exploiting the VLMs' powerful global scene understanding ability learned from the billion-scale image-level text descriptions. This limits their capability in detecting hard objects of …

Go to article

Foodmask: Real-Time Food Instance Counting, Segmentation And Recognition, Huu-Thanh Nguyen, Yu Cao, Chong-Wah Ngo, Wing-Kwong Chan Feb 2024

Foodmask: Real-Time Food Instance Counting, Segmentation And Recognition, Huu-Thanh Nguyen, Yu Cao, Chong-Wah Ngo, Wing-Kwong Chan

Research Collection School Of Computing and Information Systems

Food computing has long been studied and deployed to several applications. Understanding a food image at the instance level, including recognition, counting and segmentation, is essential to quantifying nutrition and calorie consumption. Nevertheless, existing techniques are limited to either category-specific instance detection, which does not reflect precisely the instance size at the pixel level, or category-agnostic instance segmentation, which is insufficient for dish recognition. This paper presents a compact and fast multi-task network, namely FoodMask, for clustering-based food instance counting, segmentation and recognition. The network learns a semantic space simultaneously encoding food category distribution and instance height at pixel basis. …

Go to article

Recommendations With Minimum Exposure Guarantees: A Post-Processing Framework, Ramon Lopes, Rodrigo Alves, Antoine Ledent, Rodrygo L. T. Santos, Marius Kloft Feb 2024

Recommendations With Minimum Exposure Guarantees: A Post-Processing Framework, Ramon Lopes, Rodrigo Alves, Antoine Ledent, Rodrygo L. T. Santos, Marius Kloft

Research Collection School Of Computing and Information Systems

Relevance-based ranking is a popular ingredient in recommenders, but it frequently struggles to meet fairness criteria because social and cultural norms may favor some item groups over others. For instance, some items might receive lower ratings due to some sort of bias (e.g. gender bias). A fair ranking should balance the exposure of items from advantaged and disadvantaged groups. To this end, we propose a novel post-processing framework to produce fair, exposure-aware recommendations. Our approach is based on an integer linear programming model maximizing the expected utility while satisfying a minimum exposure constraint. The model has fewer variables than previous …

Go to article

Imitate The Good And Avoid The Bad: An Incremental Approach To Safe Reinforcement Learning, Minh Huy Hoang, Mai Anh Tien, Pradeep Varakantham Feb 2024

Imitate The Good And Avoid The Bad: An Incremental Approach To Safe Reinforcement Learning, Minh Huy Hoang, Mai Anh Tien, Pradeep Varakantham

Research Collection School Of Computing and Information Systems

A popular framework for enforcing safe actions in Reinforcement Learning (RL) is Constrained RL, where trajectory based constraints on expected cost (or other cost measures) are employed to enforce safety and more importantly these constraints are enforced while maximizing expected reward. Most recent approaches for solving Constrained RL convert the trajectory based cost constraint into a surrogate problem that can be solved using minor modifications to RL methods. A key drawback with such approaches is an over or underestimation of the cost constraint at each state. Therefore, we provide an approach that does not modify the trajectory based cost constraint …

Go to article

When Evolutionary Computation Meets Privacy, Bowen Zhao, Wei-Neng Chen, Xiaoguo Li, Ximeng Liu, Qingqi Pei, Jun Zhang Feb 2024

When Evolutionary Computation Meets Privacy, Bowen Zhao, Wei-Neng Chen, Xiaoguo Li, Ximeng Liu, Qingqi Pei, Jun Zhang

Research Collection School Of Computing and Information Systems

Recently, evolutionary computation (EC) has experienced significant advancements due to the integration of machine learning, distributed computing, and big data technologies. These developments have led to new research avenues in EC, such as distributed EC and surrogate-assisted EC. While these advancements have greatly enhanced the performance and applicability of EC, they have also raised concerns regarding privacy leakages, specifically the disclosure of optimal results and surrogate models. Consequently, the combination of evolutionary computation and privacy protection becomes an increasing necessity. However, a comprehensive exploration of privacy concerns in evolutionary computation is currently lacking, particularly in terms of identifying the object, …

Go to article

Mitigating Fine-Grained Hallucination By Fine-Tuning Large Vision-Language Models With Caption Rewrites, Lei Wang, Jiabang He, Shenshen Li, Ning Liu, Ee-Peng Lim Feb 2024

Mitigating Fine-Grained Hallucination By Fine-Tuning Large Vision-Language Models With Caption Rewrites, Lei Wang, Jiabang He, Shenshen Li, Ning Liu, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

Large language models (LLMs) have shown remarkable performance in natural language processing (NLP) tasks. To comprehend and execute diverse human instructions over image data, instruction-tuned large vision-language models (LVLMs) have been introduced. However, LVLMs may suffer from different types of object hallucinations. Nevertheless, LVLMs are evaluated for coarse-grained object hallucinations only (i.e., generated objects non-existent in the input image). The fine-grained object attributes and behaviors non-existent in the image may still be generated but not measured by the current evaluation methods. In this paper, we thus focus on reducing fine-grained hallucinations of LVLMs. We propose ReCaption, a framework that consists …

Go to article

Men Are From Mars And Women Are From Venus: Dyadic Collaboration In The Metaverse, Shu Schiller, Fiona Fui-Hoon Nah, Andy Luse, Keng Siau Feb 2024

Men Are From Mars And Women Are From Venus: Dyadic Collaboration In The Metaverse, Shu Schiller, Fiona Fui-Hoon Nah, Andy Luse, Keng Siau

Research Collection School Of Computing and Information Systems

Purpose: The gender composition of teams remains an important yet complex element in unlocking the success of collaboration and performance in the metaverse. In this study, the authors examined the collaborations of same- and mixed-gender dyads to investigate how gender composition influences perceptions of the dyadic collaboration process and outcomes at both the individual and team levels in the metaverse. Design/methodology/approach: Drawing on expectation states theory and social role theory, the authors hypothesized differences between dyads of different gender compositions. A blocked design was utilized where 432 subjects were randomly assigned to teams of different gender compositions: 101 male dyads, …

Go to article

Wakening Past Concepts Without Past Data: Class-Incremental Learning From Online Placebos, Yaoyao Liu, Yingying Li, Bernt Schiele, Qianru Sun Jan 2024

Wakening Past Concepts Without Past Data: Class-Incremental Learning From Online Placebos, Yaoyao Liu, Yingying Li, Bernt Schiele, Qianru Sun

Research Collection School Of Computing and Information Systems

Not forgetting old class knowledge is a key challenge for class-incremental learning (CIL) when the model continuously adapts to new classes. A common technique to address this is knowledge distillation (KD), which penalizes prediction inconsistencies between old and new models. Such prediction is made with almost new class data, as old class data is extremely scarce due to the strict memory limitation in CIL. In this paper, we take a deep dive into KD losses and find that "using new class data for KD"not only hinders the model adaption (for learning new classes) but also results in low efficiency for …

Go to article

Effects Of Mindfulness And Emotion Regulation On Aesthetics: A Theoretical Model From Hedonic Perspective Of Processing Fluency, Geng-Bao Lin, Fiona Fui-Hoon Nah, Choon Ling Sia Jan 2024

Effects Of Mindfulness And Emotion Regulation On Aesthetics: A Theoretical Model From Hedonic Perspective Of Processing Fluency, Geng-Bao Lin, Fiona Fui-Hoon Nah, Choon Ling Sia

Research Collection School Of Computing and Information Systems

Research has shown that processing fluency positively impacts perceived aesthetics, with pleasure mediating the relationship. Considering the important role of pleasure, we propose studying the role of emotion regulation in moderating the mediated relationship from processing fluency to perceived aesthetics. Based on our hypotheses, individuals’ emotion regulation strategies are expected to have moderating effects on the relationship between processing fluency and perceived aesthetics such that cognitive reappraisal positively moderates the relationship from processing fluency to pleasure, and expressive suppression negatively moderates the relationship from pleasure to perceived aesthetics. Trait mindfulness is also expected to influence perceived aesthetics through emotion regulation …

Go to article

Predicting Viral Rumors And Vulnerable Users With Graph-Based Neural Multi-Task Learning For Infodemic Surveillance, Xuan Zhang, Wei Gao Jan 2024

Predicting Viral Rumors And Vulnerable Users With Graph-Based Neural Multi-Task Learning For Infodemic Surveillance, Xuan Zhang, Wei Gao

Research Collection School Of Computing and Information Systems

In the age of the infodemic, it is crucial to have tools for effectively monitoring the spread of rampant rumors that can quickly go viral, as well as identifying vulnerable users who may be more susceptible to spreading such misinformation. This proactive approach allows for timely preventive measures to be taken, mitigating the negative impact of false information on society. We propose a novel approach to predict viral rumors and vulnerable users using a unified graph neural network model. We pre-train network-based user embeddings and leverage a cross-attention mechanism between users and posts, together with a community-enhanced vulnerability propagation (CVP) …

Go to article

Privobfnet: A Weakly Supervised Semantic Segmentation Model For Data Protection, Chiat Pin Tay, Vigneshwaran Subbaraju, Thivya Kandappu Jan 2024

Privobfnet: A Weakly Supervised Semantic Segmentation Model For Data Protection, Chiat Pin Tay, Vigneshwaran Subbaraju, Thivya Kandappu

Research Collection School Of Computing and Information Systems

The use of social media has made it easy to communicate and share information over the internet. However, it also brings issues such as data privacy leakage, which can be exploited by recipients with malicious intentions to harm the sender. In this paper, we propose a deep neural network that analyzes user’s image for privacy sensitive content and automatically locates sensitive regions for obfuscation. Our approach relies solely on image level annotations and learns to (a) predict an overall privacy score, (b) detect sensitive attributes and (c) demarcate the sensitive regions for obfuscation, in a given input image. We validated …

Go to article

Causal Disentangled Recommendation Against User Preference Shifts, Wenjie Wang, Xinyu Lin, Liuhui Wang, Fuli Feng, Yunshan Ma, Tat‑Seng Chua Jan 2024

Causal Disentangled Recommendation Against User Preference Shifts, Wenjie Wang, Xinyu Lin, Liuhui Wang, Fuli Feng, Yunshan Ma, Tat‑Seng Chua

Research Collection School Of Computing and Information Systems

Recommender systems easily face the issue of user preference shifts. User representations will become outof-date and lead to inappropriate recommendations if user preference has shifted over time. To solve theissue, existing work focuses on learning robust representations or predicting the shifting pattern. Therelacks a comprehensive view to discover the underlying reasons for user preference shifts. To understand thepreference shift, we abstract a causal graph to describe the generation procedure of user interaction sequences.Assuming user preference is stable within a short period, we abstract the interaction sequence as a set ofchronological environments. From the causal graph, we find that the changes …

Go to article

Quantifying The Competitiveness Of A Dataset In Relation To General Preferences, Kyriakos Mouratidis, Keming Li, Bo Tang Jan 2024

Quantifying The Competitiveness Of A Dataset In Relation To General Preferences, Kyriakos Mouratidis, Keming Li, Bo Tang

Research Collection School Of Computing and Information Systems

Typically, a specific market (e.g., of hotels, restaurants, laptops, etc.) is represented as a multi-attribute dataset of the available products. The topic of identifying and shortlisting the products of most interest to a user has been well-explored. In contrast, in this work we focus on the dataset, and aim to assess its competitiveness with regard to different possible preferences. We define measures of competitiveness, and represent them in the form of a heat-map in the domain of preferences. Our work finds application in market analysis and in business development. These applications are further enhanced when the competitiveness heat-map is used …

Go to article

First Prev Next Last