• Proceedings of the KSME Conference
• /
• 2000.04a
• /
• pp.505-510
• /
• 2000

Vehicle performances such as fuel consumption and catalyst-out emissions are affected by a driving pattern, which is defined as a driving cycle with the grade in this study. We developed an algorithm to recognize a current driving pattern by using a neural network. And this algorithm can be used in adapting the driving control strategy to the recognized driving pattern. First, we classified the general driving patterns into 6 representative driving patterns, which are composed of 3 urban driving patterns, 2 suburban driving patterns and 1 expressway driving pattern. A total of 24 parameters such as average cycle velocity, positive acceleration kinetic energy, relative duration spent at stop, average acceleration and average grade are chosen to characterize the driving patterns. Second, we used a neural network (especially the Hamming network) to decide which representative driving pattern is closest to the current driving pattern by comparing the inner products between them. And before calculating inner product, each element of the current and representative driving patterns is transformed into 1 and -1 array as to 4 levels. In the end, we simulated the driving pattern recognition algorithm in a temporary pattern composed of 6 representative driving patterns and, verified the reliable recognition performance.

• Journal of Power Electronics
• /
• v.12 no.1
• /
• pp.1-9
• /
• 2012

This study investigates an application of the Hamming network-dual extended Kalman filter (DEKF) based on pattern recognition for high accuracy state-of-charge (SOC)/capacity estimation and state-of-health (SOH) prediction at various temperatures. The averaged nine discharging/charging voltage-temperature (DCVT) patterns for ten fresh Li-Ion cells at experimental temperatures are measured as representative patterns, together with cell model parameters. Through statistical analysis, the Hamming network is applied to identify the representative pattern that matches most closely with the pattern of an arbitrary cell measured at any temperature. Based on temperature-checking process, model parameters for a representative DCVT pattern can then be applied to estimate SOC/capacity and to predict SOH of an arbitrary cell using the DEKF. This avoids the need for repeated parameter measuremet.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.2
• /
• pp.366-373
• /
• 2017

In this paper, we propose a variable weighted average (VWA) learning method in order to improve the performance of the fuzzy ART neural network that has been developed by Grossberg. In a conventional method, the Fast Commit Slow Recode (FCSR), when an input pattern falls in a category, the representative pattern of the category is updated at a fixed learning rate regardless of the degree of similarity of the input pattern. To resolve this issue, a variable learning method proposes reflecting the distance between the input pattern and the representative pattern to reduce the FCSR's category proliferation issue and improve the pattern recognition rate. However, these methods still suffer from the category proliferation issue and limited pattern recognition rate due to inevitable excessive learning created by use of fuzzy AND. The proposed method applies a weighted average learning scheme that reflects the distance between the input pattern and the representative pattern when updating the representative pattern of a category suppressing excessive learning for a representative pattern. Our simulation results show that the newly proposed variable weighted average learning method (VWA) mitigates the category proliferation problem of a fuzzy ART neural network by suppressing excessive learning of a representative pattern in a noisy environment and significantly improves the pattern recognition rates.

• Journal of Internet Computing and Services
• /
• v.21 no.2
• /
• pp.39-48
• /
• 2020

Data mining techniques have been suggested to find efficiently meaningful and useful information. Especially, in the big data environments, as data becomes accumulated in several applications, related pattern mining methods have been proposed. Recently, instead of analyzing not only static data stored already in files or databases, mining dynamic data incrementally generated in a real time is considered as more interesting research areas because these dynamic data can be only one time read. With this reason, researches of how these dynamic data are mined efficiently have been studied. Moreover, approaches of mining representative patterns such as maximal pattern mining have been proposed since a huge number of result patterns as mining results are generated. As another issue, to discover more meaningful patterns in real world, weights of items in weighted pattern mining have been used, In real situation, profits, costs, and so on of items can be utilized as weights. In this paper, we analyzed weighted maximal pattern mining approaches for data generated incrementally. Maximal representative pattern mining techniques, and incremental pattern mining methods. And then, the application scenarios for analyzing the required commodity patterns in infants are presented by applying weighting representative pattern mining. Furthermore, the performance of state-of-the-art algorithms have been evaluated. As a result, we show that incremental weighted maximal pattern mining technique has better performance than incremental weighted pattern mining and weighted maximal pattern mining.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.3
• /
• pp.139-147
• /
• 2009

The memory based reasoning just stores in the memory in the form of the training pattern of the representative pattern. And it classifies through the distance calculation with the test pattern. Because it uses the techniques which stores the training pattern whole in the memory or in which it replaces training patterns with the representative pattern. Due to this, the memory in which it is a lot for the other machine learning techniques is required. And as the moreover stored training pattern increases, the time required for a classification is very much required. In this paper, We propose the EAS(Evaluation And Selection) algorithm in order to minimize memory usage and to improve classification performance. After partitioning the training space, this evaluates each partitioned space as MDL and PM method. The partitioned space in which the evaluation result is most excellent makes into the representative pattern. Remainder partitioned spaces again partitions and repeat the evaluation. We verify the performance of Proposed algorithm using benchmark data sets from UCI Machine Learning Repository.

• Journal of Internet Computing and Services
• /
• v.16 no.2
• /
• pp.77-83
• /
• 2015

