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

Engineering Commons

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

Articles 1 - 30 of 30

Full-Text Articles in Engineering

Pre-Training Graph Neural Networks For Link Prediction In Biomedical Networks, Yahui Long, Min Wu, Yong Liu, Yuan Fang, Chee Kong Kwoh, Jiawei Luo, Xiaoli Li Apr 2022

Pre-Training Graph Neural Networks For Link Prediction In Biomedical Networks, Yahui Long, Min Wu, Yong Liu, Yuan Fang, Chee Kong Kwoh, Jiawei Luo, Xiaoli Li

Research Collection School Of Computing and Information Systems

Motivation: Graphs or networks are widely utilized to model the interactions between different entities (e.g., proteins, drugs, etc) for biomedical applications. Predicting potential links in biomedical networks is important for understanding the pathological mechanisms of various complex human diseases, as well as screening compound targets for drug discovery. Graph neural networks (GNNs) have been designed for link prediction in various biomedical networks, which rely on the node features extracted from different data sources, e.g., sequence, structure and network data. However, it is challenging to effectively integrate these data sources and automatically extract features for different link prediction tasks. Results: In …


Estimating Homophily In Social Networks Using Dyadic Predictions, George Berry, Antonio Sirianni, Ingmar Weber, Jisun An, Michael Macy Aug 2021

Estimating Homophily In Social Networks Using Dyadic Predictions, George Berry, Antonio Sirianni, Ingmar Weber, Jisun An, Michael Macy

Research Collection School Of Computing and Information Systems

Predictions of node categories are commonly used to estimate homophily and other relational properties in networks. However, little is known about the validity of using predictions for this task. We show that estimating homophily in a network is a problem of predicting categories of dyads (edges) in the graph. Homophily estimates are unbiased when predictions of dyad categories are unbiased. Node-level prediction models, such as the use of names to classify ethnicity or gender, do not generally produce unbiased predictions of dyad categories and therefore produce biased homophily estimates. Bias comes from three sources: sampling bias, correlation between model errors …


Ship-Gan: Generative Modeling Based Maritime Traffic Simulator, Chaithanya Shankaramurthy Basrur, Arambam James Singh, Arunesh Sinha, Akshat Kumar May 2021

Ship-Gan: Generative Modeling Based Maritime Traffic Simulator, Chaithanya Shankaramurthy Basrur, Arambam James Singh, Arunesh Sinha, Akshat Kumar

Research Collection School Of Computing and Information Systems

Modeling vessel movement in a maritime environment is an extremely challenging task given the complex nature of vessel behavior. Several existing multiagent maritime decision making frameworks require access to an accurate traffic simulator. We develop a system using electronic navigation charts to generate realistic and high fidelity vessel traffic data using Generative Adversarial Networks (GANs). Our proposed Ship-GAN uses a conditional Wasserstein GAN to model a vessel’s behavior. The generator can simulate the travel time of vessels across different maritime zones conditioned on vessels’ speeds and traffic intensity. Furthermore, it can be used as an accurate simulator for prior decision …


Peer-Inspired Student Performance Prediction In Interactive Online Question Pools With Graph Neural Network, Haotian Li, Huan Wei, Yong Wang, Yangqiu Song, Huamin. Qu Oct 2020

Peer-Inspired Student Performance Prediction In Interactive Online Question Pools With Graph Neural Network, Haotian Li, Huan Wei, Yong Wang, Yangqiu Song, Huamin. Qu

Research Collection School Of Computing and Information Systems

Student performance prediction is critical to online education. It can benefit many downstream tasks on online learning platforms, such as estimating dropout rates, facilitating strategic intervention, and enabling adaptive online learning. Interactive online question pools provide students with interesting interactive questions to practice their knowledge in online education. However, little research has been done on student performance prediction in interactive online question pools. Existing work on student performance prediction targets at online learning platforms with predefined course curriculum and accurate knowledge labels like MOOC platforms, but they are not able to fully model knowledge evolution of students in interactive online …


