Machine learning research has, to a great extent, ignored an important aspect of many real world applications: time. Existing concept learners predominantly operate on a static set of attributes; for example, classifying flowers described by leaf size, petal colour and petal count. The values of these attributes is assumed to be unchanging-- the flower never grows or loses leaves. However, many real datasets are not "static"; they cannot sensibly be represented as a fixed set of attributes. Rather, the examples are expressed as features that vary temporally, and it is the temporal variation itself that is used for classification. Consider a simple gesture recognition domain, in which the temporal features are the position of the hands, finger bends, and so on. Looking at the position of the hand at one point in time is not likely to lead to a successful classification; it is only by analysing changes in position that recognition is possible. This thesis presents a new technique for temporal classification. By extracting
|
2489
|
Induction of Decision Trees
– Quinlan
- 1986
|
|
2138
|
UCI Repository of Machine Learning Databases
– Blake, Merz
- 1998
|
|
1705
|
Maintaining knowledge about temporal intervals
– Allen
- 1983
|
|
1486
|
Fuzzy sets
– Zadeh
- 1965
|
|
1453
|
Bagging predictors
– Breiman
- 1996
|
|
1117
|
Data Mining Practical Machine Learning Tools and Techniques
– IH, Frank
- 2005
|
|
922
|
Wavelet Tour on Signal Processing
– Mallat
- 1999
|
|
843
|
Efficient induction of logic programs
– Muggleton, Feng
- 1990
|
|
747
|
Learning logical definitions from relations
– Quinlan
- 1990
|
|
545
|
An introduction to hidden markov models
– Rabiner, Juang
- 1986
|
|
503
|
Codes capable of correcting deletions, insertions and reversals
– Levenshtein
- 1966
|
|
490
|
Irrelevant features and the subset selection problem
– John, Kohavi
- 1994
|
|
486
|
Inverse entailment and Progol
– Muggleton
- 1995
|
|
418
|
Multi-interval discretization of continuous-valued attributes for classification learning
– Fayyad, Irani
- 1993
|
|
356
|
An empirical comparison of voting classification algorithms: Bagging, boosting and variants
– Bauer, Kohavi
- 1999
|
|
339
|
Bayesian Classification (AutoClass): Theory and Results
– Cheeseman, Stutz
- 1996
|
|
273
|
Parallel distributed processing: Explorations in the microstructure of cognition: Vol. 1. Foundations
– Rumelhart, McClelland
- 1986
|
|
265
|
A brief introduction to boosting
– Schapire
- 1999
|
|
234
|
Rough Sets
– Pawlak, Grzymala-Busse, et al.
|
|
232
|
Visual Recognition of American Sign Language Using Hidden Markov Models
– Starner, Pentland
- 1994
|
|
210
|
An information measure for classification
– Wallace, Boulton
- 1968
|
|
209
|
The Fourier Transform and its Applications
– BRACEWELL
- 1978
|
|
169
|
Syntactic Pattern Recognition and Applications
– Fu
- 1982
|
|
130
|
Locally Adaptive Dimensionality Reduction for Indexing Large Time Series Databases
– Keogh, Chakrabarti, et al.
- 2001
|
|
102
|
Learning the structure of dynamic probabilistic networks
– Friedman, Murphy, et al.
- 1998
|
|
101
|
An enhanced representation of time series which allows fast and accurate classification, clustering and relevance feedback
– Keogh, Pazzani
- 1998
|
|
86
|
Knowledge-based temporal abstraction in clinical domains
– Shahar, MA
- 1996
|
|
81
|
Speech recognition with dynamic bayesian networks
– Zweig, Russell
- 1998
|
|
64
|
A philosophical basis for knowledge acquisition
– Compton, Jansen
- 1990
|
|
64
|
The alternating decision tree learning algorithm
– Freund, Mason
- 1999
|
|
64
|
Extraction of rules from discrete-time recurrent neural networks. Neural Networks
– Omlin, Giles
- 1996
|
|
61
|
Local Feature Extraction and Its Application Using a Library of Bases
– Saito
- 1994
|
|
59
|
The truth will come to light: Directions and challenges in extracting the knowledge embedded within trained artificial neural networks
– Tickle, Andrews, et al.
- 1998
|
|
47
|
Gesture recognition using recurrent neural networks
– Marakami, Taguchi
- 1991
|
|
43
|
Machine Learning: An Artificial Intelligence Approach
– Michalski, Carbonell, et al.
- 1983
|
|
39
|
Neural Networks for Speech and Sequence Recognition
– Bengio
- 1996
|
|
38
|
Learning comprehensible descriptions of multivariate time series
– KADOUS
- 1999
|
|
38
|
Scaling up dynamic time warping to massive datasets
– Keogh, Pazzani
- 1999
|
|
34
|
A variable span smoother
– Friedman
- 1984
|
|
32
|
Concepts from time series
– Rosentein, Cohen
- 1998
|
|
28
|
Pattern extraction for time series classification
– Geurts
- 2001
|
|
28
|
Bias in information-based measures in decision tree induction
– White, Liu
- 1994
|
|
27
|
The ISOLET spoken letter database
– Cole, Muthusamy, et al.
|
|
27
|
L.R.: A comparative study of several dynamic timewarping algorithms for connected word recognition
– Myers, Rabiner
- 1981
|
|
27
|
Inkeri Verkamo. Discovering frequent episodes in sequences
– Mannila, Toivonen, et al.
- 1995
|
|
27
|
Intrinsic classification by MML - the Snob Program
– Wallace, Dowe
- 1994
|
|
24
|
A method for clustering the experiences of a mobile robot that accords with human judgements
– Oates, Schmill, et al.
- 2000
|
|
21
|
Extracting hidden context
– Harries, Sammut, et al.
- 1998
|
|
19
|
Learning qualitative models of dynamic systems
– Hau, Coiera
- 1997
|
|
17
|
Heikki Mannila, Gopal Renganathan, and Padhraic Smyth. Rule Discovery from time series
– Das, Lin
- 1998
|
