Knowl Inf Syst DOI 10.1007/s10115-009-0252-9 REGULAR PAPER

Knowl Inf Syst DOI 10.1007/s10115-009-0252-9 REGULAR PAPER

Cached

Download Links

[www.cs.sfu.ca]

by Elsa Loekito , James Bailey , Jian Pei , E. Loekito , J. Pei

BibTeX

@MISC{Loekito_knowlinf,
    author = {Elsa Loekito and James Bailey and Jian Pei and E. Loekito and J. Pei},
    title = {Knowl Inf Syst DOI 10.1007/s10115-009-0252-9 REGULAR PAPER},
    year = {}
}

Bookmark

OpenURL

Abstract

binary decision diagram based approach for mining frequent subsequences

Citations

883	Mining frequent patterns without candidate generation - Han, Pei, et al.
447	Mining sequential patterns: Generalizations and performance improvements - Srikanth, Agrawal - 1996
117	Zero-suppressed BDDs for set manipulation in combinatorial problems - Minato - 1993
103	CloSpan: Mining closed sequential patterns in large datasets - Yan, Han, et al. - 2003
91	Verification of arithmetic circuits with binary moment diagrams - Bryant, Chen - 1995
79	Bide: Efficient mining of frequent closed sequences - Wang, Han - 2004
65	Mining sequential patterns by pattern-growth: the PrefixSpan approach - Pei - 2004
52	The psp approach for mining sequential patterns - Masseglia, Cathala, et al. - 1998
45	W.: Mining sequential patterns with constraints in large databases - Pei, Han, et al. - 2002
39	Efficient analysis and manipulation of OBDDs can be extended to FBDDs - Meinel - 1994
28	TSP: Mining top-k closed sequential patterns - Tzvetkov, Yan, et al. - 2005
22	Zero-suppressed BDDs and Their Applications - Minato - 2001
13	Graph-Based Algorithms for Boolean Function Manipulation - RE - 1986
13	Fast mining of high dimensional expressive contrast patterns using zero-suppressed binary decision diagrams - Loekito, Bailey - 2006
12	Y (2005) Mining web log sequential patterns with position coded pre-order linked WAPtree - CI, Lu
7	DNA sequence classification via an expectation maximization algorithm and neural networks: a case study - Ma, Wang, et al. - 2001
5	Finding simple disjoint decompositions in frequent itemset data using Zero-suppressed BDD - Minato - 2005
4	SPADE: an efficient algorithm for mining frequent sequences. Mach Learn 42(1–2): 31–60 123 Loekito et al. Author Biographies Elsa Loekito received her Bachelor of Computer Science (Hons) and PhD degree in Computer Science from the University of Melbourne, - MJ - 2001
3	Efficient mining of sequential patterns with time constraints by delimited pattern growth - Lin, Lee - 2005
2	PLWAP sequential mining: open source code - Ezeife, Lu
2	Are zero-suppressed binary decision diagrams good for mining frequent patterns in high dimensional datasets - Loekito, Bailey - 2007
2	Symbolic reasoning with weighted and normalized decision diagrams - Ossowski, Baier - 2006
2	Quantitative Fault Tree Analysis using Binary Decision Diagrams - Sinnamon, Andrews - 1996
2	Frequent subsequence-based protein localization - Zaïane, Wang, et al. - 2006
1	Mneimneh MN, Sakallah K (2002) ZBDD-based backtrack search SAT solver. In: International workshop on logic synthesis - FA
1	Searching subsequences. Theor Comput Sci 78(2):363–376 - RA - 1991
1	Tsipouras MG, Papaloukas C, Fotiadis DI (2008) An optimized sequential pattern matching methodology for sequence classification. Knowl Inform Syst (KAIS) 19:249–264 - TP
1	AP (2005) Protein sequence classification through relevant sequences and bayes classifiers - Ferreira, Azevedo
1	Y-K, Dubey P (2005) Cache-conscious frequent pattern mining on a modern processor - Ghoting, Buehrer, et al.
1	Shinohara A, Takeda M, Arikawa S (2000) A practical algorithm to find the best subsequence patterns - Hirao, Hoshino
1	Synthetic data generation code for association rules and sequential patterns. Intelligent information systems, IBM almaden research center. http://www.almaden.ibm.com/software/quest/resources - IBM - 2006
1	Dong G (2007) Mining minimal distinguishing subsequence patterns with gap constraints. Knowl Inform Syst (KAIS - Ji, Bailey
1	Zeugmann T (2007) N-gram analysis based on Zero-suppressed BDDs. In: New frontiers in artificial intelligence. Lecture notes in computer science, vol 4384 - Kurai, Minato
1	Chung SM (2008) A scalable algorithm for mining maximal frequent sequences using a sample. Knowl Inform Syst (KAIS) 15(2):149–179 123 binary decision diagram based approach for mining frequent subsequences - Luo
1	Arimura H (2005) Combinatorial item set analysis based on Zero-suppressed BDDs - Minato
1	Arimura H (2006) Frequent pattern mining and knowledge indexing based on Zero-suppressed BDDs. In: The 5th international workshop on knowledge discovery in inductive databases (KDID’06), pp 83–94 - Minato
1	Boulicaut J-F (2006) Looking for monotonicity properties of a similarity constraint on sequences - Mitasiunaite
1	Entrez, the life sciences search engine. http://www.ncbi.nlm.nih.gov/sites/entrez - NCBI
1	Mortazavi-asl B, Zhu H (2000) Mining access patterns efficiently from web logs, In: PAKDD’00: proceedings of the 2000 Pacific-Asia conference on knowledge discovery and data mining, pp 396–407 - Pei, Han
1	FSL (2003) Frequent-subsequence-based prediction of outer membrane proteins - She, Chen, et al.
1	is an Associate Professor and the Director of Collaborative Research and Industry Relations in the School of Computing Science at Simon Fraser University, which he joined in 2004. From 2002 to 2004, he was an Assistant Professor at the State University of - Pei - 1993