Generic Construction Of Elgamal-Type Attribute-Based Encryption Schemes With Revocability And Dual-Policy, Shengmin Xu, Yinghui Zhang, Yingjiu Li, Ximeng Liu, Guomin Yang Oct 2019

Generic Construction Of Elgamal-Type Attribute-Based Encryption Schemes With Revocability And Dual-Policy, Shengmin Xu, Yinghui Zhang, Yingjiu Li, Ximeng Liu, Guomin Yang

Research Collection School Of Computing and Information Systems

Cloud is a computing paradigm for allowing data owners to outsource their data to enjoy on-demand services and mitigate the burden of local data storage. However, secure sharing of data via cloud remains an essential issue since the cloud service provider is untrusted. Fortunately, asymmetric-key encryption, such as identity-based encryption (IBE) and attribute-based encryption (ABE), provides a promising tool to offer data confidentiality and has been widely applied in cloud-based applications. In this paper, we summarize the common properties of most of IBE and ABE and introduce a cryptographic primitive called ElGamal type cryptosystem. This primitive can be used to …


R2gan: Cross-Modal Recipe Retrieval With Generative Adversarial Network, Bin Zhu, Chong-Wah Ngo, Jingjing Chen, Yanbin Hao Jun 2019

R2gan: Cross-Modal Recipe Retrieval With Generative Adversarial Network, Bin Zhu, Chong-Wah Ngo, Jingjing Chen, Yanbin Hao

Research Collection School Of Computing and Information Systems

Representing procedure text such as recipe for crossmodal retrieval is inherently a difficult problem, not mentioning to generate image from recipe for visualization. This paper studies a new version of GAN, named Recipe Retrieval Generative Adversarial Network (R2GAN), to explore the feasibility of generating image from procedure text for retrieval problem. The motivation of using GAN is twofold: learning compatible cross-modal features in an adversarial way, and explanation of search results by showing the images generated from recipes. The novelty of R2GAN comes from architecture design, specifically a GAN with one generator and dual discriminators is used, which makes the …


Interaction-Aware Arrangement For Event-Based Social Networks, Feifei Kou, Zimu Zhou, Hao Cheg, Junping Du, Yexuan Shi, Pan Xu Apr 2019

Interaction-Aware Arrangement For Event-Based Social Networks, Feifei Kou, Zimu Zhou, Hao Cheg, Junping Du, Yexuan Shi, Pan Xu

Research Collection School Of Computing and Information Systems

No abstract provided.


A Coordination Framework For Multi-Agent Persuasion And Adviser Systems, Budhitama Subagdja, Ah-Hwee Tan, Yilin Kang Feb 2019

A Coordination Framework For Multi-Agent Persuasion And Adviser Systems, Budhitama Subagdja, Ah-Hwee Tan, Yilin Kang

Research Collection School Of Computing and Information Systems

Assistive agents have been used to give advices to the users regarding activities in daily lives. Although adviser bots are getting smarter and gaining more popularity these days they are usually developed and deployed independent from each other. When several agents operate together in the same context, their advices may no longer be effective since they may instead overwhelm or confuse the user if not properly arranged. Only little attentions have been paid to coordinating different agents to give different advices to a user within the same environment. However, aligning the advices on-the-fly with the appropriate presentation timing at the …


Simknn: A Scalable Method For In-Memory Knn Search Over Moving Objects In Road Networks, Bin Cao, Chenyu Hou, Suifei Li, Jing Fan, Jianwei Yin, Baihua Zheng, Jie Bao Oct 2018

Simknn: A Scalable Method For In-Memory Knn Search Over Moving Objects In Road Networks, Bin Cao, Chenyu Hou, Suifei Li, Jing Fan, Jianwei Yin, Baihua Zheng, Jie Bao

Research Collection School Of Computing and Information Systems

Nowadays, many location-based applications require the ability of querying k-nearest neighbors over a very large scale of5 moving objects in road networks, e.g., taxi-calling and ride-sharing services. Traditional grid index with equal-sized cells can not adapt6 to the skewed distribution of moving objects in real scenarios. Thus, to obtain the fast querying response time, the grid needs to be split7 into more smaller cells which introduces the side-effect of higher memory cost, i.e., maintaining such a large volume of cells requires a8 much larger memory space at the server side. In this paper, we present SIMkNN, a scalable and in-memory …


