메뉴 건너뛰기




Volumn 178, Issue 22, 2008, Pages 4228-4245

Fast discovery of sequential patterns in large databases using effective time-indexing

Author keywords

Pattern growth; Sequence mining; Sequential patterns; Time constraint; Time index

Indexed keywords

GALLIUM ALLOYS; INDEXING (OF INFORMATION); MINING; PLANNING; STRATEGIC PLANNING;

EID: 51349163865     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2008.07.012     Document Type: Article
Times cited : (21)

References (29)
  • 1
    • 0029212693 scopus 로고    scopus 로고
    • R. Agrawal, R. Srikant, Mining sequential patterns, in: Proceedings of the 11th International Conference on Data Engineering, Taipei, Taiwan, 1995, pp. 3-14.
    • R. Agrawal, R. Srikant, Mining sequential patterns, in: Proceedings of the 11th International Conference on Data Engineering, Taipei, Taiwan, 1995, pp. 3-14.
  • 2
    • 51349159829 scopus 로고    scopus 로고
    • C. Antunes, A.L. Oliveira, Sequential patterns mining algorithms: trade-off between speed and memory, in: Proceedings of the 2nd International Workshop on Mining Graphs, Trees and Sequences (MGTS 2004), Pisa, Italy, 2004.
    • C. Antunes, A.L. Oliveira, Sequential patterns mining algorithms: trade-off between speed and memory, in: Proceedings of the 2nd International Workshop on Mining Graphs, Trees and Sequences (MGTS 2004), Pisa, Italy, 2004.
  • 3
    • 0242540443 scopus 로고    scopus 로고
    • J. Ayres, J. Flannick, J. Gehrke, T. Yiu, Sequential pattern mining using a bitmap representation, in: Proceedings of the 8th International Conference on Knowledge Discovery and Data Mining, 2002, pp. 429-435.
    • J. Ayres, J. Flannick, J. Gehrke, T. Yiu, Sequential pattern mining using a bitmap representation, in: Proceedings of the 8th International Conference on Knowledge Discovery and Data Mining, 2002, pp. 429-435.
  • 4
    • 0141921659 scopus 로고    scopus 로고
    • Discovering time-interval sequential patterns in sequence databases
    • Chen Y.L., Chiang M.C., and Kao M.T. Discovering time-interval sequential patterns in sequence databases. Expert Systems with Applications 25 3 (2003) 343-354
    • (2003) Expert Systems with Applications , vol.25 , Issue.3 , pp. 343-354
    • Chen, Y.L.1    Chiang, M.C.2    Kao, M.T.3
  • 6
    • 26844513291 scopus 로고    scopus 로고
    • A general effective framework for monotony and tough constraint based sequential pattern mining
    • Chen E., Li T., and Shey P.C.-Y. A general effective framework for monotony and tough constraint based sequential pattern mining. Lecture Notes in Computer Science 3589 (2005) 458-467
    • (2005) Lecture Notes in Computer Science , vol.3589 , pp. 458-467
    • Chen, E.1    Li, T.2    Shey, P.C.-Y.3
  • 7
    • 38349081558 scopus 로고    scopus 로고
    • Efficient strategies for tough aggregate constraint-based sequential pattern mining
    • Chen E., Cao H., Li Q., and Qian T. Efficient strategies for tough aggregate constraint-based sequential pattern mining. Information Sciences 178 6 (2008) 1498-1518
    • (2008) Information Sciences , vol.178 , Issue.6 , pp. 1498-1518
    • Chen, E.1    Cao, H.2    Li, Q.3    Qian, T.4
  • 8
    • 2442458706 scopus 로고    scopus 로고
    • D.Y. Chiu, Y.H. Wu, A.L.P. Chen, An efficient algorithm for mining frequent sequences by a new strategy without support counting, in: Proceedings of the 20th International Conference on Data Engineering, 2004, pp. 375-386.
    • D.Y. Chiu, Y.H. Wu, A.L.P. Chen, An efficient algorithm for mining frequent sequences by a new strategy without support counting, in: Proceedings of the 20th International Conference on Data Engineering, 2004, pp. 375-386.
  • 9
    • 32344453032 scopus 로고    scopus 로고
    • S. Cong, J. Han, D.A. Padua, Parallel mining of closed sequential patterns, in: Proceedings of the 11th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Chicago, IL, USA, August 2005, pp. 562-567.
    • S. Cong, J. Han, D.A. Padua, Parallel mining of closed sequential patterns, in: Proceedings of the 11th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Chicago, IL, USA, August 2005, pp. 562-567.
  • 10
    • 47349113988 scopus 로고    scopus 로고
    • C. Fiot, A. Laurent, M. Teisseire, Extended time constraints for sequence mining, in: Proceedings of the 14th International Symposium on Temporal Representation and Reasoning (TIME'07), 2007, pp. 105-116.
    • C. Fiot, A. Laurent, M. Teisseire, Extended time constraints for sequence mining, in: Proceedings of the 14th International Symposium on Temporal Representation and Reasoning (TIME'07), 2007, pp. 105-116.
  • 12
    • 24044460806 scopus 로고    scopus 로고
    • Efficient algorithms for mining and incremental update of maximal frequent sequences
    • Kao B., Zhang M., Yip C.L., Cheung D.W., and Fayyad U.M. Efficient algorithms for mining and incremental update of maximal frequent sequences. Data Mining and Knowledge Discovery 10 2 (2005) 87-116
    • (2005) Data Mining and Knowledge Discovery , vol.10 , Issue.2 , pp. 87-116
    • Kao, B.1    Zhang, M.2    Yip, C.L.3    Cheung, D.W.4    Fayyad, U.M.5
  • 14
    • 35748979448 scopus 로고    scopus 로고
    • Privacy preserving data mining of sequential patterns for network traffic data
    • Kim S.-W., Park S., Won J.-I., and Kim S.-W. Privacy preserving data mining of sequential patterns for network traffic data. Information Sciences 178 3 (2008) 694-713
    • (2008) Information Sciences , vol.178 , Issue.3 , pp. 694-713
    • Kim, S.-W.1    Park, S.2    Won, J.-I.3    Kim, S.-W.4
  • 15
    • 33846009469 scopus 로고    scopus 로고
    • Benchmarking the effectiveness of sequential pattern mining methods
    • Kum H.-C., Chang J.H., and Wang W. Benchmarking the effectiveness of sequential pattern mining methods. Data and Knowledge Engineering 60 1 (2007) 30-50
    • (2007) Data and Knowledge Engineering , vol.60 , Issue.1 , pp. 30-50
    • Kum, H.-C.1    Chang, J.H.2    Wang, W.3
  • 16
    • 12744252835 scopus 로고    scopus 로고
    • Fast discovery of sequential patterns through memory indexing and database partitioning
    • Lin M.Y., and Lee S.Y. Fast discovery of sequential patterns through memory indexing and database partitioning. Journal of Information Science and Engineering 21 1 (2005) 109-128
    • (2005) Journal of Information Science and Engineering , vol.21 , Issue.1 , pp. 109-128
    • Lin, M.Y.1    Lee, S.Y.2
  • 17
    • 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
  • 18
    • 5144226703 scopus 로고    scopus 로고
    • Interactive sequence discovery by incremental mining
    • Lin M.Y., and Lee S.Y. Interactive sequence discovery by incremental mining. Information Sciences 165 3-4 (2004) 187-205
    • (2004) Information Sciences , vol.165 , Issue.3-4 , pp. 187-205
    • Lin, M.Y.1    Lee, S.Y.2
  • 19
    • 84947770983 scopus 로고    scopus 로고
    • F. Masseglia, F. Cathala, P. Poncelet, The PSP approach for mining sequential patterns, in: Proceedings of the 2nd European Symposium on Principles of Data Mining and Knowledge Discovery, Nantes, France, 1998, pp. 176-184.
    • F. Masseglia, F. Cathala, P. Poncelet, The PSP approach for mining sequential patterns, in: Proceedings of the 2nd European Symposium on Principles of Data Mining and Knowledge Discovery, Nantes, France, 1998, pp. 176-184.
  • 20
    • 5644272932 scopus 로고    scopus 로고
    • F. Masseglia, P. Poncelet, M. Teisseire, Pre-processing time constraints for efficiently mining generalized sequential patterns, in: Proceedings of the 11th International Symposium on Temporal Representation and Reasoning, France, 2004, pp. 87-95.
    • F. Masseglia, P. Poncelet, M. Teisseire, Pre-processing time constraints for efficiently mining generalized sequential patterns, in: Proceedings of the 11th International Symposium on Temporal Representation and Reasoning, France, 2004, pp. 87-95.
  • 21
    • 2442455696 scopus 로고    scopus 로고
    • S. Orlando, R. Perego, C. Silvestri, A new algorithm for gap constrained sequence mining, in: Proceedings of the 2004 ACM Symposium on Applied Computing, Nicosia, Cyprus, 2004, pp. 540-547.
    • S. Orlando, R. Perego, C. Silvestri, A new algorithm for gap constrained sequence mining, in: Proceedings of the 2004 ACM Symposium on Applied Computing, Nicosia, Cyprus, 2004, pp. 540-547.
  • 22
    • 0035016443 scopus 로고    scopus 로고
    • J. Pei, J. Han, B. Moryazavi-Asl, H. Pinto, Q. Chen, U. Dayal, M.-C. Hsu, PrefixSpan: mining sequential patterns efficiently by prefix-projected pattern growth, in: Proceedings of the 17th International Conference on Data Engineering, Heidelberg, Germany, April 2001, pp. 215-224.
    • J. Pei, J. Han, B. Moryazavi-Asl, H. Pinto, Q. Chen, U. Dayal, M.-C. Hsu, PrefixSpan: mining sequential patterns efficiently by prefix-projected pattern growth, in: Proceedings of the 17th International Conference on Data Engineering, Heidelberg, Germany, April 2001, pp. 215-224.
  • 23
    • 33947584673 scopus 로고    scopus 로고
    • Constraint-based sequential pattern mining: the pattern-growth methods
    • Pei J., Han J., and Wang W. Constraint-based sequential pattern mining: the pattern-growth methods. Journal of Intelligent Information Systems 28 2 (2007) 133-160
    • (2007) Journal of Intelligent Information Systems , vol.28 , Issue.2 , pp. 133-160
    • Pei, J.1    Han, J.2    Wang, W.3
  • 24
    • 2442588422 scopus 로고    scopus 로고
    • M. Seno, G. Karypis, SLPMiner: an algorithm for finding frequent sequential patterns using length-decreasing support constraint, in: Proceedings of the 2002 IEEE International Conference on Data Mining, 2002, pp. 418-425.
    • M. Seno, G. Karypis, SLPMiner: an algorithm for finding frequent sequential patterns using length-decreasing support constraint, in: Proceedings of the 2002 IEEE International Conference on Data Mining, 2002, pp. 418-425.
  • 25
    • 84897708583 scopus 로고    scopus 로고
    • R. Srikant, R. Agrawal, Mining sequential patterns: generalizations and performance improvements, in: Proceedings of the 5th International Conference on Extending Database Technology, Avignon, France, 1996, pp. 3-17.
    • R. Srikant, R. Agrawal, Mining sequential patterns: generalizations and performance improvements, in: Proceedings of the 5th International Conference on Extending Database Technology, Avignon, France, 1996, pp. 3-17.
  • 26
    • 2442446148 scopus 로고    scopus 로고
    • J. Wang, J. Han, BIDE: efficient mining of frequent closed sequences, in: Proceedings of the 20th International Conference on Data Engineering, Boston, MA, March 2004, pp. 79-90.
    • J. Wang, J. Han, BIDE: efficient mining of frequent closed sequences, in: Proceedings of the 20th International Conference on Data Engineering, Boston, MA, March 2004, pp. 79-90.
  • 28
    • 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-2 (2001) 31-60
    • (2001) Machine Learning Journal , vol.42 , Issue.1-2 , pp. 31-60
    • Zaki, M.J.1
  • 29
    • 51349089764 scopus 로고    scopus 로고
    • M.J. Zaki, Sequence mining in categorical domains: incorporating constraints, in: Proceedings of the 9th International Conference on Information and Knowledge Management, November 2000, pp. 422-429.
    • M.J. Zaki, Sequence mining in categorical domains: incorporating constraints, in: Proceedings of the 9th International Conference on Information and Knowledge Management, November 2000, pp. 422-429.


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