• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.5
• /
• pp.361-367
• /
• 2004

This paper describes design of an algorithm for analyzing human activity using body-fixed 3-axis accelerometer in the small of the back. In the first step, we distinguish static and dynamic activity period using AC signal analysis. Then five postures were classified by applying the threshold in DC signal corresponding to the static activity period. Also, after comparison of average power and taking negative peak signal in the dynamic activity period, the four dynamic activities were classified by adaptive threshold method. To evaluate the performance of the proposed algorithm, the measured signals obtained from six subjects were applied to the proposed algorithm and the results were compared with the simultaneously measured video data. As a result, the activity classification rate of 95.7％ on average was obtained. Overall results show that the proposed classification algorithm has a possibility to be used to analyze the static and dynamic physical activity.

• Journal of KIISE:Databases
• /
• v.33 no.1
• /
• pp.102-116
• /
• 2006

Electronic catalogs (or e-catalogs) hold information about the goods and services offered or requested by the participants, and consequently, form the basis of an e-commerce transaction. Catalog management is complicated by a number of factors and product classification is at the core of these issues. Classification hierarchy is used for spend analysis, custom3 regulation, and product identification. Classification is the foundation on which product databases are designed, and plays a central role in almost all aspects of management and use of product information. However, product classification has received little formal treatment in terms of underlying model, operations, and semantics. We believe that the lack of a logical model for classification Introduces a number of problems not only for the classification itself but also for the product database in general. It needs to meet diverse user views to support efficient and convenient use of product information. It needs to be changed and evolved very often without breaking consistency in the cases of introduction of new products, extinction of existing products, class reorganization, and class specialization. It also needs to be merged and mapped with other classification schemes without information loss when B2B transactions occur. For these requirements, a classification scheme should be so dynamic that it takes in them within right time and cost. The existing classification schemes widely used today such as UNSPSC and eClass, however, have a lot of limitations to meet these requirements for dynamic features of classification. In this paper, we try to understand what it means to classify products and present how best to represent classification schemes so as to capture the semantics behind the classifications and facilitate mappings between them. Product information implies a plenty of semantics such as class attributes like material, time, place, etc., and integrity constraints. In this paper, we analyze the dynamic features of product databases and the limitation of existing code based classification schemes. And describe the semantic classification model, which satisfies the requirements for dynamic features oi product databases. It provides a means to explicitly and formally express more semantics for product classes and organizes class relationships into a graph. We believe the model proposed in this paper satisfies the requirements and challenges that have been raised by previous works.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.8
• /
• pp.741-751
• /
• 2000

To achieve high performance by exploiting instruction level parallelism aggressively in superscalar processors, it is necessary to overcome the limitation imposed by control dependences and data dependences which prevent instructions from executing parallel. Value prediction is a technique that breaks data dependences by predicting the outcome of an instruction and executes speculatively its data dependent instruction based on the predicted outcome. In this paper, a hybrid value prediction scheme with dynamic classification mechanism is proposed. We design a hybrid predictor by combining the last predictor, a stride predictor and a two-level predictor. The choice of a predictor for each instruction is determined by a dynamic classification mechanism. This makes each predictor utilized more efficiently than the hybrid predictor without dynamic classification mechanism. To show performance improvements of our scheme, we simulate the SPECint95 benchmark set by using execution-driven simulator. The results show that our scheme effect reduce of 45% hardware cost and 16% prediction accuracy improvements comparing with the conventional hybrid prediction scheme and two-level value prediction scheme.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.59 no.12
• /
• pp.2314-2318
• /
• 2010

For human-robot interaction, a robot should recognize the meaning of human behavior. In the case of static behavior such as face expression and sign language, the information contained in a single image is sufficient to deliver the meaning to the robot. In the case of dynamic behavior such as gestures, however, the information of sequential images is required. This paper proposes behavior classification by using fuzzy classifier to deliver the meaning of dynamic behavior to the robot. The proposed method extracts feature points from input images by a skeleton model, generates a vector space from a differential image of the extracted feature points, and uses this information as the learning data for fuzzy classifier. Finally, we show the effectiveness and the feasibility of the proposed method through experiments.

• Proceedings of the KIEE Conference
• /
• 2003.11c
• /
• pp.604-607
• /
• 2003

