• Journal of KIISE:Software and Applications
• /
• v.37 no.7
• /
• pp.584-589
• /
• 2010

The dynamic time warping algorithm generally used in time series pattern recognition spends most of the time in generating the correlation table, and it establishes the global path constraint to reduce the corresponding time complexity. However, the constraint restrains just in terms of the time axis, not considering the contents of input patterns. In this paper, we therefore propose an efficient branch and bound dynamic time warping algorithm which sets the global constraints by adaptively reflecting the patterns. The experimental results show that the proposed method outperforms conventional methods in terms of the speed and accuracy.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.7
• /
• pp.19-26
• /
• 2010

In this paper, we suggest a efficient handwritten character verification method in on-line environments which automatically analyses two input character string and computes their similarity degrees. The proposed algorithm first applies the circular projection method to input handwritten strings and extracts their representative features including shape, directions, etc. It then calculates the similarity between two character strings by using an improved dynamic time warping (DTW) algorithm. We improved the conventional DTW algorithm efficiently through adopting the branch-and-bound policy to the existing DTW algorithm which is well-known to produce good results in the various optimization problems. The experimental results to verify the performance of the proposed system show that the suggested handwritten character verification method operates more efficiently than the existing DTW and DDTW algorithms in terms of the speed.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.20 no.5
• /
• pp.113-129
• /
• 2021

Recently, traffic congestion in the city is continuously increasing due to the expansion of the living area centered in the metropolitan area and the concentration of population in large cities. New road construction has become impossible due to the increase in land prices in downtown areas and limited sites, and the importance of efficient data-based road operation is increasingly emerging. For efficient road operation, it is essential to classify appropriate scenarios according to changes in traffic conditions and to operate optimal signals for each scenario. In this study, the Dynamic Time Warping model for cluster analysis of time series data was applied to traffic volume and speed data collected at continuous intersections for optimal scenario classification. We propose a methodology for composing an optimal signal operation scenario by analyzing the characteristics of the scenarios for each data used for classification.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.6
• /
• pp.559-566
• /
• 2008

In this paper, we propose a range subsequence matching under dynamic time warping (DTW) distance. We exploit Dual Match, which divides data sequences into disjoint windows and the query sequence into sliding windows. However, Dual Match is known to work under Euclidean distance. We argue that Euclidean distance is a fragile distance, and thus, DTW should be supported by Dual Match. For this purpose, we derive a new important theorem showing the correctness of our approach and provide a detailed algorithm using the theorem. Extensive experimental results show that our range subsequence matching performs much better than the sequential scan algorithm.

• KIPS Transactions on Software and Data Engineering
• /
• v.8 no.9
• /
• pp.363-372
• /
• 2019

A sequence refers to data in which the order exists on the two items, and purchase transaction data in which the products purchased by one customer are listed is one of the representative sequence data. In general, all goods have a product taxonomy, such as category/ sub-category/ sub-sub category, and if they are similar to each other, they are classified into the same category according to their characteristics. Therefore, in this paper, we not only consider the purchase order of products to compare two purchase transaction sequences, but also calculate their similarity by giving a higher score if they are in the same category in spite of their difference. Especially, in order to choose the best similarity measure that directly affects the calculation performance of the purchase transaction sequences, we have compared the performance of three representative similarity measures, the Levenshtein distance, dynamic time warping distance, and the Needleman-Wunsch similarity. We have extended the existing methods to take into account the product taxonomy. For conventional similarity measures, the comparison of goods in two sequences is calculated by simply assigning a value of 0 or 1 according to whether or not the product is matched. However, the proposed method is subdivided to have a value between 0 and 1 using the product taxonomy tree to give a different degree of relevance between the two products, even if they are different products. Through experiments, we have confirmed that the proposed method was measured the similarity more accurately than the previous method. Furthermore, we have confirmed that dynamic time warping distance was the most suitable measure because it considered the degree of association of the product in the sequence and showed good performance for two sequences with different lengths.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.7
• /
• pp.25-32
• /
• 2009