Breathing-Based Authentication On Resource-Constrained Iot Devices Using Recurrent Neural Networks, Jagmohan Chauhan, Suranga Seneviratne, Yining Hu, Archan Misra, Aruna Seneviratne, Youngki Lee May 2018

Breathing-Based Authentication On Resource-Constrained Iot Devices Using Recurrent Neural Networks, Jagmohan Chauhan, Suranga Seneviratne, Yining Hu, Archan Misra, Aruna Seneviratne, Youngki Lee

Research Collection School Of Computing and Information Systems

Recurrent neural networks (RNNs) have shown promising resultsin audio and speech-processing applications. The increasingpopularity of Internet of Things (IoT) devices makes a strongcase for implementing RNN-based inferences for applicationssuch as acoustics-based authentication and voice commandsfor smart homes. However, the feasibility and performance ofthese inferences on resource-constrained devices remain largelyunexplored. The authors compare traditional machine-learningmodels with deep-learning RNN models for an end-to-endauthentication system based on breathing acoustics.


Virtualization In Wireless Sensor Networks: Fault Tolerant Embedding For Internet Of Things, Omprakash Kaiwartya, Abdul Hanan Abdullah, Yue Cao, Jaime Lloret, Sushil Kumar, Rajiv Ratn Shah, Mukesh Prasad, Shiv Prakash Apr 2018

Virtualization In Wireless Sensor Networks: Fault Tolerant Embedding For Internet Of Things, Omprakash Kaiwartya, Abdul Hanan Abdullah, Yue Cao, Jaime Lloret, Sushil Kumar, Rajiv Ratn Shah, Mukesh Prasad, Shiv Prakash

Research Collection School Of Computing and Information Systems

Recently, virtualization in wireless sensor networks (WSNs) has witnessed significant attention due to the growing service domain for IoT. Related literature on virtualization in WSNs explored resource optimization without considering communication failure in WSNs environments. The failure of a communication link in WSNs impacts many virtual networks running IoT services. In this context, this paper proposes a framework for optimizing fault tolerance in virtualization in WSNs, focusing on heterogeneous networks for service-oriented IoT applications. An optimization problem is formulated considering fault tolerance and communication delay as two conflicting objectives. An adapted non-dominated sorting based genetic algorithm (A-NSGA) is developed to …


Scaling Human Activity Recognition Via Deep Learning-Based Domain Adaptation, Md Abdullah Hafiz Khan, Nirmalya Roy, Archan Misra Mar 2018

Scaling Human Activity Recognition Via Deep Learning-Based Domain Adaptation, Md Abdullah Hafiz Khan, Nirmalya Roy, Archan Misra

Research Collection School Of Computing and Information Systems

We investigate the problem of making human activityrecognition (AR) scalable–i.e., allowing AR classifiers trainedin one context to be readily adapted to a different contextualdomain. This is important because AR technologies can achievehigh accuracy if the classifiers are trained for a specific individualor device, but show significant degradation when the sameclassifier is applied context–e.g., to a different device located ata different on-body position. To allow such adaptation withoutrequiring the onerous step of collecting large volumes of labeledtraining data in the target domain, we proposed a transductivetransfer learning model that is specifically tuned to the propertiesof convolutional neural networks (CNNs). Our model, …


Bikemate: Bike Riding Behavior Monitoring With Smartphones, Weixi Gu, Zimu Zhou, Yuxun Zhou, Han Zou, Yunxin Liu, Costas J. Spanos, Lin Zhang Nov 2017

Bikemate: Bike Riding Behavior Monitoring With Smartphones, Weixi Gu, Zimu Zhou, Yuxun Zhou, Han Zou, Yunxin Liu, Costas J. Spanos, Lin Zhang

Research Collection School Of Computing and Information Systems

