메뉴 건너뛰기




Volumn 23, Issue 1, 2011, Pages 79-94

Efficient periodicity mining in time series databases using suffix trees

Author keywords

noise resilient; periodicity detection; segment periodicity; sequence periodicity; suffix tree; symbol periodicity; Time series

Indexed keywords

NOISE RESILIENT; PERIODICITY DETECTION; SEGMENT PERIODICITY; SEQUENCE PERIODICITY; SUFFIX-TREES; SYMBOL PERIODICITY;

EID: 78649422350     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2010.76     Document Type: Article
Times cited : (95)

References (34)
  • 3
    • 0023543757 scopus 로고
    • Sequence variation in s-antigen genes of plasmodium falciparum
    • Dec
    • H. Brown et al., "Sequence Variation in S-Antigen Genes of Plasmodium falciparum", Molecular Biology and Medicine, vol. 4, no. 6, pp. 365-376, Dec. 1987.
    • (1987) Molecular Biology and Medicine , vol.4 , Issue.6 , pp. 365-376
    • Brown, H.1
  • 4
    • 17444427106 scopus 로고    scopus 로고
    • Constructing suffix tree for gigabyte sequences with megabyte memory
    • Jan
    • C.-F. Cheung, J. X. Yu, and H. Lu, "Constructing Suffix Tree for Gigabyte Sequences with Megabyte Memory", IEEE Trans. Knowledge and Data Eng., vol. 17, no. 1, pp. 90-105, Jan. 2005.
    • (2005) IEEE Trans. Knowledge and Data Eng. , vol.17 , Issue.1 , pp. 90-105
    • Cheung, C.-F.1    Yu, J.X.2    Lu, H.3
  • 5
    • 84976723548 scopus 로고
    • Faster tree pattern matching
    • M. Dubiner et al., "Faster Tree Pattern Matching", J. ACM, vol. 14, pp. 205-213, 1994.
    • (1994) J. ACM , vol.14 , pp. 205-213
    • Dubiner, M.1
  • 8
    • 34248380883 scopus 로고    scopus 로고
    • Analysis of the average depth in a suffix tree under a Markov model
    • J. Fayolle and M. D. Ward, "Analysis of the Average Depth in a Suffix Tree under a Markov Model", Proc. Int'l Conf. Analysis of Algorithms, pp. 95-104, 2005.
    • (2005) Proc. Int'l Conf. Analysis of Algorithms , pp. 95-104
    • Fayolle, J.1    Ward, M.D.2
  • 10
    • 32144464541 scopus 로고    scopus 로고
    • Detecting periodic patterns in unevenly spaced gene expression time series using lomb-scargle periodograms
    • Feb
    • E. F. Glynn, J. Chen, and A. R. Mushegian, "Detecting Periodic Patterns in Unevenly Spaced Gene Expression Time Series Using Lomb-Scargle Periodograms", Bioinformatics, vol. 22, no. 3 pp. 310-316, Feb. 2006.
    • (2006) Bioinformatics , vol.22 , Issue.3 , pp. 310-316
    • Glynn, E.F.1    Chen, J.2    Mushegian, A.R.3
  • 12
    • 0032627945 scopus 로고    scopus 로고
    • Efficient mining of partial periodic patterns in time series database
    • J. Han, Y. Yin, and G. Dong, "Efficient Mining of Partial Periodic Patterns in Time Series Database", Proc. 15th IEEE Int'l Conf. Data Eng., p. 106, 1999.
    • (1999) Proc. 15th IEEE Int'l Conf. Data Eng. , pp. 106
    • Han, J.1    Yin, Y.2    Dong, G.3
  • 13
    • 20844447400 scopus 로고    scopus 로고
    • SMCA: A general model for mining asynchronous periodic patterns in temporal databases
    • June
    • K.-Y. Huang and C.-H. Chang, "SMCA: A General Model for Mining Asynchronous Periodic Patterns in Temporal Databases", IEEE Trans. Knowledge and Data Eng., vol. 17, no. 6, pp. 774-785, June 2005.
    • (2005) IEEE Trans. Knowledge and Data Eng. , vol.17 , Issue.6 , pp. 774-785
    • Huang, K.-Y.1    Chang, C.-H.2
  • 15
    • 0012972592 scopus 로고    scopus 로고
    • Persistent suffix trees and suffix binary search trees as DNA sequence indexes
    • Univ. of Glasgow, Dept. of Computing Science
    • E. Hunt, R. W. Irving, and M. P. Atkinson, "Persistent Suffix Trees and Suffix Binary Search Trees as DNA Sequence Indexes", Technical Report TR2000-63, Univ. of Glasgow, Dept. of Computing Science, 2000.
    • (2000) Technical Report TR2000-63
    • Hunt, E.1    Irving, R.W.2    Atkinson, M.P.3
  • 17
    • 0033919542 scopus 로고    scopus 로고
    • Amino acid repeat patterns in protein sequences: Their diversity and structural-function implications
    • M. V. Katti, R. Sami-Subbu, P. K. Rajekar, and V. S. Gupta, "Amino Acid Repeat Patterns in Protein Sequences: Their Diversity and Structural-Function Implications", Protein Science, vol. 9, no. 6, pp. 1203-1209, 2000.
    • (2000) Protein Science , vol.9 , Issue.6 , pp. 1203-1209
    • Katti, M.V.1    Sami-Subbu, R.2    Rajekar, P.K.3    Gupta, V.S.4
  • 18
    • 34548547034 scopus 로고    scopus 로고
    • HOT SAX: Efficiently finding the most unusual time series subsequence
    • E. Keogh, J. Lin, and A. Fu, "HOT SAX: Efficiently Finding the Most Unusual Time Series Subsequence", Proc. Fifth IEEE Int'l Conf. Data Mining, pp. 226-233, 2005.
    • (2005) Proc. Fifth IEEE Int'l Conf. Data Mining , pp. 226-233
    • Keogh, E.1    Lin, J.2    Fu, A.3
  • 24
    • 77952012022 scopus 로고    scopus 로고
    • STNR: A suffix tree based noise resilient algorithm for periodicity detection in time series databases
    • F. Rasheed and R. Alhajj, "STNR: A Suffix Tree Based Noise Resilient Algorithm for Periodicity Detection in Time Series Databases", Applied Intelligence, vol. 32, no. 3, pp. 267-278, 2010.
    • (2010) Applied Intelligence , vol.32 , Issue.3 , pp. 267-278
    • Rasheed, F.1    Alhajj, R.2
  • 26
    • 0036350889 scopus 로고    scopus 로고
    • On tries, suffix trees, and universal variable-length-to-block codes
    • Y. A. Reznik, "On Tries, Suffix Trees, and Universal Variable-Length-to-Block Codes", Proc. IEEE Int'l Symp. Information Theory, p. 123, 2002.
    • (2002) Proc. IEEE Int'l Symp. Information Theory , pp. 123
    • Reznik, Y.A.1
  • 29
    • 34047188666 scopus 로고    scopus 로고
    • Compressed suffix tree-a basis for genome-scale sequence analysis
    • N. Välimäki, W. Gerlach, K. Dixit, and V. Mäkinen, "Compressed Suffix Tree-A Basis for Genome-Scale Sequence Analysis", Bioinformatics, vol. 23, pp. 629-630, 2007.
    • (2007) Bioinformatics , vol.23 , pp. 629-630
    • Välimäki, N.1    Gerlach, W.2    Dixit, K.3    Mäkinen, V.4
  • 31
    • 25844465842 scopus 로고    scopus 로고
    • Practical methods for constructing suffix trees
    • Sept
    • Y. Tian, S. Tata, R. A. Hankins, and J. M. Patel, "Practical Methods for Constructing Suffix Trees", VLDB J., vol. 14, no. 3, pp. 281-299, Sept. 2005.
    • (2005) VLDB J , vol.14 , Issue.3 , pp. 281-299
    • Tian, Y.1    Tata, S.2    Hankins, R.A.3    Patel, J.M.4
  • 32
    • 0001704377 scopus 로고
    • Online construction of suffix trees
    • E. Ukkonen, "Online Construction of Suffix Trees", Algorithmica, vol. 14, no. 3, pp. 249-260, 1995.
    • (1995) Algorithmica , vol.14 , Issue.3 , pp. 249-260
    • Ukkonen, E.1


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