• Journal of Biomedical Engineering Research
• /
• v.26 no.2
• /
• pp.87-93
• /
• 2005

A new method for real-time estimating left ventricular relaxation time constant (T) from the left ventricular (LV) pressure waveform, based on the isovolumic relaxation model, is proposed. The presented method uses a recursive least squares (RLS) algorithm to accomplish real-time estimation. A new criterion to detect the end-point of the isovolumic relaxation period (IRP) for the estimation of T is also introduced, which is based on the pattern analysis of mean square errors between the original and reconstructed pressure waveforms. We have verified the performance of the new method in over 4,600 beats obtained from 70 patients. The results demonstrate that the proposed method provides more stable and reliable estimation of τ than the conventional 'off-line' methods.

• Journal of Institute of Control, Robotics and Systems
• /
• v.8 no.10
• /
• pp.827-832
• /
• 2002

We propose a prediction method of the pollutant and a synchronous classification of the current state of SOx emission in the power plant. We use the auto-regressive with exogeneous (ARX) model as a predictor of SOx emission and use a radial basis function network (RBFN) as a pattem classifier. The ARX modeling scheme is implemented using recursive least squares (RLS) method to update the model parameters adaptively. The capability of SOx emission monitoring is utilized with the application of the RBFN classifier. Experimental results show that the ARX model can predict the SOx emission concentration well and ARX modeling parameters can be a good feature for the state monitoring. in addition, its validity has been verified through the power spectrum analysis. Consequently, the RBFN classifier in combination with ARX model is shown to be quite adequate for monitoring the state of SOx emission.

• The KIPS Transactions:PartB
• /
• v.13B no.2 s.105
• /
• pp.127-132
• /
• 2006

K-NN (k-Nearest Neighbors), which is a well-known instance-based learning algorithm, simply stores entire training patterns in memory, and uses a distance function to classify a test pattern. K-NN is proven to show satisfactory performance, but it is notorious formemory usage and lengthy computation. Various studies have been found in the literature in order to minimize memory usage and computation time, and NGE (Nested Generalized Exemplar) theory is one of them. In this paper, we propose RPA (Recursive Partition Averaging) and IRPA (Incremental RPA) which is an incremental version of RPA. RPA partitions the entire pattern space recursively, and generates representatives from each partition. Also, due to the fact that RPA is prone to produce excessive number of partitions as the number of features in a pattern increases, we present IRPA which reduces the number of representative patterns by processing the training set in an incremental manner. Our proposed methods have been successfully shown to exhibit comparable performance to k-NN with a lot less number of patterns and better result than EACH system which implements the NGE theory.

• Communications for Statistical Applications and Methods
• /
• v.3 no.1
• /
• pp.155-168
• /
• 1996

In this paper we consider the multiprocess dynamic normal model with parameters having a time dependent non-linear structure. We develop and study the recursive estimation procedure for the proposed model with normality assumption. It turns out thst the proposed model has nice properties such as insensitivity to outliers and quick reaction to abrupt changes of pattern.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04b
• /
• pp.457-459
• /
• 2002

뜻풀이에서 추출한 의미 정보를 이용만 통계시인 방법의 기존 동형이의어 분별 시스템에는 불필요한 의미 정보들을 많이 가지고 있었다. 그리고 동형이의어간의 의미정보가 서로 교차하는 부분이 많아 확률적인 결정에 오류를 발생시켰다. 본 논문에서는 뜻풀이에서 구문패턴을 분석하여 보다 정제된 의미 정보를 추출하였고, 구문패턴에 속하는 어휘들의 하위어를 사전에서 자동 추출하여 부족한 의미 정보를 보완하였다. 또한, 구문패턴으로 분별할 수 없는 일부 동형이의어들은 순환 뜻풀이 망(RDN)을 이용하여 동형이의어를 분별하였다. 이러한 방법으로 동형이의어 분별을 통해 기존 연구보다 8%의 정확률 향상을 가져왔다.

• Journal of KIISE:Software and Applications
• /
• v.31 no.4
• /
• pp.478-487
• /
• 2004

We had proposed the RPA(Recursive Partition Averaging) method in order to improve the storage requirement and classification rate of the Memory Based Reasoning. That algorithm worked not bad in many area, however, the major drawbacks of RPA are it's partitioning condition and the way of extracting major patterns. We propose an adaptive RPA algorithm which uses the FPD(feature-based population densimeter) to stop the ARPA partitioning process and produce, instead of RPA's averaged major pattern, optimizing resulting hyperrectangles. The proposed algorithm required only approximately 40% of memory space that is needed in k-NN classifier, and showed a superior classification performance to the RPA. Also, by reducing the number of stored patterns, it showed an excellent results in terms of classification when we compare it to the k-NN.

