메뉴 건너뛰기




Volumn 36, Issue 2 PART 2, 2009, Pages 2677-2690

Efficient mining of sequential patterns with time constraints: Reducing the combinations

Author keywords

Levelwise algorithms; Sequential patterns; Time constraints

Indexed keywords

DATABASE SYSTEMS; FLEXIBLE AC TRANSMISSION SYSTEMS;

EID: 56749180709     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2008.01.021     Document Type: Article
Times cited : (44)

References (21)
  • 1
    • 0027621699 scopus 로고    scopus 로고
    • Agrawal, R., Imielinski, T., & Swami, A. (1993). Mining association rules between sets of items in large databases. In Proceedings of the 1993 ACM SIGMOD conference (pp. 207-216).
    • Agrawal, R., Imielinski, T., & Swami, A. (1993). Mining association rules between sets of items in large databases. In Proceedings of the 1993 ACM SIGMOD conference (pp. 207-216).
  • 2
    • 0029212693 scopus 로고    scopus 로고
    • Agrawal, R., & Srikant, R. (1995). Mining sequential patterns. In Proceedings of the 11th international conference on data engineering (ICDE'95).
    • Agrawal, R., & Srikant, R. (1995). Mining sequential patterns. In Proceedings of the 11th international conference on data engineering (ICDE'95).
  • 3
    • 56749146897 scopus 로고    scopus 로고
    • Ayres, J., Gehrke, J. E., Yiu, T., & Flannick, J. (2002). Sequential pattern mining using bitmaps. In Proceedings of the eighth ACM SIGKDD international conference on knowledge discovery and data mining.
    • Ayres, J., Gehrke, J. E., Yiu, T., & Flannick, J. (2002). Sequential pattern mining using bitmaps. In Proceedings of the eighth ACM SIGKDD international conference on knowledge discovery and data mining.
  • 5
    • 33751026482 scopus 로고    scopus 로고
    • Giannotti, F., Nanni, M., Pedreschi, D., & Pinelli, F. (2006). Mining sequences with temporal annotations. In Proceedings of the 2006 ACM symposium on applied computing (SAC 06) (pp. 593-597).
    • Giannotti, F., Nanni, M., Pedreschi, D., & Pinelli, F. (2006). Mining sequences with temporal annotations. In Proceedings of the 2006 ACM symposium on applied computing (SAC 06) (pp. 593-597).
  • 6
    • 0034593066 scopus 로고    scopus 로고
    • Han, J., Pei, J., Mortazavi-asl, B., Chen, Q., Dayal, U., & Hsu, M. (2000). FreeSpan: Frequent pattern-projected sequential pattern mining. In Proceedings of the sixth international conference on knowledge discovery and data mining (KDD 00) (pp. 355-359).
    • Han, J., Pei, J., Mortazavi-asl, B., Chen, Q., Dayal, U., & Hsu, M. (2000). FreeSpan: Frequent pattern-projected sequential pattern mining. In Proceedings of the sixth international conference on knowledge discovery and data mining (KDD 00) (pp. 355-359).
  • 7
    • 56749146893 scopus 로고    scopus 로고
    • Kum, H., Pei, J., Wang, W., & Duncan, D. (2003). ApproxMAP: Approximate mining of consensus sequential patterns. In Proceedings of SIAM international conference on data mining.
    • Kum, H., Pei, J., Wang, W., & Duncan, D. (2003). ApproxMAP: Approximate mining of consensus sequential patterns. In Proceedings of SIAM international conference on data mining.
  • 8
    • 9444298518 scopus 로고    scopus 로고
    • Leleu, M., Rigotti, C., Boulicaut, J. F., & Euvrard, G. (2003). Constraint-based mining of sequential patterns over datasets with consecutive repetitions. In Proceedings of the seventh European conference on principles and practice of knowledge discovery in databases (PKDD 03) (pp. 303-314).
    • Leleu, M., Rigotti, C., Boulicaut, J. F., & Euvrard, G. (2003). Constraint-based mining of sequential patterns over datasets with consecutive repetitions. In Proceedings of the seventh European conference on principles and practice of knowledge discovery in databases (PKDD 03) (pp. 303-314).
  • 9
    • 56749122720 scopus 로고    scopus 로고
    • Lin, M. -Y., Hsueh, S. -C., & Chang, C. -W. (2006). Mining closed sequential patterns with time constraints. In Proceedings of workshop on software engineering, databases, and knowledge discovery, international computer symposium 2006.
    • Lin, M. -Y., Hsueh, S. -C., & Chang, C. -W. (2006). Mining closed sequential patterns with time constraints. In Proceedings of workshop on software engineering, databases, and knowledge discovery, international computer symposium 2006.
  • 10
    • 23844526866 scopus 로고    scopus 로고
    • Efficient mining of sequential patterns with time constraints by delimited pattern growth
    • Lin M.-Y., and Lee S.-Y. Efficient mining of sequential patterns with time constraints by delimited pattern growth. Knowledge and Information Systems 7 4 (2005) 499-514
    • (2005) Knowledge and Information Systems , vol.7 , Issue.4 , pp. 499-514
    • Lin, M.-Y.1    Lee, S.-Y.2
  • 11
    • 84947770983 scopus 로고    scopus 로고
    • Masseglia, F., Cathala, F., & Poncelet, P. (1998). The PSP approach for mining sequential patterns. In Proceedings of the second European symposium on principles of data mining and knowledge discovery (PKDD'98), LNAI (Vol. 1510, pp. 176-184).
    • Masseglia, F., Cathala, F., & Poncelet, P. (1998). The PSP approach for mining sequential patterns. In Proceedings of the second European symposium on principles of data mining and knowledge discovery (PKDD'98), LNAI (Vol. 1510, pp. 176-184).
  • 12
    • 5644272932 scopus 로고    scopus 로고
    • Masseglia, F., Poncelet, P., & Teisseire, M. (2004). Pre-processing time constraints for efficiently mining generalized sequential patterns. In Proceedings of the 11th international symposium on temporal representation and reasoning (TIME 04) (pp. 87-95).
    • Masseglia, F., Poncelet, P., & Teisseire, M. (2004). Pre-processing time constraints for efficiently mining generalized sequential patterns. In Proceedings of the 11th international symposium on temporal representation and reasoning (TIME 04) (pp. 87-95).
  • 13
    • 2442455696 scopus 로고    scopus 로고
    • Orlando, S., Perego, R., & Silvestri, C. (2004). A new algorithm for gap constrained sequence mining. In Proceedings of the ACM symposium on applied computing (SAC 04) (pp. 540-547).
    • Orlando, S., Perego, R., & Silvestri, C. (2004). A new algorithm for gap constrained sequence mining. In Proceedings of the ACM symposium on applied computing (SAC 04) (pp. 540-547).
  • 14
    • 0035016443 scopus 로고    scopus 로고
    • Pei, J., Han, J., Mortazavi-Asl, B., Pinto, H., Chen, Q., Dayal, U., & Hsu, M. C. (2001). PrefixSpan: Mining sequential patterns efficiently by prefix-projected pattern growth. In 17th International conference on data engineering (ICDE).
    • Pei, J., Han, J., Mortazavi-Asl, B., Pinto, H., Chen, Q., Dayal, U., & Hsu, M. C. (2001). PrefixSpan: Mining sequential patterns efficiently by prefix-projected pattern growth. In 17th International conference on data engineering (ICDE).
  • 15
    • 2442588422 scopus 로고    scopus 로고
    • Seno, M., & Karypis, G. (2002). SLPMiner: An algorithm for finding frequent sequential patterns using length-decreasing support constraint. In Proceedings of the IEEE international conference on data mining (ICDM 02) (pp. 481-425).
    • Seno, M., & Karypis, G. (2002). SLPMiner: An algorithm for finding frequent sequential patterns using length-decreasing support constraint. In Proceedings of the IEEE international conference on data mining (ICDM 02) (pp. 481-425).
  • 16
    • 56749149019 scopus 로고    scopus 로고
    • Srikant, R., & Agrawal, R. (1995). Mining generalized association rules. In Proceedings of the 21st international conference on very large databases (VLDB'95) (pp. 407-419).
    • Srikant, R., & Agrawal, R. (1995). Mining generalized association rules. In Proceedings of the 21st international conference on very large databases (VLDB'95) (pp. 407-419).
  • 17
    • 84897708583 scopus 로고    scopus 로고
    • Srikant, R., & Agrawal, R. (1996). Mining sequential patterns: Generalizations and performance improvements. In Proceedings of the fifth international conference on extending database technology (EDBT'96) (pp. 3-17).
    • Srikant, R., & Agrawal, R. (1996). Mining sequential patterns: Generalizations and performance improvements. In Proceedings of the fifth international conference on extending database technology (EDBT'96) (pp. 3-17).
  • 18
    • 2442446148 scopus 로고    scopus 로고
    • Wang, J., & Han, J. (2004). BIDE: Efficient mining of frequent closed sequences. In Proceedings of the international conference on data engineering (ICDE'04).
    • Wang, J., & Han, J. (2004). BIDE: Efficient mining of frequent closed sequences. In Proceedings of the international conference on data engineering (ICDE'04).
  • 19
    • 56749118553 scopus 로고    scopus 로고
    • Wojciechowski, M., Morzy, T., & Zakrzewicz, M. (2002). Efficient constraint-based sequential pattern mining using dataset filtering techniques. In Proceedings of the Baltic conference (BalticDB & IS 2002) (pp. 213-224).
    • Wojciechowski, M., Morzy, T., & Zakrzewicz, M. (2002). Efficient constraint-based sequential pattern mining using dataset filtering techniques. In Proceedings of the Baltic conference (BalticDB & IS 2002) (pp. 213-224).
  • 20
    • 0034826102 scopus 로고    scopus 로고
    • SPADE: An efficient algorithm for mining frequent sequences
    • Zaki M.J. SPADE: An efficient algorithm for mining frequent sequences. Machine Learning Journal 42 1 (2001) 31-60
    • (2001) Machine Learning Journal , vol.42 , Issue.1 , pp. 31-60
    • Zaki, M.J.1
  • 21
    • 56749141440 scopus 로고    scopus 로고
    • Zaki, M. J. (2000). Sequence mining in categorical domains: Incorporating constraints. In Proceedings of the 9th international conference on information and knowledge management (CIKM 00) (pp. 422-429).
    • Zaki, M. J. (2000). Sequence mining in categorical domains: Incorporating constraints. In Proceedings of the 9th international conference on information and knowledge management (CIKM 00) (pp. 422-429).


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