Chris Wallace
Australian computer scientist
Chris Wallace 's AcademicInfluence.com Rankings
Download Badge
Computer Science
Why Is Chris Wallace Influential?
(Suggest an Edit or Addition)According to Wikipedia, Christopher Stewart Wallace was an Australian computer scientist and physicist. Wallace is notable for having devised:The minimum message length principle — an information-theoretic principle in statistics, econometrics, machine learning, inductive inference and knowledge discovery which can be seen both as a mathematical formalisation of Occam's Razor and as an invariant Bayesian method of model selection and point estimation,The Wallace tree form of binary multiplier ,a variety of random number generators,a theory in physics and philosophy that entropy is not the arrow of time,a refrigeration system ,hardware for detecting and counting cosmic rays,design of computer operating systems,the notion of universality probability in mathematical logic,and a vast range of other works - see, e.g., and its Foreword re C. S. Wallace , pp 523-560.He was appointed Foundation Chair of Information Science at Monash University in 1968 at the age of 34 , and Professor Emeritus in 1996. Wallace was a fellow of the Australian Computer Society and in 1995 he was appointed a fellow of the ACM "For research in a number of areas in Computer Science including fast multiplication algorithm, minimum message length principle and its applications, random number generation, computer architecture, numerical solution of ODE's, and contribution to Australian Computer Science."
Chris Wallace 's Published Works
Published Works
- An Information Measure for Classification (1968) (1116)
- Estimation and Inference by Compact Coding (1987) (601)
- Minimum Message Length and Kolmogorov Complexity (1999) (391)
- Statistical and Inductive Inference by Minimum Message Length (Information Science and Statistics) (2005) (250)
- MML clustering of multi-state, Poisson, von Mises circular and Gaussian distributions (2000) (183)
- Coding Decision Trees (1993) (160)
- Unsupervised Learning Using MML (1996) (158)
- The Melbourne Family Grief Study, I: Perceptions of family functioning in bereavement. (1996) (138)
- Intrinsic classification by MML - the Snob program (1994) (116)
- A Password-Capability System (1986) (113)
- Causal Discovery via MML (1996) (101)
- Classification by Minimum-Message-Length Inference (1991) (95)
- A General Selection Criterion for Inductive Inference (1984) (84)
- Fast pseudorandom generators for normal and exponential variates (1996) (81)
- Learning Linear Causal Models by MML Sampling (1999) (69)
- A Program for Numerical Classification (1970) (64)
- Constructing a Minimal Diagnostic Decision Tree (1993) (60)
- Intrinsic Classification of Spatially Correlated Data (1998) (58)
- Minimum Message Length Segmentation (1998) (56)
- An Information Measure for Hierarchic Classification (1973) (53)
- The information content of a multistate distribution. (1969) (49)
- MML mixture modelling of multi-state, Poisson, von Mises circular and Gaussian distributions (1997) (48)
- A Study of Causal Discovery With Weak Links and Small Samples (1997) (46)
- Finite-state models in the alignment of macromolecules (1992) (46)
- Bayesian Estimation of the Von Mises Concentration Parameter (1996) (43)
- In Search of the Philosopher's Stone: Remarks on Humphreys and Freedman's Critique of Causal Discovery (1997) (40)
- Refinements of MDL and MML Coding (1999) (40)
- Single-factor analysis by minimum message length estimation (1992) (39)
- MML Estimation of the Parameters of the Sherical Fisher Distribution (1996) (36)
- The Complexity of Strict Minimum Message Length Inference (2002) (33)
- Circular clustering of protein dihedral angles by Minimum Message Length. (1996) (32)
- Point Estimation Using the Kullback-Leibler Loss Function and MML (1998) (31)
- Resolving the Neyman-Scott problem by minimum message length (1997) (26)
- The posterior probability distribution of alignments and its application to parameter estimation of evolutionary trees and to optimization of multiple alignments (1994) (26)
- Archaeoastronomy in the Old World: STONE CIRCLE GEOMETRIES: AN INFORMATION THEORY APPROACH (1982) (25)
- An Information Measure for Single Link Classification (1975) (24)
- Occupancy of a Rectangular Array (1973) (24)
- Physically random generator (1990) (23)
- Minimum message length encoding, evolutionary trees and multiple-alignment (1992) (23)
- Learning Bayesian Networks with Restricted Causal Interactions (1999) (22)
- Transformed Rejection Generators for Gamma and Normal Pseudo-Random Variables (1976) (21)
- A note on the comparison of polynomial selection methods (1999) (19)
- Finding Cutpoints in Noisy Binary Sequences - A Revised Empirical Evaluation (1999) (18)
- Hierarchical Clusters of Vegetation Types. (2005) (16)
- Charging in a Secure Environment (1990) (14)
- General Linear Multistep Methods To Solve Ordinary Differential Equations (1973) (14)
- A decision graph explanation of protein secondary structure prediction (1993) (13)
- Some Comments on the Implementation of Capabilities (1988) (13)
- The Transformed Rejection Method for Generating Poisson Random Variables (2007) (9)
- Some new multistep methods for solving ordinary differential equations (1975) (7)
- A new step-size changing technique for multistep methods (1979) (6)
- The discovery of causal models with small samples (1996) (6)
- A Microprogrammed Lexical Processor (1971) (5)
- TTL-compatible Multiport Bus (1985) (5)
- Sampling of Highly Correlated Data for Polynomial Regression and Model Discovery (2001) (5)
- Minimum Message Length Criterion for Second-Order Polynomial Model Selection Applied to Tropical Cyclone Intensity Forecasting (2003) (4)
- Competition for memory access in the KDF9 (1967) (4)
- Correlated round-off errors in digital integrating differential analyzers (1964) (3)
- Bayesian Networks with Non-Interacting Causes (1999) (3)
- Algorithmic and combinatorial problems in strict minimum message length inference (1997) (3)
- Resource Charging in Ad-hoc Networks by Password Capabilities (2003) (3)
- An Optimal Approach to Mining Boolean Functions from Noisy Data (2003) (2)
- A Cheap Graphic Input Device (1968) (1)
- Point Estimation using the Kullback-Leibler Loss Function and Minimum Message Length (1998) (1)
- Minimum Description Length (1999) (1)
- Computing Research in Australia (1977) (1)
- BAYESIAN ESTIMATION OF THE VON MISES CONCENTRATIONPARAMETERDavid (2007) (1)
- A grafted multi-access network (1968) (1)
- A Simple Graphic I/O Device (1970) (1)
This paper list is powered by the following services:
Other Resources About Chris Wallace
What Schools Are Affiliated With Chris Wallace ?
Chris Wallace is affiliated with the following schools: