Fast discovery of sequential patterns by memory indexing

DOI10.1007/3-540-46145-0_15MaRDI QIDQ4410533zbMATH OpenFDO

Authors Ming-Yen Lin, Suh-Yin Lee

Publication date 3 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2454/24540150.htm

Mathematics Subject Classification ID

Database theory (68P15) Information storage and retrieval of data (68P20) Computing methodologies and applications (68U99)

Recommendations

• Fast discovery of sequential patterns in large databases using effective time-indexing
• SPADE: An efficient algorithm for mining frequent sequences
• Mining sequential patterns across time sequences
• Indexing and mining of the local patterns in sequence database
• A mining algorithm for fast maximal sequential patterns

Cited in

(6)

• Scanning multiple sequences via cache memory
• Quickest Search and Learning Over Correlated Sequences: Theory and Application
• How to improve efficiency of analysis of sequential data?
• \texttt{TIRPCLo}: efficient and complete mining of time intervals-related patterns
• Mining sequential patterns across time sequences
• Fast discovery of sequential patterns in large databases using effective time-indexing

Describes a project that uses

Uses Software

• SPADE

This page was built for publication: Fast discovery of sequential patterns by memory indexing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4410533)