DELISP: Efficient discovery of generalized sequential patterns by delimited pattern-growth technology

DOI10.1007/3-540-47887-6_19MaRDI QIDQ4739191zbMATH OpenFDO

Authors Ming-Yen Lin, Suh-Yin Lee, Sheng-Shun Wang

Publication date 12 August 2004

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/2336/23360198.htm

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2222605
• Generalization of pattern-growth methods for sequential pattern mining with gap constraints

Cited in

(6)

• scientific article; zbMATH DE number 2089468 (Why is no real title available?)
• Processing Sequential Patterns in Relational Databases
• Accuracy of generalized context patterns in the context based sequential patterns mining
• Discovering exclusive patterns in frequent sequences
• NWP-miner: nonoverlapping weak-gap sequential pattern mining
• 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: DELISP: Efficient discovery of generalized sequential patterns by delimited pattern-growth technology

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