메뉴 건너뛰기




Volumn 1, Issue , 2009, Pages 180-186

Mining frequent patterns with gaps and one-off condition

Author keywords

[No Author keywords available]

Indexed keywords

APRIORI; BIOLOGICAL SCIENCE; FREQUENT PATTERNS; MINING PROCESS;

EID: 70749158863     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSE.2009.160     Document Type: Conference Paper
Times cited : (12)

References (15)
  • 3
    • 0005106921 scopus 로고
    • Mining sequential patterns: Generalizations and performance improvements
    • IBM Almaden Research Center, San Jose, California, December
    • R. Srikant, R. Agrawal. Mining Sequential Patterns: Generalizations and Performance Improvements. Research Report RJ9994, IBM Almaden Research Center, San Jose, California, December 1995.
    • (1995) Research Report RJ9994
    • Srikant, R.1    Agrawal, R.2
  • 5
    • 0035016443 scopus 로고    scopus 로고
    • PrefixSpan: Mining sequential patterns efficiently by prefix-projected pattern growth
    • Heidelberg, Germany, April
    • J. Pei, J. Han, B. Mortazavi-AslQ. Chen, U. Dayal, and M.C. Hsu, PrefixSpan: Mining sequential patterns efficiently by prefix-projected pattern growth. In ICDE'01, Heidelberg, Germany, April 2001.
    • (2001) ICDE'01
    • Pei, J.1    Han, J.2    Mortazavi-Asl, B.3    Chen, Q.4    Dayal, U.5    Hsu, M.C.6
  • 6
    • 29944442006 scopus 로고    scopus 로고
    • Mining periodic patterns with gap requirement from sequences
    • M. Zhang, B. Kao, D. Cheung, and K. Yip. Mining periodic patterns with gap requirement from sequences. In: SIGMOD 2005, 2005.
    • (2005) SIGMOD 2005
    • Zhang, M.1    Kao, B.2    Cheung, D.3    Yip, K.4
  • 9
    • 34147163612 scopus 로고    scopus 로고
    • Mining minimal distinguishing subsequence patterns with gap constraints
    • Nov
    • X. Ji, J. Bailey, and G. Dong. Mining minimal distinguishing subsequence patterns with gap constraints. In Proc. of the 5th ICDM, pages 194-201, Nov 2005.
    • (2005) Proc. of the 5th ICDM , pp. 194-201
    • Ji, X.1    Bailey, J.2    Dong, G.3
  • 10
    • 67649646374 scopus 로고    scopus 로고
    • Efficient mining of closed repetitive gapped subsequences from a sequence database
    • B Ding, D Lo, J Han, SC Khoo. Efficient Mining of Closed Repetitive Gapped Subsequences from a Sequence Database. ICDE 09, 2009.
    • (2009) ICDE 09
    • Ding, B.1    Lo, D.2    Han, J.3    Khoo, S.C.4
  • 13
    • 0031684427 scopus 로고    scopus 로고
    • Combinatorial pattern discovery in biological sequences: The TEIRESIAS algorithm
    • Isidore Rigoutsos and Aris Floratos. Combinatorial pattern discovery in biological sequences: the TEIRESIAS algorithm. Bioinformatics, 14(1), 1998.
    • (1998) Bioinformatics , vol.14 , Issue.1
    • Rigoutsos, I.1    Floratos, A.2
  • 14
    • 33750560216 scopus 로고    scopus 로고
    • Efficient string matching with wildcards and length constraints
    • G. Chen, X. Wu, X. Zhu, A. Arslan, and Y. He. Efficient string matching with wildcards and length constraints. Knowledge and Information Systems, 10(4):399-419, 2006.
    • (2006) Knowledge and Information Systems , vol.10 , Issue.4 , pp. 399-419
    • Chen, G.1    Wu, X.2    Zhu, X.3    Arslan, A.4    He, Y.5
  • 15
    • 70749124351 scopus 로고    scopus 로고
    • http://www.ncbi.nlm.nih.gov.


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.