Accurate forecasting of time series is crucial across various domains.Many prediction tasks rely on effectively segmenting,matching,and time series data alignment.For instance,regardless of time series with the same g...Accurate forecasting of time series is crucial across various domains.Many prediction tasks rely on effectively segmenting,matching,and time series data alignment.For instance,regardless of time series with the same granularity,segmenting them into different granularity events can effectively mitigate the impact of varying time scales on prediction accuracy.However,these events of varying granularity frequently intersect with each other,which may possess unequal durations.Even minor differences can result in significant errors when matching time series with future trends.Besides,directly using matched events but unaligned events as state vectors in machine learning-based prediction models can lead to insufficient prediction accuracy.Therefore,this paper proposes a short-term forecasting method for time series based on a multi-granularity event,MGE-SP(multi-granularity event-based short-termprediction).First,amethodological framework for MGE-SP established guides the implementation steps.The framework consists of three key steps,including multi-granularity event matching based on the LTF(latest time first)strategy,multi-granularity event alignment using a piecewise aggregate approximation based on the compression ratio,and a short-term prediction model based on XGBoost.The data from a nationwide online car-hailing service in China ensures the method’s reliability.The average RMSE(root mean square error)and MAE(mean absolute error)of the proposed method are 3.204 and 2.360,lower than the respective values of 4.056 and 3.101 obtained using theARIMA(autoregressive integratedmoving average)method,as well as the values of 4.278 and 2.994 obtained using k-means-SVR(support vector regression)method.The other experiment is conducted on stock data froma public data set.The proposed method achieved an average RMSE and MAE of 0.836 and 0.696,lower than the respective values of 1.019 and 0.844 obtained using the ARIMA method,as well as the values of 1.350 and 1.172 obtained using the k-means-SVR method.展开更多
In the past several years, support vector machines （SVM） have achieved a huge success in many fields, especially in pattern recognition. But the standard SVM cannot deal with length-variable vectors, which is one se...In the past several years, support vector machines （SVM） have achieved a huge success in many fields, especially in pattern recognition. But the standard SVM cannot deal with length-variable vectors, which is one severe obstacle for its applications to some important areas, such as speech recognition and part-of-speech tagging. The paper proposed a novel SVM with discriminative dynamic time alignment （ DDTA - SVM） to solve this problem. When training DDTA - SVM classifier, according to the category information of the training sampies, different time alignment strategies were adopted to manipulate them in the kernel functions, which contributed to great improvement for training speed and generalization capability of the classifier. Since the alignment operator was embedded in kernel functions, the training algorithms of standard SVM were still compatible in DDTA- SVM. In order to increase the reliability of the classification, a new classification algorithm was suggested. The preliminary experimental results on Chinese confusable syllables speech classification task show that DDTA- SVM obtains faster convergence speed and better classification performance than dynamic time alignment kernel SVM （ DTAK - SVM）. Moreover, DDTA - SVM also gives higher classification precision compared to the conventional HMM. This proves that the proposed method is effective, especially for confusable length - variable pattern classification tasks展开更多
Two deficiencies in traditional iterative closest pointsimultaneous localization and mapping( ICP-SLAM) usually result in poor real-time performance. On one hand, relative position between current scan frame and globa...Two deficiencies in traditional iterative closest pointsimultaneous localization and mapping( ICP-SLAM) usually result in poor real-time performance. On one hand, relative position between current scan frame and global map cannot be previously known. As a result, ICP algorithm will take much amount of iterations to reach convergence. On the other hand,establishment of correspondence is done by global searching, which requires enormous computational time. To overcome the two problems,a fast ICP-SLAM with rough alignment and narrowing-scale nearby searching is proposed. As for the decrease of iterative times,rough alignment based on initial pose matrix is proposed. In detail,initial pose matrix is obtained by micro-electro-mechanical system( MEMS) magnetometer and global landmarks. Then rough alignment will be applied between current scan frame and global map at the beginning of ICP algorithm with initial pose matrix. As for accelerating the establishment of correspondence, narrowingscale nearby searching with dynamic threshold is proposed,where match-points are found within a progressively constrictive range.Compared to traditional ICP-SLAM,the experimental results show that the amount of iteration for ICP algorithm to reach convergence reduces to 92. 34% and ICP algorithm runtime reduces to 98. 86% on average. In addition,computational cost is kept in a stable level due to the eliminating of the accumulation of computational consumption. Moreover,great improvement can also been achieved in SLAM quality and robustness.展开更多
The relationship between China and South Africa will enter into an unprecedented year of development starting the first day of 2018 when the two countries celebrate the 20th anni versary of diplomatic ties. South Afri...The relationship between China and South Africa will enter into an unprecedented year of development starting the first day of 2018 when the two countries celebrate the 20th anni versary of diplomatic ties. South Africa. as Africa＇s largest economy, not only success- fully hosted the Johannesburg Summit of the Forum on China-Africa Cooperation （FOCAC） in December 2015, but also has actively aligned itself with the Belt and Road Initiative. Moreover,展开更多
基金funded by the Fujian Province Science and Technology Plan,China(Grant Number 2019H0017).
文摘Accurate forecasting of time series is crucial across various domains.Many prediction tasks rely on effectively segmenting,matching,and time series data alignment.For instance,regardless of time series with the same granularity,segmenting them into different granularity events can effectively mitigate the impact of varying time scales on prediction accuracy.However,these events of varying granularity frequently intersect with each other,which may possess unequal durations.Even minor differences can result in significant errors when matching time series with future trends.Besides,directly using matched events but unaligned events as state vectors in machine learning-based prediction models can lead to insufficient prediction accuracy.Therefore,this paper proposes a short-term forecasting method for time series based on a multi-granularity event,MGE-SP(multi-granularity event-based short-termprediction).First,amethodological framework for MGE-SP established guides the implementation steps.The framework consists of three key steps,including multi-granularity event matching based on the LTF(latest time first)strategy,multi-granularity event alignment using a piecewise aggregate approximation based on the compression ratio,and a short-term prediction model based on XGBoost.The data from a nationwide online car-hailing service in China ensures the method’s reliability.The average RMSE(root mean square error)and MAE(mean absolute error)of the proposed method are 3.204 and 2.360,lower than the respective values of 4.056 and 3.101 obtained using theARIMA(autoregressive integratedmoving average)method,as well as the values of 4.278 and 2.994 obtained using k-means-SVR(support vector regression)method.The other experiment is conducted on stock data froma public data set.The proposed method achieved an average RMSE and MAE of 0.836 and 0.696,lower than the respective values of 1.019 and 0.844 obtained using the ARIMA method,as well as the values of 1.350 and 1.172 obtained using the k-means-SVR method.
基金Sponsored by the National Natural Science Foundation of China(Grant No. 60575030)the Scientific Research Foundation of Harbin Institute of Technol-ogy (Grant No. HIT.2002.70)the Heilongjiang Scientific Research Foundation for Scholars Returned from Abroad(Grant No.LC03C10)
文摘In the past several years, support vector machines （SVM） have achieved a huge success in many fields, especially in pattern recognition. But the standard SVM cannot deal with length-variable vectors, which is one severe obstacle for its applications to some important areas, such as speech recognition and part-of-speech tagging. The paper proposed a novel SVM with discriminative dynamic time alignment （ DDTA - SVM） to solve this problem. When training DDTA - SVM classifier, according to the category information of the training sampies, different time alignment strategies were adopted to manipulate them in the kernel functions, which contributed to great improvement for training speed and generalization capability of the classifier. Since the alignment operator was embedded in kernel functions, the training algorithms of standard SVM were still compatible in DDTA- SVM. In order to increase the reliability of the classification, a new classification algorithm was suggested. The preliminary experimental results on Chinese confusable syllables speech classification task show that DDTA- SVM obtains faster convergence speed and better classification performance than dynamic time alignment kernel SVM （ DTAK - SVM）. Moreover, DDTA - SVM also gives higher classification precision compared to the conventional HMM. This proves that the proposed method is effective, especially for confusable length - variable pattern classification tasks
文摘Two deficiencies in traditional iterative closest pointsimultaneous localization and mapping( ICP-SLAM) usually result in poor real-time performance. On one hand, relative position between current scan frame and global map cannot be previously known. As a result, ICP algorithm will take much amount of iterations to reach convergence. On the other hand,establishment of correspondence is done by global searching, which requires enormous computational time. To overcome the two problems,a fast ICP-SLAM with rough alignment and narrowing-scale nearby searching is proposed. As for the decrease of iterative times,rough alignment based on initial pose matrix is proposed. In detail,initial pose matrix is obtained by micro-electro-mechanical system( MEMS) magnetometer and global landmarks. Then rough alignment will be applied between current scan frame and global map at the beginning of ICP algorithm with initial pose matrix. As for accelerating the establishment of correspondence, narrowingscale nearby searching with dynamic threshold is proposed,where match-points are found within a progressively constrictive range.Compared to traditional ICP-SLAM,the experimental results show that the amount of iteration for ICP algorithm to reach convergence reduces to 92. 34% and ICP algorithm runtime reduces to 98. 86% on average. In addition,computational cost is kept in a stable level due to the eliminating of the accumulation of computational consumption. Moreover,great improvement can also been achieved in SLAM quality and robustness.
文摘The relationship between China and South Africa will enter into an unprecedented year of development starting the first day of 2018 when the two countries celebrate the 20th anni versary of diplomatic ties. South Africa. as Africa＇s largest economy, not only success- fully hosted the Johannesburg Summit of the Forum on China-Africa Cooperation （FOCAC） in December 2015, but also has actively aligned itself with the Belt and Road Initiative. Moreover,