In this paper, we propose a new handwriting verification method using pattern analysis in off-line environments. The proposed method first segments character regions in a document and extracts effective features from the segmented regions. It then estimates the similarity between the extracted non-linear features and reference ones by using dynamic time warping and principal component analysis. Our handwriting verification method extracts handwriting features effectively and enables the verification of handwriting with various lengths of features as well as ones of short patterns. The experimental results show that our method outperforms others in terms as accuracy. We expect that the proposed method will automate the manual handwriting verification tasks and provide much objectivity on handwriting identification.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.37 no.6
• /
• pp.535-543
• /
• 2019

Recently, growing social interest in alley markets, which have shown rapid growth like Gyeonglidan-gil street in Seoul, has led to the need for an analysis of growth factors. This paper aims at exploring growing alley markets through time-series clustering using DTW (Dynamic Time Warping) and examining the growth factors through logistic regression. According to cluster analysis, the number of growing markets of the Northeast, the Southwest, and the Southeast were much more than the Northwest but the proportion in region of the Northwest, the Northeast, and the Southwest were much more than the Southeast. Logistic regression results show that people in 20s and 30s have a lower impact on sales than those in 50s, but have a greater impact on growth of alley market. Alley markets located in high-income areas often reached their growth limits, indicating a tendency to stagnate or decline. The proximity of a subway station effected positive on sales but negative on growth. This research is an advanced study in that the causes of sales growth of alley markets is examined, which has not been examined in the preceding study.

• The Korean Journal of Applied Statistics
• /
• v.33 no.6
• /
• pp.791-804
• /
• 2020

Residential electricity consumption can be predicted more accurately by utilizing the realtime household electricity consumption reference that can be collected by the AMI as the ICT developed under the smart grid circumstance. This paper studied the model that predicts residential power load using the ARIMA, TBATS, NNAR model based on the data of hour unit amount of household electricity consumption, and unlike forecasting the consumption of the whole households at once, it computed the anticipated amount of the electricity consumption by aggregating the predictive value of each established model of cluster that was collected by the households which show the similiar load profile. Especially, as the typical time series data, the electricity consumption data chose the clustering analysis method that is appropriate to the time series data. Therefore, Dynamic Time Warping and Periodogram based method is used in this paper. By the result, forecasting the residential elecrtricity consumption by clustering the similiar household showed better performance than forecasting at once and in summertime, NNAR model performed best, and in wintertime, it was TBATS model. Lastly, clustering method showed most improvements in forecasting capability when the DTW method that was manifested the difference between the patterns of each cluster was used.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.6
• /
• pp.73-80
• /
• 2010

Vocabulary recognition system is providing inaccurate vocabulary and similar phoneme recognition due to reduce recognition rate. It's require method of similar phoneme recognition unrecognized and efficient feature extraction process. Therefore in this paper propose phoneme likelihood error correction improvement system using based on phoneme feature Bhattacharyya distance measurement. Phoneme likelihood is monophone training data phoneme using HMM feature extraction method, similar phoneme is induced recognition able to accurate phoneme using Bhattacharyya distance measurement. They are effective recognition rate improvement. System performance comparison as a result of recognition improve represent 1.2%, 97.91% by Euclidean distance measurement and dynamic time warping(DTW) system.

• Journal of KIISE:Databases
• /
• v.34 no.5
• /
• pp.409-419
• /
• 2007

Database community focuses on the similar music retrieval systems for music database when a humming query is given. One of the approaches is converting the midi data to time series, building their indices and performing the similarity search on them. Queries based on humming can be transformed to time series by using the known pitch detection algorithms. The recently suggested algorithm, scaled and warped matching, is based on dynamic time warping and uniform scaling. This paper proposes Humming BIRD(Humming Based sImilaR mini music retrieval system) using sliding window and center-aligned scaled and warped matching. Center-aligned scaled and warped matching is a mixed distance measure of center-aligned uniform scaling and time warping. The newly proposed measure gives tighter lower bound than previous ones which results in reduced search space. The empirical results show the superiority of this algorithm comparing the pruning power while it returns the same results.