Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Physical Sciences and Mathematics (8555)
- Computer Sciences (8538)
- Databases and Information Systems (3453)
- Software Engineering (2164)
- Artificial Intelligence and Robotics (1697)
-
- Information Security (1071)
- Numerical Analysis and Scientific Computing (1025)
- Graphics and Human Computer Interfaces (932)
- Engineering (888)
- Social and Behavioral Sciences (681)
- Business (642)
- Theory and Algorithms (493)
- Computer Engineering (451)
- Operations Research, Systems Engineering and Industrial Engineering (410)
- Programming Languages and Compilers (379)
- OS and Networks (324)
- Communication (297)
- Social Media (240)
- Public Affairs, Public Policy and Public Administration (217)
- Transportation (195)
- Medicine and Health Sciences (181)
- Education (170)
- Management Information Systems (167)
- Data Storage Systems (162)
- E-Commerce (148)
- International and Area Studies (111)
- Asian Studies (110)
- Health Information Technology (110)
- Digital Communications and Networking (104)
- Technology and Innovation (104)
- Keyword
-
- Deep learning (123)
- Machine learning (122)
- Social media (74)
- Artificial intelligence (72)
- Reinforcement learning (69)
-
- Privacy (65)
- Data mining (64)
- Cloud computing (58)
- Deep Learning (56)
- Empirical study (54)
- Optimization (54)
- Security (54)
- Visualization (51)
- Task analysis (50)
- Online learning (49)
- Software engineering (49)
- Training (49)
- Neural networks (48)
- Singapore (48)
- Anomaly detection (47)
- Feature extraction (46)
- Twitter (46)
- Large Language Models (45)
- Blockchain (44)
- Collaboration (44)
- Semantics (43)
- Access control (41)
- Algorithms (40)
- Android (39)
- Natural language processing (39)
- Publication Year
- File Type
Articles 2191 - 2220 of 8596
Full-Text Articles in Entire DC Network
Multimodal Private Signatures, Khoa Nguyen, Fuchun Guo, Willy Susilo, Guomin Yang
Multimodal Private Signatures, Khoa Nguyen, Fuchun Guo, Willy Susilo, Guomin Yang
Research Collection School Of Computing and Information Systems
We introduce Multimodal Private Signature (MPS) - an anonymous signature system that offers a novel accountability feature: it allows a designated opening authority to learn some partial information op about the signer’s identity id, and nothing beyond. Such partial information can flexibly be defined as op = id (as in group signatures), or as op = 0 (like in ring signatures), or more generally, as op = Gj (id), where Gj (·) is a certain disclosing function. Importantly, the value of op is known in advance by the signer, and hence, the latter can decide whether she/he wants to disclose …
Self-Checking Deep Neural Networks For Anomalies And Adversaries In Deployment, Yan Xiao, Ivan Beschastnikh, Yun Lin, Rajdeep Singh Hundal, Xiaofei Xie, David S. Rosenblum, Jin Song Dong
Self-Checking Deep Neural Networks For Anomalies And Adversaries In Deployment, Yan Xiao, Ivan Beschastnikh, Yun Lin, Rajdeep Singh Hundal, Xiaofei Xie, David S. Rosenblum, Jin Song Dong
Research Collection School Of Computing and Information Systems
Deep Neural Networks (DNNs) have been widely adopted, yet DNN models are surprisingly unreliable, which raises significant concerns about their use in critical domains. In this work, we propose that runtime DNN mistakes can be quickly detected and properly dealt with in deployment, especially in settings like self-driving vehicles. Just as software engineering (SE) community has developed effective mechanisms and techniques to monitor and check programmed components, our previous work, SelfChecker, is designed to monitor and correct DNN predictions given unintended abnormal test data. SelfChecker triggers an alarm if the decisions given by the internal layer features of the model …
Andea: Anomaly And Novelty Detection, Explanation, And Accommodation, Guansong Pang, Jundong Li, Anton Van Den Hengel, Longbin Cao, Thomas G. Dietterich
Andea: Anomaly And Novelty Detection, Explanation, And Accommodation, Guansong Pang, Jundong Li, Anton Van Den Hengel, Longbin Cao, Thomas G. Dietterich
Research Collection School Of Computing and Information Systems
The detection of, explanation of, and accommodation to anomalies and novelties are active research areas in multiple communities, including data mining, machine learning, and computer vision. They are applied in various guises including anomaly detection, out-of-distribution example detection, adversarial example recognition and detection, curiosity-driven reinforcement learning, and open-set recognition and adaptation, all of which are of great interest to the SIGKDD community. The techniques developed have been applied in a wide range of domains including fraud detection and anti-money laundering in fintech, early disease detection, intrusion detection in large-scale computer networks and data centers, defending AI systems from adversarial attacks, …
Integrating Forward And Reverse Logistics In Vehicle Routing Problem With Cross-Docking, Vincent F. Yu, Pham T. Anh, Aldy Gunawan
Integrating Forward And Reverse Logistics In Vehicle Routing Problem With Cross-Docking, Vincent F. Yu, Pham T. Anh, Aldy Gunawan
Research Collection School Of Computing and Information Systems
A closed-loop supply chain is one of the vital parts for maintaining the success of enterprises, where forward and reverse logistics are integrated to eliminate wastes (e.g., transportation costs). However, previous studies related to the Vehicle Routing Problem have almost overlooked this integration. This research therefore introduces a variant of the Vehicle Routing Problem with cross-docking (VRPCD) by simultaneously considering three additional factors: (1) various types of vehicles in terms of their capacities and unit travel costs; (2) multiple cross-docks; and (3) the integration of forward and reverse logistics. In particular, the flows of the network consist of distributing goods …
Legion: Massively Composing Rankers For Improved Bug Localization At Adobe, Darryl Jarman, Jeffrey Berry, Riley Smith, Ferdian Thung, David Lo
Legion: Massively Composing Rankers For Improved Bug Localization At Adobe, Darryl Jarman, Jeffrey Berry, Riley Smith, Ferdian Thung, David Lo
Research Collection School Of Computing and Information Systems
Studies have estimated that, in industrial settings, developers spend between 30 and 90 percent of their time fixing bugs. As such, tools that assist in identifying the location of bugs provide value by reducing debugging costs. One such tool is BugLocator. This study initially aimed to determine if developers working on the Adobe Analytics product could use BugLocator. The initial results show that BugLocator achieves a similar accuracy on five of seven Adobe Analytics repositories and on open-source projects. However, these results do not meet the minimum applicability requirement deemed necessary by Adobe Analytics developers prior to possible adoption. Thus, …
Efficient Resource Allocation With Fairness Constraints In Restless Multi-Armed Bandits, Dexun Li, Pradeep Varakantham
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 …
Trajectory Optimization For Safe Navigation In Maritime Traffic Using Historical Data, Chaithanya Basrur, Arambam James Singh, Arunesh Sinha, Akshat Kumar, T. K. Satish Kumar
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 …
Neural-Progressive Hedging: Enforcing Constraints In Reinforcement Learning With Stochastic Programming, Supriyo Ghosh, Laura Wynter, Shiau Hong Lim, Duc Thien Nguyen
Neural-Progressive Hedging: Enforcing Constraints In Reinforcement Learning With Stochastic Programming, Supriyo Ghosh, Laura Wynter, Shiau Hong Lim, Duc Thien Nguyen
Research Collection School Of Computing and Information Systems
We propose a framework, called neural-progressive hedging (NP), that leverages stochastic programming during the online phase of executing a reinforcement learning (RL) policy. The goal is to ensure feasibility with respect to constraints and risk-based objectives such as conditional value-at-risk (CVaR) during the execution of the policy, using probabilistic models of the state transitions to guide policy adjustments. The framework is particularly amenable to the class of sequential resource allocation problems since feasibility with respect to typical resource constraints cannot be enforced in a scalable manner. The NP framework provides an alternative that adds modest overhead during the online phase. …
Crosscbr: Cross‑View Contrastive Learning For Bundle Recommendation, Yunshan Ma, Yingzhi He, An Zhang, Xiang Wang, Tat-Seng Chua
Crosscbr: Cross‑View Contrastive Learning For Bundle Recommendation, Yunshan Ma, Yingzhi He, An Zhang, Xiang Wang, Tat-Seng Chua
Research Collection School Of Computing and Information Systems
Bundle recommendation aims to recommend a bundle of related items to users, which can satisfy the users' various needs with one-stop convenience. Recent methods usually take advantage of both user-bundle and user-item interactions information to obtain informative representations for users and bundles, corresponding to bundle view and item view, respectively. However, they either use a unified view without differentiation or loosely combine the predictions of two separate views, while the crucial cooperative association between the two views' representations is overlooked.In this work, we propose to model the cooperative association between the two different views through cross-view contrastive learning. By encouraging …
Joint Chance-Constrained Staffing Optimization In Multi-Skill Call Centers, Tien Thanh Dam, Thuy Anh Ta, Tien Mai
Joint Chance-Constrained Staffing Optimization In Multi-Skill Call Centers, Tien Thanh Dam, Thuy Anh Ta, Tien Mai
Research Collection School Of Computing and Information Systems
This paper concerns the staffing optimization problem in multi-skill call centers. The objective is to find a minimal cost staffing solution while meeting a target level for the quality of service (QoS) to customers. We consider a staffing problem in which joint chance constraints are imposed on the QoS of the day. Our joint chance-constrained formulation is more rational capturing the correlation between different call types, as compared to separate chance-constrained versions considered in previous studies. We show that, in general, the probability functions in the joint-chance constraints display S-shaped curves, and the optimal solutions should belong to the concave …
Fed-Ltd: Towards Cross-Platform Ride Hailing Via Federated Learning To Dispatch, Yansheng Wang, Yongxin Tong, Zimu Zhou, Ziyao Ren, Yi Xu, Guobin Wu, Weifeng Lv
Fed-Ltd: Towards Cross-Platform Ride Hailing Via Federated Learning To Dispatch, Yansheng Wang, Yongxin Tong, Zimu Zhou, Ziyao Ren, Yi Xu, Guobin Wu, Weifeng Lv
Research Collection School Of Computing and Information Systems
Learning based order dispatching has witnessed tremendous success in ride hailing. However, the success halts within individual ride hailing platforms because sharing raw order dispatching data across platforms may leak user privacy and business secrets. Such data isolation not only impairs user experience but also decreases the potential revenues of the platforms. In this paper, we advocate federated order dispatching for cross-platform ride hailing, where multiple platforms collaboratively make dispatching decisions without sharing their local data. Realizing this concept calls for new federated learning strategies that tackle the unique challenges on effectiveness, privacy and efficiency in the context of order …
Finding Meta Winning Ticket To Train Your Maml, Dawei Gao, Yuexiang Xie, Zimu Zhou, Zhen Wang, Yaliang Li, Bolin. Ding
Finding Meta Winning Ticket To Train Your Maml, Dawei Gao, Yuexiang Xie, Zimu Zhou, Zhen Wang, Yaliang Li, Bolin. Ding
Research Collection School Of Computing and Information Systems
The lottery ticket hypothesis (LTH) states that a randomly initialized dense network contains sub-networks that can be trained in isolation to the performance of the dense network. In this paper, to achieve rapid learning with less computational cost, we explore LTH in the context of meta learning. First, we experimentally show that there are sparse sub-networks, known as meta winning tickets, which can be meta-trained to few-shot classification accuracy to the original backbone. The application of LTH in meta learning enables the adaptation of meta-trained networks on various IoT devices with fewer computation. However, the status quo to identify winning …
Finding Meta Winning Ticket To Train Your Maml, Dawei Gao, Yuexiang Xie, Zimu Zhou, Zhen Wang, Yaliang Li, Bolin. Ding
Finding Meta Winning Ticket To Train Your Maml, Dawei Gao, Yuexiang Xie, Zimu Zhou, Zhen Wang, Yaliang Li, Bolin. Ding
Research Collection School Of Computing and Information Systems
The lottery ticket hypothesis (LTH) states that a randomly initialized dense network contains sub-networks that can be trained in isolation to the performance of the dense network. In this paper, to achieve rapid learning with less computational cost, we explore LTH in the context of meta learning. First, we experimentally show that there are sparse sub-networks, known as meta winning tickets, which can be meta-trained to few-shot classification accuracy to the original backbone. The application of LTH in meta learning enables the adaptation of meta-trained networks on various IoT devices with fewer computation. However, the status quo to identify winning …
Structured Encryption For Knowledge Graphs, Yujie Xue, Lanxiang Chen, Yu Mi, Lingfang Zeng, Fatemeh Rezaeibagha, Robert H. Deng
Structured Encryption For Knowledge Graphs, Yujie Xue, Lanxiang Chen, Yu Mi, Lingfang Zeng, Fatemeh Rezaeibagha, Robert H. Deng
Research Collection School Of Computing and Information Systems
We investigate the problem of structured encryption (STE) for knowledge graphs (KGs) where the knowledge of data can be efficiently and privately queried. Presently, the application of natural language processing (NLP) for knowledge-based search is gradually emerging. Compared with the traditional search based only on keywords of documents-symmetric searchable encryption (SSE), the knowledge-based search system transforms the latent knowledge contained in documents into a semantic network as a knowledge base, which greatly improves the accuracy and relevance of search results. In order to develop a knowledge-based search, the contents of documents are analyzed and extracted using KG techniques (e.g. multi-relational …
Ransomsoc: A More Effective Security Operations Center To Detect And Respond To Ransomware Attacks, Anthony Cheuk Tung Lai, Ping Fan Ke, Kelvin Chan, Siu Ming Yiu, Dongsun Kim, Wai Kin Wong, Shuai Wang, Joseph Muppala, Alan Ho
Ransomsoc: A More Effective Security Operations Center To Detect And Respond To Ransomware Attacks, Anthony Cheuk Tung Lai, Ping Fan Ke, Kelvin Chan, Siu Ming Yiu, Dongsun Kim, Wai Kin Wong, Shuai Wang, Joseph Muppala, Alan Ho
Research Collection School Of Computing and Information Systems
Ransomware remains a major threat for organizations. Despite a lot of research done, existing solutions still have at least two shortcomings. (I) Slow detection time: by the time we realize that the system is under ransomware attack, almost all files have been encrypted. (II) Without a ransomwareaware backup scheme: Most existing systems, in particular those in SMEs (small and medium enterprises), do not have a proper backup system. Even they have it, either it is not a remote-site backup (i.e., files in the backup system may also be encrypted) or it is not designed for ransomware attacks. In this paper, …
P-Meta: Towards On-Device Deep Model Adaptation, Zhongnan Qu, Zimu Zhou, Yongxin Tong, Lothar Thiele
P-Meta: Towards On-Device Deep Model Adaptation, Zhongnan Qu, Zimu Zhou, Yongxin Tong, Lothar Thiele
Research Collection School Of Computing and Information Systems
Data collected by IoT devices are often private and have a large diversity across users. Therefore, learning requires pre-training a model with available representative data samples, deploying the pre-trained model on IoT devices, and adapting the deployed model on the device with local data. Such an on-device adaption for deep learning empowered applications demands data and memory efficiency. However, existing gradient-based meta learning schemes fail to support memory-efficient adaptation. To this end, we propose p-Meta, a new meta learning method that enforces structure-wise partial parameter updates while ensuring fast generalization to unseen tasks. Evaluations on few-shot image classification and reinforcement …
Mobile Health With Head-Worn Devices: Challenges And Opportunities, Andrea Ferlini, Dong Ma, Lorena Qendro, Cecilia Mascolo
Mobile Health With Head-Worn Devices: Challenges And Opportunities, Andrea Ferlini, Dong Ma, Lorena Qendro, Cecilia Mascolo
Research Collection School Of Computing and Information Systems
Monitoring human behavior and health status using mobile devices, a.k.a. Mobile Health, has gained increasing attention from both academia and industry in recent years. It allows imperceptible health tracking from the users and remote health management from the healthcare service providers. Headworn devices, such as earbuds, glasses, and BCIs (Brain Computer Interfaces), exhibit great potential for mobile health due to their advantageous wearing position, the human head, which is motion-resilient and full of human bio-signals. Although initial attempts have been conducted for different healthcare applications with head-worn devices, this fast-growing area is still under-explored and retains great promises. With this …
Self-Adaptive Systems: A Systematic Literature Review Across Categories And Domains, Terence Wong, Markus Wagner, Christoph Treude
Self-Adaptive Systems: A Systematic Literature Review Across Categories And Domains, Terence Wong, Markus Wagner, Christoph Treude
Research Collection School Of Computing and Information Systems
Context: Championed by IBM’s vision of autonomic computing paper in 2003, the autonomic computing research field has seen increased research activity over the last 20 years. Several conferences (SEAMS, SASO, ICAC) and workshops (SISSY) have been established and have contributed to the autonomic computing knowledge base in search of a new kind of system — a self-adaptive system (SAS). These systems are characterized by being context-aware and can act on that awareness. The actions carried out could be on the system or on the context (or environment). The underlying goal of a SAS is the sustained achievement of its goals …
Systems And Methods For Contrastive Learning With Self-Labeling Refinement, Pan Zhou, Caiming Xiong, Steven Hoi
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.
Destress: Computation-Optimal And Communication-Efficient Decentralized Nonconvex Finite-Sum Optimization, Boyue Li, Zhize Li, Yuejie Chi
Destress: Computation-Optimal And Communication-Efficient Decentralized Nonconvex Finite-Sum Optimization, Boyue Li, Zhize Li, Yuejie Chi
Research Collection School Of Computing and Information Systems
Emerging applications in multiagent environments such as internet-of-things, networked sensing, autonomous systems, and federated learning, call for decentralized algorithms for finite-sum optimizations that are resource efficient in terms of both computation and communication. In this paper, we consider the prototypical setting where the agents work collaboratively to minimize the sum of local loss functions by only communicating with their neighbors over a predetermined network topology. We develop a new algorithm, called DEcentralized STochastic REcurSive gradient methodS (DESTRESS) for nonconvex finite-sum optimization, which matches the optimal incremental first-order oracle complexity of centralized algorithms for finding first-order stationary points, while maintaining communication …
Investigating Toxicity Changes Of Cross-Community Redditors From 2 Billion Posts And Comments, Hind Almerekhi, Haewoon Kwak, Bernard J. Jansen
Investigating Toxicity Changes Of Cross-Community Redditors From 2 Billion Posts And Comments, Hind Almerekhi, Haewoon Kwak, Bernard J. Jansen
Research Collection School Of Computing and Information Systems
This research investigates changes in online behavior of users who publish in multiple communities on Reddit by measuring their toxicity at two levels. With the aid of crowdsourcing, we built a labeled dataset of 10,083 Reddit comments, then used the dataset to train and fine-tune a Bidirectional Encoder Representations from Transformers (BERT) neural network model. The model predicted the toxicity levels of 87,376,912 posts from 577,835 users and 2,205,581,786 comments from 890,913 users on Reddit over 16 years, from 2005 to 2020. This study utilized the toxicity levels of user content to identify toxicity changes by the user within the …
Learning To Ask Critical Questions For Assisting Product Search, Zixuan Li, Lizi Liao, Tat-Seng Chua
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 …
Towards Aligning Slides And Video Snippets: Mitigating Sequence And Content Mismatches, Ziyuan Liu, Hady W. Lauw
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 …
Enhancing A Qubo Solver Via Data Driven Multi-Start And Its Application To Vehicle Routing Problem, Whei Yeap Suen, Matthieu Parizy, Hoong Chuin Lau
Enhancing A Qubo Solver Via Data Driven Multi-Start And Its Application To Vehicle Routing Problem, Whei Yeap Suen, Matthieu Parizy, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
Quadratic unconstrained binary optimization (QUBO) models have garnered growing interests as a strong alternative modelling framework for solving combinatorial optimization problems. A wide variety of optimization problems that are usually studied using conventional Operations Research approaches can be formulated as QUBO problems. However, QUBO solvers do not guarantee optimality when solving optimization problems. Instead, obtaining high quality solutions using QUBO solvers entails tuning of multiple parameters. Here in our work, we conjecture that the initial states adjustment method used in QUBO solvers can be improved, where careful tuning will yield overall better results. We propose a data-driven multi-start algorithm that …
A Recommendation System Approach To Tune A Qubo Solver, Siong Thye Goh, Jianyuan Bo, Matthieu Parizy, Hoong Chuin Lau
A Recommendation System Approach To Tune A Qubo Solver, Siong Thye Goh, Jianyuan Bo, Matthieu Parizy, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
There are two major challenges to solving constrained optimization problems using a QuadraticUnconstrained Binary Optimization or QUBO solver (QS). First, we need to tune both the underlyingproblem parameters and the algorithm parameters. Second, the solution returned from a QSmight not be feasible. While it is common to use automated tuners such as SMAC and Hyperopt totune the algorithm parameters, the initial search ranges input for the auto tuner affect the performanceof the QS. In this paper, we propose a framework that resembles the Algorithm Selection(AS) framework to tune algorithm parameters for an annealing-based QS. To cope with constraints,we focus on …
Uncovering Inclusivity Gaps In Design Pedagogy Through The Digital Design Marginalization Framework, Jaisie Sin, Cosmin Munteanu, Michael Nixon, Velian Pandeliev, Garreth W. Tigwell, Kristen Shinohara, Anthony Tang, Steve Szigeti
Uncovering Inclusivity Gaps In Design Pedagogy Through The Digital Design Marginalization Framework, Jaisie Sin, Cosmin Munteanu, Michael Nixon, Velian Pandeliev, Garreth W. Tigwell, Kristen Shinohara, Anthony Tang, Steve Szigeti
Research Collection School Of Computing and Information Systems
Designers play a key role in the design of inclusive and socially conscious interfaces. Thus, it is imperative for designers to be thoughtful of the ethical and social implications of design. However, gaps in the foundational training that designers receive (e.g., as university students) can negatively impact their ability to consider the social implications of their design practice. This can result in consequences such as digital marginalization, which, as defined by the Digital Design Marginalization (DDM) framework, is the “pushing away”, whether intentional or not, of a defined group of users from a digital or online service or system, where …
Self-Guided Learning To Denoise For Robust Recommendation, Yunjun Gao, Yuntao Du, Yujia Hu, Lu Chen, Xinjun Zhu, Ziquan Fang, Baihua Zheng
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 …
Designing Flipped Learning Activities For Beginner Programming Course, Benjamin Gan, Eng Lieh Ouh
Designing Flipped Learning Activities For Beginner Programming Course, Benjamin Gan, Eng Lieh Ouh
Research Collection School Of Computing and Information Systems
This study focuses on designing flipped classroom learning activities across pre-class problem-based exercises; with in-class active discussions and practical problem-solving sessions; and follow up with postclass problem-based labs and assessments. We evaluate the effectiveness of our learning activities based on student surveys, course feedback, grades, and teacher feedback for a beginner programming course with non-IS students. We describe detail programming learning activities with comparisons to existing practices based on related work. Our findings are that majority of students (86%) agreed with flipped classroom, but teachers should be aware of the 14% who disagreed and cater for them. Teachers should avoid …
Cross-Lingual Transfer Learning For Statistical Type Inference, Zhiming Li, Xiaofei Xie, Haoliang Li, Zhengzi Xu, Yi Li, Yang Liu
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 …
Gbgallery: A Benchmark And Framework For Game Testing, Zhuo Li, Yuechen Wu, Lei Ma, Xiaofei Xie, Yingfeng Chen, Changjie Fan
Gbgallery: A Benchmark And Framework For Game Testing, Zhuo Li, Yuechen Wu, Lei Ma, Xiaofei Xie, Yingfeng Chen, Changjie Fan
Research Collection School Of Computing and Information Systems
Software bug database and benchmark are the wheels of advancing automated software testing. In practice, real bugs often occur sparsely relative to the amount of software code, the extraction and curation of which are quite labor-intensive but can be essential to facilitate the innovation of testing techniques. Over the past decade, several milestones have been made to construct bug databases, pushing the progress of automated software testing research. However, up to the present, it still lacks a real bug database and benchmark for game software, making current game testing research mostly stagnant. The missing of bug database and framework greatly …