메뉴 건너뛰기




Volumn , Issue , 2009, Pages 1024-1035

Efficient mining of closed repetitive gapped subsequences from a sequence database

Author keywords

[No Author keywords available]

Indexed keywords

CLOSED PATTERN; DATA SETS; MINING ALGORITHMS; PERFORMANCE STUDY; PROGRAM EXECUTION; PROTEIN SEQUENCES; SEQUENCE DATA; SEQUENCE DATABASE; SEQUENTIAL PATTERN MINING PROBLEM; SUPPORT THRESHOLD;

EID: 67649646374     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2009.104     Document Type: Conference Paper
Times cited : (118)

References (21)
  • 1
    • 0029212693 scopus 로고
    • Mining sequential patterns
    • R. Agrawal and R. Srikant, "Mining sequential patterns," in ICDE, 1995.
    • (1995) ICDE
    • Agrawal, R.1    Srikant, R.2
  • 2
    • 27144468394 scopus 로고    scopus 로고
    • Discovery of frequent episodes in event sequences
    • H. Mannila, H. Toivonen, and A. I. Verkamo, "Discovery of frequent episodes in event sequences," Data Min. Knowl. Discov., vol. 1, no. 3, pp. 259-289, 1997.
    • (1997) Data Min. Knowl. Discov , vol.1 , Issue.3 , pp. 259-289
    • Mannila, H.1    Toivonen, H.2    Verkamo, A.I.3
  • 3
    • 0035016443 scopus 로고    scopus 로고
    • Prefixspan: Mining sequential patterns efficiently by prefixprojected pattern growth
    • J. Pei, J. Han, B. Mortazavi-Asl, H. Pinto, Q. Chen, U. Dayal, and M.- C. Hsu, "Prefixspan: Mining sequential patterns efficiently by prefixprojected pattern growth," in ICDE, 2001.
    • (2001) ICDE
    • Pei, J.1    Han, J.2    Mortazavi-Asl, B.3    Pinto, H.4    Chen, Q.5    Dayal, U.6    Hsu, M.C.7
  • 4
    • 0242456805 scopus 로고    scopus 로고
    • M. El-Ramly, E. Stroulia, and P. Sorenson, From run-time behavior to usage scenarios: an interaction-pattern mining approach, in KDD, 2002.
    • M. El-Ramly, E. Stroulia, and P. Sorenson, "From run-time behavior to usage scenarios: an interaction-pattern mining approach," in KDD, 2002.
  • 5
    • 67649663791 scopus 로고    scopus 로고
    • X. Yan, J. Han, and R. Afhar, CloSpan: Mining closed sequential patterns in large datasets, in SDM, 2003.
    • X. Yan, J. Han, and R. Afhar, "CloSpan: Mining closed sequential patterns in large datasets," in SDM, 2003.
  • 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) SIGMOD
    • Zhang, M.1    Kao, B.2    Cheung, D.3    Yip, K.4
  • 7
    • 36849095568 scopus 로고    scopus 로고
    • D. Lo, S.-C. Khoo, and C. Liu, Efficient mining of iterative patterns for software specification discovery, in KDD, 2007.
    • D. Lo, S.-C. Khoo, and C. Liu, "Efficient mining of iterative patterns for software specification discovery," in KDD, 2007.
  • 8
    • 0002221136 scopus 로고
    • Fast algorithms for mining association rules
    • R. Agrawal and R. Srikant, "Fast algorithms for mining association rules," in VLDB, 1994.
    • (1994) VLDB
    • Agrawal, R.1    Srikant, R.2
  • 10
    • 34547367487 scopus 로고    scopus 로고
    • SMArTIC: Toward building an accurate, robust and scalable specification miner
    • D. Lo and S.-C. Khoo, "SMArTIC: Toward building an accurate, robust and scalable specification miner," in SIGSOFT FSE, 2006.
    • (2006) SIGSOFT FSE
    • Lo, D.1    Khoo, S.-C.2
  • 11
    • 49949117821 scopus 로고    scopus 로고
    • D. Lo, S. Maoz, and S.-C. Khoo, Mining modal scenario-based specifications from execution traces of reactive systems, in ASE, 2007.
    • D. Lo, S. Maoz, and S.-C. Khoo, "Mining modal scenario-based specifications from execution traces of reactive systems," in ASE, 2007.
  • 12
    • 0036983315 scopus 로고    scopus 로고
    • Automatic extraction of object oriented component interfaces
    • J. Whaley, M. Martin, and M. Lam, "Automatic extraction of object oriented component interfaces," in ISSTA, 2002.
    • (2002) ISSTA
    • Whaley, J.1    Martin, M.2    Lam, M.3
  • 13
    • 51149108945 scopus 로고    scopus 로고
    • Dynamic protocol recovery
    • J. Quante and R. Koschke, "Dynamic protocol recovery," in WCRE, 2007.
    • (2007) WCRE
    • Quante, J.1    Koschke, R.2
  • 14
    • 67649392630 scopus 로고    scopus 로고
    • Mining temporal rules from program execution traces
    • D. Lo, S.-C. Khoo, and C. Liu, "Mining temporal rules from program execution traces," in PCODA, 2007.
    • (2007) PCODA
    • Lo, D.1    Khoo, S.-C.2    Liu, C.3
  • 15
    • 67649647479 scopus 로고    scopus 로고
    • Efficient mining of recurrent rules from a sequence database
    • -, "Efficient mining of recurrent rules from a sequence database," in DASFAA, 2008.
    • (2008) DASFAA
  • 16
    • 33745196010 scopus 로고    scopus 로고
    • Tool-assisted unit-test generation and selection based on operational abstractions
    • T. Xie and D. Notkin, "Tool-assisted unit-test generation and selection based on operational abstractions," Autom. Softw. Eng., vol. 13, no. 3, pp. 345-371, 2006.
    • (2006) Autom. Softw. Eng , vol.13 , Issue.3 , pp. 345-371
    • Xie, T.1    Notkin, D.2
  • 17
    • 32344452883 scopus 로고    scopus 로고
    • PR-miner: Automatically extracting implicit programming rules and detecting violations in large software code
    • Z. Li and Y. Zhou, "PR-miner: Automatically extracting implicit programming rules and detecting violations in large software code," in SIGSOFT FSE, 2005.
    • (2005) SIGSOFT FSE
    • Li, Z.1    Zhou, Y.2
  • 18
    • 0242540443 scopus 로고    scopus 로고
    • J. Ayres, J. Flannick, J. Gehrke, and T. Yiu, Sequential pattern mining using a bitmap representation, in KDD, 2002.
    • J. Ayres, J. Flannick, J. Gehrke, and T. Yiu, "Sequential pattern mining using a bitmap representation," in KDD, 2002.
  • 19
    • 2442446148 scopus 로고    scopus 로고
    • BIDE: Efficient mining of frequent closed sequences
    • J. Wang and J. Han, "BIDE: Efficient mining of frequent closed sequences," in ICDE, 2004.
    • (2004) ICDE
    • Wang, J.1    Han, J.2
  • 20
    • 36849088200 scopus 로고    scopus 로고
    • Discovering unbounded episodes in sequential data
    • G. Garriga, "Discovering unbounded episodes in sequential data," in PKDD, 2003.
    • (2003) PKDD
    • Garriga, G.1
  • 21
    • 0000746072 scopus 로고
    • On the complexity of iterated shuffle
    • M. K. Warmuth and D. Haussler, "On the complexity of iterated shuffle," J. Comput. Syst. Sci., vol. 28, no. 3, pp. 345-358, 1984.
    • (1984) J. Comput. Syst. Sci , vol.28 , Issue.3 , pp. 345-358
    • Warmuth, M.K.1    Haussler, D.2


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