• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.21 no.45
• /
• pp.101-112
• /
• 1998

Data mining, which is also referred to as knowledge discovery in database, means a process of nontrivial extraction of implicit, previously unknown and potentially useful information (such as knowledge rules, constraints, regularities) from data in databases. The discovered knowledge can be applied to information management, decision making, and many other applications. In this paper, a new data mining problem, discovering sequential patterns, is proposed which is to find all sequential patterns using sampling method. Recognizing that the quantity of database is growing exponentially and transaction database is frequently updated, sampling method is a fast algorithm reducing time and cost while extracting the trend of customer behavior. This method analyzes the fraction of database but can in general lead to results of a very high degree of accuracy. The relaxation factor, as well as the sample size, can be properly adjusted so as to improve the result accuracy while minimizing the corresponding execution time. The superiority of the proposed algorithm will be shown through analyzing accuracy and efficiency by comparing with Apriori All algorithm.

• Journal of Intelligence and Information Systems
• /
• v.1 no.2
• /
• pp.57-71
• /
• 1995

This paper presents a rule extraction algorithm RE to acquire explicit rules from trained neural networks. The validity of extracted rules has been confirmed using 6 different data sets. Based on experimental results, we conclude that extracted rules from RE predict more accurately and robustly than neural networks themselves and rules obtained from an inductive learning algorithm do. Rule extraction algorithm for neural networks are important for incorporating knowledge obtained from trained networks into knowledge based systems. In lieu of this, the proposed RE algorithm contributes to the trend toward developing hybrid and versatile knowledge-based system including expert systems and knowledge-based decision su, pp.rt systems.

• International journal of advanced smart convergence
• /
• v.7 no.4
• /
• pp.75-83
• /
• 2018

Predictive IoT Sensor Algorithm is a technique of data science that helps computers learn from existing data to predict future behaviors, outcomes, and trends. This algorithm is a cloud predictive analytics service that makes it possible to quickly create and deploy predictive models as analytics solutions. Sensors and computers collect and analyze data. Using the time series prediction algorithm helps to predict future temperature. The application of this IoT in industrial environments like power plants and factories will allow organizations to process much larger data sets much faster and precisely. This rich source of sensor data can be networked, gathered and analyzed by super smart software which will help to detect problems, work more productively. Using predictive IoT technology - sensors and real-time monitoring - can help organizations exactly where and when equipment needs to be adjusted, replaced or how to act in a given situation.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.26 no.4
• /
• pp.241-248
• /
• 2021

A battery state-of-health (SOH) estimation algorithm using a machine learning-based linear regression method is proposed for estimating battery aging. The proposed algorithm analyzes the change trend of the open-circuit voltage (OCV) curve, which is a parameter related to SOH. At this time, a section with high linearity of the SOH and OCV curves is selected and used for SOH estimation. The SOH of the aged battery is estimated according to the selected interval using a machine learning-based linear regression method. The performance of the proposed battery SOH estimation algorithm is verified through experiments and simulations using battery packs for electric vehicles.

• Journal of Biomedical Engineering Research
• /
• v.27 no.3
• /
• pp.131-141
• /
• 2006

A visual decision by clinical experts like physical therapists is a best way to detect onset and offset time of muscle activation. The current computer-based algorithms are being researched toward similar results of clinical experts. The new algorithm in this paper has an ability to extract a trend from noisy input data. Kalman smoother is used to recognize the trend to be revealed from disorderly signals. Histogram of smoothed signals by Kalman smoother has a clear boundary to separate muscle contractions from relaxations. To verify that the Kalman smoother algorithm is reliable way to detect onset and offset time of muscle contractions, the algorithm of Robert P. Di Fabio (published in 1987) is compared with Kalman smoother. For 31 templates of subjects, an average and a standard deviation are compared. The average of errors between Di Fabio's algorithm and experts is 109 milliseconds in onset detection and 142 milliseconds in offset detection. But the average between Kalman smoother and experts is 90 and 137 milliseconds in each case. Moreover, the standard deviations of errors are 133 (onset) and 210 (offset) milliseconds in Di Fabio's one, but 48 (onset) and 55 (offset) milliseconds in Kalman smoother. As a result, the Kalman smoother is much closer to determinations of clinical experts and more reliable than Di Fabio's one.

• Journal of KIISE:Software and Applications
• /
• v.36 no.3
• /
• pp.236-243
• /
• 2009

