Open Access. Powered by Scholars. Published by Universities.®

Databases and Information Systems Commons™

Open Access. Powered by Scholars. Published by Universities.®

Singapore Management University

Discipline
Keyword
Publication Year
Publication
Publication Type

Articles 1981 - 2010 of 3560

Full-Text Articles in Databases and Information Systems

Learning Adversary Behavior In Security Games: A Pac Model Perspective, Arunesh Sinha, Debarun Kar, Milind Tambe May 2016

Learning Adversary Behavior In Security Games: A Pac Model Perspective, Arunesh Sinha, Debarun Kar, Milind Tambe

Research Collection School Of Computing and Information Systems

Recent applications of Stackelberg Security Games (SSG), from wildlife crime to urban crime, have employed machine learning tools to learn and predict adversary behavior using available data about defender-adversary interactions. Given these recent developments, this paper commits to an approach of directly learning the response function of the adversary. Using the PAC model, this paper lays a firm theoretical foundation for learning in SSGs (e.g., theoretically answer questions about the numbers of samples required to learn adversary behavior) and provides utility guarantees when the learned adversary model is used to plan the defender's strategy. The paper also aims to answer …

Go to article

Are You Charlie Or Ahmed? Cultural Pluralism In Charlie Hebdo Response On Twitter, Jisun An, Haewoon Kwak, Yelena Mejova, Sonia Alonso Saenz De Oger, Braulio Gomez Fortes May 2016

Are You Charlie Or Ahmed? Cultural Pluralism In Charlie Hebdo Response On Twitter, Jisun An, Haewoon Kwak, Yelena Mejova, Sonia Alonso Saenz De Oger, Braulio Gomez Fortes

Research Collection School Of Computing and Information Systems

We study the response to the Charlie Hebdo shootings of January 7, 2015 on Twitter across the globe. We ask whether the stances on the issue of freedom of speech can be modeled using established sociological theories, including Huntington’s culturalist Clash of Civilizations, and those taking into consideration social context, including Density and Interdependence theories. We find support for Huntington’s culturalist explanation, in that the established traditions and norms of one’s “civilization” predetermine some of one’s opinion. However, at an individual level, we also find social context to play a significant role, with non-Arabs living in Arab countries using #JeSuisAhmed …

Go to article

Modeling Human-Like Non-Rationality For Social Agents, Jaroslaw Kochanowicz, Ah-Hwee Tan, Daniel Thalmann May 2016

Modeling Human-Like Non-Rationality For Social Agents, Jaroslaw Kochanowicz, Ah-Hwee Tan, Daniel Thalmann

Research Collection School Of Computing and Information Systems

Humans are not rational beings. Deviations from rationality in human thinking are currently well documented [25] as non-reducible to rational pursuit of egoistic benefit or its occasional distortion with temporary emotional excitation, as it is often assumed. This occurs not only outside conceptual reasoning or rational goal realization but also subconsciously and often in certainty that they did not and could not take place ‘in my case’. Non-rationality can no longer be perceived as a rare affective abnormality in otherwise rational thinking, but as a systemic, permanent quality, ’a design feature’ of human cognition. While social psychology has systematically addressed …

Go to article

An Autonomous Agent For Learning Spatiotemporal Models Of Human Daily Activities, Shan Gao, Ah-Hwee Tan May 2016

An Autonomous Agent For Learning Spatiotemporal Models Of Human Daily Activities, Shan Gao, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Activities of Daily Living (ADLs) refer to activities performed by individuals on a daily basis. As ADLs are indicatives of a person’s habits, lifestyle, and well being, learning the knowledge of people’s ADL routine has great values in the healthcare and consumer domains. In this paper, we propose an autonomous agent, named Agent for Spatia-Temporal Activity Pattern Modeling (ASTAPM), being able to learn spatial and temporal patterns of human ADLs. ASTAPM utilises a self-organizing neural network model named Spatiotemporal - Adaptive Resonance Theory (ST-ART). ST-ART is capable of integrating multimodal contextual information, involving the time and space, wherein the ADL …

Go to article

Fast Weighted Histograms For Bilateral Filtering And Nearest Neighbor Searching, Shengfeng He, Qingxiong Yang, Rynson W. H. Lau, Ming-Hsuan Yang May 2016

Fast Weighted Histograms For Bilateral Filtering And Nearest Neighbor Searching, Shengfeng He, Qingxiong Yang, Rynson W. H. Lau, Ming-Hsuan Yang

