A high-throughput glasshouse bioassay to detect crown rot resistance in wheat germplasm
- Authors: Mitter, V. , Zhang, M. C. , Liu, C. J. , Ghosh, Ranadhir , Ghosh, Moumita , Chakraborty, Sukumar
- Date: 2006
- Type: Text , Journal article
- Relation: Plant Pathology Vol. 55, no. 3 (2006), p. 433-441
- Full Text: false
- Reviewed:
- Description: A high-throughput and reliable seedling bioassay to screen wheat germplasm for crown rot resistance was developed. Single wheat seedlings were grown in square seedling punnets in a glasshouse and inoculated with a monoconidial Fusarium pseudograminearum isolate 10 days after emergence. The punnets were laid horizontally on their side and a 10-
- Description: C1
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
Derivative free stochastic discrete gradient method with adaptive mutation
- Authors: Ghosh, Ranadhir , Ghosh, Moumita , Bagirov, Adil
- Date: 2006
- Type: Text , Journal article
- Relation: Advances in Data Mining Vol. 4065, no. (2006), p. 264-278
- Full Text: false
- Reviewed:
- Description: In data mining we come across many problems such as function optimization problem or parameter estimation problem for classifiers for which a good learning algorithm for searching is very much necessary. In this paper we propose a stochastic based derivative free algorithm for unconstrained optimization problem. Many derivative-based local search methods exist which usually stuck into local solution for non-convex optimization problems. On the other hand global search methods are very time consuming and works for only limited number of variables. In this paper we investigate a derivative free multi search gradient based method which overcomes the problems of local minima and produces global solution in less time. We have tested the proposed method on many benchmark dataset in literature and compared the results with other existing algorithms. The results are very promising.
- Description: C1
- Description: 2003001541
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
An intelligent offline handwriting recognition system using evolutionary neural learning algorithm and rule based over segmented data points
- Authors: Ghosh, Ranadhir , Ghosh, Moumita
- Date: 2005
- Type: Text , Journal article
- Relation: Journal of Research and Practice in Information Technology Vol. 37, no. 1 (2005), p. 73-86
- Full Text: false
- Reviewed:
- Description: In this paper we propose a novel technique of using a hybrid evolutionary method, which uses a combination of genetic algorithm and matrix based solution methods such as QR factorization. The training of the model is based on a layer based hierarchical structure for the architecture and the weights for the Artificial Neural Network classifier. The architecture for the classifier is found using a binary search type procedure. The hierarchical structured algorithm (EALS-BT) is also a hybrid, because it combines the Genetic Algorithm based method with the Matrix based solution method for finding weights. A heuristic segmentation algorithm is initially used to over segment each word. Then the segmentation points are passed through the rule-based module to discard the incorrect segmentation points and include any missing segmentation points. Following the segmentation the contour is extracted between two correct segmentation points. The contour is passed through the feature extraction module that extracts the angular features, after which the EALS-BT algorithm finds the architecture and the weights for the classifier network. These recognized characters are grouped into words and passed to a variable length lexicon that retrieves words that have the highest confidence value.
- Description: C1
- Description: 2003001367
Applying anatomical therapeutic chemical (ATC) and critical term ontologies to Australian drug safety data for association rules and adverse event signalling
- Authors: Saunders, Gary , Ivkovic, Sasha , Ghosh, Ranadhir , Yearwood, John
- Date: 2005
- Type: Text , Journal article
- Relation: Conferences in Research and Practice in Information Technology, Advances in Ontologies 2005: Proceedings of the Australasian Ontology Workshop AOW 2005 Vol. 58, no. (2005), p. 93-98
- Full Text:
- Reviewed:
- Description: C1
- Description: 2003001450
Comparative analysis of genetic algorithm, simulated annealing and cutting angle method for artificial neural networks
- Authors: Ghosh, Ranadhir , Ghosh, Moumita , Yearwood, John , Bagirov, Adil
- Date: 2005
- Type: Text , Journal article
- Relation: Machine Learning and Data Mining in Pattern Recognition, Proceedings Vol. 3587, no. (2005), p. 62-70
- Full Text: false
- Reviewed:
- Description: Neural network learning is the main essence of ANN. There are many problems associated with the multiple local minima in neural networks. Global optimization methods are capable of finding global optimal solution. In this paper we investigate and present a comparative study for the effects of probabilistic and deterministic global search method for artificial neural network using fully connected feed forward multi-layered perceptron architecture. We investigate two probabilistic global search method namely Genetic algorithm and Simulated annealing method and a deterministic cutting angle method to find weights in neural network. Experiments were carried out on UCI benchmark dataset.
- Description: C1
- Description: 2003003398
Hybridization of neural learning algorithms using evolutionary and discrete gradient approaches
- Authors: Ghosh, Ranadhir , Yearwood, John , Ghosh, Moumita , Bagirov, Adil
- Date: 2005
- Type: Text , Journal article
- Relation: Journal of Computer Science Vol. 1, no. 3 (2005), p. 387-394
- Full Text: false
- Reviewed:
- Description: In this study we investigated 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 study 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.
- Description: C1
- Description: 2003001357
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
Optimization approach for clustering datasets with weights
- Authors: Ghosh, Ranadhir , Rubinov, Alex , Zhang, Jiapu
- Date: 2005
- Type: Text , Journal article
- Relation: Optimization Methods & Software Vol. 20, no. 2-3 (Apr-Jun 2005), p. 329-345
- Full Text:
- Reviewed:
- Description: We introduce datasets with weights and suggest using the minimization of some highly nonsmooth functions for clustering of such datasets. Datasets with weights often appear as the result of an approximation of large-scale datasets. We examine such approximations and also consider the application of datasets with weights to examine self-organizing maps. Results of some numerical experiments are presented and discussed.
- Description: C1
- Description: 2003001366
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
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
Weather-based prediction of anthracnose severity using artificial neural network models
- Authors: Chakraborty, Sukumar , Ghosh, Ranadhir , Ghosh, Moumita , Fernandes, C. D. , Charchar, M. J. , Kelemu, S.
- Date: 2004
- Type: Text , Journal article
- Relation: Plant Pathology Vol. 53, no. 4 (2004), p. 375-386
- Full Text: false
- Reviewed:
- Description: Data were collected and analysed from seven field sites in Australia, Brazil and Colombia on weather conditions and the severity of anthracnose disease of the tropical pasture legume Stylosanthes scabra caused by Colletotrichum gloeosporioides. Disease severity and weather data were analysed using artificial neural network (ANN) models developed using data from some or all field sites in Australia and/or South America to predict severity at other sites. Three series of models were developed using different weather summaries. Of these, ANN models with weather for the day of disease assessment and the previous 24 h period had the highest prediction success, and models trained on data from all sites within one continent correctly predicted disease severity in the other continent on more than 75% of days; the overall prediction error was 21.9% for the Australian and 22.1% for the South American model. Of the six cross-continent ANN models trained on pooled data for five sites from two continents to predict severity for the remaining sixth site, the model developed without data from Planaltina in Brazil was the most accurate, with >85% prediction success, and the model without Carimagua in Colombia was the least accurate, with only 54% success. In common with multiple regression models, moisture-related variables such as rain, leaf surface wetness and variables that influence moisture availability such as radiation and wind on the day of disease severity assessment or the day before assessment were the most important weather variables in all ANN models. A set of weights from the ANN models was used to calculate the overall risk of anthracnose for the various sites. Sites with high and low anthracnose risk are present in both continents, and weather conditions at centres of diversity in Brazil and Colombia do not appear to be more conducive than conditions in Australia to serious anthracnose development.
- Description: C1
- Description: 2003000875
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