Now showing items 9-28 of 30

  • Bayesian network structure learning using characteristic properties of permutation representations with applications to prostate cancer treatment. 

    Regnier-Coudert, Olivier (Robert Gordon University School of Computing Science and Digital Media, 2013-05)
    Over the last decades, Bayesian Networks (BNs) have become an increasingly popular technique to model data under presence of uncertainty. BNs are probabilistic models that represent relationships between variables by ...
  • Combining biochemical network motifs within an ARN-agent control system. 

    Gerrard, Claire E.; McCall, John; Macleod, Christopher; Coghill, George M. (IEEE http://dx.doi.org/10.1109/UKCI.2013.6651281, 2013-09)
    GERRARD, C. E., MCCALL, J., MACLEOD, C. and COGHILL, G. M., 2013. Combining biochemical network motifs within an ARN-agent control system. In: Y. JIN and S. A. THOMAS, eds. Proceedings of the 13th UK Workshop on Computational Intelligence (UKCI) 2013 9-11 September 2013. New York: IEEE. pp. 8-15.
    The Artificial Reaction Network (ARN) is an Artificial Chemistry representation inspired by cell signaling networks. The ARN has previously been applied to the simulation of the chemotaxis pathway of Escherichia coli and ...
  • Computational aspects of cellular intelligence and their role in artificial intelligence. 

    Gerrard, Claire E. (Robert Gordon University School of Computing Science and Digital Media, 2014-07)
    The work presented in this thesis is concerned with an exploration of the computational aspects of the primitive intelligence associated with single-celled organisms. The main aim is to explore this “Cellular Intelligence” ...
  • DEUM: A Framework for an Estimation of Distribution Algorithm based on Markov Random Fields 

    Shakya, Siddhartha (The Robert Gordon University School of Computing, Faculty of Design and Technology, The Robert Gordon University, Aberdeen, UK, 2006-04)
    Estimation of Distribution Algorithms (EDAs) belong to the class of population based optimisation algorithms. They are motivated by the idea of discovering and exploiting the interaction between variables in the solution. ...
  • Experimental user interface design toolkit for interaction research (IDTR). 

    Golovine, Jean Claude Raymond Rolin (Robert Gordon University School of Computing Science and Digital Media., 2013-05)
    The research reported and discussed in this thesis represents a novel approach to User Interface evaluation and optimisation through cognitive modelling. This is achieved through the development and testing of a toolkit ...
  • Exploring aspects of cell intelligence with artificial reaction networks. 

    Gerrard, Claire E.; McCall, John; Coghill, George M.; Macleod, Christopher (Springer. http://dx.doi.org/10.1007/s00500-013-1174-8, 2014-10)
    GERRARD, C. E., MCCALL, J., COGHILL, G. M. and MACLEOD, C., 2014. Exploring aspects of cell intelligence with artificial reaction networks. Soft Computing, 18 (10), pp. 1899-1912.
    The Artificial Reaction Network (ARN) is a Cell Signalling Network inspired connectionist representation belonging to the branch of A-Life known as Artificial Chemistry. Its purpose is to represent chemical circuitry ...
  • Generating easy and hard problems using the Proximate Optimality Principle. 

    McCall, John; Christie, Lee A.; Brownlee, Alexander Edward Ian (ACM http://doi.acm.org/10.1145/2739482.2764890, 2015)
    MCCALL, J. A. W., CHRISTIE, L. A. and BROWNLEE, A. E. I, 2015. Generating easy and hard problems using the Proximate Optimality Principle. In: Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation (GECCO Companion '15). New York: ACM. pp. 767-768.
    We present an approach to generating problems of variable difficulty based on the well-known Proximate Optimality Principle (POP), often paraphrased as "similar solutions have similar fitness". We explore definitions of ...
  • Incorporating a metropolis method in a distribution estimation using Markov random field algorithm. 

    Shakya, Siddhartha; McCall, John; Brown, Deryck (IEEE http://dx.doi.org/10.1109/CEC.2005.1555017, 2005-09)
    SHAKYA, S., MCCALL, J. and BROWN, D., 2005. Incorporating a metropolis method in a distribution estimation using Markov random field algorithm. In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2005), Volume 3. 2-5 September 2005. New York: IEEE. pp. 2576-2583.
    Markov Random Field (MRF) modelling techniques have been recently proposed as a novel approach to probabilistic modelling for Estimation of Distribution Algorithms (EDAs)[34, 4]. An EDA using this technique, presented ...
  • An inductive logic programming approach to learning which uORFs regulate gene expression. 

    Selpi (The Robert Gordon University School of Computing, 2008-03)
    Some upstream open reading frames (uORFs) regulate gene expression (i.e. they are functional) and can play key roles in keeping organisms healthy. However, how uORFs are involved in gene regulation is not het fully understood. ...
  • Minimal walsh structure and ordinal linkage of monotonicity-invariant function classes on bit strings. 

    Christie, Lee A.; McCall, John; Lonie, David P. (ACM http://dx.doi.org/10.1145/2576768.2598240, 2014)
    CHRISTIE, L. A., MCCALL, J. A. W. and LONIE, D. P., 2014. Minimal walsh structure and ordinal linkage of monotonicity-invariant function classes on bit strings. In: Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation (GECCO '14). 12-16 July 2014. New York: ACM. pp. 333-340.
    Problem structure, or linkage, refers to the interaction between variables in a black-box fitness function. Discovering structure is a feature of a range of algorithms, including estimation of distribution algorithms (EDAs) ...
  • Multi-objective optimisation of cancer chemotherapy using evolutionary algorithms. 

    Petrovski, Andrei; McCall, John (Springer http://dx.doi.org/10.1007/3-540-44719-9, 2001)
    PETROVSKI, A. and MCCALL, J., 2001. Multi-objective optimisation of cancer chemotherapy using evolutionary algorithms. In: ZITZLEF, E., DEB, K., THIELE, L., COELLO, C. and CORNE, D. Evolutionary Multi-criterion Optimization : First International Conference, EMO 2001, Zurich, Switzerland, March 2001 : Proceedings. Berlin: Springer. pp. 531-545.
    The main objectives of cancer treatment in general, and of cancer chemotherapy in particular, are to eradicate the tumour and to prolong the patient survival time. Traditionally, treatments are optimised with only ...
  • Multi-objective particle swarm optimisation: methods and applications. 

    Al Moubayed, Noura (Robert Gordon University School of Computing Science and Digital Media, 2014-02)
    Solving real life optimisation problems is a challenging engineering venture. Since the early days of research on optimisation it was realised that many problems do not simply have one optimisation objective. This led to ...
  • Multivariate Markov networks for fitness modelling in an estimation of distribution algorithm. 

    Brownlee, Alexander Edward Ian (The Robert Gordon University School of Computing, 2009-05)
    A well-known paradigm for optimisation is the evolutionary algorithm (EA). An EA maintains a population of possible solutions to a problem which converges on a global optimum using biologically-inspired selection and ...
  • Partial structure learning by subset Walsh transform. 

    Christie, Lee A.; Lonie, David P.; McCall, John (IEEE http://dx.doi.org/10.1109/UKCI.2013.6651297, 2013)
    CHRISTIE, L. A., LONIE, D. P., and McCALL, J. A. W., 2013. Partial structure learning by subset Walsh transform. In: Proceedings of the 2013 UK Workshop on Computational Intelligence (UKCI), 2013. IEEE Press, pp. 128-135.
    Estimation of distribution algorithms (EDAs) use structure learning to build a statistical model of good solutions discovered so far, in an effort to discover better solutions. The non-zero coefficients of the Walsh ...
  • Problem dependent metaheuristic performance in Bayesian network structure learning. 

    Wu, Yanghui (Robert Gordon University School of Computing Science and Digital Media, 2012-09)
    Bayesian network (BN) structure learning from data has been an active research area in the machine learning field in recent decades. Much of the research has considered BN structure learning as an optimization problem. ...
  • The role of Walsh structure and ordinal linkage in the optimisation of pseudo-Boolean functions under monotonicity invariance. 

    Christie, Lee A. (Robert Gordon University Faculty of Design and Technology. School of Computing Science and Digital Media., 2016-02)
    CHRISTIE, L.A. 2016. The role of Walsh structure and ordinal linkage in the optimisation of pseudo-Boolean functions under monotonicity invariance. Robert Gordon University, PhD thesis.
    Optimisation heuristics rely on implicit or explicit assumptions about the structure of the black-box fitness function they optimise. A review of the literature shows that understanding of structure and linkage is helpful ...
  • A sequence-length sensitive approach to learning biological grammars using inductive logic programming. 

    Mamer, Thierry (Robert Gordon University School of Computing, 2011-01)
    This thesis aims to investigate if the ideas behind compression principles, such as the Minimum Description Length, can help us to improve the process of learning biological grammars from protein sequences using Inductive ...
  • Solving the ising spin glass problem using a bivariate RDA based on Markov random fields. 

    Shakya, Siddhartha; McCall, John; Brown, Deryck (IEEE http://dx.doi.org/10.1109/CEC.2006.1688408, 2006-07)
    SHAKYA, S., MCCALL, J. and BROWN, D., 2006. Solving the ising spin glass problem using a bivariate RDA based on Markov random fields. In: YEN, G., LUCAS, S., FOGEL, G., KENDALL, G., SALOMON, R., ZHANG, B.-T., COELLO, C. and RUNARSSON, T., eds. Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2006). 16-21 July 2006. New York: IEEE. pp. 908-915.
    Markov Random Field (MRF) modelling techniques have been recently proposed as a novel approach to probabilistic modelling for Estimation of Distribution Algorithms (EDAs). An EDA using this technique was called Distribution ...
  • Statistical optimisation and tuning of GA factors. 

    Petrovski, Andrei; Brownlee, Alexander Edward Ian; McCall, John (IEEE http://dx.doi.org/10.1109/CEC.2005.1554759, 2005-09)
    PETROVSKI, A., BROWNLEE, A. and MCCALL, J., 2005. Statistical optimisation and tuning of GA factors. In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2005), Volume 1. 2-5 September 2005. New York: IEEE. pp. 758-764.
    This paper presents a practical methodology of improving the efficiency of Genetic Algorithms through tuning the factors significantly affecting GA performance. This methodology is based on the methods of statistical ...
  • Structural coherence of problem and algorithm: an analysis for EDAs on all 2-bit and 3-bit problems. 

    Brownlee, Alexander Edward Ian; McCall, John; Christie, Lee A. (IEEE http://dx.doi.org/10.1109/CEC.2015.7257139, 2015-05)
    BROWNLEE, A. E. I., MCCALL, J. A. W. and CHRISTIE, L. A., 2015. Structural coherence of problem and algorithm: an analysis for EDAs on all 2-bit and 3-bit problems. In: 2015 IEEE Congress on Evolutionary Computation (CEC): Proceedings. 25-28 May 2015. Piscataway, NJ: IEEE. Pp. 2066-2073.
    Metaheuristics assume some kind of coherence between decision and objective spaces. Estimation of Distribution algorithms approach this by constructing an explicit probabilistic model of high fitness solutions, the ...