Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Andrew R. Mitchell

dblp:49/88 · DBLP profile ↗
← Back
10ranked-venue papers
4as first author
0since 2021 · last 2000
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 7 · 1 first-authorArtificial intelligence and machine learning · 3 · 3 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Kernel, tree and ensemble methods · 57% Learning theory · 43%
Theoretical computer science
1 paper
Automata and formal languages · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Kernel, tree and ensemble methods › ensemble learning
boosting
0.012000
"Boosting'' a Positive-Data-Only Learner · ICML 2000
Machine learning › Learning theory
inductive inference
0.011998
Learnability of a Subclass of Extended Pattern Languages · COLT 1998
Automata and formal languages › language learning
language identification
0.011998
Learnability of a Subclass of Extended Pattern Languages · COLT 1998
Automata and formal languages › formal language classes
pattern languages
0.011998
Learnability of a Subclass of Extended Pattern Languages · COLT 1998

Methods — techniques the papers use, named apart from their topics

combinatorial argument · 0.0positive-unlabeled learning · 0.0boosting · 0.0
YearPublicationVenuePosition
2000 "Boosting'' a Positive-Data-Only Learner
Andrew R. Mitchell
ICML1
1999 The VC-Dimension of Subclasses of Pattern
Andrew R. Mitchell, Tobias Scheffer, Arun Sharma 0001, Frank Stephan 0001
ALT1
1998 Learnability of a Subclass of Extended Pattern Languages
abstract
Angluin introduced the class of pattern languages as term languages over strings on a finite alphabet, and showed that the class is identifiable in the limit from texts (positive data).III Angluin's definition of pattern languages, erasing substitutions are disallowed.Extended pattern languages are term languages over strings when erasing substitutions are allowed.The question of identifiability in the limit of extended pattern languages from texts has not been resolved, and is one of the outstanding open problems in inductive inference.However, there are at least two subclasses that are known to be identifiable.Shinohara has shown that the the class of extended pattern languages that can be generated by regulx patterns (these are patterns in which each variable occurs no more than once) is identifiable in the limit from texts.Wright showed that the class of extended pattern languages where the pattern contains at most m distinct variables, for any positive integer rn, is identifiable in the limit from texts.The present paper considers a generalisation of regular patterns where each variable occurring in the pattern occurs exactly rn times for some positive integer m.Such patterns arc referred to as quasi-regular patterns, and for each m, the corresponding class of extended pattern languages is denoted QRP,, .It is shown that for each m, the class QRP,, is identifiable in the limit from texts.The proof employs a sophisticated combinatorial argument for bounding the search space.It is also shown that the class U,QRP, is identifiable in the limit from texts.Pcnnission to n&r digital or hard copies of all or part of this work for personal or classroom USC is granted without fee provided that copies are not made or distributed for prolit or con~tnercial advantage and that copies bear this notice and the full citation on thZ first p"ge.-fo copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or SI fw.
Andrew R. Mitchell
COLT1
1971 Alternating Direction Methods for Parabolic Equations in Three Space Dimensions with Mixed Derivatives
abstract
An alternating direction implicit (ADI) method which requires the solution of three tridiagonal sets of equations at each time step is suggested for solving the general parabolic equation with variable coefficients in three space dimensions. A sufficient condition for stability is proved in the pure initial value case. Other existing finite difference schemes are mentioned and numerical results are presented.
S. McKee, Andrew R. Mitchell
Comput. J.2
1970 Alternating Direction Methods for Parabolic Equations in Two Space Dimensions with a Mixed Derivative
abstract
An alternating direction implicit (A.D.I.) method, which requires the solution of two tridiagonal sets of equations at each time step, is derived for solving a parabolic equation with variable coefficients in two space dimensions with a mixed derivative. The method is shown to be unconditionally stable for two semi-infinite ranges of an auxiliary parameter. Other existing finite difference schemes are mentioned and numerical results are presented.
S. McKee, Andrew R. Mitchell
Comput. J.2
1966 Some Computational Results of an Improved A.D.I. Method for the Dirichlet Problem
abstract
The alternating direction implicit (A.D.I.) method of the present authors (Mitchell and Fairweather, 1964) is modified and used to solve the nine-point Laplace difference equation in a square. The greater accuracy of the method, h4 as compared with h2 for the Peaceman–Rachford method, where h is the mesh size, is achieved with no appreciable increase in time or effort. The new A.D.I. method is then combined with the Schwarz Alternating Procedure to solve the nine-point difference equation in non-rectangular regions with sides parallel to the co-ordinate axes. Special attention is given to the re-entrant L-shaped region.
Graeme Fairweather, Andrew R. Mitchell
Comput. J.2
1966 On the Instability of the Crank Nicholson Formula Under Derivative Boundary Conditions
abstract
Finite-difference solutions are considered for the heat conduction equation in one space dimension subject to general boundary conditions involving linear combinations of the function and its space derivative. It is shown that under such conditions, instability can often arise even although “stable” formulae of the Crank Nicholson type are used. In particular, the persistent error discussed by Parker and Crank (1964) is shown to be a weak case of this more serious instability.
P. Keast, Andrew R. Mitchell
Comput. J.2
1964 A generalized alternating direction method of Douglas-Rachford type for solving the biharmonic equation
abstract
Alternating direction methods of Douglas-Rachford type are considered as a means of solving the biharmonic equation. The family of methods obtained contains the Conte-Dames formula as a special case.
Graeme Fairweather, Andrew R. Mitchell
Comput. J.2
1963 The use of higher derivatives in quadrature formulae
abstract
Some new high accuracy quadrature formulae involving derivatives of the integrand are derived and compared with existing formulae.
J. D. Lambert, Andrew R. Mitchell
Comput. J.2
1962 High Accuracy Difference Formulae for the Numerical Solution of the Heat Conduction Equation
abstract
A method is given for generating systematically difference replacements of the heat condúction equation of any desired order of truncation error. The method is then used to obtain explicit and implicit formulae of high accuracy.
Andrew R. Mitchell, R. P. Pearce
Comput. J.1