Research Collection School Of Computing and Information Systems

The locality sensitive histogram (LSH) injects spatial information into the local histogram in an efficient manner, and has been demonstrated to be very effective for visual tracking. In this paper, we explore the application of this efficient histogram in two important problems. We first extend the LSH to linear time bilateral filtering, and then propose a new type of histogram for efficiently computing edge-preserving nearest neighbor fields (NNFs). While the existing histogram-based bilateral filtering methods are the state of the art for efficient grayscale image processing, they are limited to box spatial filter kernels only. In our first application, we …

Go to article

Efficient Verifiable Computation Of Linear And Quadratic Functions Over Encrypted Data, Ngoc Hieu Tran, Hwee Hwa Pang, Robert H. Deng May 2016

Efficient Verifiable Computation Of Linear And Quadratic Functions Over Encrypted Data, Ngoc Hieu Tran, Hwee Hwa Pang, Robert H. Deng

Research Collection School Of Computing and Information Systems

In data outsourcing, a client stores a large amount of data on an untrusted server; subsequently, the client can request the server to compute a function on any subset of the data. This setting naturally leads to two security requirements: confidentiality of input data, and authenticity of computations. Existing approaches that satisfy both requirements simultaneously are built on fully homomorphic encryption, which involves expensive computation on the server and client and hence is impractical. In this paper, we propose two verifiable homomorphic encryption schemes that do not rely on fully homomorphic encryption. The first is a simple and efficient scheme …

Go to article

Euclidean Co-Embedding Of Ordinal Data For Multi-Type Visualization, Dung D. Le, Hady W. Lauw May 2016

Euclidean Co-Embedding Of Ordinal Data For Multi-Type Visualization, Dung D. Le, Hady W. Lauw

Research Collection School Of Computing and Information Systems

Embedding deals with reducing the high-dimensional representation of data into a low-dimensional representation. Previous work mostly focuses on preserving similarities among objects. Here, not only do we explicitly recognize multiple types of objects, but we also focus on the ordinal relationships across types. Collaborative Ordinal Embedding or COE is based on generative modelling of ordinal triples. Experiments show that COE outperforms the baselines on objective metrics, revealing its capacity for information preservation for ordinal data.

Go to article

Temporal Kernel Descriptors For Learning With Time-Sensitive Patterns, Doyen Sahoo, Abhishek Sharma, Hoi, Steven C. H., Peilin Zhao May 2016

Temporal Kernel Descriptors For Learning With Time-Sensitive Patterns, Doyen Sahoo, Abhishek Sharma, Hoi, Steven C. H., Peilin Zhao

Research Collection School Of Computing and Information Systems