Detecting dangerous riding behaviors is of great importance to improve bicycling safety. Existing bike safety precautionary measures rely on dedicated infrastructures that incur high installation costs. In this work, we propose BikeMate, a ubiquitous bicycling behavior monitoring system with smartphones. BikeMate invokes smartphone sensors to infer dangerous riding behaviors including lane weaving, standing pedalling and wrong-way riding. For easy adoption, BikeMate leverages transfer learning to reduce the overhead of training models for different users, and applies crowdsourcing to infer legal riding directions without prior knowledge. Experiments with 12 participants show that BikeMate achieves an overall accuracy of 86.8% for lane …


Understanding Inactive Yet Available Assignees In Github, Jing Jiang, David Lo, Xinyu Ma, Fuli Feng, Li Zhang Nov 2017

Understanding Inactive Yet Available Assignees In Github, Jing Jiang, David Lo, Xinyu Ma, Fuli Feng, Li Zhang

Research Collection School Of Computing and Information Systems

Context In GitHub, an issue or a pull request can be assigned to a specific assignee who is responsible for working on this issue or pull request. Due to the principle of voluntary participation, available assignees may remain inactive in projects. If assignees ever participate in projects, they are active assignees; otherwise, they are inactive yet available assignees (inactive assignees for short). Objective Our objective in this paper is to provide a comprehensive analysis of inactive yet available assignees in GitHub. Method We collect 2,374,474 records of activities in 37 popular projects, and 797,756 records of activities in 687 projects …


Intent Recognition In Smart Living Through Deep Recurrent Neural Networks, Xiang Zhang, Lina Yao, Chaoran Huang, Quan Z. Sheng, Xianzhi Wang Nov 2017

Intent Recognition In Smart Living Through Deep Recurrent Neural Networks, Xiang Zhang, Lina Yao, Chaoran Huang, Quan Z. Sheng, Xianzhi Wang

Research Collection School Of Computing and Information Systems

Electroencephalography (EEG) signal based intent recognition has recently attracted much attention in both academia and industries, due to helping the elderly or motor-disabled people controlling smart devices to communicate with outer world. However, the utilization of EEG signals is challenged by low accuracy, arduous and time-consuming feature extraction. This paper proposes a 7-layer deep learning model to classify raw EEG signals with the aim of recognizing subjects’ intents, to avoid the time consumed in pre-processing and feature extraction. The hyper-parameters are selected by an Orthogonal Array experiment method for efficiency. Our model is applied to an open EEG dataset provided …


Summarization Of Egocentric Videos: A Comprehensive Survey, Ana Garcia Del Molino, Cheston Tan, Joo-Hwee Lim, Ah-Hwee Tan Nov 2016

Summarization Of Egocentric Videos: A Comprehensive Survey, Ana Garcia Del Molino, Cheston Tan, Joo-Hwee Lim, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

The introduction of wearable video cameras (e.g., GoPro) in the consumer market has promoted video life-logging, motivating users to generate large amounts of video data. This increasing flow of first-person video has led to a growing need for automatic video summarization adapted to the characteristics and applications of egocentric video. With this paper, we provide the first comprehensive survey of the techniques used specifically to summarize egocentric videos. We present a framework for first-person view summarization and compare the segmentation methods and selection algorithms used by the related work in the literature. Next, we describe the existing egocentric video datasets …


Passively Testing Routing Protocols In Wireless Sensor Networks, Xiaoping Che, Stephane Maag, Hwee-Xian Tan, Hwee-Pink Tan Jul 2016

Passively Testing Routing Protocols In Wireless Sensor Networks, Xiaoping Che, Stephane Maag, Hwee-Xian Tan, Hwee-Pink Tan

Research Collection School Of Computing and Information Systems

Smart systems are today increasingly developed with the number of wireless sensor devices that drastically increases. They are implemented within several contexts through our environment. Thus, sensed data transported in ubiquitous systems are important and the way to carry them must be efficient and reliable. For that purpose, several routing protocols have been proposed to wireless sensor networks (WSN). However, one stage that is often neglected before their deployment, is the conformance testing process, a crucial and challenging step. Active testing techniques commonly used in wired networks are not suitable to WSN and passive approaches are needed. While some works …


