Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

42

ACSC
2002
IEEE

favoriteEmaildiscussreport

110views Theoretical Computer Science» more ACSC 2002»

Using Finite State Automata for Sequence Mining

14 years 9 months ago

Using Finite State Automata for Sequence Mining

Download crpit.com

We show how frequently occurring sequential patterns may be found from large datasets by first inducing a finite state automaton model describing the data, and then querying the model.

Philip Hingston

Real-time Traffic

ACSC 2002 | Large Datasets | Sequential Patterns | State Automaton Model | Theoretical Computer Science |

claim paper

Related Content

» Person Name Identification in Chinese Documents Using Finite State Automata

» Sequence Mining Automata A New Technique for Mining Frequent Sequences under Regular Expre...

» Finite state automata and monadic definability of singular cardinals

» Pattern Classification In Symbolic Streams via Semantic Annihilation of Information

» Learning Finite Automata Using Local Distinguishing Experiments

» Inferring Finite Automata with Stochastic Output Functions and an Application to Map Learn...

» A more bioplausible approach to the evolutionary inference of finite state machines

» Optimal Lower Bounds on Regular Expression Size Using Communication Complexity

» LaFA lookahead finite automata for scalable regular expression detection

Post Info
More Details (n/a)

Added	14 Jul 2010
Updated	14 Jul 2010
Type	Conference
Year	2002
Where	ACSC
Authors	Philip Hingston

Comments (0)