A binary decision diagram based approach for mining frequent subsequences
- 17 September 2009
- journal article
- Published by Springer Nature in Knowledge and Information Systems
- Vol. 24 (2) , 235-268
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- An optimized sequential pattern matching methodology for sequence classificationKnowledge and Information Systems, 2008
- PLWAP sequential mining2005
- Mining Web Log Sequential Patterns with Position Coded Pre-Order Linked WAP-TreeData Mining and Knowledge Discovery, 2005
- Protein Sequence Classification Through Relevant Sequence Mining and Bayes Classifiers2005
- Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree ApproachData Mining and Knowledge Discovery, 2004
- A Practical Algorithm to Find the Best Subsequence PatternsLecture Notes in Computer Science, 2000
- Verification of arithmetic circuits with binary moment diagrams1995
- Efficient Boolean manipulation with OBDD's can be extended to FBDD'sIEEE Transactions on Computers, 1994
- Searching subsequencesTheoretical Computer Science, 1991
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986