Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Databases and Information Systems (3560)
- Software Engineering (2204)
- Artificial Intelligence and Robotics (1897)
- Information Security (1107)
- Numerical Analysis and Scientific Computing (1060)
-
- Graphics and Human Computer Interfaces (947)
- Engineering (884)
- Social and Behavioral Sciences (808)
- Business (748)
- Theory and Algorithms (513)
- Computer Engineering (449)
- Programming Languages and Compilers (413)
- Operations Research, Systems Engineering and Industrial Engineering (407)
- OS and Networks (345)
- Communication (326)
- Social Media (264)
- Public Affairs, Public Policy and Public Administration (230)
- Medicine and Health Sciences (197)
- Education (194)
- Transportation (194)
- Management Information Systems (176)
- Data Storage Systems (167)
- E-Commerce (154)
- International and Area Studies (147)
- Technology and Innovation (146)
- Asian Studies (145)
- Health Information Technology (118)
- Higher Education (105)
- Keyword
-
- Machine learning (145)
- Deep learning (129)
- Artificial intelligence (123)
- Social media (82)
- Singapore (73)
-
- Reinforcement learning (72)
- Data mining (70)
- Privacy (67)
- Security (62)
- Cloud computing (60)
- Deep Learning (58)
- Empirical study (55)
- Software engineering (55)
- Optimization (54)
- Online learning (51)
- Visualization (51)
- Neural networks (50)
- Anomaly detection (49)
- Training (49)
- Twitter (49)
- Task analysis (48)
- Blockchain (47)
- Large Language Models (47)
- Natural language processing (47)
- Collaboration (46)
- Feature extraction (45)
- Algorithms (44)
- Access control (43)
- Machine Learning (43)
- Semantics (43)
- Publication Year
- Publication
-
- Research Collection School Of Computing and Information Systems (8479)
- Dissertations and Theses Collection (Open Access) (189)
- Research Collection Lee Kong Chian School Of Business (59)
- Research Collection Yong Pung How School Of Law (49)
- Research Collection School of Social Sciences (27)
-
- Asian Management Insights (26)
- Research Collection College of Integrative Studies (23)
- Perspectives@SMU (21)
- Research Collection School Of Accountancy (18)
- Dissertations and Theses Collection (15)
- FORCE 2026 (14)
- SMU Press Releases and News (12)
- MITB Thought Leadership Series (11)
- Research Collection Library (10)
- Research Collection School of Computing and Information Systems (10)
- Research@SMU: Connecting the Dots (10)
- PhD Student’s Publications Collection (8)
- LARC Research Publications (7)
- Research Collection School Of Economics (6)
- CCX Research (4)
- SMU Research Data (4)
- Student Publications (4)
- 2024 AI for Research Week (3)
- SCIS Student Publications (3)
- Centre for AI & Data Governance (2019-2025) (2)
- Research Collection Office of Research (2)
- CASTLe: Collection of Articles on Scholarship for Teaching and Learning (1)
- Centre for Computational Law (2022-2025) (1)
- Library Events (1)
- ROSA Journal Articles and Publications (1)
- Publication Type
- File Type
Articles 3001 - 3030 of 9024
Full-Text Articles in Computer Sciences
Effective Digital Learning Practices For Is Design Courses During Covid-19, Eng Lieh Ouh, Benjamin Gan
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 …
Learning To Assign: Towards Fair Task Assignment In Large-Scale Ride Hailing, Dingyuan Shi, Yongxin Tong, Zimu Zhou, Bingchen Song, Weifeng Lv, Qiang Yang
Learning To Assign: Towards Fair Task Assignment In Large-Scale Ride Hailing, Dingyuan Shi, Yongxin Tong, Zimu Zhou, Bingchen Song, Weifeng Lv, Qiang Yang
Research Collection School Of Computing and Information Systems
Ride hailing is a widespread shared mobility application where the central issue is to assign taxi requests to drivers with various objectives. Despite extensive research on task assignment in ride hailing, the fairness of earnings among drivers is largely neglected. Pioneer studies on fair task assignment in ride hailing are ineffective and inefficient due to their myopic optimization perspective and timeconsuming assignment techniques. In this work, we propose LAF, an effective and efficient task assignment scheme that optimizes both utility and fairness. We adopt reinforcement learning to make assignments in a holistic manner and propose a set of acceleration techniques …
Neural Architecture Search Of Spd Manifold Networks, R.S. Sukthanker, Zhiwu Huang, S. Kumar, E. G. Endsjo, Y. Wu, Gool L. Van
Neural Architecture Search Of Spd Manifold Networks, R.S. Sukthanker, Zhiwu Huang, S. Kumar, E. G. Endsjo, Y. Wu, Gool L. Van
Research Collection School Of Computing and Information Systems
In this paper, we propose a new neural architecture search (NAS) problem of Symmetric Positive Definite (SPD) manifold networks, aiming to automate the design of SPD neural architectures. To address this problem, we first introduce a geometrically rich and diverse SPD neural architecture search space for an efficient SPD cell design. Further, we model our new NAS problem with a one-shot training process of a single supernet. Based on the supernet modeling, we exploit a differentiable NAS algorithm on our relaxed continuous search space for SPD neural architecture search. Statistical evaluation of our method on drone, action, and emotion recognition …
Maintenance-Related Concerns For Post-Deployed Ethereum Smart Contract Development: Issues, Techniques, And Future Challenges, Jiachi Chen, Xin Xia, David Lo, John Grundy, Xiaohu Yang
Maintenance-Related Concerns For Post-Deployed Ethereum Smart Contract Development: Issues, Techniques, And Future Challenges, Jiachi Chen, Xin Xia, David Lo, John Grundy, Xiaohu Yang
Research Collection School Of Computing and Information Systems
Software development is a very broad activity that captures the entire life cycle of a software, which includes designing, programming, maintenance and so on. In this study, we focus on the maintenance-related concerns of the post-deployment of smart contracts. Smart contracts are self-executed programs that run on a blockchain. They cannot be modified once deployed and hence they bring unique maintenance challenges compared to conventional software. According to the definition of ISO/IEC 14764, there are four kinds of software maintenance, i.e., corrective, adaptive, perfective, and preventive maintenance. This study aims to answer (i) What kinds of issues will smart contract …
Learning-Based Extraction Of First-Order Logic Representations Of Api Directives, Mingwei Liu, Xin Peng, Andrian Marcus, Christoph Treude, Xuefang Bai, Gang Lyu, Jiazhen Xie, Xiaoxin Zhang
Learning-Based Extraction Of First-Order Logic Representations Of Api Directives, Mingwei Liu, Xin Peng, Andrian Marcus, Christoph Treude, Xuefang Bai, Gang Lyu, Jiazhen Xie, Xiaoxin Zhang
Research Collection School Of Computing and Information Systems
Developers often rely on API documentation to learn API directives, i.e., constraints and guidelines related to API usage. Failing to follow API directives may cause defects or improper implementations. Since there are no industry-wide standards on how to document API directives, they take many forms and are often hard to understand by developers or challenging to parse with tools. In this paper, we propose a learning based approach for extracting first-order logic representations of API directives (FOL directives for short). The approach, called LeadFOL, uses a joint learning method to extract atomic formulas by identifying the predicates and arguments involved …
Bidding Mechanisms In Graph Games, Guy Avni, Thomas A. Henzinger, Dorde Zikelic
Bidding Mechanisms In Graph Games, Guy Avni, Thomas A. Henzinger, Dorde Zikelic
Research Collection School Of Computing and Information Systems
A graph game proceeds as follows: two players move a token through a graph to produce a finite or infinite path, which determines the payoff of the game. We study bidding games in which in each turn, an auction determines which player moves the token. Bidding games were largely studied in combination with two variants of first-price auctions called “Richman” and “poorman” bidding. We study taxman bidding, which span the spectrum between the two. The game is parameterized by a constant τ∈[0,1]: portion τ of the winning bid is paid to the other player, and portion 1−τ to the bank. …
Towards Generative Aspect-Based Sentiment Analysis, Wenxuan Zhang, Xin Li, Yang Deng, Lidong Bing, Wai Lam
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 …
Cfr-Mix: Solving Imperfect Information Extensive-Form Games With Combinatorial Action Space, Shuxin Li, Youzhi Zhang, Xinrun Wang, Wanqi Xue, Bo An
Cfr-Mix: Solving Imperfect Information Extensive-Form Games With Combinatorial Action Space, Shuxin Li, Youzhi Zhang, Xinrun Wang, Wanqi Xue, Bo An
Research Collection School Of Computing and Information Systems
In many real-world scenarios, a team of agents must coordinate with each other to compete against an opponent. The challenge of solving this type of game is that the team's joint action space grows exponentially with the number of agents, which results in the inefficiency of the existing algorithms, e.g., Counterfactual Regret Minimization (CFR). To address this problem, we propose a new framework of CFR: CFR-MIX. Firstly, we propose a new strategy representation that represents a joint action strategy using individual strategies of all agents and a consistency relationship to maintain the cooperation between agents. To compute the equilibrium with …
Solving Large-Scale Extensive-Form Network Security Games Via Neural Fictitious Self-Play, Wanqi Xue, Youzhi Zhang, Shuxin Li, Xinrun Wang, Bo An, Chai Kiat Yeo
Solving Large-Scale Extensive-Form Network Security Games Via Neural Fictitious Self-Play, Wanqi Xue, Youzhi Zhang, Shuxin Li, Xinrun Wang, Bo An, Chai Kiat Yeo
Research Collection School Of Computing and Information Systems
Securing networked infrastructures is important in the real world. The problem of deploying security resources to protect against an attacker in networked domains can be modeled as Network Security Games (NSGs). Unfortunately, existing approaches, including the deep learning-based approaches, are inefficient to solve large-scale extensive-form NSGs. In this paper, we propose a novel learning paradigm, NSG-NFSP, to solve large-scale extensive-form NSGs based on Neural Fictitious Self-Play (NFSP). Our main contributions include: i) reforming the best response (BR) policy network in NFSP to be a mapping from action-state pair to action-value, to make the calculation of BR possible in NSGs; ii) …
Neural Regret-Matching For Distributed Constraint Optimization Problems, Yanchen Deng, Runshen Yu, Xinrun Wang, Bo An
Neural Regret-Matching For Distributed Constraint Optimization Problems, Yanchen Deng, Runshen Yu, Xinrun Wang, Bo An
Research Collection School Of Computing and Information Systems
Distributed constraint optimization problems (DCOPs) are a powerful model for multi-agent coordination and optimization, where information and controls are distributed among multiple agents by nature. Sampling-based algorithms are important incomplete techniques for solving medium-scale DCOPs. However, they use tables to exactly store all the information (e.g., costs, confidence bounds) to facilitate sampling, which limits their scalability. This paper tackles the limitation by incorporating deep neural networks in solving DCOPs for the first time and presents a neural-based sampling scheme built upon regret-matching. In the algorithm, each agent trains a neural network to approximate the regret related to its local problem …
Outsourcing Service Fair Payment Based On Blockchain And Its Applications In Cloud Computing, Yinghui Zhang, Robert H. Deng, Ximeng Liu, Dong Zheng
Outsourcing Service Fair Payment Based On Blockchain And Its Applications In Cloud Computing, Yinghui Zhang, Robert H. Deng, Ximeng Liu, Dong Zheng
Research Collection School Of Computing and Information Systems
As a milestone in the development of outsourcing services, cloud computing enables an increasing number of individuals and enterprises to enjoy the most advanced services from outsourcing service providers. Because online payment and data security issues are involved in outsourcing services, the mutual distrust between users and service providers may severely impede the wide adoption of cloud computing. Nevertheless, most existing solutions only consider a specific type of services and rely on a trusted third-party to realize fair payment. In this paper, to realize secure and fair payment of outsourcing services in general without relying on any third-party, trusted or …
Learning Interpretable Concept Groups In Cnns, Saurabh Varshneya, Antoine Ledent, Rob Vandermeulen, Yunwen Lei, Matthias Enders, Damian Borth, Marius Kloft
Learning Interpretable Concept Groups In Cnns, Saurabh Varshneya, Antoine Ledent, Rob Vandermeulen, Yunwen Lei, Matthias Enders, Damian Borth, Marius Kloft
Research Collection School Of Computing and Information Systems
We propose a novel training methodology---Concept Group Learning (CGL)---that encourages training of interpretable CNN filters by partitioning filters in each layer into concept groups, each of which is trained to learn a single visual concept. We achieve this through a novel regularization strategy that forces filters in the same group to be active in similar image regions for a given layer. We additionally use a regularizer to encourage a sparse weighting of the concept groups in each layer so that a few concept groups can have greater importance than others. We quantitatively evaluate CGL's model interpretability using standard interpretability evaluation …
An Empirical Study Of The Discreteness Prior In Low-Rank Matrix Completion, Rodrigo Alves, Antoine Ledent, Renato Assunção, Marius And Kloft
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) …
Fine-Grained Analysis Of Structured Output Prediction, Waleed Mustafa, Yunwen Lei, Antoine Ledent, Marius And Kloft
Fine-Grained Analysis Of Structured Output Prediction, Waleed Mustafa, Yunwen Lei, Antoine Ledent, Marius And Kloft
Research Collection School Of Computing and Information Systems
In machine learning we often encounter structured output prediction problems (SOPPs), i.e. problems where the output space admits a rich internal structure. Application domains where SOPPs naturally occur include natural language processing, speech recognition, and computer vision. Typical SOPPs have an extremely large label set, which grows exponentially as a function of the size of the output. Existing generalization analysis implies generalization bounds with at least a square-root dependency on the cardinality d of the label set, which can be vacuous in practice. In this paper, we significantly improve the state of the art by developing novel high-probability bounds with …
Unlinkable And Revocable Secret Handshake, Yangguang Tian, Yingliu Li, Guomin Yang, Guomin Yang
Unlinkable And Revocable Secret Handshake, Yangguang Tian, Yingliu Li, Guomin Yang, Guomin Yang
Research Collection School Of Computing and Information Systems
In this paper, we introduce a new construction for unlinkable secret handshake that allows a group of users to perform handshakes anonymously. We define formal security models for the proposed construction and prove that it can achieve session key security, anonymity and affiliation hiding. In particular, the proposed construction ensures that (i) anonymity against protocol participants (including group authority) is achieved since a hierarchical identity-based signature is used in generating group user's pseudonym-credential pairs and (ii) revocation is achieved using a secret sharing-based revocation mechanism.
Are Missing Links Predictable? An Inferential Benchmark For Knowledge Graph Completion, Yixin Cao, Xiang Ji, Xin Lv, Juanzi Li, Yonggang Wen, Hanwang Zhang
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 …
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
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 …
Receiver-Anonymity In Rerandomizable Rcca-Secure Cryptosystems Resolved, Yi Wang, Rongmao Chen, Guomin Yang, Xinyi Huang, Baosheng Wang, Moti Yung
Receiver-Anonymity In Rerandomizable Rcca-Secure Cryptosystems Resolved, Yi Wang, Rongmao Chen, Guomin Yang, Xinyi Huang, Baosheng Wang, Moti Yung
Research Collection School Of Computing and Information Systems
In this work we resolve the open problem raised by Prabhakaran and Rosulek at CRYPTO 2007, and present the first anonymous, rerandomizable, Replayable-CCA (RCCA) secure public-key encryption scheme. This solution opens the door to numerous privacy-oriented applications with a highly desired RCCA security level. At the core of our construction is a non-trivial extension of smooth projective hash functions (Cramer and Shoup, EUROCRYPT 2002), and a modular generic framework developed for constructing rerandomizable RCCA-secure encryption schemes with receiver-anonymity. The framework gives an enhanced abstraction of the original Prabhakaran and Rosulek’s scheme (which was the first construction of rerandomizable RCCA-secure encryption …
How Knowledge Graph And Attention Help? A Qualitative Analysis Into Bag-Level Relation Extraction, Zikun Hu, Yixin Cao, Lifu Huang, Tat-Seng Chua
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; …
The 4th Workshop On Heterogeneous Information Network Analysis And Applications (Hena 2021), Chuan Shi, Yuan Fang, Yanfang Ye, Jiawei Zhang
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 …
An Improved Learnable Evolution Model For Solving Multi-Objective Vehicle Routing Problem With Stochastic Demand, Yunyun Niu, Detian Kong, Rong Wen, Zhiguang Cao, Jianhua Xiao
An Improved Learnable Evolution Model For Solving Multi-Objective Vehicle Routing Problem With Stochastic Demand, Yunyun Niu, Detian Kong, Rong Wen, Zhiguang Cao, Jianhua Xiao
Research Collection School Of Computing and Information Systems
The multi-objective vehicle routing problem with stochastic demand (MO-VRPSD) is much harder to tackle than other traditional vehicle routing problems (VRPs), due to the uncertainty in customer demands and potentially conflicted objectives. In this paper, we present an improved multi-objective learnable evolution model (IMOLEM) to solve MO-VRPSD with three objectives of travel distance, driver remuneration and number of vehicles. In our method, a machine learning algorithm, i.e., decision tree, is exploited to help find and guide the desirable direction of evolution process. To cope with the key issue of "route failure" caused due to stochastic customer demands, we propose a …
Gp3: Gaussian Process Path Planning For Reliable Shortest Path In Transportation Networks, Hongliang Guo, Xuejie Hou, Zhiguang Cao, Jie Zhang
Gp3: Gaussian Process Path Planning For Reliable Shortest Path In Transportation Networks, Hongliang Guo, Xuejie Hou, Zhiguang Cao, Jie Zhang
Research Collection School Of Computing and Information Systems
This paper investigates the reliable shortest path (RSP) problem in Gaussian process (GP) regulated transportation networks. Specifically, the RSP problem that we are targeting at is to minimize the (weighted) linear combination of mean and standard deviation of the path's travel time. With the reasonable assumption that the travel times of the underlying transportation network follow a multi-variate Gaussian distribution, we propose a Gaussian process path planning (GP3) algorithm to calculate the a priori optimal path as the RSP solution. With a series of equivalent RSP problem transformations, we are able to reach a polynomial time complexity algorithm with guaranteed …
A Survey On Ml4vis: Applying Machine Learning Advances To Data Visualization, Qianwen Wang, Zhutian Chen, Yong Wang, Huamin Qu
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 …
Invertible Grayscale With Sparsity Enforcing Priors, Yong Du, Yangyang Xu, Taizhong Ye, Qiang Wen, Chufeng Xiao, Junyu Dong, Guoqiang Han, Shengfeng He
Invertible Grayscale With Sparsity Enforcing Priors, Yong Du, Yangyang Xu, Taizhong Ye, Qiang Wen, Chufeng Xiao, Junyu Dong, Guoqiang Han, Shengfeng He
Research Collection School Of Computing and Information Systems
Color dimensionality reduction is believed as a non-invertible process, as re-colorization results in perceptually noticeable and unrecoverable distortion. In this article, we propose to convert a color image into a grayscale image that can fully recover its original colors, and more importantly, the encoded information is discriminative and sparse, which saves storage capacity. Particularly, we design an invertible deep neural network for color encoding and decoding purposes. This network learns to generate a residual image that encodes color information, and it is then combined with a base grayscale image for color recovering. In this way, the non-differentiable compression process (e.g., …
Certis: Digital Transformation Of A Physical Security Company, Singapore Management University
Certis: Digital Transformation Of A Physical Security Company, Singapore Management University
Perspectives@SMU
How a company synonymous with auxiliary police injected sensors and artificial intelligence into its 21st century operations
Trust In And Ethical Design Of Carebots: The Case For Ethics Of Care, Gary Kok Yew Chan
Trust In And Ethical Design Of Carebots: The Case For Ethics Of Care, Gary Kok Yew Chan
Research Collection Yong Pung How School Of Law
The paper has two main objectives: to examine the challenges arising from the use of carebots as well as to discuss how the design of carebots can deal with these challenges. First, it notes that the use of carebots to take care of the physical and mental health of the elderly, children and the disabled as well as to serve as assistive tools and social companions encounter a few main challenges. They relate to the extent of the care robots’ ability to care for humans, potential deception by robot morphology and communications, (over)reliance on or attachment to robots, and the …
Simulating Subject Communities In Case Law Citation Networks, Jerrold Tsin Howe Soh
Simulating Subject Communities In Case Law Citation Networks, Jerrold Tsin Howe Soh
Research Collection Yong Pung How School Of Law
We propose and evaluate generative models for case law citation networks that account for legal authority, subject relevance, and time decay. Since Common Law systems rely heavily on citations to precedent, case law citation networks present a special type of citation graph which existing models do not adequately reproduce. We describe a general framework for simulating node and edge generation processes in such networks, including a procedure for simulating case subjects, and experiment with four methods of modelling subject relevance: using subject similarity as linear features, as fitness coefficients, constraining the citable graph by subject, and computing subject-sensitive PageRank scores. …
Users’ Reception Of Product Recommendations: Analyses Based On Eye Tracking Data, Feiyan Jia, Yani Shi, Choon Ling Sia, Chuan-Hoo Tan, Fiona Fui-Hoon Nah, Keng Siau
Users’ Reception Of Product Recommendations: Analyses Based On Eye Tracking Data, Feiyan Jia, Yani Shi, Choon Ling Sia, Chuan-Hoo Tan, Fiona Fui-Hoon Nah, Keng Siau
Research Collection School Of Computing and Information Systems
Based on eye tracking technology, we study consumers’ overall attention to recommendations appearing at different time settings (i.e., early, mid, and late) and their attention to different information contained in each recommendation, such as recommendation signs, product descriptions, and reviews. By investigating consumers’ eye movement patterns and attention distributions on recommendations, we open the “black box” of why consumers’ reception to recommendations appearing at different time settings varies. The product preference construction literature and mindset theory help to explain why the early recommendations receive the most attention. The need for justification helps to explain why the late recommendations should receive …
Addressing The ‘Unseens’: Digital Wellbeing In The Remote Workplace, Holtjona Galanxhi, Fiona Fui-Hoon Nah
Addressing The ‘Unseens’: Digital Wellbeing In The Remote Workplace, Holtjona Galanxhi, Fiona Fui-Hoon Nah
Research Collection School Of Computing and Information Systems
The ubiquity of sophisticated devices, along with uninterrupted access to the Internet and organizational computerized systems, allows for the “anyplace” workplace to be established. Technology has the potential to deliberately or inadvertently impact psychological wellbeing. Specific psychological demands are inadvertently imposed on remote employees whose permanent online presence is required. Hence, it is important to understand factors affecting digital wellbeing and steps that can be taken to maximize the wellbeing of remote employees. This paper provides suggestions for future research on studying the digital wellbeing of (fully or partially) remote employees. A research framework is proposed to demonstrate the different …
Variational Learning From Implicit Bandit Feedback, Quoc Tuan Truong, Hady W. Lauw
Variational Learning From Implicit Bandit Feedback, Quoc Tuan Truong, Hady W. Lauw
Research Collection School Of Computing and Information Systems
Recommendations are prevalent in Web applications (e.g., search ranking, item recommendation, advertisement placement). Learning from bandit feedback is challenging due to the sparsity of feedback limited to system-provided actions. In this work, we focus on batch learning from logs of recommender systems involving both bandit and organic feedbacks. We develop a probabilistic framework with a likelihood function for estimating not only explicit positive observations but also implicit negative observations inferred from the data. Moreover, we introduce a latent variable model for organic-bandit feedbacks to robustly capture user preference distributions. Next, we analyze the behavior of the new likelihood under two …