Adaptive Scaling Of Cluster Boundaries For Large-Scale Social Media Data Clustering, Lei Meng, Ah-Hwee Tan, Donald C. Wunsch Dec 2015

Adaptive Scaling Of Cluster Boundaries For Large-Scale Social Media Data Clustering, Lei Meng, Ah-Hwee Tan, Donald C. Wunsch

Research Collection School Of Computing and Information Systems

The large scale and complex nature of social media data raises the need to scale clustering techniques to big data and make them capable of automatically identifying data clusters with few empirical settings. In this paper, we present our investigation and three algorithms based on the fuzzy adaptive resonance theory (Fuzzy ART) that have linear computational complexity, use a single parameter, i.e., the vigilance parameter to identify data clusters, and are robust to modest parameter settings. The contribution of this paper lies in two aspects. First, we theoretically demonstrate how complement coding, commonly known as a normalization method, changes the …


Shopminer: Mining Customer Shopping Behavior In Physical Clothing Stores With Passive Rfids, Longfei Shangguan, Zimu Zhou, Xiaolong Zheng, Lei Yang, Yunhao Liu, Jinsong Han Nov 2015

Shopminer: Mining Customer Shopping Behavior In Physical Clothing Stores With Passive Rfids, Longfei Shangguan, Zimu Zhou, Xiaolong Zheng, Lei Yang, Yunhao Liu, Jinsong Han

Research Collection School Of Computing and Information Systems

Shopping behavior data are of great importance to understand the effectiveness of marketing and merchandising efforts. Online clothing stores are capable capturing customer shopping behavior by analyzing the click stream and customer shopping carts. Retailers with physical clothing stores, however, still lack effective methods to identify comprehensive shopping behaviors. In this paper, we show that backscatter signals of passive RFID tags can be exploited to detect and record how customers browse stores, which items of clothes they pay attention to, and which items of clothes they usually match with. The intuition is that the phase readings of tags attached on …


Measuring Centralities For Transportation Networks Beyond Structures, Yew-Yih Cheng, Lee Ka Wei, Roy, Ee-Peng Lim, Feida Zhu May 2015

Measuring Centralities For Transportation Networks Beyond Structures, Yew-Yih Cheng, Lee Ka Wei, Roy, Ee-Peng Lim, Feida Zhu

Research Collection School Of Computing and Information Systems

In an urban city, its transportation network supports efficient flow of people between different parts of the city. Failures in the network can cause major disruptions to commuter and business activities which can result in both significant economic and time losses. In this paper, we investigate the use of centrality measures to determine critical nodes in a transportation network so as to improve the design of the network as well as to devise plans for coping with the network failures. Most centrality measures in social network analysis research unfortunately consider only topological structure of the network and are oblivious of …


Self-Organizing Neural Networks Integrating Domain Knowledge And Reinforcement Learning, Teck-Hou Teng, Ah-Hwee Tan, Jacek M. Zurada Jun 2014

Self-Organizing Neural Networks Integrating Domain Knowledge And Reinforcement Learning, Teck-Hou Teng, Ah-Hwee Tan, Jacek M. Zurada

Research Collection School Of Computing and Information Systems

The use of domain knowledge in learning systems is expected to improve learning efficiency and reduce model complexity. However, due to the incompatibility with knowledge structure of the learning systems and real-time exploratory nature of reinforcement learning (RL), domain knowledge cannot be inserted directly. In this paper, we show how self-organizing neural networks designed for online and incremental adaptation can integrate domain knowledge and RL. Specifically, symbol-based domain knowledge is translated into numeric patterns before inserting into the self-organizing neural networks. To ensure effective use of domain knowledge, we present an analysis of how the inserted knowledge is used by …


An Agent-Based Network Analytic Perspective On The Evolution Of Complex Adaptive Supply Chain Networks, L. Ponnambalam, A. Tan, X. Fu, X. F. Yin, Zhaoxia Wang, R. S. Goh Aug 2013