• Journal of Educational Research in Mathematics
• /
• v.22 no.4
• /
• pp.619-636
• /
• 2012

The main purpose of this study was to explore the process of generalization generated by mathematically gifted students. Specifically, this study probed how fourth, fifth, and sixth graders might generalize geometric patterns and represent such generalization. The subjects of this study were a total of 30 students from gifted classes of one elementary school in Korea. The results of this study showed that on the question of the launch stage, students used a lot of recursive strategies that built mainly on a few specific numbers in the given pattern in order to decide the number of successive differences. On the question of the towards a working generalization stage, however, upper graders tend to use a contextual strategy of looking for a pattern or making an equation based on the given information. The more difficult task, more students used recursive strategies or concrete strategies such as drawing or skip-counting. On the question of the towards an explicit generalization stage, students tended to describe patterns linguistically. However, upper graders used more frequently algebraic representations (symbols or formulas) than lower graders did. This tendency was consistent with regard to the question of the towards a justification stage. This result implies that mathematically gifted students use similar strategies in the process of generalizing a geometric pattern but upper graders prefer to use algebraic representations to demonstrate their thinking process more concisely. As this study examines the strategies students use to generalize a geometric pattern, it can provoke discussion on what kinds of prompts may be useful to promote a generalization ability of gifted students and what sorts of teaching strategies are possible to move from linguistic representations to algebraic representations.

• Journal of Internet Computing and Services
• /
• v.20 no.4
• /
• pp.21-27
• /
• 2019

Selection of feature pattern gathered from the observation of the RNA sequencing data (RNA-seq) are not all equally informative for identification of differential expressions: some of them may be noisy, correlated or irrelevant because of redundancy in Big-Data sets. Variable selection of feature pattern aims at differential expressed gene set that is significantly relevant for a special task. This issues are complex and important in many domains, for example. In terms of a computational research field of machine learning, selection of feature pattern has been studied such as Random Forest, K-Nearest and Support Vector Machine (SVM). One of most the well-known machine learning algorithms is SVM, which is classical as well as original. The one of a member of SVM-criterion is Support Vector Machine-Recursive Feature Elimination (SVM-RFE), which have been utilized in our research work. We propose a novel algorithm of the SVM-RFE with Q-learning in reinforcement learning for better variable selection of feature pattern. By comparing our proposed algorithm with the well-known SVM-RFE combining Welch' T in published data, our result can show that the criterion from weight vector of SVM-RFE enhanced by Q-learning has been improved by an off-policy by a more exploratory scheme of Q-learning.

• The Journal of Asian Finance, Economics and Business
• /
• v.6 no.4
• /
• pp.179-187
• /
• 2019

This study aims to investigate the effects of market commonality and resource similarity on price competition and the recursive consequences in the Korean lodging market. Price comparison among hotels in the same geographic market has been facilitated through the development of information technology, rendering little search cost of consumers. While the literature implies the heterogeneous price attack and response among hotels, a limited number of empirical researches focus on the asymmetric and recursive pattern in the competitive dynamics. This study empirically examines the price interactions in the Korean lodging market based on the theoretical framework of competitive price interactions and countervailing power. Demonstrating superiority to the spatial lag model and the ordinary least squares in the estimation, the results from spatial error model suggest that the hotels with longer operational history pose an asymmetric impact on the price of the newer hotels. The asymmetry is also found in chain hotels over the independent, further implying the possibility of predatory pricing. The findings of this study provide the evidence of a hierarchical structure in the price competition, with different countervailing power by the resources of the hotels. Theoretical and managerial implications are discussed, with suggestions for future study.

• Journal of Korea Multimedia Society
• /
• v.6 no.5
• /
• pp.824-830
• /
• 2003

RPA (Recursive Partition Averaging) method was proposed in order to improve the storage requirement and classification rate of the Memory Based Reasoning. That algorithm worked well in many areas, however, the major drawbacks of RPA are it's pattern averaging mechanism. We propose an adaptive OHC algorithm which uses the FPD(Feature-based Population Densimeter) to increase the classification rate of RPA. The proposed algorithm required only approximately 40% of memory space that is needed in k-NN classifier, and showed a superior classification performance to the RPA. Also, by reducing the number of stored patterns, it showed a excellent results in terms of classification when we compare it to the k-NN.