• 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.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.7
• /
• pp.1849-1857
• /
• 1999

We proposed the RPA (Recursive Partition Averaging) method in order to improve the storage requirement and classification rate of the Memory Based Reasoning. This algorithm recursively partitions the pattern space until each hyperrectangle contains only those patterns of the same class, then it computes the average values of patterns in each hyperrectangle to extract a representative. Also we have used the mutual information between the features and classes as weights for features to improve the classification performance. The proposed algorithm used 30~90% of memory space that is needed in the k-NN (k-Nearest Neighbors) classifier, and showed a comparable classification performance to the k-NN. Also, by reducing the number of stored patterns, it showed an excellent result in terms of classification time when we compare it to the k-NN.

• Journal of the Korean Society for Precision Engineering
• /
• v.11 no.1
• /
• pp.138-149
• /
• 1994

This paper introduces a new monitoring technique which utilizes an adaptive signal processing for feature generation, coupled with a multilayered merual network for pattern recognition. The cutting force signal in face milling operation was modeled by a low order discrete autoregressive model, shere parameters were estimated recursively at each sampling instant using a parameter adaptation algorithm based on an RLS(recursive least square) method with discounted measurements. The influences of the adaptation algorithm parameters as well as some considerations for modeling on the estimation results are discussed. The sensitivity of the extimated model parameters to the tool state(new and worn tool)is presented, and the application of a multilayered neural network to tool state monitoring using the previously generated features is also demonstrated with a high success rate. The methodology turned out to be quite suitable for in-process tool wear monitoring in the sense that the model parameters are effective as tool state features in milling operation and that the classifier successfully maps the sensors data to correct output decision.

• Proceedings of the Korean Society For Composite Materials Conference
• /
• 2001.10a
• /
• pp.163-169
• /
• 2001

The solution of two-dimensional deflection of circular wavy reinforcing fiber elastics was obtained for one end clamped boundary under concentrated load condition. The fiber was regarded as a linear elastic material. Wavy shape was described as a combination of half-circular arc smoothly connected each other with constant curvature of all the same magnitude and alternative sign. Also load direction was taken into account. As a result, the solution was expressed in terms of a series of elliptic integrals. These elliptic integrals had two different transformed parameters involved with load value and initial radius of curvature. While we found the exact solutions and expressed them in terms of elliptic integrals, the recursive ignition formulae about the displacement and arc length at each segment of circular section were obtained. Algorithm of determining unknown parameters was established and the profile curve of deflected beam was shown in comparison with initial shape.

• ETRI Journal
• /
• v.43 no.6
• /
• pp.1024-1037
• /
• 2021

Mining high utility itemsets (HUIs) from transaction databases considers such factors as the unit profit and quantity of purchased items. Two-phase tree-based algorithms transform a database into compressed tree structures and generate candidate patterns through a recursive pattern-growth procedure. This procedure requires a lot of memory and time to construct conditional pattern trees. To address this issue, this study employs two compressed tree structures, namely, Utility Count Tree and String Utility Tree, to enumerate valid patterns and thus promote fast utility computation. Furthermore, the study presents an algorithm called single-phase utility computation (SPUC) that leverages these two tree structures to mine HUIs in a single phase by incorporating novel pruning strategies. Experiments conducted on both real and synthetic datasets demonstrate the superior performance of SPUC compared with IHUP, UP-Growth, and UP-Growth+algorithms.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.5 no.2
• /
• pp.28-43
• /
• 1995

This paper concerns with automatic generation of fuzzy rules which can be used for pattern classification. Feature space is recursively subdivided into hyperspheres, and each hypersphere is represented by its centroid and bounding distance. Fuzzy rules are then generated based on the constructed hyperspheres. The resulting fuzzy rules have very simple premise parts, and they can be organized into a hierarchical structure so that classification process can be implemented very rapidly. The experimented results show that the suggested method works very well compared to other methods.

• International Journal of Contents
• /
• v.3 no.2
• /
• pp.18-24
• /
• 2007

