• Journal of the Korea Safety Management & Science
• /
• v.13 no.4
• /
• pp.273-282
• /
• 2011

Nowadays, our industries and occupation are increased under the economy development of government. So, this paper introduce to compare with coefficient's of correlation on the time series of the education and the qualification in our country. For this reason, the decision making to qualifications' foresight which will be change to the education category-prospective on the time series. The qualification has claasified 5 degrees-master craftsman, professional engineer, engineer, technician(or industrial engineer), craftsman - and 516 qualification items. Education has classified to 4 degrees(7 degrees) - elementary, middle, high, high scholastic level school(college, university, graduation). This paper has matched to educational classification and qualification classification through the following method. We defined the same level between education and qualification after analysed correlation under the time series, so the craftsman equals high school graduation people, technician equals college graduation people, engineer quals university graduation people, now we could not analyse master and professional levels. This paper will suggest to the qualification's future policy direction and improve the education policy direction.

• International Journal of Contents
• /
• v.7 no.1
• /
• pp.14-22
• /
• 2011

Temporal Sign Language Recognition (TSLR) from hand motion is an active area of gesture recognition research in facilitating efficient communication with deaf people. TSLR systems consist of two stages: a motion sensing step which extracts useful features from signers' motion and a classification process which classifies these features as a performed sign. This work focuses on two of the research problems, namely unknown time varying signal of sign languages in feature extraction stage and computing complexity and time consumption in classification stage due to a very large sign sequences database. In this paper, we propose a combination of Dynamic Time Warping (DTW) and application of the Single hidden Layer Feedforward Neural networks (SLFNs) trained by Extreme Learning Machine (ELM) to cope the limitations. DTW has several advantages over other approaches in that it can align the length of the time series data to a same prior size, while ELM is a useful technique for classifying these warped features. Our experiment demonstrates the efficiency of the proposed method with the recognition accuracy up to 98.67%. The proposed approach can be generalized to more detailed measurements so as to recognize hand gestures, body motion and facial expression.

• The Korean Journal of Applied Statistics
• /
• v.11 no.1
• /
• pp.177-184
• /
• 1998

Most of the research on discrimination and classification analysis has been directed to the situation where the data consist of independent observations. However, it is often the case in practice that a dependence structure between objects does exist, in particular, for the time series data. This article is handling such a case and is concerned with the problem of classifying new object when the dependence can be modelled by a discrete time series via conditional autologistic transition probability.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2021.07a
• /
• pp.11-13
• /
• 2021

본 논문에서는 시계열 데이터 분류를 통한 음성 감정 인식을 제안한다. mel-spectrogram을 사용하여 음성파일에서 특징을 뽑아내 다변수 시계열 데이터로 변환한다. 이를 Conv1D, GRU, Transformer를 결합한 딥러닝 모델에 학습시킨다. 위의 딥러닝 모델에 음성 감정 인식 데이터 세트인 TESS, SAVEE, RAVDESS, EmoDB에 적용하여 각각의 데이터 세트에서 기존의 모델 보다 높은 정확도의 음성 감정 분류 결과를 얻을 수 있었다. 정확도는 99.60%, 99.32%, 97.28%, 99.86%를 얻었다.

• Journal of Industrial Technology
• /
• v.29 no.B
• /
• pp.17-23
• /
• 2009

In many cases, clustering algorithms have been used for extracting and discovering useful information from non-linear data. They have made a great effect on performances of the systems dealing with non-linear data. Thus, this paper presents a new approach called hierarchically structured clustering algorithm, and it is applied to the prediction system for non-linear time series data. The proposed hierarchically structured clustering algorithm (called HCKA: Hierarchical Cross-correlation and K-means clustering Algorithms) in which the cross-correlation and k-means clustering algorithm are combined can accept the correlationship of non-linear time series as well as statistical characteristics. First, the optimal differences of data are generated, which can suitably reveal the characteristics of non-linear time series. Second, the generated differences are classified into the upper clusters for their predictors by the cross-correlation clustering algorithm, and then each classified differences are classified again into the lower fuzzy sets by the k-means clustering algorithm. As a result, the proposed method can give an efficient classification and improve the performance. Finally, we demonstrates the effectiveness of the proposed HCKA via typical time series examples.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.2
• /
• pp.221-225
• /
• 2008

