• Journal of the Korea Society of Computer and Information
• /
• v.23 no.11
• /
• pp.43-49
• /
• 2018

In this paper, we propose a displacement measurement method based on deep learning using image data obtained from tensile tests of a material specimen. We focus on the fact that the sequential images during the tension are generated and the displacement of the specimen is represented in the image data. So, we designed sample generation model which makes sequential images of specimen. The behavior of generated images are similar to the real specimen images under tensile force. Using generated images, we trained and validated our model. In the deep neural network, sequential images are assigned to a multi-channel input to train the network. The multi-channel images are composed of sequential images obtained along the time domain. As a result, the neural network learns the temporal information as the images express the correlation with each other along the time domain. In order to verify the proposed method, we conducted experiments by comparing the deformation measuring performance of the neural network changing the displacement range of images.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.5
• /
• pp.29-36
• /
• 2009

Sequential pattern mining, which discovers frequent subsequences as patterns in a sequence database, is an important data mining problem with broad applications. Since a sequential pattern in DNA sequences can be a motif, we studied to find sequential patterns in DNA sequences. Most previously proposed mining algorithms follow the exact matching with a sequential pattern definition. They are not able to work in noisy environments and inaccurate data in practice. Theses problems occurs frequently in DNA sequences which is a biological data. We investigated approximate matching method to deal with those cases. Our idea is based on the observation that all occurrences of a frequent pattern can be classified into groups, which we call approximated pattern. The existing PrefixSpan algorithm can successfully find sequential patterns in a long sequence. We improved the PrefixSpan algorithm to find approximate sequential patterns. The experimental results showed that the number of repeats from the proposed method was 5 times more than that of PrefixSpan when the pattern length is 4.

• Communications for Statistical Applications and Methods
• /
• v.27 no.1
• /
• pp.15-35
• /
• 2020

In research on behavioral studies, significant attention has been paid to the stage-sequential process for multiple latent class variables. We now explore the stage-sequential process of multiple latent class variables using the multivariate latent class profile analysis (MLCPA). A latent profile variable, representing the stage-sequential process in MLCPA, is formed by a set of repeatedly measured categorical response variables. This paper proposes the extended MLCPA in order to explain an association between the latent profile variable and the latent group variable as a form of a two-dimensional contingency table. We applied the extended MLCPA to the National Longitudinal Survey on Youth 1997 (NLSY97) data to investigate the association between of developmental progression of depression and substance use behaviors among adolescents who experienced Authoritarian parental styles in their youth.

• Communications for Statistical Applications and Methods
• /
• v.29 no.6
• /
• pp.721-733
• /
• 2022

In this paper we compare parameter estimation by Grassmann manifold optimization and sequential candidate set algorithm in a structured principal fitted component (PFC) model. The structured PFC model extends the form of the covariance matrix of a random error to relieve the limits that occur due to too simple form of the matrix. However, unlike other PFC models, structured PFC model does not have a closed form for parameter estimation in dimension reduction which signals the need of numerical computation. The numerical computation can be done through Grassmann manifold optimization and sequential candidate set algorithm. We conducted numerical studies to compare the two methods by computing the results of sequential dimension testing and trace correlation values where we can compare the performance in determining dimension and estimating the basis. We could conclude that Grassmann manifold optimization outperforms sequential candidate set algorithm in dimension determination, while sequential candidate set algorithm is better in basis estimation when conducting dimension reduction. We also applied the methods in real data which derived the same result.

• The Korean Journal of Applied Statistics
• /
• v.24 no.6
• /
• pp.1249-1257
• /
• 2011

In this paper, we propose a Sequential Adaptive Nearest Neighbor(SANN) imputation method that combines the Adaptive Nearest Neighbor(ANN) method and the Sequential k-Nearest Neighbor(SKNN) method. When choosing the nearest neighbors of missing observations, the proposed SANN method takes the local feature of the missing observations into account as well as reutilizes the imputed observations in a sequential manner. By using a Monte Carlo study and a real data example, we demonstrate the characteristics of the SANN method and its potential performance.

• Journal of Communications and Networks
• /
• v.17 no.6
• /
• pp.568-581
• /
• 2015