With advances in topic detection and tracking(TDT), automatic trend analysis from a collection of time-stamped documents, like patents, news papers, and blog pages, is a challenging research problem. Past research in this area has mainly focused on showing a trend line over time of a given concept by measuring the strength of trend-associated term frequency information. for detection of emerging trends, either a simple criterion such as frequency change was used, or an overall comparison was made against a training data. We note that in order to show most salient trends detected among many possibilities, it is critical to devise a ranking function. To this end, we define four properties(change, persistency, stability and volume) of trend lines drawn from frequency information, to quantify various aspects of trends, and propose a method by which trend lines can be ranked. The properties are examined individually and in combination in a series of experiments for their validity using the ranking algorithm. The results show that a judicious combination of the four properties is a better indicator for salient trends than any single criterion used in the past for ranking or detecting emerging trends.

• Proceedings of the KIEE Conference
• /
• 2004.07c
• /
• pp.1930-1932
• /
• 2004

SOM(Self Organizing Map) algorithm which has some advantages such as data accumulation ability and the degradation trend trace ability was compared with conventionally used BP(Back Propagation) algorithm. For the purpose, partial discharge data were acquired and analysed from the artificial defects in GIS. As a result, basically the pattern recognition rate of BP algorithm was found out to be better than that of SOM algorithm. However, SOM algorithm showed a great on-site-applicability such as ability of suggesting new-pattern-possibility. Therefore, through increasing pattern recognition rate it is possible to apply SOM algorithm to partial discharge analysis. Also, for the image processing method it is required the normalization of the PRPDA graph. However, due to the normalization both BP and SOM algorithm have shown worse results, so that it is required further study to solve the problem.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.4
• /
• pp.1095-1109
• /
• 2022

Along with the popularity of GPS system and smart cell phone, trajectories of pedestrians or vehicles are recorded at any time. The great amount of works had been carried out in order to discover traffic paradigms or other regular patterns buried in the huge trajectory dataset. The core of the mining algorithm is how to evaluate the similarity, that is, the "distance", between trajectories appropriately, then the mining results will be accordance to the reality. Euclidean distance is commonly used in the lots of existed algorithms to measure the similarity, however, the trend of trajectories is usually ignored during the measurement. In this paper, a novel segment transform distance (STD) algorithm is proposed, in which a rule system of line segment transformation is established. The similarity of two-line segments is quantified by the cost of line segment transformation. Further, an improvement of STD, named ST-DTW, is advanced with the use of the traditional method dynamic time warping algorithm (DTW), accelerating the speed of calculating STD. The experimental results show that the error rate of ST-DTW algorithm is 53.97%, which is lower than that of the LCSS algorithm. Besides, all the weights of factors could be adjusted dynamically, making the algorithm suitable for various kinds of applications.

• KIEAE Journal
• /
• v.17 no.5
• /
• pp.77-86
• /
• 2017

Purpose: Because of the growing concern over fossil fuel use and increasing demand for greenhouse gas emission reduction since the 1990s, the building energy analysis field has produced various types of methods, which are being applied more often and broadly than ever. A lot of research products have been actively proposed in the area of the building energy simulation for over 50 years around the world. However, in the last 20 years, there have been only a few research cases where the trend of building energy analysis is examined, estimated or compared. This research aims to investigate a trend of the building energy analysis by focusing on methodology and characteristics of each method. Method: The research papers addressing the building energy analysis are classified into two types of method: engineering analysis and algorithm estimation. Especially, EPG(Energy Performance Gap), which is the limit both for the existing engineering method and the single algorithm-based estimation method, results from comparing data of two different levels- in other words, real time data and simulation data. Result: When one or more ensemble algorithms are used, more accurate estimations of energy consumption and performance are produced, and thereby improving the problem of energy performance gap.

• The Korean Journal of Applied Statistics
• /
• v.17 no.3
• /
• pp.459-473
• /
• 2004

It has well known that an exhaustive search algorithm suggested by Breiman et. a1.(1984) has a trend to select the variable having relatively many possible splits as an splitting rule. We propose an algorithm to overcome this variable selection bias problem and then construct unbiased regression trees based on the algorithm. The proposed algorithm runs two steps of selecting a split variable and determining a split rule for binary split based on the split variable. Simulation studies were performed to compare the proposed algorithm with Breiman et a1.(1984)'s CART(Classification and Regression Tree) in terms of degree of variable selection bias, variable selection power, and MSE(Mean Squared Error). Also, we illustrate the proposed algorithm with real data sets.