A time-series similarity measurement method based on wavelet and matrix transform was proposed,and its anti-noise ability,sensitivity and accuracy were discussed. The time-series sequences were compressed into wavelet...A time-series similarity measurement method based on wavelet and matrix transform was proposed,and its anti-noise ability,sensitivity and accuracy were discussed. The time-series sequences were compressed into wavelet subspace,and sample feature vector and orthogonal basics of sample time-series sequences were obtained by K-L transform. Then the inner product transform was carried out to project analyzed time-series sequence into orthogonal basics to gain analyzed feature vectors. The similarity was calculated between sample feature vector and analyzed feature vector by the Euclid distance. Taking fault wave of power electronic devices for example,the experimental results show that the proposed method has low dimension of feature vector,the anti-noise ability of proposed method is 30 times as large as that of plain wavelet method,the sensitivity of proposed method is 1/3 as large as that of plain wavelet method,and the accuracy of proposed method is higher than that of the wavelet singular value decomposition method. The proposed method can be applied in similarity matching and indexing for lager time series databases.展开更多
Many classical clustering algorithms do good jobs on their prerequisite but do not scale well when being applied to deal with very large data sets(VLDS).In this work,a novel division and partition clustering method(DP...Many classical clustering algorithms do good jobs on their prerequisite but do not scale well when being applied to deal with very large data sets(VLDS).In this work,a novel division and partition clustering method(DP) was proposed to solve the problem.DP cut the source data set into data blocks,and extracted the eigenvector for each data block to form the local feature set.The local feature set was used in the second round of the characteristics polymerization process for the source data to find the global eigenvector.Ultimately according to the global eigenvector,the data set was assigned by criterion of minimum distance.The experimental results show that it is more robust than the conventional clusterings.Characteristics of not sensitive to data dimensions,distribution and number of nature clustering make it have a wide range of applications in clustering VLDS.展开更多
基金Projects(60634020, 60904077, 60874069) supported by the National Natural Science Foundation of ChinaProject(JC200903180555A) supported by the Foundation Project of Shenzhen City Science and Technology Plan of China
文摘A time-series similarity measurement method based on wavelet and matrix transform was proposed,and its anti-noise ability,sensitivity and accuracy were discussed. The time-series sequences were compressed into wavelet subspace,and sample feature vector and orthogonal basics of sample time-series sequences were obtained by K-L transform. Then the inner product transform was carried out to project analyzed time-series sequence into orthogonal basics to gain analyzed feature vectors. The similarity was calculated between sample feature vector and analyzed feature vector by the Euclid distance. Taking fault wave of power electronic devices for example,the experimental results show that the proposed method has low dimension of feature vector,the anti-noise ability of proposed method is 30 times as large as that of plain wavelet method,the sensitivity of proposed method is 1/3 as large as that of plain wavelet method,and the accuracy of proposed method is higher than that of the wavelet singular value decomposition method. The proposed method can be applied in similarity matching and indexing for lager time series databases.
基金Projects(60903082,60975042)supported by the National Natural Science Foundation of ChinaProject(20070217043)supported by the Research Fund for the Doctoral Program of Higher Education of China
文摘Many classical clustering algorithms do good jobs on their prerequisite but do not scale well when being applied to deal with very large data sets(VLDS).In this work,a novel division and partition clustering method(DP) was proposed to solve the problem.DP cut the source data set into data blocks,and extracted the eigenvector for each data block to form the local feature set.The local feature set was used in the second round of the characteristics polymerization process for the source data to find the global eigenvector.Ultimately according to the global eigenvector,the data set was assigned by criterion of minimum distance.The experimental results show that it is more robust than the conventional clusterings.Characteristics of not sensitive to data dimensions,distribution and number of nature clustering make it have a wide range of applications in clustering VLDS.