Predicting locations of users with portable devices such as IP phones, smart-phones, iPads and iPods in public wireless local area networks (WLANs) plays a crucial role in location management and network resource allocation. Many techniques in machine learning and data mining, such as sequential pattern mining and clustering, have been widely used. However, these approaches have two deficiencies. First, because they are based on profiles of individual mobility behaviors, a sequential pattern technique may fail to predict new users or users with movement on novel paths. Second, using similar mobility behaviors in a cluster for predicting the movement of users may cause significant degradation in accuracy owing to indistinguishable regular movement and random movement. In this paper, we propose a novel fusion technique that utilizes mobility rules discovered from multiple similar users by combining clustering and sequential pattern mining. The proposed technique with two algorithms, named the clustering-based-sequential-pattern-mining (CSPM) and sequential-pattern-mining-based-clustering (SPMC), can deal with the lack of information in a personal profile and avoid some noise due to random movements by users. Experimental results show that our approach outperforms existing approaches in terms of efficiency and prediction accuracy.

• Database Research
• /
• v.34 no.3
• /
• pp.86-98
• /
• 2018

Point-of-Interest(POI) recommendation systems suggest the most interesting POIs to users considering the current location and time. With the rapid development of smartphones, internet-of-things, and location-based social networks, it has become feasible to accumulate huge amounts of user POI visits. Therefore, instant recommendation of interesting POIs at a given time is being widely recognized as important. To increase the performance of POI recommendation systems, several studies extracting users' POI sequential preference from POI check-in data, which is intended for implicit feedback, have been suggested. However, when constructing a model utilizing sequential preference, the model encounters possibility of data distortion because of a low number of observed check-ins which is attributed to intensified data sparsity. This paper suggests refinement of temporal intervals based on data confidence. When building a POI recommendation system using temporal intervals to model the POI sequential preference of users, our methodology reduces potential data distortion in the dataset and thus increases the performance of the recommendation system. We verify our model's effectiveness through the evaluation with the Foursquare and Gowalla dataset.

• ETRI Journal
• /
• v.42 no.6
• /
• pp.976-986
• /
• 2020

Internet of Things (IoT) is considered the future network to support wireless communications. To realize an IoT network, sufficient spectrum should be allocated for the rapidly increasing IoT devices. Through cognitive radio, unlicensed IoT devices exploit cooperative spectrum sensing (CSS) to opportunistically access a licensed spectrum without causing harmful interference to licensed primary users (PUs), thereby effectively improving the spectrum utilization. However, an open access cognitive IoT allows abnormal IoT devices to undermine the CSS process. Herein, we first establish a hard-combining attack model according to the malicious behavior of falsifying sensing data. Subsequently, we propose a weighted sequential hypothesis test (WSHT) to increase the PU detection accuracy and decrease the sampling number, which comprises the data transmission status-trust evaluation mechanism, sensing data availability, and sequential hypothesis test. Finally, simulation results show that when various attacks are encountered, the requirements of the WSHT are less than those of the conventional WSHT for a better detection performance.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.2
• /
• pp.137-144
• /
• 2013

A sequential pattern mining is finding out frequent patterns from the data set in time order. In this field, a dynamic weighted sequential pattern mining is applied to a computing environment that changes depending on the time and it can be utilized in a variety of environments applying changes of dynamic weight. In this paper, we propose a new sequence data mining method to explore the stream data by applying the dynamic weight. This method reduces the candidate patterns that must be navigated by using the dynamic weight according to the relative time sequence, and it can find out frequent sequence patterns quickly as the data input and output using a hash structure. Using this method reduces the memory usage and processing time more than applying the existing methods. We show the importance of dynamic weighted mining through the comparison of different weighting sequential pattern mining techniques.

• Communications for Statistical Applications and Methods
• /
• v.28 no.5
• /
• pp.563-582
• /
• 2021

This paper deals with developing a general class of accelerated sequential procedures and obtaining the associated second-order approximations for the expected sample size and 'regret' (difference between the risks of the proposed accelerated sequential procedure and the optimum fixed sample size procedure) function. We establish that the estimation problems based on various lifetime distributions can be tackled with the help of the proposed class of accelerated sequential procedures. Extensive simulation analysis is presented in support of the accuracy of our proposed methodology using the Pareto distribution and a real data set on carbon fibers is also analyzed to demonstrate the practical utility. We also provide the brief details of some other inferential problems which can be seen as the applications of the proposed class of accelerated sequential procedures.