A fuzzy logic approach to experience based
- Authors: Sun, Zhaohao , Finnie, Gavin
- Date: 2007
- Type: Text , Journal article
- Relation: International Journal of Intelligent Systems Vol. 22, no. 8 (2007), p. 867-889
- Full Text: false
- Reviewed:
- Description: International Journal of Intelligent Systems archive Volume 22 Issue 8, August 2007 John Wiley & Sons, Inc. New York, NY, USA table of contents doi>10.1002/int.v22:8
Keeping the patient asleep and alive : Towards a computational cognitive model of disturbance management in anaesthesia
- Authors: Keogh, Kathleen , Sonenberg, Elizabeth
- Date: 2007
- Type: Text , Journal article
- Relation: Cognitive Systems Research Vol. 8, no. 4 (2007), p. 249-261
- Full Text:
- Reviewed:
- Description: We have analysed rich, dynamic data about the behaviour of anaesthetists during the management of a simulated critical incident in the operating theatre. We use a paper based analysis and a partial implementation to further the development of a computational cognitive model for disturbance management in anaesthesia. We suggest that our data analysis pattern may be used for the analysis of behavioural data describing cognitive and observable events in other complex dynamic domains. © 2007 Elsevier B.V. All rights reserved.
- Description: C1
- Description: 2003005060
A hybrid neural learning algorithm using evolutionary learning and derivative free local search method
- Authors: Ghosh, Ranadhir , Yearwood, John , Ghosh, Moumita , Bagirov, Adil
- Date: 2006
- Type: Text , Journal article
- Relation: International Journal of Neural Systems Vol. 16, no. 3 (2006), p. 201-213
- Full Text: false
- Reviewed:
- Description: In this paper we investigate a hybrid model based on the Discrete Gradient method and an evolutionary strategy for determining the weights in a feed forward artificial neural network. Also we discuss different variants for hybrid models using the Discrete Gradient method and an evolutionary strategy for determining the weights in a feed forward artificial neural network. The Discrete Gradient method has the advantage of being able to jump over many local minima and find very deep local minima. However, earlier research has shown that a good starting point for the discrete gradient method can improve the quality of the solution point. Evolutionary algorithms are best suited for global optimisation problems. Nevertheless they are cursed with longer training times and often unsuitable for real world application. For optimisation problems such as weight optimisation for ANNs in real world applications the dimensions are large and time complexity is critical. Hence the idea of a hybrid model can be a suitable option. In this paper we propose different fusion strategies for hybrid models combining the evolutionary strategy with the discrete gradient method to obtain an optimal solution much quicker. Three different fusion strategies are discussed: a linear hybrid model, an iterative hybrid model and a restricted local search hybrid model. Comparative results on a range of standard datasets are provided for different fusion hybrid models. © World Scientific Publishing Company.
- Description: C1
- Description: 2003001712
A Root-finding algorithm for list decoding of Reed-Muller codes
- Authors: Wu, Xinwen , Kuijper, Margreta , Udaya, Parampalli
- Date: 2006
- Type: Text , Journal article
- Relation: IEEE transactions on information theory Vol. 51, no. 3 (2006), p. 1190-1196
- Full Text: false
- Reviewed:
- Description: Let Fq[X1,...,Xm] denote the set of polynomials over Fq in m variables, and Fq[X1,...,Xm]≤u denote the subset that consists of the polynomials of total degree at most u. Let H(T) be a nontrivial polynomial in T with coefficients in Fq[X1,...,Xm]. A crucial step in interpolation-based list decoding of q-ary Reed-Muller (RM) codes is finding the roots of H(T) in Fq[X1,...,Xm]≤u. In this correspondence, we present an efficient root-finding algorithm, which finds all the roots of H(T) in Fq[X1,...,Xm]≤u. The algorithm can be used to speed up the list decoding of RM codes.
- Description: C1
- Description: 2003005726
Neural networks for detection and classification of walking pattern changes due to ageing
- Authors: Begg, Rezaul , Kamruzzaman, Joarder
- Date: 2006
- Type: Text , Journal article
- Relation: Australasian Physical & Engineering Sciences in Medicine Vol. 29, no. 2 (2006), p. 188-195
- Full Text: false
- Reviewed:
- Description: With age, gait functions reflected in the walking patterns degenerate and threaten the balance control mechanisms of the locomotor system. The aim of this paper is to explore applications of artificial neural networks for automated recognition of gait changes due to ageing from their respective gait-pattern characteristics. The ability of such discrimination has many advantages including the identification of at-risk or faulty gait. Various gait features (e.g., temporal-spatial, footground reaction forces and lower limb joint angular data) were extracted from 12 young and 12 elderly participants during normal walking and these were utilized for training and testing on three neural network algorithms (Standard Backpropagation; Scaled Conjugate Gradient; and Backpropagation with Bayesian Regularization, BR). Receiver operating characteristics plots, sensitivity and specificity results as well as accuracy rates were used to evaluate performance of the three classifiers. Cross-validation test results indicate a maximum generalization performance of 83.3% in the recognition of the young and elderly gait patterns. Out of the three neural network algorithms, BR performed superiorly in the test results with best sensitivity, selectivity and detection rates. With the help of a feature selection technique, the maximum classification accuracy of the BR attained 100%, when trained with a small subset of selected gait features. The results of this study demonstrate the capability of neural networks in the detection of gait changes with ageing and their potentials for future applications as gait diagnostics.
A fully automated breast cancer recognition system using discrete-gradient based clustering and multi category feature selection
- Authors: Ghosh, Ranadhir , Ghosh, Moumita , Yearwood, John
- Date: 2005
- Type: Text , Journal article
- Relation: Journal of Advanced Computational Intelligence and Intelligent Informatics Vol. 9, no. 3 (2005), p. 244-256
- Full Text: false
- Reviewed:
- Description: Advances in machine intelligence have provided a whole new window of opportunities in medical research. Building a fully automated computer aided diagnostic system for digital mammograms is just one of them. Given some success with semi-automated systems earlier, a fully automated CAD system is just another step forward. A proper combination of a feature selection model and a classifier for those areas of a mammogram marked by radiologists has been very successful. However a fully automated system with only two modules is a time consuming process as the suspicious areas in a mammogram can be quite small when compared to the whole image. Thus an additional clustering process can help in reducing the time complexity of the overall process. In this paper we propose a fast clustering process to identify suspicious areas. Another novelty of this paper is a multi-category feature selection approach. The choice of features to represent the patterns affects several aspects of pattern recognition problems such as accuracy, required learning time and the required number of samples. In this paper we propose a hybrid canonical based feature extraction technique as a combination of an evolutionary algorithm based classifier with a feed forward MLP model.
- Description: C1
- Description: 2003001358
Modular neural network design for the problem of alphabetic character recognition
- Authors: Ferguson, Brent , Ghosh, Ranadhir , Yearwood, John
- Date: 2005
- Type: Text , Journal article
- Relation: International Journal of Pattern Recognition and Artificial Intelligence Vol. 19, no. 2 (Mar 2005), p. 249-269
- Full Text: false
- Reviewed:
- Description: This paper reports on an experimental approach to nd a modularized articial neural network solution for the UCI letters recognition problem. Our experiments have been carried out in two parts. We investigate directed task decomposition using expert knowledge and clustering approaches to nd the subtasks for the modules of the network. We next investigate processes to combine the modules e ectively in a single decision process. After having found suitable modules through task decomposition we have found through further experimentation that when the modules are combined with decision tree supervision, their functional error is reduced signicantly to improve their combination through the decision process that has been implemented as a small multilayered perceptron. The experiments conclude with a modularized neural network design for this classication problem that has increased learning and generalization characteristics. The test results for this network are markedly better than a single or stand alone network that has a fully connected topology.
- Description: C1
- Description: 2003001355
Some special properties of G A- and LS-based neural learning method
- Authors: Ghosh, Ranadhir
- Date: 2005
- Type: Text , Journal article
- Relation: Journal of Intelligent Systems Vol. 14, no. 4 (2005), p. 289-319
- Full Text: false
- Reviewed:
- Description: Many works in the area of hybrid neural learning algorithms combine global and local based method for artificial neural network. In this paper, we discuss some special properties of a hybrid neural learning algorithm that combines the GA based method with least square based methods such as QR factorization. We look at different types of learning properties of this new hybrid algorithm, such as time complexity, convergence property, and the stability of the algorithm.
- Description: C1
- Description: 2003001361
Structured reasoning to support deliberative dialogue
- Authors: Macfadyen, Alyx , Stranieri, Andrew , Yearwood, John
- Date: 2005
- Type: Text , Journal article
- Relation: Lecture Notes in Artificial Intelligence 3681: Knowledge-Based Intelligent Information and Engineering Systems, 9th International Conference, KES 2005, Melbourne, Australia, September 2005, Proceedings, Part 1 Vol. 1, no. (2005), p. 283-289
- Full Text:
- Reviewed:
- Description: Deliberative dialogue is a form of dialogue that involves participants advancing claims and, without power plays or posturing, deliberating on the claims of others until a consensus decision is reached. This paper describes a deliberative support system to facilitate and encourage participants to engage in a discussion deliberatively. A knowledge representation framework is deployed to generate a strong domain model of reasoning structure. The structure, coupled with a deliberative dialogue protocol results in a web based system that regulates a discussion to avoid combative, non-deliberative exchanges. The system has been designed for online dispute resolution between husband and wife in divorce proceedings involving property.
- Description: C1
- Description: 2003001381
A fully automated offline handwriting recognition system incorporating rule based neural network validated segmentation and hybrid neural network classifier
- Authors: Ghosh, Moumita , Ghosh, Ranadhir , Verma, Brijesh
- Date: 2004
- Type: Text , Journal article
- Relation: International Journal of Pattern Recognition and Artificial Intelligence Vol. 18, no. 7 (Nov 2004), p. 1267-1283
- Full Text: false
- Reviewed:
- Description: In this paper we propose a fully automated offline handwriting recognition system that incorporates rule based segmentation, contour based feature extraction, neural network validation, a hybrid neural network classifier and a hamming neural network lexicon. The work is based on our earlier promising results in this area using heuristic segmentation and contour based feature extraction. The segmentation is done using many heuristic based set of rules in an iterative manner and finally followed by a neural network validation system. The extraction of feature is performed using both contour and structure based feature extraction algorithm. The classification is performed by a hybrid neural network that incorporates a hybrid combination of evolutionary algorithm and matrix based solution method. Finally a hamming neural network is used as a lexicon. A benchmark dataset from CEDAR has been used for training and testing- Author
- Description: C1
- Description: 2003000867
Connection topologies for combining genetic and least square methods for neural learning
- Authors: Ghosh, Ranadhir
- Date: 2004
- Type: Text , Journal article
- Relation: Journal of Intelligent Systems Vol. 13, no. 3 (2004), p. 199-232
- Full Text: false
- Reviewed:
- Description: In the last few years, there have been many works in the area of hybrid neural learning algorithms combining a global and local based method for training artificial neural networks. In this paper, we discuss various connection strategies that can be applied to a special kind of a hybrid neural learning algorithm group, one that combines a genetic algorithm-based method with various least square-based methods like QR factorization. The relative advantages and disadvantages of the different connection types are studied to find a suitable connection topology for combining the two different learning methods. The methodology also finds the optimum number of hidden neurons using a hierarchical combination methodology structure for weights and architecture. We have tested our proposed approach on XOR, 10 bit odd parity, and some other real-world benchmark data sets, such as the hand-writing character dataset from CEDAR, Breast cancer, and Heart Disease from the UCI machine learning repository.
- Description: C1
A hierarchical method for finding optimal architecture and weights using evolutionary least square based learning
- Authors: Ghosh, Ranadhir , Verma, Brijesh
- Date: 2003
- Type: Text , Journal article
- Relation: International Journal of Neural Systems Vol. 13, no. 1 (2003), p. 13-24
- Full Text: false
- Reviewed:
- Description: In this paper, we present a novel approach of implementing a combination methodology to find appropriate neural network architecture and weights using an evolutionary least square based algorithm (GALS).1 This paper focuses on aspects such as the heuristics of updating weights using an evolutionary least square based algorithm, finding the number of hidden neurons for a two layer feed forward neural network, the stopping criterion for the algorithm and finally some comparisons of the results with other existing methods for searching optimal or near optimal solution in the multidimensional complex search space comprising the architecture and the weight variables. We explain how the weight updating algorithm using evolutionary least square based approach can be combined with the growing architecture model to find the optimum number of hidden neurons. We also discuss the issues of finding a probabilistic solution space as a starting point for the least square method and address the problems involving fitness breaking. We apply the proposed approach to XOR problem, 10 bit odd parity problem and many real-world benchmark data sets such as handwriting data set from CEDAR, breast cancer and heart disease data sets from UCI ML repository. The comparative results based on classification accuracy and the time complexity are discussed.
- Description: 2003004100
Simplified theodolite calibration for robot metrology
- Authors: Sultan, Ibrahim , Wager, John
- Date: 2002
- Type: Text , Journal article
- Relation: Advanced Robotics Vol. 16, no. 7 (2002), p. 653-671
- Full Text:
- Reviewed:
- Description: Theodolites represent a well-established three-dimensional-point-measuring technology. However, when used for robot applications they have to be properly calibrated to fulfil the necessary accuracy requirements. The theodolite calibration methods reported in the literature involve the use of costly sophisticated equipment not easily available to most users. Therefore, a new simplified calibration technique is presented based on the use of a graduated precision bar suspended freely to align with the vertical direction. To develop efficient mathematical models, the theodolites will be regarded as 2R open-ended mechanisms with the end-effector axis directed along the line of sight. The proposed models are then coded in a computer program designed to verify the validity of the technique presented. The simulation results will be presented at the end of the paper.
- Description: 2003000163
Argumentation structures that integrate dialectical and non-dialectical reasoning
- Authors: Stranieri, Andrew , Zeleznikow, John , Yearwood, John
- Date: 2001
- Type: Text , Journal article
- Relation: Knowledge Engineering Review Vol. 16, no. 4 (Dec 2001), p. 331-348
- Full Text:
- Reviewed:
- Description: Argumentation concepts have been applied to numerous knowledge engineering endeavours in recent years. For example, a variety of logics have been developed to represent argumentation in the context of a dialectical situation such as a dialogue. In contrast to the dialectical approach, argumentation has also been used to structure knowledge. This can be seen as a non-dialectical approach. The Toulmin argument structure has often been used to structure knowledge non-dialectically yet most studies that apply the Toulmin structure do not use the original structure but vary one or more components. Variations to the Toulmin structure can be understood as different ways to integrate a dialectical perspective with a non-dialectical one. Drawing the dialectical/non-dialectical distinction enables the specification of a framework called the generic actual argument model that is expressly non-dialectical. The framework enables the development of knowledge-based systems that integrate a variety of inference procedures, combine information retrieval with reasoning and facilitate automated document drafting. Furthermore, the non-dialectical framework provides the foundation for simple dialectical models. Systems based on our approach have been developed in family law, refugee law, determining eligibility for government legal aid, copyright law and e-tourism.
- Description: C1
- Description: 2003002516
System development a la MODDE
- Authors: Meikle, Tunde , Yearwood, John
- Date: 2001
- Type: Text , Conference paper
- Relation: Paper presented at 8th International Conference on Artificial Intelligence and Law - ICAIL '01, St. Louis, Missouri, USA : 21st-25th May 2001 p. 99-103
- Full Text: false
- Description: This paper describes the MODDE (Model of Decision support system Design and Evaluation) framework in some detail. The work is in progress and is being currently applied to the EMBRACE project being developed for the Refugee Review Tribunal (RRT) of Australia. Refugee law is the general legal area we are working in, while the specific domain under investigation is that of the decision makers at the RRT. EMBRACE is a decision support system being designed to assist the RRT in maintaining consistency of decisions, and preserve discretion of decision makers as well as making it easier to cope with high volumes of work in decreasing time frames. The use of the MODDE framework is intended to facilitate systematic attention to important features of decision making in our specific legal domain and to provide a sound basis upon which to evaluate a part of the system intrinsic to user acceptance. Copyright 2001 ACM.
- Description: 2003003947
Tools for placing legal decision support systems on the world wide web
- Authors: Stranieri, Andrew , Yearwood, John , Zeleznikow, John
- Date: 2001
- Type: Text , Conference paper
- Relation: Paper presented at Eighth International Conference on Artificial Intelligence and Law, ICAIL 2001, St. Louis, USA : 21st-25th May 2001
- Full Text: false
- Description: 2003003944