In this paper, to avoid the frequency analysis requiring a high sampling rate, time-warped similarity measure algorithms, which are able to classify objects even with a low-rate sampling rate as time- series methods, are presented and proposed the DTW-Cosine algorithm, as the best classifier among them in wireless sensor networks. Two problems, local time shifting and spatial signal variation, should be solved to apply the time-warped similarity measure algorithms to wireless sensor networks. We find that our proposed algorithm can overcome those problems very efficiently and outperforms the other algorithms by at least 10.3% accuracy.

• Spatial Information Research
• /
• v.22 no.1
• /
• pp.27-33
• /
• 2014

Considering the wide coverage, the transparency from climate condition, Interferometric Synthetic Aperture Radar (InSAR) possesses a great potential for the landcover classification as shown in many precedent researches. In addition to the merits of InSAR products for the landcover classification, the time series analysis of InSAR pairs can provide a highly reliable basis to interpret landcover. We applied such idea with the test site in Mountain Baekdu located on the border between North Korea and China. Since it is recently noted as the potential volcanic activation site, the landcover especially the vegetation distribution information is highly essential to validate the reliability of Differential Interferometric Synthetic Aperture Radar (DInSAR) over Mt. Baekdu. The algorithms combining the auxiliary information from Moderate Resolution Imaging Spectroradiometer (MODIS) to analyze the phase coherence and backscatter coefficient of Observing Satellite (ALOS) Phased Array type L-band Synthetic Aperture Radar (PALSAR) was established. The results using InSAR signatures from two polarization modes of ALOS PALSAR showed high reliability for mining landcover and spatial distribution.

• KIPS Transactions on Software and Data Engineering
• /
• v.11 no.5
• /
• pp.197-202
• /
• 2022

IoT (Internet of Things) devices are being attacked by malware due to many security vulnerabilities, such as the use of weak IDs/passwords and unauthenticated firmware updates. However, due to the diversity of CPU architectures, it is difficult to set up a malware analysis environment and design features. In this paper, we design time series features using the byte sequence of executable files to represent independent features of CPU architectures, and analyze them using recurrent neural networks. The proposed feature is a fixed-length time series pattern extracted from the byte sequence by calculating partial entropy and applying linear interpolation. Temporary changes in the extracted feature are analyzed by RNN and LSTM. In the experiment, the IoT malware detection showed high performance, while low performance was analyzed in the malware family classification. When the entropy patterns for each malware family were compared visually, the Tsunami and Gafgyt families showed similar patterns, resulting in low performance. LSTM is more suitable than RNN for learning temporal changes in the proposed malware features.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.682-685
• /
• 2004

This paper investigated a method for classifying emotional states by using pulse wave signal. It focused on finding effective features for emotional state classification. The emptional states considered here consisted of interest and neutral. Classification experiments utilized 65 and 60 samples of interest and neutral states respectively. We have investigated 19 features derived from pulse wave signals by using both time domain and frequency domain analysis methods with 2 classifiers of minimum distance (normalized Euclidean distanece) and ${\kappa}$-Nearest Neighbour. The Leave-one-out cross validation was used as an evaluation mehtod. Based on experimental results, the most efficient features were a combination of 4 features consisting of (i) the mean of the first differences of the smoothed pulse rate time series signal, (ii) the mean of absolute values of the second differences of thel normalized interbeat intervals, (iii) the root mean square successive difference, and (iv) the power in high frequency range in normalized unit, which provided 80.8% average accuracy with ${\kappa}$-Nearest Neighbour classifier.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.11
• /
• pp.4016-4027
• /
• 2014

Understanding network latency is important for providing consistent and acceptable levels of services in network-based applications. However, due to the difficulty of estimating applications' network demands and the difficulty of network latency modeling the management of network resources has often been ignored. We expect that, since network latency repeats cycles of congested states, a systematic classification method for network status would be helpful to simplify issues in network resource managements. This paper presents a simple empirical method to classify network status with a real operational network. By observing oscillating behavior of end-to-end latency we determine networks' status in run time. Five typical network statuses are defined based on a long-term stability and a short-term burstiness. By investigating prediction accuracies of several simple numerical models we show the effectiveness of the network status classification. Experimental results show that around 80% reduction in prediction errors depending on network status.