Detecting temporal patterns is one of the most prevalent challenges while mining data. Often, timestamps or information about when certain instances or events occurred can provide us with critical information to recognize temporal patterns. Unfortunately, most existing techniques are not able to fully extract useful temporal information based on the time (especially at different resolutions of time). They miss out on 3 crucial factors: (i) they do not distinguish between timestamp features (which have cyclical or periodic properties) and ordinary features; (ii) they are not able to detect patterns exhibited at different resolutions of time (e.g. different patterns at the …

Go to article

Hdidx: High-Dimensional Indexing For Efficient Approximate Nearest Neighbor Search, Ji Wan, Sheng Tang, Yongdong Zhang, Jintao Li, Pengcheng Wu, Steven C. H. Hoi May 2016

Hdidx: High-Dimensional Indexing For Efficient Approximate Nearest Neighbor Search, Ji Wan, Sheng Tang, Yongdong Zhang, Jintao Li, Pengcheng Wu, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

Fast Nearest Neighbor (NN) search is a fundamental challenge in large-scale data processing and analytics, particularly for analyzing multimedia contents which are often of high dimensionality. Instead of using exact NN search, extensive research efforts have been focusing on approximate NN search algorithms. In this work, we present "HDIdx", an efficient high-dimensional indexing library for fast approximate NN search, which is open-source and written in Python. It offers a family of state-of-the-art algorithms that convert input high-dimensional vectors into compact binary codes, making them very efficient and scalable for NN search with very low space complexity.

Go to article

Online Sparse Passive Aggressive Learning With Kernels, Jing Lu, Peilin Zhao, Hoi, Steven C. H. May 2016

Online Sparse Passive Aggressive Learning With Kernels, Jing Lu, Peilin Zhao, Hoi, Steven C. H.

Research Collection School Of Computing and Information Systems

Conventional online kernel methods often yield an unboundedlarge number of support vectors, making them inefficient and non-scalable forlarge-scale applications. Recent studies on bounded kernel-based onlinelearning have attempted to overcome this shortcoming. Although they can boundthe number of support vectors at each iteration, most of them fail to bound thenumber of support vectors for the final output solution which is often obtainedby averaging the series of solutions over all the iterations. In this paper, wepropose a novel kernel-based online learning method, Sparse Passive Aggressivelearning (SPA), which can output a final solution with a bounded number ofsupport vectors. The key idea of …

Go to article

Mining Social Ties Beyond Homophily, Hongwei Liang, Ke Wang, Feida Zhu May 2016

Mining Social Ties Beyond Homophily, Hongwei Liang, Ke Wang, Feida Zhu

Research Collection School Of Computing and Information Systems

Summarizing patterns of connections or social tiesin a social network, in terms of attributes information on nodesand edges, holds a key to the understanding of how the actorsinteract and form relationships. We formalize this problem asmining top-k group relationships (GRs), which captures strongsocial ties between groups of actors. While existing works focuson patterns that follow from the well known homophily principle,we are interested in social ties that do not follow from homophily,thus, provide new insights. Finding top-k GRs faces new challenges:it requires a novel ranking metric because traditionalmetrics favor patterns that are expected from the homophilyprinciple; it requires an innovative …

Go to article

A Key-Insulated Cp-Abe With Key Exposure Accountability For Secure Data Sharing In The Cloud, Hanshu Hong, Zhixin Sun, Ximeng Liu May 2016

A Key-Insulated Cp-Abe With Key Exposure Accountability For Secure Data Sharing In The Cloud, Hanshu Hong, Zhixin Sun, Ximeng Liu

Research Collection School Of Computing and Information Systems

ABE has become an effective tool for data protection in cloud computing. However, since users possessing the same attributes share the same private keys, there exist some malicious users exposing their private keys deliberately for illegal data sharing without being detected, which will threaten the security of the cloud system. Such issues remain in many current ABE schemes since the private keys are rarely associated with any user specific identifiers. In order to achieve user accountability as well as provide key exposure protection, in this paper, we propose a key-insulated ciphertext policy attribute based encryption with key exposure accountability (KI-CPABE-KEA). …

Go to article

Efspredictor: Predicting Configuration Bugs With Ensemble Feature Selection, Bowen Xu, David Lo, Xin Xia, Ashish Sureka, Shanping Li May 2016

Efspredictor: Predicting Configuration Bugs With Ensemble Feature Selection, Bowen Xu, David Lo, Xin Xia, Ashish Sureka, Shanping Li

Research Collection School Of Computing and Information Systems

The configuration of a system determines the system behavior and wrong configuration settings can adversely impact system's availability, performance, and correctness. We refer to these wrong configuration settings as configuration bugs. The importance of configuration bugs has prompted many researchers to study it, and past studies can be grouped into three categories: detection, localization, and fixing of configuration bugs. In the work, we focus on the detection of configuration bugs, in particular, we follow the line-of-work that tries to predict if a bug report is caused by a wrong configuration setting. Automatically prediction of whether a bug is a configuration …

Go to article

Semantic Proximity Search On Graphs With Metagraph-Based Learning, Yuan Fang, Wenqing Lin, Vincent W. Zheng, Min Wu, Kevin Chen-Chuan Chang, Xiao-Li Li May 2016

Semantic Proximity Search On Graphs With Metagraph-Based Learning, Yuan Fang, Wenqing Lin, Vincent W. Zheng, Min Wu, Kevin Chen-Chuan Chang, Xiao-Li Li

Research Collection School Of Computing and Information Systems

Given ubiquitous graph data such as the Web and social networks, proximity search on graphs has been an active research topic. The task boils down to measuring the proximity between two nodes on a graph. Although most earlier studies deal with homogeneous or bipartite graphs only, many real-world graphs are heterogeneous with objects of various types, giving rise to different semantic classes of proximity. For instance, on a social network two users can be close for different reasons, such as being classmates or family members, which represent two distinct classes of proximity. Thus, it becomes inadequate to only measure a …

Go to article

Online Passive-Aggressive Active Learning, Jing Lu, Peilin Zhao, Steven C. H. Hoi May 2016

Online Passive-Aggressive Active Learning, Jing Lu, Peilin Zhao, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

We investigate online active learning techniques for online classification tasks. Unlike traditional supervised learning approaches, either batch or online learning, which often require to request class labels of each incoming instance, online active learning queries only a subset of informative incoming instances to update the classification model, aiming to maximize classification performance with minimal human labelling effort during the entire online learning task. In this paper, we present a new family of online active learning algorithms called Passive-Aggressive Active (PAA) learning algorithms by adapting the Passive-Aggressive algorithms in online active learning settings. Unlike conventional Perceptron-based approaches that employ only the …

Go to article

On Unravelling Opinions Of Issue Specific-Silent Users In Social Media, Wei Gong, Ee-Peng Lim, Feida Zhu, Pei Hua Cher May 2016

On Unravelling Opinions Of Issue Specific-Silent Users In Social Media, Wei Gong, Ee-Peng Lim, Feida Zhu, Pei Hua Cher

Research Collection School Of Computing and Information Systems

Social media has become a popular platform for people toshare opinions. Among the social media mining researchprojects that study user opinions and issues, most focus onanalyzing posted and shared content. They could run into thedanger of non-representative findings as the opinions of userswho do not post content are overlooked, which often happensin today’s marketing, recommendation, and social sensing research.For a more complete and representative profiling ofuser opinions on various topical issues, we need to investigatethe opinions of the users even when they stay silent onthese issues. We call these users the issue specific-silent users(i-silent users). To study them and their …

Go to article

Joint Search By Social And Spatial Proximity [Extended Abstract], Kyriakos Mouratidis, Jing Li, Yu Tang, Nikos Mamoulis May 2016

Joint Search By Social And Spatial Proximity [Extended Abstract], Kyriakos Mouratidis, Jing Li, Yu Tang, Nikos Mamoulis

Research Collection School Of Computing and Information Systems

The diffusion of social networks introduces new challengesand opportunities for advanced services, especially so with their ongoingaddition of location-based features. We show how applications like company andfriend recommendation could significantly benefit from incorporating social andspatial proximity, and study a query type that captures these twofold semantics.We develop highly scalable algorithms for its processing, and use real socialnetwork data to empirically verify their efficiency and efficacy.

Go to article

From Classification To Quantification In Tweet Sentiment Analysis, Wei Gao, Fabrizio Sebastiani Apr 2016

From Classification To Quantification In Tweet Sentiment Analysis, Wei Gao, Fabrizio Sebastiani

Research Collection School Of Computing and Information Systems

entiment classification has become a ubiquitous enabling technology in the Twittersphere, since classifying tweets according to the sentiment they convey towards a given entity (be it a product, a person, a political party, or a policy) has many applications in political science, social science, market research, and many others. In this paper, we contend that most previous studies dealing with tweet sentiment classification (TSC) use a suboptimal approach. The reason is that the final goal of most such studies is not estimating the class label (e.g., Positive, Negative, or Neutral) of individual tweets, but estimating the relative frequency (a.k.a. “prevalence”) …

Go to article

Persentiment: A Personalized Sentiment Classification System For Microblog Users, Kaisong Song, Ling Chen, Wei Gao, Shi Feng, Daling Wang, Chengqi Zhang Apr 2016

Persentiment: A Personalized Sentiment Classification System For Microblog Users, Kaisong Song, Ling Chen, Wei Gao, Shi Feng, Daling Wang, Chengqi Zhang

Research Collection School Of Computing and Information Systems

Microblogging services are playing increasingly important roles in our daily life today. It is useful for microblog users to instantly understand the sentiment of a large number of microblogs posted by their friends and make appropriate response. Despite considerable progress on microblog sentiment classification, most of the existing works ignore the influence of personal distinctions of different microblog users on the sentiments they convey, and none of them has provided real-world personalized sentiment classification systems. Considering personal distinctions in sentiment analysis is natural and necessary as different people have different language habits, personal characters, opinion bias and so on. In …

Go to article

Large Scale Online Kernel Learning, Jing Lu, Hoi, Steven C. H., Jialei Wang, Peilin Zhao, Zhi-Yong Liu Apr 2016

Large Scale Online Kernel Learning, Jing Lu, Hoi, Steven C. H., Jialei Wang, Peilin Zhao, Zhi-Yong Liu

Research Collection School Of Computing and Information Systems

In this paper, we present a new framework for large scale online kernel learning, making kernel methods efficient and scalable for large-scale online learning applications. Unlike the regular budget online kernel learning scheme that usually uses some budget maintenance strategies to bound the number of support vectors, our framework explores a completely different approach of kernel functional approximation techniques to make the subsequent online learning task efficient and scalable. Specifically, we present two different online kernel machine learning algorithms: (i) Fourier Online Gradient Descent (FOGD) algorithm that applies the random Fourier features for approximating kernel functions; and (ii) Nyström Online …

Go to article

Olps: A Toolbox For On-Line Portfolio Selection, Bin Li, Doyen Sahoo, Hoi, Steven C. H. Apr 2016

Olps: A Toolbox For On-Line Portfolio Selection, Bin Li, Doyen Sahoo, Hoi, Steven C. H.

Research Collection School Of Computing and Information Systems

On-line portfolio selection is a practical financial engineering problem, which aims to sequentially allocate capital among a set of assets in order to maximize long-term return. In recent years, a variety of machine learning algorithms have been proposed to address this challenging problem, but no comprehensive open-source toolbox has been released for various reasons. This article presents the first open-source toolbox for "On-Line Portfolio Selection" (OLPS), which implements a collection of classical and state-of-the-art strategies powered by machine learning algorithms. We hope that OLPS can facilitate the development of new learning methods and enable the performance benchmarking and comparisons of …

Go to article

Personal Credit Profiling Via Latent User Behavior Dimensions On Social Media, Guangming Guo, Feida Zhu, Enhong Chen, Le Wu, Qi Liu, Yingling Liu, Minghui Qiu Apr 2016

Personal Credit Profiling Via Latent User Behavior Dimensions On Social Media, Guangming Guo, Feida Zhu, Enhong Chen, Le Wu, Qi Liu, Yingling Liu, Minghui Qiu

Research Collection School Of Computing and Information Systems

Consumer credit scoring and credit risk management have been the core research problem in financial industry for decades. In this paper, we target at inferring this particular user attribute called credit, i.e., whether a user is of the good credit class or not, from online social data. However, existing credit scoring methods, mainly relying on financial data, face severe challenges when tackling the heterogeneous social data. Moreover, social data only contains extremely weak signals about users’ credit label. To that end, we put forward a Latent User Behavior Dimension based Credit Model (LUBD-CM) to capture these small signals for personal …

Go to article

Understanding The Determinants Of Human Computation Game Acceptance: The Effects Of Aesthetic Experience And Output Quality, Xiaohui Wang, Dion Hoe-Lian Goh, Ee-Peng Lim, Wei Liang Adrian Vu Apr 2016

Understanding The Determinants Of Human Computation Game Acceptance: The Effects Of Aesthetic Experience And Output Quality, Xiaohui Wang, Dion Hoe-Lian Goh, Ee-Peng Lim, Wei Liang Adrian Vu

Research Collection School Of Computing and Information Systems

Purpose: Human computation games (HCGs) that blend gaming with utilitarian purposes are a potentially effective channel for content creation. The purpose of this paper is to investigate the driving factors behind players’ adoption of HCGs through a music video tagging game. The effects of perceived aesthetic experience (PAE) and perceived output quality (POQ) on HCG acceptance are empirically examined. Design/methodology/approach: An integrative structural model is developed to explain how hedonic and utilitarian factors, including PAE and POQ, working with another salient factor – perceived usefulness (PU) – affect the acceptance of HCGs. The structural equation modeling method is used to …

Go to article

What Makes A Music Track Popular In Online Social Networks?, Jing Ren, Jialie Shen, Robert John Kauffman Apr 2016

What Makes A Music Track Popular In Online Social Networks?, Jing Ren, Jialie Shen, Robert John Kauffman

Research Collection School Of Computing and Information Systems

Tens of thousands of music tracks are uploaded to the Internet every day through social networks that focus on music and videos, as well as portal websites. While some of the content has been popular for decades, some tracks that have just been released have been completely ignored. So what makes a music track popular? Can we predict the popularity of a music track before it is released? In this research, we will focus on an online music social network, Last.fm, and investigate three key factors of a music track that may have impact on its popularity. They include: the …

Go to article

On Effective Location-Aware Music Recommendation, Zhiyong Cheng, Jialie Shen Apr 2016

On Effective Location-Aware Music Recommendation, Zhiyong Cheng, Jialie Shen

Research Collection School Of Computing and Information Systems

Rapid advances in mobile devices and cloud-based music service now allow consumers to enjoy music any-time and anywhere. Consequently, there has been an increasing demand in studying intelligent techniques to facilitate context-aware music recommendation. However, one important context that is generally overlooked is user's venue, which often includes surrounding atmosphere, correlates with activities, and greatly influences the user's music preferences. In this article, we present a novel venue-aware music recommender system called VenueMusic to effectively identify suitable songs for various types of popular venues in our daily lives. Toward this goal, a Location-aware Topic Model (LTM) is proposed to (i) …

Go to article

When Peculiarity Makes A Difference: Object Characterisation In Heterogeneous Information Networks, Wei Chen, Feida Zhu, Lei Zhao, Xiaofang Zhou Apr 2016

When Peculiarity Makes A Difference: Object Characterisation In Heterogeneous Information Networks, Wei Chen, Feida Zhu, Lei Zhao, Xiaofang Zhou

Research Collection School Of Computing and Information Systems

A central task in heterogeneous information networks (HIN) is how to characterise an entity, which underlies a wide range of applications such as similarity search, entity profiling and linkage. Most existing work focus on using the main features common to all. While this approach makes sense in settings where commonality is of primary interest, there are many scenarios as important where uncommon and discriminative features are more useful. To address the problem, a novel model COHIN (Characterize Objects in Heterogeneous Information Networks) is proposed, where each object is characterized as a set of feature paths that contain both main and …

Go to article

Semantic Visualization With Neighborhood Graph Regularization, Tuan Minh Van Le, Hady W. Lauw Apr 2016

Semantic Visualization With Neighborhood Graph Regularization, Tuan Minh Van Le, Hady W. Lauw

Research Collection School Of Computing and Information Systems

Visualization of high-dimensional data, such as text documents, is useful to map out the similarities among various data points. In the high-dimensional space, documents are commonly represented as bags of words, with dimensionality equal to the vocabulary size. Classical approaches to document visualization directly reduce this into visualizable two or three dimensions. Recent approaches consider an intermediate representation in topic space, between word space and visualization space, which preserves the semantics by topic modeling. While aiming for a good fit between the model parameters and the observed data, previous approaches have not considered the local consistency among data instances. We …

Go to article

Interactive Teachable Cognitive Agents: Smart Building Blocks For Multiagent Systems, Budhitama Subagdja, Ah-Hwee Tan Mar 2016

Interactive Teachable Cognitive Agents: Smart Building Blocks For Multiagent Systems, Budhitama Subagdja, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Developing a complex intelligent system by abstracting their behaviors, functionalities, and reasoning mechanisms can be tedious and time consuming. In this paper, we present a framework for developing an application or software system based on smart autonomous components that collaborate with the developer or user to realize the entire system. Inspired by teachable approaches and programming-by-demonstration methods in robotics and end-user development, we treat intelligent agents as teachable components that make up the system to be built. Each agent serves different functionalities and may have prebuilt operations to accomplish its own design objectives. However, each agent may also be equipped …

Go to article

Semantic Memory Modeling And Memory Interaction In Learning Agents, Wenwen Wang, Ah-Hwee Tan, Loo-Nin Teow Mar 2016

Semantic Memory Modeling And Memory Interaction In Learning Agents, Wenwen Wang, Ah-Hwee Tan, Loo-Nin Teow

Research Collection School Of Computing and Information Systems

Semantic memory plays a critical role in reasoning and decision making. It enables an agent to abstract useful knowledge learned from its past experience. Based on an extension of fusion adaptive resonance theory network, this paper presents a novel self-organizing memory model to represent and learn various types of semantic knowledge in a unified manner. The proposed model, called fusion adaptive resonance theory for multimemory learning, incorporates a set of neural processes, through which it may transfer knowledge and cooperate with other long-term memory systems, including episodic memory and procedural memory. Specifically, we present a generic learning process, under which …

Go to article

Scrum-X: An Interactive And Experiential Learning Platform For Teaching Scrum, Wee Leong Lee Mar 2016

Scrum-X: An Interactive And Experiential Learning Platform For Teaching Scrum, Wee Leong Lee

Research Collection School Of Computing and Information Systems

Motivating and engaging thecurrent generation of technology-savvy students and improving the quality oflearning is becoming more challenging with traditional instructional methods.Educational games and simulations are gaining more ground, both in formal andinformal learning environments. With experiential learning, learners canenhance their management skills and ability to make decisions by analyzingdifferent scenarios and paths that the project could have taken if specificdecisions were made during the project. This paper presents Scrum-X, acomputer-based simulation game to teach Scrum, an agile project managementmethodology, to graduates and professionals with IT background. In the game,players plan, execute and manage a software development project using Scrummethodology. Players …

Go to article

First Prev Next Last