메뉴 건너뛰기




Volumn 8, Issue 2, 2014, Pages

Discovering general prominent streaks in sequence data

Author keywords

Computational journalism; Sequence database; Skyline query; Time series database

Indexed keywords

COMPUTER SCIENCE; DATA MINING;

EID: 84903736247     PISSN: 15564681     EISSN: 1556472X     Source Type: Journal    
DOI: 10.1145/2601439     Document Type: Article
Times cited : (12)

References (36)
  • 1
    • 85006228721 scopus 로고
    • Efficient similarity search in sequence databases
    • DOI:http://dx.doi.org/10.1007/3-540-57301-1-5
    • Rakesh Agrawal, Christos Faloutsos, and Arun Swami. 1993. Efficient similarity search in sequence databases. Lecture Notes in Computer Science, Vol. 730, 69-84. DOI:http://dx.doi.org/10.1007/3-540-57301-1-5
    • (1993) Lecture Notes in Computer Science , vol.730 , pp. 69-84
    • Agrawal, R.1    Faloutsos, C.2    Swami, A.3
  • 2
    • 0002644607 scopus 로고
    • Fast similarity search in the presence of noise, scaling, and translation in time-series databases
    • Morgan Kaufmann, San Francisco, CA
    • Rakesh Agrawal, King-Ip Lin, Harpreet S. Sawhney, and Kyuseok Shim. 1995. Fast similarity search in the presence of noise, scaling, and translation in time-series databases. In Proceedings of the 21th International Conference on Very Large Data Bases (VLDB'95). Morgan Kaufmann, San Francisco, CA, 490-501. http://dl.acm.org/citation.cfm?id=645921.673155
    • (1995) Proceedings of the 21th International Conference on Very Large Data Bases (VLDB'95) , pp. 490-501
    • Agrawal, R.1    Lin, K.2    Sawhney, H.S.3    Shim, K.4
  • 5
    • 0016557674 scopus 로고
    • Multidimensional binary search trees used for associative searching
    • 1975, September. DOI:http://dx.doi.org/10.1145/361002.361007
    • Jon Louis Bentley. 1975. Multidimensional binary search trees used for associative searching. Communications of the ACM 18, 9 (September 1975), 509-517. DOI:http://dx.doi.org/10.1145/361002.361007
    • (1975) Communications of the ACM , vol.18 , Issue.9 , pp. 509-517
    • Louis Bentley, J.1
  • 6
    • 0018492535 scopus 로고
    • Multidimensional binary search trees in database applications
    • DOI:http://dx.doi.org/10.1109/TSE.1979.234200
    • Jon Louis Bentley. 1979. Multidimensional binary search trees in database applications. IEEE Transactions on Software Engineering 4, 333-340. DOI:http://dx.doi.org/10.1109/TSE.1979.234200
    • (1979) IEEE Transactions on Software Engineering , vol.4 , pp. 333-340
    • Louis Bentley, J.1
  • 12
    • 21744433274 scopus 로고    scopus 로고
    • Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-totals
    • DOI 10.1023/A:1009726021843
    • Jim Gray, Surajit Chaudhuri, Adam Bosworth, Andrew Layman, Don Reichart, Murali Venkatrao, Frank Pellow, and Hamid Pirahesh. 1997. Data cube: A relational aggregation operator generalizing groupby, cross-tab, and sub-totals. Data Mining and Knowledge Discovery 1, 1 (January 1997), 29-53. DOI:http://dx.doi.org/10.1023/A:1009726021843 (Pubitemid 127078358)
    • (1997) Data Mining and Knowledge Discovery , vol.1 , Issue.1 , pp. 29-54
    • Gray, J.1    Chaudhuri, S.2    Bosworth, A.3    Layman, A.4    Reichart, D.5    Venkatrao, M.6    Pellow, F.7    Pirahesh, H.8
  • 13
    • 67649639297 scopus 로고    scopus 로고
    • Online interval skyline queries on time series
    • IEEE Computer Society, Washington, DC. DOI:http://dx.doi.org/10.1109/ ICDE.2009.70
    • Bin Jiang and Jian Pei. 2009. Online interval skyline queries on time series. In Proceedings of the 2009 IEEE International Conference on Data Engineering (ICDE'09). IEEE Computer Society, Washington, DC, 1036-1047. DOI:http://dx.doi.org/10.1109/ICDE.2009.70
    • (2009) Proceedings of the 2009 IEEE International Conference on Data Engineering (ICDE'09) , pp. 1036-1047
    • Jiang, B.1    Pei, J.2
  • 16
    • 0016564037 scopus 로고
    • On finding the maxima of a set of vectors
    • October 1975. DOI:http://dx.doi.org/10.1145/321906.321910
    • H. T. Kung, F. Luccio, and F. P. Preparata. 1975. On finding the maxima of a set of vectors. Journal of the ACM 22, 4 (October 1975), 469-476. DOI:http://dx.doi.org/10.1145/321906.321910
    • (1975) Journal of the ACM , vol.22 , Issue.4 , pp. 469-476
    • Kung, H.T.1    Luccio, F.2    Preparata, F.P.3
  • 17
    • 24044470614 scopus 로고    scopus 로고
    • Clustering of time series data - A survey
    • DOI 10.1016/j.patcog.2005.01.025, PII S0031320305001305
    • T. Warren Liao. 2005. Clustering of time series data-a survey. Pattern Recognition 38, 11 (November 2005), 1857-1874. DOI:http://dx.doi.org/10.1016/j. patcog.2005.01.025 (Pubitemid 41214630)
    • (2005) Pattern Recognition , vol.38 , Issue.11 , pp. 1857-1874
    • Warren Liao, T.1
  • 18
    • 34548740177 scopus 로고    scopus 로고
    • Selecting stars: The k most representative skyline operator
    • DOI 10.1109/ICDE.2007.367854, 4221657, 23rd International Conference on Data Engineering, ICDE 2007
    • Xuemin Lin, Yidong Yuan, Qing Zhang, and Ying Zhang. 2007. Selecting stars: The k most representative skyline operator. In Proceedings of the IEEE 23rd International Conference on Data Engineering (ICDE'07). 86-95. DOI:http://dx.doi.org/10.1109/ICDE.2007.367854 (Pubitemid 47422012)
    • (2007) Proceedings - International Conference on Data Engineering , pp. 86-95
    • Lin, X.1    Yuan, Y.2    Zhang, Q.3    Zhang, Y.4
  • 20
    • 23944477932 scopus 로고    scopus 로고
    • Progressive skyline computation in database systems
    • DOI 10.1145/1061318.1061320
    • Dimitris Papadias, Yufei Tao, Greg Fu, and Bernhard Seeger. 2005. Progressive skyline computation in database systems. ACM Transactions on Database Systems 30, 1 (March 2005), 41-82. DOI:http://dx.doi.org/10.1145/ 1061318.1061320 (Pubitemid 41201811)
    • (2005) ACM Transactions on Database Systems , vol.30 , Issue.1 , pp. 41-82
    • Papadias, D.1    Tao, Y.2    Fu, G.3    Seeger, B.4
  • 21
    • 13844256245 scopus 로고    scopus 로고
    • Mining sequential patterns by pattern-growth: The prefixspan approach
    • DOI 10.1109/TKDE.2004.77
    • Jian Pei, Jiawei Han, Behzad Mortazavi-Asl, Jianyong Wang, Helen Pinto, Qiming Chen, Umeshwar Dayal, and Mei-Chun Hsu. 2004. Mining sequential patterns by pattern-growth: The PrefixSpan approach. IEEE Transactions on Knowledge and Data Engineering 16, 11 (November 2004), 1424-1440. DOI:http://dx.doi.org/10. 1109/TKDE.2004.77 (Pubitemid 40242330)
    • (2004) IEEE Transactions on Knowledge and Data Engineering , vol.16 , Issue.11 , pp. 1424-1440
    • Pei, J.1    Han, J.2    Mortazavi-Asl, B.3    Wang, J.4    Pinto, H.5    Chen, Q.6    Dayal, U.7    Hsu, M.-C.8
  • 22
    • 33846200457 scopus 로고    scopus 로고
    • Towards multidimensional subspace skyline analysis
    • DOI 10.1145/1189769.1189774
    • Jian Pei, Yidong Yuan, Xuemin Lin, Wen Jin, Martin Ester, Qing Liu, Wei Wang, Yufei Tao, Jeffrey Xu Yu, and Qing Zhang. 2006. Towards multidimensional subspace skyline analysis. ACM Transactions on Database Systems 31, 4 (December 2006), 1335-1381. DOI:http://dx.doi.org/10.1145/1189769.1189774 (Pubitemid 46103273)
    • (2006) ACM Transactions on Database Systems , vol.31 , Issue.4 , pp. 1335-1381
    • Pei, J.1    Yuan, Y.2    Lin, X.3    Jin, W.4    Ester, M.5    Liu, Q.6    Wang, W.7    Tao, Y.8    Yu, J.X.9    Zhang, Q.10
  • 23
    • 0024610919 scopus 로고
    • A tutorial on hiddenMarkovmodels and selected applications in speech recognition
    • DOI:http://dx.doi.org/10.1109/5.18626
    • Lawrence Rabiner. 1989. A tutorial on hiddenMarkovmodels and selected applications in speech recognition. Proceedings of the IEEE 77, 2, 257-286. DOI:http://dx.doi.org/10.1109/5.18626
    • (1989) Proceedings of the IEEE , vol.77 , Issue.2 , pp. 257-286
    • Rabiner, L.1
  • 25
    • 84898995769 scopus 로고    scopus 로고
    • Clustering sequences with hiddenMarkovmodels
    • MIT Press, Cambridge, MA
    • Padhraic Smyth. 1997. Clustering sequences with hiddenMarkovmodels. In Advances in Neural Information Processing Systems. MIT Press, Cambridge, MA, 648-654.
    • (1997) Advances in Neural Information Processing Systems , pp. 648-654
    • Smyth, P.1
  • 28
    • 67649649603 scopus 로고    scopus 로고
    • Distance-based representative skyline
    • IEEE Computer Society, Washington, DC. DOI:http://dx.doi.org/10.1109/ ICDE.2009.84
    • Yufei Tao, Ling Ding, Xuemin Lin, and Jian Pei. 2009. Distance-based representative skyline. In Proceedings of the 2009 IEEE International Conference on Data Engineering. IEEE Computer Society, Washington, DC, 892-903. DOI:http://dx.doi.org/10.1109/ICDE.2009.84
    • (2009) Proceedings of the 2009 IEEE International Conference on Data Engineering , pp. 892-903
    • Tao, Y.1    Ding, L.2    Lin, X.3    Pei, J.4
  • 29
    • 33749417750 scopus 로고    scopus 로고
    • SUBSKY: Efficient computation of skylines in subspaces
    • IEEE Computer Society, Washington, DC, 65-. DOI:http://dx.doi.org/10. 1109/ICDE
    • Yufei Tao, Xiaokui Xiao, and Jian Pei. 2006. SUBSKY: Efficient computation of skylines in subspaces. In Proceedings of the 22nd International Conference on Data Engineering (ICDE'06). IEEE Computer Society, Washington, DC, 65-. DOI:http://dx.doi.org/10.1109/ICDE.2006.149
    • (2006) Proceedings of the 22nd International Conference on Data Engineering (ICDE'06) , vol.2006 , pp. 149
    • Tao, Y.1    Xiao, X.2    Pei, J.3
  • 32
    • 34250613572 scopus 로고    scopus 로고
    • Refreshing the sky: The compressed skycube with efficient support for frequent updates
    • DOI 10.1145/1142473.1142529, SIGMOD 2006 - Proceedings of the ACM SIGMOD International Conference on Management of Data
    • Tian Xia and Donghui Zhang. 2006. Refreshing the sky: The compressed skycube with efficient support for frequent updates. In Proceedings of the 2006 ACM SIGMOD International Conference on Management of Data (SIGMOD'06). ACM, New York, NY, 491-502. DOI:http://dx.doi.org/10.1145/1142473.1142529 (Pubitemid 46946534)
    • (2006) Proceedings of the ACM SIGMOD International Conference on Management of Data , pp. 491-502
    • Xia, T.1    Zhang, D.2
  • 35
    • 0034826102 scopus 로고    scopus 로고
    • SPADE: An efficient algorithm for mining frequent sequences
    • DOI 10.1023/A:1007652502315
    • Mohammed J. Zaki. 2001. SPADE: An efficient algorithm for mining frequent sequences. Machine Learning 42, 1-2, 31-60. DOI:http://dx.doi.org/10.1023/A: 1007652502315 (Pubitemid 32872398)
    • (2001) Machine Learning , vol.42 , Issue.1-2 , pp. 31-60
    • Zaki, M.J.1
  • 36
    • 33745773298 scopus 로고    scopus 로고
    • Discovering strong skyline points in high dimensional spaces
    • CIKM'05 - Proceedings of the 14th ACM International Conference on Information and Knowledge Management
    • Zhenjie Zhang, Xinyu Guo, Hua Lu, Anthony K. H. Tung, and Nan Wang. 2005. Discovering strong skyline points in high dimensional spaces. In Proceedings of the 14th ACM International Conference on Information and Knowledge Management (CIKM'05). ACM, New York, NY, 247-248. DOI:http://dx.doi.org/10.1145/1099554. 1099610 (Pubitemid 44022147)
    • (2005) International Conference on Information and Knowledge Management, Proceedings , pp. 247-248
    • Zhang, Z.1    Guo, X.2    Lu, H.3    Tung, A.K.H.4    Wang, N.5


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