Most recommendation systems recommend the products or other information satisfying preferences of users on the basis of the users' previous profile information and other information related to product searches and purchase of users visiting web sites. This study aims to apply these application categories to e-mail more necessary to users. The E-Mail System has the strong personality so that there will be some problems even if e-mails are automatically classified by category through the learning on the basis of the personal rules. In consideration with this aspect, we need the semi-automatic system enabling both automatic classification and recommendation method to enhance the satisfaction of users. Accordingly, this paper uses two approaches as the solution against the misclassification that the users consider as the accuracy of classification itself using the dynamic threshold in Bayesian Learning Algorithm and the second one is the methodological approach using the recommendation agent enabling the users to make the final decision.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.7 no.3
• /
• pp.165-170
• /
• 2007

Recommendation systems provide users with proper services using context information being input from many sensors occasionally under ubiquitous computing environment. But in case there isn't sufficient context information for service recommendation in spite of much context information, there can be problems of resulting in inexact result. In addition, in the quantification step to use context information, there are problems of classifying context information inexactly because of using an absolute classification course. In this paper, we solved the problem of lack of necessary context information for service recommendation by using dynamic profile information. We also improved the problem of absolute classification by using a relative classification of context information in quantification step. As the result of experiments, expectation preference degree was improved by 7.5% as compared with collaborative filtering methods using an absolute quantification method where context information of P2P mobile agent is used.

• Journal of KIISE
• /
• v.44 no.8
• /
• pp.842-853
• /
• 2017

Streaming data is a sequence of data samples that are consistently generated over time. The data distribution or concept can change over time, and this change becomes a factor to reduce the performance of a classification model. Adaptive incremental learning can maintain the classification performance by updating the current classification model with the weight adjusted according to the degree of concept drift. However, selecting the proper weight value depending on the degree of concept drift is difficult. In this paper, we propose a dynamic ensemble method based on adaptive weight adjustment according to the degree of concept drift. Experimental results demonstrate that the proposed method shows higher performance than the other compared methods.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2007.11a
• /
• pp.427-430
• /
• 2007

기존의 LVQ(Learning Vector Quantization) 방법을 이용하여 물체를 분류하면 데이터의 학습이 빠르고 연산량이 적어 실시간으로 물체를 분류할 수 있는 장점이 있다. 하지만 데이터의 훈련시 output neuron의 개수를 정확히 예측할 수 없고 output neuron의 개수에 따라 물체를 분류하는 정확도가 매우 달라질 수 있다. 그러므로 본 논문에서는 output neuron의 개수를 데이터의 특성에 맞게 결정해주는 알고리즘을 제시한다. DLVQ(Dynamic Learning Vector Quantization) 알고리즘은 승자로 결정된 가중치 벡터의 부류가 샘플 데이터의 부류와 같으면 업데이트하고 다르면 새로운 가중치 벡터로 생성한다. 제한한 알고리즘의 가장 다른 부분은 미리 output neuron의 개수를 정하는 것이 아니라 훈련 과정에서 동적으로 output neuron의 개수를 생성하는 것이다. 그리고 클러터의 구분 방법을 제시하여 사람, 차, 클러터를 구분할 수 있다.

• Transactions on Control, Automation and Systems Engineering
• /
• v.2 no.1
• /
• pp.40-46
• /
• 2000

In this paper, a transient identification based on a Hidden Markov Model (HMM) has been suggested and evaluated experimentally for the classification of transients in the dynamic process. The transient can be identified by its unique time dependent patterns related to the principal variables. The HMM, a double stochastic process, can be applied to transient identification which is a spatial and temporal classification problem under a statistical pattern recognition framework. The HMM is created for each transient from a set of training data by the maximum-likelihood estimation method. The transient identification is determined by calculating which model has the highest probability for the given test data. Several experimental tests have been performed with normalization methods, clustering algorithms, and a number of states in HMM. Several experimental tests have been performed including superimposing random noise, adding systematic error, and untrained transients. The proposed real-time transient identification system has many advantages, however, there are still a lot of problems that should be solved to apply to a real dynamic process. Further efforts are being made to improve the system performance and robustness to demonstrate reliability and accuracy to the required level.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.7
• /
• pp.2480-2495
• /
• 2014

This paper describes a hierarchical method for image-based age estimation that combines age group classification and age value estimation. The proposed method uses a coarse-to-fine strategy with different appearance features to describe facial shape and texture. Considering the damage to continuity between neighboring groups caused by fixed divisions during age group classification, a dynamic grouping technique is employed to allow non-fixed groups. Based on the given group, an ordinal hyperplane ranking (OHRank) model is employed to transform age estimation into a series of binary enquiry problems that can take advantage of the intrinsic correlation and ordinal information of age. A set of experiments on FG-NET are presented and the results demonstrate the validity of our solution.