Computing substitution matrices for genomic comparative analysis (2009)
Duc Cao, Minh, Dix, Trevor I., Allison, Lloyd
Substitution matrices describe the rates of mutating one character in a biological sequence to another character, and are important for many knowledge discovery tasks such as phylogenetic analysis...
Computing substitution matrices for genomic comparative analysis (2009)
Duc Cao, Minh, Dix, Trevor I., Allison, Lloyd
Substitution matrices describe the rates of mutating one character in a biological sequence to another character, and are important for many knowledge discovery tasks such as phylogenetic analysis...
K.B.: Learning hybrid Bayesian networks by MML (2008)
Rodney T. O’donnell, Lloyd Allison, Kevin B. Korb
Abstract. We use a Markov Chain Monte Carlo (MCMC) MML algorithm to learn hybrid Bayesian networks from observational data. Hybrid networks represent local structure, using conditional probability...
A Statement on Higher Education Policy in (2008)
Summary Policy on higher education in Australia has become highly political since the massive expansion which occurred under the prime ministership of Bob Hawke in the 1980's. We believe that...
Causal KL: Evaluating Causal Discovery (2008)
Rodney T. O’donnell, Kevin B. Korb, Lloyd Allison
The two most commonly used criteria for assessing causal model discovery with artificial data are edit-distance and Kullback-Leibler divergence, measured from the true model to the learned model....
A Simple Statistical Algorithm for Biological Sequence Compression (2008)
Minh Duc, Cao Trevor, I. Dix, Lloyd Allison, Chris Mears
This paper introduces a novel algorithm for biological sequence compression that makes use of both statistical properties and repetition within sequences. A panel of experts is maintained to estimate...
CIRCULAR CLUSTERING BY MINIMUM MESSAGE LENGTH OF PROTEIN DIHEDRAL ANGLES (2008)
David L. Dowe, Lloyd Allison, Lawrence Hunter, Chris S. Wallace, Timothy Edgoose
Early work on proteins identified the existence of helices and extended sheets in protein secondary structures, a high-level classification which remains popular today. Using the Snob program for...
Generator and Search Objects in Java (2007)
COMPUTER SCIENCE Generator classes are defined in the object oriented programming language Java by using continuation-style programming. Generator objects are used to write Prolog-like programs in...
Bayesian Posterior Comprehension via Message from Monte Carlo (2007)
Leigh J. Fitzgibbon, David L. Dowe, Lloyd Allison
We discuss the problem of producing an epitome, or brief summary, of a Bayesian posterior distribution- and then investigate a general solution based on the Minimum Message Length (MML) principle....
Probability Model Type Sufficiency (2007)
Leigh J. Fitzgibbon, Lloyd Allison, Joshua W. Comley
Abstract. We investigate the role of sufficient statistics in generalized probabilistic data mining and machine learning software frameworks. Some issues involved in the specification of a...
The specication of various kinds of statistical model from machine learning and data mining is examined formally using the type and class system of the functional programming language Haskell as a...
Dix, Trevor I, Powell, David R, Allison, Lloyd, Bernal, Julie, Jaeger, Samira, Stern, Linda
Abstract Background Features of a DNA sequence can be found by compressing the sequence under a suitable model; good compression implies low information content. Good DNA compression models consider...
Segmentation and clustering as complementary sources of information (2007)
Dale, Michael Bodley, Allison, Lloyd, Dale, Patricia Ellen
This paper examines the effects of using a segmentation method to identify change-points or edges in vegetation. It identifies coherence (spatial or temporal) in place of unconstrained clustering....
Segmentation and clustering as complementary sources of information (2007)
Dale, Michael Bodley, Allison, Lloyd, Dale, Patricia Ellen
This paper examines the effects of using a segmentation method to identify change-points or edges in vegetation. It identifies coherence (spatial or temporal) in place of unconstrained clustering....
Segmentation and clustering as complementary sources of information (2007)
Dale, Michael Bodley, Allison, Lloyd, Dale, Patricia Ellen
This paper examines the effects of using a segmentation method to identify change-points or edges in vegetation. It identifies coherence (spatial or temporal) in place of unconstrained clustering....
Haskell Communities and Activities Report (2007)
Andres Löh (ed, Lloyd Allison, Tiago Miguel, Laureano Alves, Krasimir Angelov, Carlos Areces, ...
You are reading the twelfth edition of the Haskell Communities and Activities Report – as always, containing entries from enthusiastic Haskellers all over the world. This edition has 138 entries,...
* Corresponding authors (2007)
Bmc Bioinformatics, Trevor I Dix, David R Powell, Lloyd Allison, Julie Bernal, Samira Jaeger, ...
Comparative analysis of long DNA sequences by per element information content using different contexts
Segmentation and clustering as complementary sources of information (2007)
Dale, Michael Bodley, Allison, Lloyd, Dale, Patricia Ellen
This paper examines the effects of using a segmentation method to identify change-points or edges in vegetation. It identifies coherence (spatial or temporal) in place of unconstrained clustering....
Haskell Communities and Activities Report (2006)
Andres Löh (ed, Lloyd Allison, Tiago Miguel, Laureano Alves, Krasimir Angelov, Dmitry Astapov, ...
Welcome to the eleventh edition of the Haskell Communities and Activities Report – a collection of entries about everything that is going on and related to Haskell in some way that appears twice a...
Haskell Communities and Activities Report (2006)
Andres Löh (ed, Lloyd Allison, Tiago Miguel, Laureano Alves, Krasimir Angelov, Dmitry Astapov, ...
This is the tenth edition of the Haskell Communities and Activities Report (HCAR) – a collection of entries about everything that is going on and related to Haskell in some way that appears twice a...
Haskell Communities and Activities Report (2005)
Andres Löh (ed, Lloyd Allison, Tiago Miguel, Laureano Alves, Krasimir Angelov, Alistair Bayley, ...
Finally, here is the 9th edition of the Haskell Communities and Activities Report (HCAR), almost three weeks after the submission deadline. This delay is entirely my own fault. In fact, I have to...
Haskell Communities and Activities Report (2005)
Andres Löh (ed, Perry Alexander, Lloyd Allison, Tiago Miguel, Laureano Alves, Krasimir Angelov, ...
You are reading the 8th edition of the Haskell Communities and Activities Report (HCAR). These are interesting times to be a Haskell enthusiast. Everyone seems to be talking about darcs ( → 6.3)...
Haskell Communities and Activities Report (2004)
Andres Löh (ed, Perry Alexander, Lloyd Allison, Krasimir Angelov, Alistair Bayley, Jérémy Bobbio, ...
Welcome to the Seventh edition of the Haskell Communities and Activities report. I can proudly announce that the report has survived yet another change of editor, and chances are good that this...
Finding Approximate Palindromes in Strings Quickly and Simply. (2004)
Lloyd Allison School, Lloyd Allison
Described are two algorithms to find long approximate palindromes in a string, for example a DNA sequence. A simple algorithm requires O(n)- space and almost always runs in O(k.n)-time where n is the...
Types and Classes of Machine Learning and Data Mining (2003)
The notion of a statistical model, as inferred and used in statistics, machine learning and data mining, is examined from a semantic point of view. Data types and type-classes for models are...
Types and Classes of Machine Learning and Data Mining (2003)
lloyd at bruce cs monash edu au
MML Inference of Single-Layer Neural Networks (2003)
Enes Makalic, Lloyd Allison, David L. Dowe
The architecture selection problem is of great importance when designing neural networks. A network that is too simple does not learn the problem sufficiently well. Conversely, a larger than...
Longest biased interval and longest non-negative sum interval (2003)
Summary: Described is an algorithm to find the longest interval having at least a specified minimum bias in a sequence of characters (bases, amino acids), e.g. ‘at least 0.95 (A+T)-rich’. It is...
Univariate Polynomial Inference by Monte Carlo Message Length Approximation (2002)
Leigh J. Fitzgibbon, David L. Dowe, Lloyd Allison
We apply the Message from Monte Carlo (MMC) algorithm to inference of univariate polynomials. MMC is an algorithm for point estimation from a Bayesian posterior sample. It partitions the posterior...
L.: Change-point estimation using new minimum message length approximations (2002)
Leigh J. Fitzgibbon, David L. Dowe, Lloyd Allison
Abstract. This paper investigates the coding of change-points in the information-theoretic Minimum Message Length (MML) framework. Changepoint coding regions affect model selection and parameter...
A smarter computer controlled model car (2002)
Brian W. Grasby, Supervisors Dr, Lloyd Allison, Dr. Ronald Pose
2 Research context 4
3.1 Fully Autonomous Vehicles................... 5 (2002)
Supervisors Dr, Lloyd Allison, Dr. Ronald Pose
This Literature Review presents the theoretical background to autonomous navigation, in particular computer controlled cars, outlining the work done in the fields applicable to the project, the...
Discovering Patterns In Plasmodium Falciparum genomic DNA (2001)
Linda Stern, Lloyd Allison, Ross Coppel, Trevor Dix
A method has been developed for discovering patterns in DNA sequences. Loosely based on the well-known Lempel Ziv model for text compression, the model detects repeated sequences in DNA. The repeats...
Minimum message length grouping of ordered data (2000)
Leigh J. Fitzgibbon, Lloyd Allison, David L. Dowe
Abstract. Explicit segmentation is the partitioning of data into homogeneous regions by specifying cut-points. W. D. Fisher (1958) gave an early example of explicit segmentation based on the...
Minimum message length grouping of ordered data (2000)
Leigh J. Fitzgibbon, Lloyd Allison, David L. Dowe
1 Introduction Grouping is defined as the partitioning, or explicit segmentation, of a set of data into homogeneous groups that can be explained by some stochastic model [8]. Constraints can be...
Alignment of low information sequences (1998)
David R. Powell, Lloyd Allison, Trevor I. Dix, David L. Dowe
Discovering simple DNA sequences by compression (1998)
David Powell, Davd Dowe, David L. Dowe, Lloyd Allison, Trevor Dix
An information-theoretic DNA compression scheme devised by Milosavljevic and Jurka #1993# has been used in many places in the literature for both the discovery of new genes and the compression of...
Discovering simple DNA sequences by compression (1998)
David Powell David, David L. Dowe, Lloyd Allison, Trevor I. Dix
An information-theoretic DNA compression scheme devised by Milosavljevic and Jurka #1993# has been used in many places in the literature for both the discovery of new genes and the compression of...
Circular Clustering Of Protein Dihedral Angles By Minimum Message Length (1996)
David L. Dowe, Lloyd Allison, Trevor I. Dix, Lawrence Hunter, Chris S. Wallace, Timothy Edgoose
this paper is given in [DADH95] and is available from ftp://www.cs.monash.edu.au/www/publications/1995/TR237.ps.Z.) Section 2introduces the MML principle and how it can be used for this circular...
Restriction site mapping for three or more enzymes (1990)
Ho, Shirley T. S., Allison, Lloyd, Yee, Chut N.
Restriction site mapping requires a generator to put forward possible maps and a constraint checker to reject false maps. Ideally these combine to give an algorithm which calculates a sound and...