[1]
DING H,TRAJCEVSKI G, SCHEUERMANN P, et al. Querying and mining of time series data: Experimental comparison of representations and distance measures[J]. Proceedings of the VLDB Endowment, 2008,1(2): 1542-1552.
[2]
杨一鸣,潘嵘,潘嘉林,等.时间序列分类问题的算法比较[J].计算机学报, 2007,30(8):1259-1265.
[3]
CZARNOWSKI I. Clusterbased instance selection for machine classification[J]. Knowledge and Information Systems, 2012, 30(1):113-133.
[4]
GARCIA S, DERRAC J, CANO J R, et al. Prototype selection for nearest neighbor classification: taxonomy and empirical study[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2012, 34(3): 417-435.
[5]
XI X, KEOGH E, SHELTON C, et al. Fast time series classification using numerosity reduction[C]// Proceedings of the 23rd International Conference on Machine Learning. New York: ACM, 2006:1033-1040.
[6]〖HJ1.45mm〗
BUZA K, NANOPOULOS A, SCHMIDTTHIEME L. INSIGHT:Efficient and effective instance selection for timeseries classification[C]// Proceedings of 15th PacificAsia Conference on Knowledge Discovery and Data Mining,LNCS 6635. Berlin: Springer, 2011:149-160.
[7]
RADOVANOVIC M, NANOPOULOS A, IVANOVIC M. Time series classification in many intrinsic dimensions[C]// Proceedings of SIAM International Conference on Data Mining. New York:ACM, 2010:677-688.
[8]
RADOVANOVIC M, NANOPOULOS A, IVANOVIC M. Nearest neighbors in highdimensional data: The emergence and influence of hubs[C]// Proceedings of the 26th Annual International Conference on Machine Learning. New York: ACM, 2009:865-872.
[9]
RADOVANOVIC M, NANOPOULOS A, IVANOVIC M. Hubs in space: popular nearest neighbors in highdimensional data[J]. The Journal of Machine Learning Research, 2010,11(3):2487- 2531.
[10]
SUN YANMIN, KAMEL M S, WONG A K C, et al. Costsensitive boosting for classification of imbalanced data[J]. Pattern Recognition,2007, 40(12):3358-3378.
[11]
KEOGH E, ZHU Q, HU B, et al. The UCR time series classification/clustering [DB/OL]. [2012-02-08]. http://www.cs.ucr.edu/~eamonn/time_series_data/.
[12]
RATANAMAHATANA C A, KEOGH E. Three myths about dynamic time warping data mining[EB/OL].[2012-03-20].http://alumni.cs.ucr.edu/~ratana/RatanamC.pdf.
[13]
SAKOE H, CHIBA S. Dynamic programming algorithm optimization for spoken word recognition[J]. Transactions on Acoustics, Speech and Signal Processing,1978, 26(1):43-49.
[14]
KEOGH E. Exact indexing of dynamic time warping[C] // Proceedings of 28th International Conference on Very Large Data Bases. New York:ACM, 2002:406-417. |