An Agent-Based Network Analytic Perspective On The Evolution Of Complex Adaptive Supply Chain Networks, L. Ponnambalam, A. Tan, X. Fu, X. F. Yin, Zhaoxia Wang, R. S. Goh

Research Collection School Of Computing and Information Systems

Supply chain networks of modern era are complex adaptive systems that are dynamic and highly interdependent in nature. Business continuity of these complex systems depend vastly on understanding as to how the supply chain network evolves over time (based on the policies it adapts), and identifying the susceptibility of the evolved networks to external disruptions. The objective of this article is to illustrate as to how an agent-based network analytic perspective can aid this understanding on the network-evolution dynamics, and identification of disruption effects on the evolved networks. To this end, we developed a 4-tier agent based supply chain model …


Self‐Regulating Action Exploration In Reinforcement Learning, Teck-Hou Teng, Ah-Hwee Tan, Yuan-Sin Tan Jan 2012

Self‐Regulating Action Exploration In Reinforcement Learning, Teck-Hou Teng, Ah-Hwee Tan, Yuan-Sin Tan

Research Collection School Of Computing and Information Systems

The basic tenet of a learning process is for an agent to learn for only as much and as long as it is necessary. With reinforcement learning, the learning process is divided between exploration and exploitation. Given the complexity of the problem domain and the randomness of the learning process, the exact duration of the reinforcement learning process can never be known with certainty. Using an inaccurate number of training iterations leads either to the non-convergence or the over-training of the learning agent. This work addresses such issues by proposing a technique to self-regulate the exploration rate and training duration …


A Self-Organizing Neural Architecture Integrating Desire, Intention And Reinforcement Learning, Ah-Hwee Tan, Yu-Hong Feng, Yew-Soon Ong Mar 2010

A Self-Organizing Neural Architecture Integrating Desire, Intention And Reinforcement Learning, Ah-Hwee Tan, Yu-Hong Feng, Yew-Soon Ong

Research Collection School Of Computing and Information Systems

This paper presents a self-organizing neural architecture that integrates the features of belief, desire, and intention (BDI) systems with reinforcement learning. Based on fusion Adaptive Resonance Theory (fusion ART), the proposed architecture provides a unified treatment for both intentional and reactive cognitive functionalities. Operating with a sense-act-learn paradigm, the low level reactive module is a fusion ART network that learns action and value policies across the sensory, motor, and feedback channels. During performance, the actions executed by the reactive module are tracked by a high level intention module (also a fusion ART network) that learns to associate sequences of actions …


Integrating Temporal Difference Methods And Self‐Organizing Neural Networks For Reinforcement Learning With Delayed Evaluative Feedback, Ah-Hwee Tan, Ning Lu, Dan Xiao Feb 2008

Integrating Temporal Difference Methods And Self‐Organizing Neural Networks For Reinforcement Learning With Delayed Evaluative Feedback, Ah-Hwee Tan, Ning Lu, Dan Xiao

Research Collection School Of Computing and Information Systems

This paper presents a neural architecture for learning category nodes encoding mappings across multimodal patterns involving sensory inputs, actions, and rewards. By integrating adaptive resonance theory (ART) and temporal difference (TD) methods, the proposed neural model, called TD fusion architecture for learning, cognition, and navigation (TD-FALCON), enables an autonomous agent to adapt and function in a dynamic environment with immediate as well as delayed evaluative feedback (reinforcement) signals. TD-FALCON learns the value functions of the state-action space estimated through on-policy and off-policy TD learning methods, specifically state-action-reward-state-action (SARSA) and Q-learning. The learned value functions are then used to determine the …


Modified Art 2a Growing Network Capable Of Generating A Fixed Number Of Nodes, Ji He, Ah-Hwee Tan, Chew-Lim Tan May 2004

Modified Art 2a Growing Network Capable Of Generating A Fixed Number Of Nodes, Ji He, Ah-Hwee Tan, Chew-Lim Tan

Research Collection School Of Computing and Information Systems

