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

Physical Sciences and Mathematics Commons

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

Articles 31 - 43 of 43

Full-Text Articles in Physical Sciences and Mathematics

Deep Learning On Lie Groups For Skeleton-Based Action Recognition, Zhiwu Huang, C. Wan, T. Probst, Gool L. Van Jul 2017

Deep Learning On Lie Groups For Skeleton-Based Action Recognition, Zhiwu Huang, C. Wan, T. Probst, Gool L. Van

Research Collection School Of Computing and Information Systems

In recent years, skeleton-based action recognition has become a popular 3D classification problem. State-of-the-art methods typically first represent each motion sequence as a high-dimensional trajectory on a Lie group with an additional dynamic time warping, and then shallowly learn favorable Lie group features. In this paper we incorporate the Lie group structure into a deep network architecture to learn more appropriate Lie group features for 3D action recognition. Within the network structure, we design rotation mapping layers to transform the input Lie group features into desirable ones, which are aligned better in the temporal domain. To reduce the high feature …


Pairwise Relation Classification With Mirror Instances And A Combined Convolutional Neural Network, Jianfei Yu, Jing Jiang Dec 2016

Pairwise Relation Classification With Mirror Instances And A Combined Convolutional Neural Network, Jianfei Yu, Jing Jiang

Research Collection School Of Computing and Information Systems

Relation classification is the task of classifying the semantic relations between entity pairs in text. Observing that existing work has not fully explored using different representations for relation instances, especially in order to better handle the asymmetry of relation types, in this paper, we propose a neural network based method for relation classification that combines the raw sequence and the shortest dependency path representations of relation instances and uses mirror instances to perform pairwise relation classification. We evaluate our proposed models on two widely used datasets: SemEval-2010 Task 8 and ACE-2005. The empirical results show that our combined model together …


Self-Organizing Neural Network For Adaptive Operator Selection In Evolutionary Search, Teck Hou Teng, Stephanus Daniel Handoko, Hoong Chuin Lau Jun 2016

Self-Organizing Neural Network For Adaptive Operator Selection In Evolutionary Search, Teck Hou Teng, Stephanus Daniel Handoko, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

Evolutionary Algorithm is a well-known meta-heuristics paradigm capable of providing high-quality solutions to computationally hard problems. As with the other meta-heuristics, its performance is often attributed to appropriate design choices such as the choice of crossover operators and some other parameters. In this chapter, we propose a continuous state Markov Decision Process model to select crossover operators based on the states during evolutionary search. We propose to find the operator selection policy efficiently using a self-organizing neural network, which is trained offline using randomly selected training samples. The trained neural network is then verified on test instances not used for …


Integrating Self-Organizing Neural Network And Motivated Learning For Coordinated Multi-Agent Reinforcement Learning In Multi-Stage Stochastic Game, Teck-Hou Teng, Ah-Hwee Tan, Janusz A. Starzyk, Yuan-Sin Tan, Loo-Nin Teow Jul 2014

Integrating Self-Organizing Neural Network And Motivated Learning For Coordinated Multi-Agent Reinforcement Learning In Multi-Stage Stochastic Game, Teck-Hou Teng, Ah-Hwee Tan, Janusz A. Starzyk, Yuan-Sin Tan, Loo-Nin Teow

Research Collection School Of Computing and Information Systems

Most non-trivial problems require the coordinated performance of multiple goal-oriented and time-critical tasks. Coordinating the performance of the tasks is required due to the dependencies among the tasks and the sharing of resources. In this work, an agent learns to perform a task using reinforcement learning with a self-organizing neural network as the function approximator. We propose a novel coordination strategy integrating Motivated Learning (ML) and a self-organizing neural network for multi-agent reinforcement learning (MARL). Specifically, we adapt the ML idea of using pain signal to overcome the resource competition issue. Dependency among the agents is resolved using domain knowledge …


Motivated Learning For The Development Of Autonomous Agents, Janusz A. Starzyk, James T. Graham, Pawel Raif, Ah-Hwee Tan Apr 2012

Motivated Learning For The Development Of Autonomous Agents, Janusz A. Starzyk, James T. Graham, Pawel Raif, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

A new machine learning approach known as motivated learning (ML) is presented in this work. Motivated learning drives a machine to develop abstract motivations and choose its own goals. ML also provides a self-organizing system that controls a machine’s behavior based on competition between dynamically-changing pain signals. This provides an interplay of externally driven and internally generated control signals. It is demonstrated that ML not only yields a more sophisticated learning mechanism and system of values than reinforcement learning (RL), but is also more efficient in learning complex relations and delivers better performance than RL in dynamically changing environments. In …


A Structure First Image Inpainting Approach Based On Self-Organizing Map (Som), Bo Chen, Zhaoxia Wang, Ming Bai, Quan Wang, Zhen Sun Dec 2010

A Structure First Image Inpainting Approach Based On Self-Organizing Map (Som), Bo Chen, Zhaoxia Wang, Ming Bai, Quan Wang, Zhen Sun

Research Collection School Of Computing and Information Systems

