Dr Leonard Trigg |
|---|
| Personal details |
|---|
| Full name | Leonard E Trigg |
| Birthdate | 3 March 1971 |
| Citizenship | New Zealand |
| Marital status | Married, with one georgous baby girl |
| Contact details |
|---|
| 24 Riverlea Rd Hamilton New Zealand |
| +64 21 624 595 |
| trigg@cs.waikato.ac.nz |
| Present position |
|---|
| Postdoctoral Fellow |
| Present employer |
|---|
| Department of Computer Science, University of Waikato. |
| Academic qualifications |
|---|
| 1997 | Ph.D. | Computer Science, University of Waikato |
| 1991 | B.C.M.S. Hons (first class) | Computer Science, University of Waikato |
| Honours/distinctions |
|---|
| 1992-95 | University of Waikato Postgraduate Scholarship |
| 1992 | Second place, South Pacific Programming Competition |
| Professional experience |
|---|
| 1998-99 | Postdoctoral Fellow | Machine Learning group University of Waikato |
| 1997-98 | Research Assistant | Machine Learning group University of Waikato |
| 1993-97 | Teaching Assistant | Department of Computer Science University of Waikato |
| 1992-93 | Deputy Warden | University House Halls of Residence University of Waikato |
| 1991-92 | Residential Assistant | Orchard Park Halls of Residence University of Waikato |
| 1988-91 | Programmer | Operations Technology New Zealand Steel |
| Teaching experience |
|---|
| Foundations of Computer Science | Lab assistant and grading |
| Foundations of Computer Science | Tutorials of 20 stdents |
| Introduction to Programming | Lab assistant and grading |
| The Computing Experience | Lab assistant and grading |
| Communications course | Grading |
| Research interests |
|---|
| Machine learning | My
thesis focused on the design of similarity functions, primarily for
use within machine learning paradigms as instance-based learning and
case-based reasoning. The approach taken in my thesis was to interpret
similarity as the likelihood of transforming between two
objects. Drawing from ideas such as Kolmogorov complexity and the
Solomonoff-Levin universal prior from algorithmic complexity, my K*
similarity function defines similarity as the probability of all
possible transformation paths between two objects, where
transformation paths are composed of smaller basic
transformations. The notion of distance is then the transformation
complexity. This approach to similarity yields more robust similarity
functions than other methods, as well as making domain customisation
simpler and more principled. As part of my thesis I implemented an
instance-based learner utilising the K* similarity measure, and
contributed this learner to the freely available Weka machine learning
workbench. After my thesis, I became more involved with the machine learning project. Problems maintaining the portability of the original Weka workbench led to the decision in late 1997 to implement a new machine learning workbench entirely in Java. Over the last two years I have been responsible for managing the development of the Java workbench, written primarily by myself and two others. I have implemented machine learning schemes from instance-based learners, naive-Bayesian learners, and decision tree learners, to recent meta-schemes such as AdaBoost and Logitboost that improve the predictions of a base learner. To facilitate experimental evaluation of machine learning schemes, I developed an experiment architecture that permits experiments to be distributed over multiple machines, with results submitted to a central database where they may be combined and re-used for similar future experiments. The architecture incorporates dependencies and scheme versioning. As well as participating in the development of the workbench, I interacted with research groups in horticultural and agricultural research institutes. These projects ranged from investigating the use of machine learning for objective grading of mushrooms, to the development of software sensors for process control. |
| Compression | Compression is closely related to machine learning and pattern recognition, as many modern compression systems form predictive models of streams of data. I am interested in compression-based evaluation of machine learning scheme performance. I have written implementations of PPM, and a progressive image-compression algorithm utilising a nearest-neighbor learning scheme. I served as referee for the IEEE Data Compression Conference in 1997 and 1999. |
| Years as a practising researcher: 7 |
|---|
| Publications |
|---|
| Trigg, L.E. (1992) "Case-based reasoning in weather prediction: retrieving similar cases from a case memory" Proc New Zealand Computer Science Research Students Conference, Hamilton, New Zealand, 257-262. | Cleary, J.G. and Trigg, L.E. (1995) "K*: An instance-based learner using an entropic distance measure" Proc International Conference on Machine Learning, Tahoe City, CA, USA, 108-114. |
| Cleary, J.G. and Trigg, L.E. (1995) "K*: An instance-based learner using an entropic distance measure" Proc New Zealand Computer Science Research Students Conference, Hamilton, New Zealand, 39-46. |
| Trigg, L.E. (1997) "Designing similarity functions" DPhil dissertation, University of Waikato, October. |
| Cleary, J.G. and Trigg, L.E. (1998) "Experiences with a weighted decision tree learner" Working Paper 98/10, University of Waikato. |
| Trigg, L.E. (1998) "An entropy gain measure of numeric prediction performance" Working Paper 98/11, University of Waikato. |
| Frank, E, Trigg, L.E., Holmes, G., and Witten, I.H. (1998) "Naive Bayes for regression" Working Paper 98/15, University of Waikato. |
| Kusabs, N., Bollen, F., Trigg, L.E., Holmes, G., and Inglis, S. (1998) "Objective measurement of mushroom quality" Proc New Zealand Institute of Agricultural Science and the New Zealand Society for Horticultural Science Annual Convention, Hawke's Bay, New Zealand, 51. |
| Holmes, G. and Trigg, L.E. (1999) "A diagnostic tool for tree-based supervised classification learning algorithms" Working Paper 99/3, University of Waikato. |
| Witten, I.H., Frank, E., Trigg, L.E., Hall, M., Holmes, G., and Cunningham, S.J. (1999) "Weka: Practical machine learning tools and techniques with Java implementations" Working Paper 99/11, University of Waikato. |
| Frank, E, Trigg, L.E., Holmes, G., and Witten, I.H. (2000?) "Naive Bayes for regression" to appear in Machine Learning. |
| Computer skills |
|---|
| I am fluent in Java, C, C++ and Unix shell scripting. I am also experienced with (in order of increasing rustiness), Pascal (& Modula 2), LISP, Prolog, BASIC, 68000 assembly. I have used the source code control systems RCS and CVS, and the development environment Visual C++, although most development has been Emacs-based. I am experienced with Unix, and at home with Windows and MacOS. I enjoy the challenge of programming competitions, which demand excellent team work as well as raw programming ability. As a veteran of programming competitions, my teams have consistently been placed first and second at the New Zealand competition, and placed second at the South Pacific competition in 1992. |
| Other qualifications |
|---|
| Drivers licence (car/motorcycle), NAUI Openwater 1 scuba diving training, amateur radio certificates to grade II. |
| Hobbies/interests |
|---|
| Squash, soccer, hockey, scuba diving, tramping, carnivorous plants, tropical fish, aquatic plants, sci-fi, motorcycling. |
| trigg@cs.waikato.ac.nz |