Frequent pattern mining, which is one of the major areas actively studied in data mining, is a method for extracting useful pattern information hidden from large data sets or databases. Moreover, frequent pattern mining approaches have been actively employed in a variety of application fields because the results obtained from them can allow us to analyze various, important characteristics within databases more easily and automatically. However, traditional frequent pattern mining methods, which simply extract all of the possible frequent patterns such that each of their support values is not smaller than a user-given minimum support threshold, have the following problems. First, traditional approaches have to generate a numerous number of patterns according to the features of a given database and the degree of threshold settings, and the number can also increase in geometrical progression. In addition, such works also cause waste of runtime and memory resources. Furthermore, the pattern results excessively generated from the methods also lead to troubles of pattern analysis for the mining results. In order to solve such issues of previous traditional frequent pattern mining approaches, the concept of representative pattern mining and its various related works have been proposed. In contrast to the traditional ones that find all the possible frequent patterns from databases, representative pattern mining approaches selectively extract a smaller number of patterns that represent general frequent patterns. In this paper, we describe details and characteristics of pattern condensing techniques that consider the maximality or closure property of generated frequent patterns, and conduct comparison and analysis for the techniques. Given a frequent pattern, satisfying the maximality for the pattern signifies that all of the possible super sets of the pattern must have smaller support values than a user-specific minimum support threshold; meanwhile, satisfying the closure property for the pattern means that there is no superset of which the support is equal to that of the pattern with respect to all the possible super sets. By mining maximal frequent patterns or closed frequent ones, we can achieve effective pattern compression and also perform mining operations with much smaller time and space resources. In addition, compressed patterns can be converted into the original frequent pattern forms again if necessary; especially, the closed frequent pattern notation has the ability to convert representative patterns into the original ones again without any information loss. That is, we can obtain a complete set of original frequent patterns from closed frequent ones. Although the maximal frequent pattern notation does not guarantee a complete recovery rate in the process of pattern conversion, it has an advantage that can extract a smaller number of representative patterns more quickly compared to the closed frequent pattern notation. In this paper, we show the performance results and characteristics of the aforementioned techniques in terms of pattern generation, runtime, and memory usage by conducting performance evaluation with respect to various real data sets collected from the real world. For more exact comparison, we also employ the algorithms implementing these techniques on the same platform and Implementation level.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.12
• /
• pp.954-961
• /
• 2013

In this paper, we propose a new learning method using a variable learning to improve pattern recognition in the FCSR(Fast Commit Slow Recode) learning method of the Fuzzy ART. Traditional learning methods have used a fixed learning rate in updating weight vector(representative pattern). In the traditional method, the weight vector will be updated with a fixed learning rate regardless of the degree of similarity of the input pattern and the representative pattern in the category. In this case, the updated weight vector is greatly influenced from the input pattern where it is on the boundary of the category. Thus, in noisy environments, this method has a problem in increasing unnecessary categories and reducing pattern recognition capacity. In the proposed method, the lower similarity between the representative pattern and input pattern is, the lower input pattern contributes for updating weight vector. As a result, this results in suppressing the unnecessary category proliferation and improving pattern recognition capacity of the Fuzzy ART in noisy environments.

• Korean Journal of Human Ecology
• /
• v.19 no.6
• /
• pp.1045-1052
• /
• 2010

Effects of the ease of pattern on the thermal conditions of clothing were investigated through the measurement of clothing surface temperatures using infrared thermography. Four vests with different pattern ease were worn by five male subjects. Surface temperature distribution on the clothing were then examined using a thermogram to view thermo-regulating characteristics affected by the ease of pattern. Representative surface temperatures were calculated based on the percentage of the surface area within a certain temperature range and the midpoint value of the corresponding area. Representative surface temperatures matches well to the thermal insulation value measured by thermal manikin. Results indicated that representative surface temperature could be a useful quantitative value if some simple calculations were to be used alongside accurate image processing.

• Proceedings of the KIEE Conference
• /
• 2001.07a
• /
• pp.416-418
• /
• 2001

This Paper presents the 2-step load cycle of daily load curve for representative load pattern of power distribution transformer. We decide the representative load pattern of distribution transformer in domestic using the pattern classification algorithm. The K-mean method is used for the pattern classification algorithm. The acquisition equipment of field load data is utilized for 96-sample distribution transformers and the field data is used in the construction of the database for the creation of daily load pattern.

• Journal of the Korean Society of Costume
• /
• v.53 no.4
• /
• pp.131-148
• /
• 2003

Mural Painting of Koguryo Dynasty. root of Korean traditional pattern. has 5 types of pattern in its 24tombs: Fire pattern. Sun . Moon pattern, Flying angel pattern. Hill.Tree pattern, Holy animal bird Pattern. These patterns had developed specially in 3 regions that are Hwanghae-region, Pyongan-region, Jipan-region. from 4th-7th Century. A lot of fire pattern has found at Pyongan-region in 5th century. The ceiling right above 'Dori' frequently had the pattern. The pattern is organized in 'Kyoho' method. The sun.moon pattern was shown in Pyongan-region in 5th century. '3-leg bird'. representative of sun, and frog, representative of moon. were drawn in the pattern in 6th century, rabbit was added with frog in the pattern. Flying angel pattern had found most in Jipan region in 5th century. The pattern was not found in 4th century. Two types of the pattern are angels playing $$\mu$ical instruments and angels preying. The hill tree pattern was simple, antique, and immature in the beginning. the pattern had developed with real description as a landscape picture after the beginning. this pattern has been categorized as a landscape painting. Holy animal and bird patternn had placed in supporting rock between ceiling and floor with the mean of protection in after life These pattern, which were previously influenced by Chines culture, were developed with a base of Koguryo own tradition and supported establishment of a characterized Koguryo Cloture. This study will be a basic document for modern fashion industry of 21 century.