This paper introduces the Adaptive Resonance Theory under Constraint (ART-C 2A) learning paradigm based on ART 2A, which is capable of generating a user-defined number of recognition nodes through online estimation of an appropriate vigilance threshold. Empirical experiments compare the cluster validity and the learning efficiency of ART-C 2A with those of ART 2A, as well as three closely related clustering methods, namely online K-Means, batch K-Means, and SOM, in a quantitative manner. Besides retaining the online cluster creation capability of ART 2A, ART-C 2A gives the alternative clustering solution, which allows a direct control on the number of output …


Qos Routing Optimization Strategy Using Genetic Algorithm In Optical Fiber Communication Networks, Zhaoxia Wang, Zengqiang Chen, Zhuzhi Yuan Jan 2004

Qos Routing Optimization Strategy Using Genetic Algorithm In Optical Fiber Communication Networks, Zhaoxia Wang, Zengqiang Chen, Zhuzhi Yuan

Research Collection School Of Computing and Information Systems

This paper describes the routing problems in optical fiber networks, defines five constraints, induces and simplifies the evaluation function and fitness function, and proposes a routing approach based on the genetic algorithm, which includes an operator [OMO] to solve the QoS routing problem in optical fiber communication networks. The simulation results show that the proposed routing method by using this optimal maintain operator genetic algorithm (OMOGA) is superior to the common genetic algorithms (CGA). It not only is robust and efficient but also converges quickly and can be carried out simply, that makes it better than other complicated GA.


Supervised Adaptive Resonance Theory And Rules, Ah-Hwee Tan Jan 2000

Supervised Adaptive Resonance Theory And Rules, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Supervised Adaptive Resonance Theory is a family of neural networks that performs incremental supervised learning of recognition categories (pattern classes) and multidimensional maps of both binary and analog patterns. This chapter highlights that the supervised ART architecture is compatible with IF-THEN rule-based symbolic representation. Specifi­cally, the knowledge learned by a supervised ART system can be readily translated into rules for interpretation. Similarly, a priori domain knowl­edge in the form of IF-THEN rules can be converted into a supervised ART architecture. Not only does initializing networks with prior knowl­edge improve predictive accuracy and learning efficiency, the inserted symbolic knowledge can also …


Concept Hierarchy Memory Model: A Neural Architecture For Conceptual Knowledge Representation, Learning, And Commonsense Reasoning, Ah-Hwee Tan, Hui-Shin Vivien Soon Jul 1996

Concept Hierarchy Memory Model: A Neural Architecture For Conceptual Knowledge Representation, Learning, And Commonsense Reasoning, Ah-Hwee Tan, Hui-Shin Vivien Soon

Research Collection School Of Computing and Information Systems

This article introduces a neural network based cognitive architecture termed Concept Hierarchy Memory Model (CHMM) for conceptual knowledge representation and commonsense reasoning. CHMM is composed of two subnetworks: a Concept Formation Network (CFN), that acquires concepts based on their sensory representations; and a Concept Hierarchy Network (CHN), that encodes hierarchical relationships between concepts. Based on Adaptive Resonance Associative Map (ARAM), a supervised Adaptive Resonance Theory (ART) model, CHMM provides a systematic treatment for concept formation and organization of a concept hierarchy. Specifically, a concept can be learned by sampling activities across multiple sensory fields. By chunking relations between concepts as …


Adaptive Resonance Associative Map, Ah-Hwee Tan Jan 1995

Adaptive Resonance Associative Map, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

This article introduces a neural architecture termed Adaptive Resonance Associative Map (ARAM) that extends unsupervised Adaptive Resonance Theory (ART) systems for rapid, yet stable, heteroassociative learning. ARAM can be visualized as two overlapping ART networks sharing a single category field. Although ARAM is simpler in architecture than another class of supervised ART models known as ARTMAP, it produces classification performance equivalent to that of ARTMAP. As ARAM network structure and operations are symmetrical, associative recall can be performed in both directions. With maximal vigilance settings, ARAM encodes pattern pairs explicitly as cognitive chunks and thus guarantees perfect storage and recall …