Biological sequences such as DNA and amino acid sequences typically contain a large number of items. They have contiguous sequences that ordinarily consist of more than hundreds of frequent items. In biological sequences analysis(BSA), a frequent contiguous sequence search is one of the most important operations. Many studies have been done for mining sequential patterns efficiently. Most of the existing methods for mining sequential patterns are based on the Apriori algorithm. In particular, the prefixSpan algorithm is one of the most efficient sequential pattern mining schemes based on the Apriori algorithm. However, since the algorithm expands the sequential patterns from frequent patterns with length-1, it is not suitable for biological datasets with long frequent contiguous sequences. In recent years, the MacosVSpan algorithm was proposed based on the idea of the prefixSpan algorithm to significantly reduce its recursive process. However, the algorithm is still inefficient for mining frequent contiguous sequences from long biological data sequences. In this paper, we propose an efficient method to mine maximal frequent contiguous sequences in large biological data sequences by constructing the spanning tree with a fixed length. To verify the superiority of the proposed method, we perform experiments in various environments. The experiments show that the proposed method is much more efficient than MacosVSpan in terms of retrieval performance.

• Journal of The Geomorphological Association of Korea
• /
• v.23 no.3
• /
• pp.67-78
• /
• 2016

Soil carbon(C) is an essential property for characterizing soil quality. Understanding spatial patterns of soil C is particularly limited for mountain areas. This study aims to predict the spatial pattern of soil C using terrain analysis in a steep mountainous area. Specifically, model performances and prediction uncertainties were investigated based on the number of resampling repetitions. Further, important predictors for soil C were also identified. Finally, the spatial distribution of uncertainty was analyzed. A total of 91 soil samples were collected via conditioned latin hypercube sampling and a digital soil C map was developed using support vector regression which is one of the powerful machine learning methods. Results showed that there were no distinct differences of model performances depending on the number of repetitions except for 10-fold cross validation. For soil C, elevation and surface curvature were selected as important predictors by recursive feature elimination. Soil C showed higher values in higher elevation and concave slopes. The spatial pattern of soil C might possibly reflect lateral movement of water and materials along the surface configuration of the study area. The higher values of uncertainty in higher elevation and concave slopes might be related to geomorphological characteristics of the research area and the sampling design. This study is believed to provide a better understanding of the relationship between geomorphology and soil C in the mountainous ecosystem.

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.12
• /
• pp.623-634
• /
• 2016

Most of existing frequent pattern mining methods address time efficiency and greatly rely on the primary memory. However, in the era of big data, the size of real-world databases to mined is exponentially increasing, and hence the primary memory is not sufficient enough to mine for frequent patterns from large real-world data sets. To solve this problem, there are some researches for frequent pattern mining method based on disk, but the processing time compared to the memory based methods took very time consuming. There are some researches to improve scalability of frequent pattern mining, but their processes are very time consuming compare to the memory based methods. In this paper, we present PPFP as a novel disk-based approach for mining frequent itemset from big data; and hence we reduced the main memory size bottleneck. PPFP algorithm is based on FP-growth method which is one of the most popular and efficient frequent pattern mining approaches. The mining with PPFP consists of two setps. (1) Constructing an IFP-tree: After construct FP-tree, we assign index number for each node in FP-tree with novel index numbering method, and then insert the indexed FP-tree (IFP-tree) into disk as IFP-table. (2) Mining frequent patterns with PPFP: Mine frequent patterns by expending patterns using stack based PUSH-POP method (PPFP method). Through this new approach, by using a very small amount of memory for recursive and time consuming operation in mining process, we improved the scalability and time efficiency of the frequent pattern mining. And the reported test results demonstrate them.

• Journal of Advanced Navigation Technology
• /
• v.19 no.6
• /
• pp.558-563
• /
• 2015

There have recently been various services that use indoor location estimation technologies. Representative methods of location estimation include fingerprinting and triangulation, but they lack accuracy. Various kinds of research which apply existing location estimation methods like AOA, TOA, and TDOA are being done to solve this problem. In this paper, we study the location estimation algorithm based on AOA using a RSSI difference in indoor environments. We assume that there is a single AP with four antennas, and estimate the angle of arrival based on the RSSI value to apply the AOA algorithm. To compensate for RSSI, we use a recursive averaging filter, and use the corrected RSSI and the Pythagorean theorem to estimate the angle of arrival. The results of the experiment, show an error of 18% because of the radiation pattern of the four non-directional antennas arranged at narrow intervals.