Fast discovery of sequential patterns in large databases using effective time-indexing

DOI10.1016/j.ins.2008.07.012zbMath1231.68123OpenAlexW2043483308MaRDI QIDQ955236

Ming-Yen Lin, Chia-Wen Chang, Sue-Chen Hsueh

Publication date: 19 November 2008

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2008.07.012

zbMATH Keywords

sequential patternstime constraintpattern-growthsequence miningtime-index

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Related Items (1)

A near-optimal database allocation for reducing the average waiting time in the grid computing environment

Uses Software

• SPADE
• PrefixSpan
• BIDE

Cites Work

• Interactive sequence discovery by incremental mining
• Efficient strategies for tough aggregate constraint-based sequential pattern mining
• SPADE: An efficient algorithm for mining frequent sequences

This page was built for publication: Fast discovery of sequential patterns in large databases using effective time-indexing