Open Access. Powered by Scholars. Published by Universities.®
Databases and Information Systems Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Numerical Analysis and Scientific Computing (661)
- Social and Behavioral Sciences (342)
- Artificial Intelligence and Robotics (340)
- Graphics and Human Computer Interfaces (310)
- Software Engineering (234)
-
- Business (225)
- Communication (216)
- Engineering (192)
- Social Media (186)
- Theory and Algorithms (175)
- Computer Engineering (165)
- Information Security (142)
- OS and Networks (115)
- Programming Languages and Compilers (97)
- E-Commerce (81)
- Data Storage Systems (69)
- Medicine and Health Sciences (66)
- Public Affairs, Public Policy and Public Administration (54)
- Education (53)
- Management Information Systems (50)
- Transportation (46)
- Health Information Technology (45)
- International and Area Studies (43)
- Asian Studies (42)
- Finance and Financial Management (42)
- Digital Communications and Networking (32)
- Technology and Innovation (25)
- Keyword
-
- Social media (53)
- Machine learning (49)
- Online learning (43)
- Deep learning (40)
- Data mining (39)
-
- Artificial intelligence (34)
- Query processing (29)
- Twitter (28)
- Classification (24)
- Reinforcement learning (24)
- Algorithms (23)
- Deep Learning (23)
- Neural networks (23)
- Clustering (21)
- Graph neural networks (20)
- Machine Learning (20)
- Semantics (20)
- Task analysis (20)
- Algorithm (19)
- Visualization (19)
- Anomaly detection (18)
- Cloud computing (18)
- Image retrieval (18)
- Recommender systems (18)
- Social network (18)
- Performance (17)
- Sentiment analysis (17)
- Singapore (17)
- Natural language processing (16)
- Social networks (16)
- Publication Year
Articles 661 - 690 of 3436
Full-Text Articles in Databases and Information Systems
Declaration-Based Prompt Tuning For Visual Question Answering, Yuhang Liu, Wei Wei, Feida Zhu, Feida Zhu
Declaration-Based Prompt Tuning For Visual Question Answering, Yuhang Liu, Wei Wei, Feida Zhu, Feida Zhu
Research Collection School Of Computing and Information Systems
In recent years, the pre-training-then-fine-tuning paradigm has yielded immense success on a wide spectrum of cross-modal tasks, such as visual question answering (VQA), in which a visual-language (VL) model is first optimized via self-supervised task objectives, e.g., masked language modeling (MLM) and image-text matching (ITM), and then fine-tuned to adapt to downstream task (e.g., VQA) via a brand-new objective function, e.g., answer prediction. However, the inconsistency of the objective forms not only severely limits the generalization of pre-trained VL models to downstream tasks, but also requires a large amount of labeled data for fine-tuning. To alleviate the problem, we propose …
Multi-Level Cross-View Contrastive Learning For Knowledge-Aware Recommender System, Ding Zou, Wei Wei, Xian-Ling Mao, Ziyang Wang, Minghui Qiu, Feida Zhu, Xin Cao
Multi-Level Cross-View Contrastive Learning For Knowledge-Aware Recommender System, Ding Zou, Wei Wei, Xian-Ling Mao, Ziyang Wang, Minghui Qiu, Feida Zhu, Xin Cao
Research Collection School Of Computing and Information Systems
Knowledge graph (KG) plays an increasingly important role in recommender systems. Recently, graph neural networks (GNNs) based model has gradually become the theme of knowledge-aware recommendation (KGR). However, there is a natural deficiency for GNN-based KGR models, that is, the sparse supervised signal problem, which may make their actual performance drop to some extent. Inspired by the recent success of contrastive learning in mining supervised signals from data itself, in this paper, we focus on exploring the contrastive learning in KG-aware recommendation and propose a novel multi-level cross-view contrastive learning mechanism, named MCCLK. Different from traditional contrastive learning methods which …
Contours Of Virtual Enfreakment In Fighting Game Characters, Sercan Sengun, Peter Mawhorter, James Bowie-Wilson, Yusef Audeh, Haewoon Kwak, D. Fox Harrell
Contours Of Virtual Enfreakment In Fighting Game Characters, Sercan Sengun, Peter Mawhorter, James Bowie-Wilson, Yusef Audeh, Haewoon Kwak, D. Fox Harrell
Research Collection School Of Computing and Information Systems
Characters in fighting videogames1 such as Street Fighter V and Tekken7 typically reveal a phenomenon that we define as virtual enfreakment: their bodies, costumes, and fighting styles are exaggerated (1) in a manner that emphasizes perceived exoticism and (2) to enable them to be easily visually and conceptually distinguishable from one another. Here, using both quantitative and qualitative methods, including crowd-sourced surveys and analyses of game mechanics, we report on the contours of virtual enfreakment in those games. We specifically examine differences in character design across gender, national-origin, and skin-color lines. Disappointingly but not surprisingly, we find racism and sexism …
Multi-Agent Reinforcement Learning For Traffic Signal Control Through Universal Communication Method, Qize Jiang, Minhao Qin, Shengmin Shi, Weiwei Sun Sun, Baihua Zheng
Multi-Agent Reinforcement Learning For Traffic Signal Control Through Universal Communication Method, Qize Jiang, Minhao Qin, Shengmin Shi, Weiwei Sun Sun, Baihua Zheng
Research Collection School Of Computing and Information Systems
How to coordinate the communication among intersections effectively in real complex traffic scenarios with multi-intersection is challenging. Existing approaches only enable the communication in a heuristic manner without considering the content/importance of information to be shared. In this paper, we propose a universal communication form UniComm between intersections. UniComm embeds massive observations collected at one agent into crucial predictions of their impact on its neighbors, which improves the communication efficiency and is universal across existing methods. We also propose a concise network UniLight to make full use of communications enabled by UniComm. Experimental results on real datasets demonstrate that UniComm …
Ai-Enabled Adaptive Learning Using Automated Topic Alignment And Doubt Detection, Kar Way Tan, Siaw Ling Lo, Eng Lieh Ouh, Wei Leng Neo
Ai-Enabled Adaptive Learning Using Automated Topic Alignment And Doubt Detection, Kar Way Tan, Siaw Ling Lo, Eng Lieh Ouh, Wei Leng Neo
Research Collection School Of Computing and Information Systems
Implementing adaptive learning is often a challenging task at higher learning institutions where the students come from diverse backgrounds and disciplines. In this work, we collected informal learning journals from learners. Using the journals, we trained two machine learning models, an automated topic alignment and a doubt detection model to identify areas of adjustment required for teaching and students who require additional attention. The models form the baseline for a quiz recommender tool to dynamically generate personalized quizzes for each learner as practices to reinforce learning. Our pilot deployment of our AI-enabled Adaptive Learning System showed that our approach delivers …
Data-Driven Retail Decision-Making Using Spatial Partitioning And Delineation Of Communities, Ming Hui Tan, Kar Way Tan
Data-Driven Retail Decision-Making Using Spatial Partitioning And Delineation Of Communities, Ming Hui Tan, Kar Way Tan
Research Collection School Of Computing and Information Systems
Urbanisation is resulting in rapid growth in road networks within cities. The evolution of road networks can be indicative of a city's economic growth and it is a field of research gaining prominence in recent years. This paper proposes a framework for spatial partition of large scale road networks that produces appropriately sized geospatial units in order to identify the type of community they serve. To this end, we have developed a three-stage procedure which first partitions the road network using Louvain method, followed by outlining the boundary of each partition using Uber H3 grids before classifying each partition using …
Docee: A Large-Scale And Fine-Grained Benchmark For Document-Level Event Extraction, Meihan Tong, Bin Xu, Shuai Wang, Meihuan Han, Yixin Cao, Jiangqi Zhu, Siyu Chen, Lei Hou, Juanzi Li
Docee: A Large-Scale And Fine-Grained Benchmark For Document-Level Event Extraction, Meihan Tong, Bin Xu, Shuai Wang, Meihuan Han, Yixin Cao, Jiangqi Zhu, Siyu Chen, Lei Hou, Juanzi Li
Research Collection School Of Computing and Information Systems
Event extraction aims to identify an event and then extract the arguments participating in the event. Despite the great success in sentencelevel event extraction, events are more naturally presented in the form of documents, with event arguments scattered in multiple sentences. However, a major barrier to promote documentlevel event extraction has been the lack of large-scale and practical training and evaluation datasets. In this paper, we present DocEE, a new document-level event extraction dataset including 27,000+ events, 180,000+ arguments. We highlight three features: largescale manual annotations, fine-grained argument types and application-oriented settings. Experiments show that there is still a big …
End-To-End Open-Set Semi-Supervised Node Classification With Out-Of-Distribution Detection, Tiancheng Huang, Donglin Wang, Yuan Fang
End-To-End Open-Set Semi-Supervised Node Classification With Out-Of-Distribution Detection, Tiancheng Huang, Donglin Wang, Yuan Fang
Research Collection School Of Computing and Information Systems
Out-Of-Distribution (OOD) samples are prevalent in real-world applications. The OOD issue becomes even more severe on graph data, as the effect of OOD nodes can be potentially amplified by propagation through the graph topology. Recent works have considered the OOD detection problem, which is critical for reducing the uncertainty in learning and improving the robustness. However, no prior work considers simultaneously OOD detection and node classification on graphs in an end-to-end manner. In this paper, we study a novel problem of end-to-end open-set semisupervised node classification (OSSNC) on graphs, which deals with node classification in the presence of OOD nodes. …
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 …
A Weakly Supervised Propagation Model For Rumor Verification And Stance Detection With Multiple Instance Learning, Ruichao Yang, Jing Ma, Hongzhan Lin, Wei Gao
A Weakly Supervised Propagation Model For Rumor Verification And Stance Detection With Multiple Instance Learning, Ruichao Yang, Jing Ma, Hongzhan Lin, Wei Gao
Research Collection School Of Computing and Information Systems
The diffusion of rumors on social media generally follows a propagation tree structure, which provides valuable clues on how an original message is transmitted and responded by users over time. Recent studies reveal that rumor verification and stance detection are two relevant tasks that can jointly enhance each other despite their differences. For example, rumors can be debunked by cross-checking the stances conveyed by their relevant posts, and stances are also conditioned on the nature of the rumor. However, stance detection typically requires a large training set of labeled stances at post level, which are rare and costly to annotate. …
Automatic Noisy Label Correction For Fine-Grained Entity Typing, Weiran Pan, Wei Wei, Feida Zhu
Automatic Noisy Label Correction For Fine-Grained Entity Typing, Weiran Pan, Wei Wei, Feida Zhu
Research Collection School Of Computing and Information Systems
Fine-grained entity typing (FET) aims to assign proper semantic types to entity mentions according to their context, which is a fundamental task in various entity-leveraging applications. Current FET systems usually establish on large-scale weaklysupervised/distantly annotation data, which may contain abundant noise and thus severely hinder the performance of the FET task. Although previous studies have made great success in automatically identifying the noisy labels in FET, they usually rely on some auxiliary resources which may be unavailable in real-world applications (e.g., pre-defined hierarchical type structures, humanannotated subsets). In this paper, we propose a novel approach to automatically correct noisy labels …
Multi-Level Cross-View Contrastive Learning For Knowledge-Aware Recommender System, Ding Zou, Wei Wei, Xian-Ling Mao, Ziyang Wang, Minghui Qiu, Feida Zhu, Xin Cao
Multi-Level Cross-View Contrastive Learning For Knowledge-Aware Recommender System, Ding Zou, Wei Wei, Xian-Ling Mao, Ziyang Wang, Minghui Qiu, Feida Zhu, Xin Cao
Research Collection School Of Computing and Information Systems
Knowledge graph (KG) plays an increasingly important role in recommender systems. Recently, graph neural networks (GNNs) based model has gradually become the theme of knowledge-aware recommendation (KGR). However, there is a natural deficiency for GNN-based KGR models, that is, the sparse supervised signal problem, which may make their actual performance drop to some extent. Inspired by the recent success of contrastive learning in mining supervised signals from data itself, in this paper, we focus on exploring the contrastive learning in KG-aware recommendation and propose a novel multi-level cross-view contrastive learning mechanism, named MCCLK. Different from traditional contrastive learning methods which …
Efficient Neural Neighborhood Search For Pickup And Delivery Problems, Yining Ma, Jingwen Li, Zhiguang Cao, Wen Song, Hongliang Guo, Yuejiao Gong, Meng Chee Chee
Efficient Neural Neighborhood Search For Pickup And Delivery Problems, Yining Ma, Jingwen Li, Zhiguang Cao, Wen Song, Hongliang Guo, Yuejiao Gong, Meng Chee Chee
Research Collection School Of Computing and Information Systems
We present an efficient Neural Neighborhood Search (N2S) approach for pickup and delivery problems (PDPs). In specific, we design a powerful Synthesis Attention that allows the vanilla self-attention to synthesize various types of features regarding a route solution. We also exploit two customized decoders that automatically learn to perform removal and reinsertion of a pickup-delivery node pair to tackle the precedence constraint. Additionally, a diversity enhancement scheme is leveraged to further ameliorate the performance. Our N2S is generic, and extensive experiments on two canonical PDP variants show that it can produce state-of-the-art results among existing neural methods. Moreover, it even …
Hakg: Hierarchy-Aware Knowledge Gated Network For Recommendation, Yuntao Du, Xinjun Zhu, Lu Chen, Baihua Zheng, Yunjun Gao
Hakg: Hierarchy-Aware Knowledge Gated Network For Recommendation, Yuntao Du, Xinjun Zhu, Lu Chen, Baihua Zheng, Yunjun Gao
Research Collection School Of Computing and Information Systems
Knowledge graph (KG) plays an increasingly important role to improve the recommendation performance and interpretability. A recent technical trend is to design end-to-end models based on information propagation mechanism. However, existing propagationbased methods fail to (1) model the underlying hierarchical structures and relations, and (2) capture the high-order collaborative signals of items for learning high-quality user and item representations. In this paper, we propose a new model, called Hierarchy-Aware Knowledge Gated Network (HAKG), to tackle the aforementioned problems. Technically, we model users and items (that are captured by a user-item graph), as well as entities and relations (that are captured …
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 …
Structured And Natural Responses Co-Generation For Conversational Search, Chenchen Ye, Lizi Liao, Fuli Feng, Wei Ji, Tat-Seng Chua
Structured And Natural Responses Co-Generation For Conversational Search, Chenchen Ye, Lizi Liao, Fuli Feng, Wei Ji, Tat-Seng Chua
Research Collection School Of Computing and Information Systems
Generating fluent and informative natural responses while maintaining representative internal states for search optimization is critical for conversational search systems. Existing approaches either 1) predict structured dialog acts first and then generate natural response; or 2) map conversation context to natural responses directly in an end-to-end manner. Both kinds of approaches have shortcomings. The former suffers from error accumulation while the semantic associations between structured acts and natural responses are confined in single direction. The latter emphasizes generating natural responses but fails to predict structured acts. Therefore, we propose a neural co-generation model that generates the two concurrently. The key …
What Makes The Story Forward?: Inferring Commonsense Explanations As Prompts For Future Event Generation, Li Lin, Yixin Cao, Lifu Huang, Shu Ang Li, Xuming Hu, Lijie Wen, Jianmin Wang
What Makes The Story Forward?: Inferring Commonsense Explanations As Prompts For Future Event Generation, Li Lin, Yixin Cao, Lifu Huang, Shu Ang Li, Xuming Hu, Lijie Wen, Jianmin Wang
Research Collection School Of Computing and Information Systems
Prediction over event sequences is critical for many real-world applications in Information Retrieval and Natural Language Processing. Future Event Generation (FEG) is a challenging task in event sequence prediction because it requires not only fluent text generation but also commonsense reasoning to maintain the logical coherence of the entire event story. In this paper, we propose a novel explainable FEG framework, Coep. It highlights and integrates two types of event knowledge, sequential knowledge of direct event-event relations and inferential knowledge that reflects the intermediate character psychology between events, such as intents, causes, reactions, which intrinsically pushes the story forward. To …
On Measuring Network Robustness For Weighted Networks, Jianbing Zheng, Ming Gao, Ee-Peng Lim, David Lo, Cheqing Jin, Aoying Zhou
On Measuring Network Robustness For Weighted Networks, Jianbing Zheng, Ming Gao, Ee-Peng Lim, David Lo, Cheqing Jin, Aoying Zhou
Research Collection School Of Computing and Information Systems
Network robustness measures how well network structure is strong and healthy when it is under attack, such as vertices joining and leaving. It has been widely used in many applications, such as information diffusion, disease transmission, and network security. However, existing metrics, including node connectivity, edge connectivity, and graph expansion, can be suboptimal for measuring network robustness since they are inefficient to be computed and cannot directly apply to the weighted networks or disconnected networks. In this paper, we define the RR-energy as a new robustness measurement for weighted networks based on the method of spectral analysis. RR-energy can cope …
Harnessing Confidence For Report Aggregation In Crowdsourcing Environments, Hadeel Alhosaini, Xianzhi Wang, Lina Yao, Zhong Yang, Farookh Hussain, Ee-Peng Lim
Harnessing Confidence For Report Aggregation In Crowdsourcing Environments, Hadeel Alhosaini, Xianzhi Wang, Lina Yao, Zhong Yang, Farookh Hussain, Ee-Peng Lim
Research Collection School Of Computing and Information Systems
Crowdsourcing is an effective means of accomplishing human intelligence tasks by leveraging the collective wisdom of crowds. Given reports of various accuracy degrees from workers, it is important to make wise use of these reports to derive accurate task results. Intuitively, a task result derived from a sufficient number of reports bears lower uncertainty, and higher uncertainty otherwise. Existing report aggregation research, however, has largely neglected the above uncertainty issue. In this regard, we propose a novel report aggregation framework that defines and incorporates a new confidence measure to quantify the uncertainty associated with tasks and workers, thereby enhancing result …
Early Rumor Detection Using Neural Hawkes Process With A New Benchmark Dataset, Fengzhu Zeng, Wei Gao
Early Rumor Detection Using Neural Hawkes Process With A New Benchmark Dataset, Fengzhu Zeng, Wei Gao
Research Collection School Of Computing and Information Systems
Little attention has been paid on EArly Rumor Detection (EARD), and EARD performance was evaluated inappropriately on a few datasets where the actual early-stage information is largely missing. To reverse such situation, we construct BEARD, a new Benchmark dataset for EARD, based on claims from fact-checking websites by trying to gather as many early relevant posts as possible. We also propose HEARD, a novel model based on neural Hawkes process for EARD, which can guide a generic rumor detection model to make timely, accurate and stable predictions. Experiments show that HEARD achieves effective EARD performance on two commonly used general …
Cosm2ic: Optimizing Real-Time Multi-Modal Instruction Comprehension, Weerakoon Mudiyanselage Dulanga Kaveesha Weerakoon, Vigneshwaran Subbaraju, Minh Anh Tuan Tran, Archan Misra
Cosm2ic: Optimizing Real-Time Multi-Modal Instruction Comprehension, Weerakoon Mudiyanselage Dulanga Kaveesha Weerakoon, Vigneshwaran Subbaraju, Minh Anh Tuan Tran, Archan Misra
Research Collection School Of Computing and Information Systems
Supporting real-time, on-device execution of multi-modal referring instruction comprehension models is an important challenge to be tackled in embodied Human-Robot Interaction. However, state-of-the-art deep learning models are resource-intensive and unsuitable for real-time execution on embedded devices. While model compression can achieve a reduction in computational resources up to a certain point, further optimizations result in a severe drop in accuracy. To minimize this loss in accuracy, we propose the COSM2IC framework, with a lightweight Task Complexity Predictor, that uses multiple sensor inputs to assess the instructional complexity and thereby dynamically switch between a set of models of varying computational intensity …
Test Mimicry To Assess The Exploitability Of Library Vulnerabilities, Hong Jin Kang, Truong Giang Nguyen, Bach Le, Corina S. Pasareanu, David Lo
Test Mimicry To Assess The Exploitability Of Library Vulnerabilities, Hong Jin Kang, Truong Giang Nguyen, Bach Le, Corina S. Pasareanu, David Lo
Research Collection School Of Computing and Information Systems
Modern software engineering projects often depend on open-source software libraries, rendering them vulnerable to potential security issues in these libraries. Developers of client projects have to stay alert of security threats in the software dependencies. While there are existing tools that allow developers to assess if a library vulnerability is reachable from a project, they face limitations. Call graphonly approaches may produce false alarms as the client project may not use the vulnerable code in a way that triggers the vulnerability, while test generation-based approaches faces difficulties in overcoming the intrinsic complexity of exploiting a vulnerability, where extensive domain knowledge …
A Mean-Field Markov Decision Process Model For Spatial Temporal Subsidies In Ride-Sourcing Markets, Zheng Zhu, Jintao Ke, Hai Wang
A Mean-Field Markov Decision Process Model For Spatial Temporal Subsidies In Ride-Sourcing Markets, Zheng Zhu, Jintao Ke, Hai Wang
Research Collection School Of Computing and Information Systems
Ride-sourcing services are increasingly popular because of their ability to accommodate on-demand travel needs. A critical issue faced by ride-sourcing platforms is the supply-demand imbalance, as a result of which drivers may spend substantial time on idle cruising and picking up remote passengers. Some platforms attempt to mitigate the imbalance by providing relocation guidance for idle drivers who may have their own self-relocation strategies and decline to follow the suggestions. Platforms then seek to induce drivers to system-desirable locations by offering them subsidies. This paper proposes a mean-field Markov decision process (MF-MDP) model to depict the dynamics in ride-sourcing markets …
3pc: Three Point Compressors For Communication-Efficient Distributed Training And A Better Theory For Lazy Aggregation, Peter Richtarik, Igor Sokolov, Ilyas Fatkhullin, Elnur Gasanov, Zhize Li, Eduard Gorbunov
3pc: Three Point Compressors For Communication-Efficient Distributed Training And A Better Theory For Lazy Aggregation, Peter Richtarik, Igor Sokolov, Ilyas Fatkhullin, Elnur Gasanov, Zhize Li, Eduard Gorbunov
Research Collection School Of Computing and Information Systems
We propose and study a new class of gradient communication mechanisms for communication-efficient training -- three point compressors (3PC) -- as well as efficient distributed nonconvex optimization algorithms that can take advantage of them. Unlike most established approaches, which rely on a static compressor choice (e.g., Top-$K$), our class allows the compressors to {\em evolve} throughout the training process, with the aim of improving the theoretical communication complexity and practical efficiency of the underlying methods. We show that our general approach can recover the recently proposed state-of-the-art error feedback mechanism EF21 (Richt\'arik et al., 2021) and its theoretical properties as …
Identifying Legal And Ethical Values In Ai, Keng Siau, Fiona Nah, Chunyan Ding, Fiona Fui-Hoon Nah
Identifying Legal And Ethical Values In Ai, Keng Siau, Fiona Nah, Chunyan Ding, Fiona Fui-Hoon Nah
Research Collection School Of Computing and Information Systems
Artificial intelligence (AI) applications in health care, education, finance, mining, communications, and arts have brought about rapid and dramatic advances in these fields (Hyder et al., 2019). The rapidly expanding potential of AI in the economy and society has raised a set of legal and ethical issues (Wang and Siau, 2019; Siau and Wang, 2020). In-depth research into the ethical and legal aspects of AI to enable policymakers to introduce effective legislation and regulate AI development and applications is needed. This research uses a systematic qualitative research methodology, Value-Focused Thinking (VFT) (Keeney, 1996; Sheng et al., 2007), to identify the …
A Survey On Visual Analysis Of Massive Open Online Courses (Mooc) Data [大型开放式在线课程(Mooc)数据可视分析综述], Zhiguang Zhou, Saqing Wang, Yuhua Liu, Yong Wang, Yigang Wang
A Survey On Visual Analysis Of Massive Open Online Courses (Mooc) Data [大型开放式在线课程(Mooc)数据可视分析综述], Zhiguang Zhou, Saqing Wang, Yuhua Liu, Yong Wang, Yigang Wang
Research Collection School Of Computing and Information Systems
Massive open online courses(MOOC)are free online courses that provide educational resources to users.In this paper,related works are summarized from the following perspectives:data types of MOOC,MOOC data visualization,and visual analysis applications of MOOC data.First,MOOC data is categorized into four types,including text data,video data,topological data,spatio-temporal data,and their concepts and applications are introduced.Then,the common visualization methods of different data types are discussed.Furthermore,the major applications of visual analytics approaches in MOOC data analysis are summarized,including online course learning,online tests and exams,online forum interaction and so on.Finally,the challenges and future work on visual analytics of MOOC data are discussed and concluded.
Class Re-Activation Maps For Weakly-Supervised Semantic Segmentation, Zhaozheng Chen, Tan Wang, Xiongwei Wu, Xian-Sheng Hua, Hanwang Zhang, Qianru Sun
Class Re-Activation Maps For Weakly-Supervised Semantic Segmentation, Zhaozheng Chen, Tan Wang, Xiongwei Wu, Xian-Sheng Hua, Hanwang Zhang, Qianru Sun
Research Collection School Of Computing and Information Systems
Extracting class activation maps (CAM) is arguably the most standard step of generating pseudo masks for weakly supervised semantic segmentation (WSSS). Yet, we find that the crux of the unsatisfactory pseudo masks is the binary cross-entropy loss (BCE) widely used in CAM. Specifically, due to the sum-over-class pooling nature of BCE, each pixel in CAM may be responsive to multiple classes co-occurring in the same receptive field. To this end, we introduce an embarrassingly simple yet surprisingly effective method: Reactivating the converged CAM with BCE by using softmax crossentropy loss (SCE), dubbed ReCAM. Given an image, we use CAM to …
Generative Flows With Invertible Attentions, Rhea Sanjay Sukthanker, Zhiwu Huang, Suryansh Kumar, Radu Timofte, Luc Van Gool
Generative Flows With Invertible Attentions, Rhea Sanjay Sukthanker, Zhiwu Huang, Suryansh Kumar, Radu Timofte, Luc Van Gool
Research Collection School Of Computing and Information Systems
Flow-based generative models have shown an excellent ability to explicitly learn the probability density function of data via a sequence of invertible transformations. Yet, learning attentions in generative flows remains understudied, while it has made breakthroughs in other domains. To fill the gap, this paper introduces two types of invertible attention mechanisms, i.e., map-based and transformer-based attentions, for both unconditional and conditional generative flows. The key idea is to exploit a masked scheme of these two attentions to learn long-range data dependencies in the context of generative flows. The masked scheme allows for invertible attention modules with tractable Jacobian determinants, …
A Practical Comparison Of Quantum And Classical Leaderless Consensus, Paul Robert Griffin, Dimple Mevada
A Practical Comparison Of Quantum And Classical Leaderless Consensus, Paul Robert Griffin, Dimple Mevada
Research Collection School Of Computing and Information Systems
Quantum computing is coming of age and being explored in many business areas for either solving difficult problems or improving business processes. Distributed ledger technology (DLT) is now embedded in many businesses and continues to mature. Consensus, at the heart of DLTs, has practical scaling issues and, as we move into needing bigger datasets, bigger networks and more security, the problem is ever increasing. Consensus agreement is a non-deterministic problem which is a good match to quantum computers due to the probabilistic nature of quantum phenomena. In this paper, we show that quantum nodes entangled in a variety of network …
Challenges For Inclusion In Software Engineering: The Case Of The Emerging Papua New Guinean Society, Raula Kula, Christoph Treude, Hideaki Hata, Sebastian Baltes, Igor Steinmacher, Marco Gerosa, Winifred Kula Amini
Challenges For Inclusion In Software Engineering: The Case Of The Emerging Papua New Guinean Society, Raula Kula, Christoph Treude, Hideaki Hata, Sebastian Baltes, Igor Steinmacher, Marco Gerosa, Winifred Kula Amini
Research Collection School Of Computing and Information Systems
Software plays a central role in modern societies, with its high economic value and potential for advancing societal change. In this paper, we characterise challenges and opportunities for a country progressing towards entering the global software industry, focusing on Papua New Guinea (PNG). By hosting a Software Engineering workshop, we conducted a qualitative study by recording talks (n=3), employing a questionnaire (n=52), and administering an in-depth focus group session with local actors (n=5). Based on a thematic analysis, we identified challenges as barriers and opportunities for the PNG software engineering community. We also discuss the state of practices and how …