This paper presents a structure first image inpainting method based on self-organizing map (SOM). SOM is employed to find the useful structure information of the damaged image. The useful structure information which includes relevant edges of the image is used to simulate the structure information of the lost or damaged area in the image. The structure information is described by distinct or indistinct curves in an image in this paper. The obtained target curves separate the damaged area of the image into several parts. As soon as each part of the damaged image is restored respectively, the damaged image is …


Multilayer Image Inpainting Approach Based On Neural Networks, Quan Wang, Zhaoxia Wang, Che Sau Chang, Ting Yang Aug 2009

Multilayer Image Inpainting Approach Based On Neural Networks, Quan Wang, Zhaoxia Wang, Che Sau Chang, Ting Yang

Research Collection School Of Computing and Information Systems

This paper describes an image inpainting approach based on the self-organizing map for dividing an image into several layers, assigning each damaged pixel to one layer, and then restoring these damaged pixels by the information of their respective layer. These inpainted layers are then fused together to provide the final inpainting results. This approach takes advantage of the neural network's ability of imitating human's brain to separate objects of an image into different layers for inpainting. The approach is promising as clearly demonstrated by the results in this paper.


Multi-Order Neurons For Evolutionary Higher Order Clustering And Growth, Kiruthika Ramanathan, Sheng Uei Guan Dec 2007

Multi-Order Neurons For Evolutionary Higher Order Clustering And Growth, Kiruthika Ramanathan, Sheng Uei Guan

Research Collection School Of Computing and Information Systems

This letter proposes to use multiorder neurons for clustering irregularly shaped data arrangements. Multiorder neurons are an evolutionary extension of the use of higher-order neurons in clustering. Higher-order neurons parametrically model complex neuron shapes by replacing the classic synaptic weight by higher-order tensors. The multiorder neuron goes one step further and eliminates two problems associated with higher-order neurons. First, it uses evolutionary algorithms to select the best neuron order for a given problem. Second, it obtains more information about the underlying data distribution by identifying the correct order for a given cluster of patterns. Empirically we observed that when the …


Clustering And Combinatorial Optimization In Recursive Supervised Learning, Kiruthika Ramanathan, Sheng Uei Guan Feb 2007

Clustering And Combinatorial Optimization In Recursive Supervised Learning, Kiruthika Ramanathan, Sheng Uei Guan

Research Collection School Of Computing and Information Systems

The use of combinations of weak learners to learn a dataset has been shown to be better than the use of a single strong learner. In fact, the idea is so successful that boosting, an algorithm combining several weak learners for supervised learning, has been considered to be the best off the shelf classifier. However, some problems still exist, including determining the optimal number of weak learners and the over fitting of data. In an earlier work, we developed the RPHP algorithm which solves both these problems by using a combination of global search, weak learning and pattern distribution. In …


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 …


Predictive Self-Organizing Networks For Text Categorization, Ah-Hwee Tan Apr 2001

Predictive Self-Organizing Networks For Text Categorization, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

This paper introduces a class of predictive self-organizing neural networks known as Adaptive Resonance Associative Map (ARAM) for classification of free-text documents. Whereas most sta- tistical approaches to text categorization derive classification knowledge based on training examples alone, ARAM performs supervised learn- ing and integrates user-defined classification knowledge in the form of IF-THEN rules. Through our experiments on the Reuters-21578 news database, we showed that ARAM performed reasonably well in mining categorization knowledge from sparse and high dimensional document feature space. In addition, ARAM predictive accuracy and learning efficiency can be improved by incorporating a set of rules derived from …


Decision Support Methods In Diabetic Patient Management By Insulin Administration Neural Network Vs. Induction Methods For Knowledge Classification, B. V. Ambrosiadou, S. Vadera, Venky Shankaraman, D. Goulis, G. Gogou May 2000

Decision Support Methods In Diabetic Patient Management By Insulin Administration Neural Network Vs. Induction Methods For Knowledge Classification, B. V. Ambrosiadou, S. Vadera, Venky Shankaraman, D. Goulis, G. Gogou

Research Collection School Of Computing and Information Systems

Diabetes mellitus is now recognised as a major worldwide public health problem. At present, about 100 million people are registered as diabetic patients. Many clinical, social and economic problems occur as a consequence of insulin-dependent diabetes. Treatment attempts to prevent or delay complications by applying ‘optimal’ glycaemic control. Therefore, there is a continuous need for effective monitoring of the patient. Given the popularity of decision tree learning algorithms as well as neural networks for knowledge classification which is further used for decision support, this paper examines their relative merits by applying one algorithm from each family on a medical problem; …


Connectionist Expert System With Adaptive Learning Capability, B. T. Low, Hochung Lui, Ah-Hwee Tan, Hoonheng Teh Jun 1991

Connectionist Expert System With Adaptive Learning Capability, B. T. Low, Hochung Lui, Ah-Hwee Tan, Hoonheng Teh

Research Collection School Of Computing and Information Systems

A neural network expert system called adaptive connectionist expert system (ACES) which will learn adaptively from past experience is described. ACES is based on the neural logic network, which is capable of doing both pattern processing and logical inferencing. The authors discuss two strategies, pattern matching ACES and rule inferencing ACES. The pattern matching ACES makes use of past examples to construct its neural logic network and fine-tunes itself adaptively during its use by further examples supplied. The rule inferencing ACES conceptualizes new rules based on the frequencies of use on the rule-based neural logic network. A new rule could …