• Proceedings of the KSRS Conference
• /
• v.2
• /
• pp.635-638
• /
• 2006

Regression of conventional prediction techniques in data mining uses the model which is generated from the training step. This model is applied to new input data without any change. If this model is applied directly to time series, the rate of prediction accuracy will be decreased. This paper proposes an incremental regression for time series prediction like typhoon track prediction. This technique considers the characteristic of time series which may be changed over time. It is composed of two steps. The first step executes a fractional process for applying input data to the regression model. The second step updates the model by using its information as new data. Additionally, the model is maintained by only recent data in a queue. This approach has the following two advantages. It maintains the minimum information of the model by using a matrix, so space complexity is reduced. Moreover, it prevents the increment of error rate by updating the model over time. Accuracy rate of the proposed method is measured by RME(Relative Mean Error) and RMSE(Root Mean Square Error). The results of typhoon track prediction experiment are performed by the proposed technique IMLR(Incremental Multiple Linear Regression) is more efficient than those of MLR(Multiple Linear Regression) and SVR(Support Vector Regression).

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.597-599
• /
• 2003

Moving pattern is as a kind of sequential pattern, which can be extracted from the large volume of location history data. This sort of knowledge is very useful in supporting intelligence to the LBS or GIS. In this paper, we proposed the continuous moving pattern mining approach in LBS platform and LBS Miner. The location updates of moving objects affect the set of the rules maintained. In our approach, we use the validity thresholds that indicate the next time to invoke the incremental pattern mining. The mining system will play a major role in supporting the various LBS solutions.

• Geomechanics and Engineering
• /
• v.36 no.3
• /
• pp.303-316
• /
• 2024

Seismic records are composed of mainshock and a series of aftershocks which often result in the incremental damage to underground structures and bring great challenges to the rescue of post-disaster and the repair of post-earthquake. In this paper, the repetition method was used to construct the mainshock-aftershocks sequence which was used as the input ground motion for the analysis of dynamic time history. Based on the Daikai station, the two-dimensional finite element model of soil-station was established to explore the failure process of station under different seismic precautionary intensities, and the concept of incremental damage of station was introduced to quantitatively analyze the damage condition of structure under the action of mainshock and two aftershocks. An arc rubber bearing was proposed for the shock absorption. With the arc rubber bearing, the mode of the traditional column end connection was changed from "fixed connection" to "hinged joint", and the ductility of the structure was significantly improved. The results show that the damage condition of the subway station is closely related to the magnitude of the mainshock. When the magnitude of the mainshock is low, the incremental damage to the structure caused by the subsequent aftershocks is little. When the magnitude of the mainshock is high, the subsequent aftershocks will cause serious incremental damage to the structure, and may even lead to the collapse of the station. The arc rubber bearing can reduce the damage to the station. The results can offer a reference for the seismic design of subway stations under the action of mainshock-aftershocks.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.44 no.1
• /
• pp.71-79
• /
• 2007

Recent advances in the internet infrastructure have resulted in a large number of huge Web sites and portals worldwide. These Web sites are being visited by various types of users in many different ways. Among all the web page access sequences from different users, some of them occur so frequently that may need an attention from those who are interested. We call them frequent access patterns and access sequences that can be frequent the candidate patterns. Since these candidate patterns play an important role in the incremental Web mining, it is important to efficiently generate, add, delete, and search for them. This thesis presents a novel tree structure that can efficiently store the candidate patterns and a related set of algorithms for generating the tree structure, adding new patterns, deleting unnecessary patterns, and searching for the needed ones. The proposed tree structure has a kind of the 3 dimensional link structure and its nodes are layered.

• The KIPS Transactions:PartB
• /
• v.10B no.3
• /
• pp.265-272
• /
• 2003

In this paper, we propose a novel improved algorithm for the rectangular decomposition technique for the purpose of performing data mining from large scaled database in a dynamic environment. The proposed algorithm performs the rectangular decompositions by transforming a binary matrix to bipartite graph and finding bicliques from the transformed bipartite graph. To demonstrate its effectiveness, we compare the proposed one which is based on the newly derived mathematical properties with those of other methods with respect to the classification rate, the number of rules, and complexity analysis.

• Journal of KIISE:Databases
• /
• v.29 no.1
• /
• pp.1-14
• /
• 2002

Association rule discovery is a method of mining for the associated item set on large databases based on support and confidence threshold. The discovered association rules can be applied to the marketing pattern analysis in E-commerce, large shopping mall and so on. The association rule discovery makes multiple scan over the database storing large transaction data, thus, the algorithm requiring very high overhead might not be useful in real-time association rule discovery in dynamic environment. Therefore this paper proposes an active candidate set management model based on trigger and incremental update mechanism to overcome non-realtime limitation of association rule discovery. In order to implement the proposed model, we not only describe an implementation model for incremental updating operation, but also evaluate the performance characteristics of this model through the experiment.

• Journal of KIISE:Databases
• /
• v.37 no.5
• /
• pp.221-227
• /
• 2010

Web access sequence mining can discover the frequently accessed web pages pursued by users. Utility-based web access sequence mining handles non-binary occurrences of web pages and extracts more useful knowledge from web logs. However, the existing utility-based web access sequence mining approach considers web access sequences from the very beginning of web logs and therefore it is not suitable for mining data streams where the volume of data is huge and unbounded. At the same time, it cannot find the recent change of knowledge in data streams adaptively. The existing approach has many other limitations such as considering only forward references of web access sequences, suffers in the level-wise candidate generation-and-test methodology, needs several database scans, etc. In this paper, we propose a new approach for high utility web access sequence mining over data streams with a sliding window method. Our approach can not only handle large-scale data but also efficiently discover the recently generated information from data streams. Moreover, it can solve the other limitations of the existing algorithm over data streams. Extensive performance analyses show that our approach is very efficient and outperforms the existing algorithm.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.5 s.311
• /
• pp.17-28
• /
• 2006

In this paper, we investigate a problem of updating sequential patterns when new transactions are added to a database. We present an efficient updating algorithm for sequential pattern mining that incrementally updates added transactions by reusing frequent patterns found previously. Our performance study shows that this method outperforms both AprioriAll and PrefixSpan algorithm which updates from scratch, since our method can efficiently utilize reduced candidate sets which result from the incremental updating technique.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.23 no.54
• /
• pp.1-11
• /
• 2000

This study suggests the partition algorithm for updating the discovered association rules in large database, because a database may allow frequent or occasional updates, and such update may not only invalidate some existing strong association rules, but also turn some weak rules into strong ones. the Partition algorithm updates strong association rules efficiently in the whole update database reuseing the information of the old large itemsets. Partition algorithms that is suggested in this study scans an incremental database in view of the fact that it is difficult to find the new set of large itemset in the whole updated database after an incremental database is added to the original database. This method of generating large itemsets is different from that of FUP(Fast Update) and KDP(Kim Dong Pil)

• Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
• /
• 2006.11a
• /
• pp.311-314
• /
• 2006

This paper concerns about total dynamic analysis of integrated mining system. This system consists of vertical steel pipe, intermediate buffer station, flexible pipe and self-propelled miner. The self-propelled miner and buffer are assumed as rigid-body of 6-dof. Discrete models of vertical steel pipe and flexible pipe are adopted, which are obtained by means of lumped-parameter method. The motion of mining vessel is not considered. Instead, the motion of mining vessel is taken into account in form of various boundary conditions (e.g. forced excitation in slow motion and/or fast oscillation and so on). A terramechanics model of extremely soft cohesive soil is applied to the self-propelled miner. The hydrodynamic forces and moments are included in the dynamic models of vehicle and lifting pipe system. Hinged and fixed constraints are used to define the connections between sub-systems (vertical steel pipe, buffer, flexible pipe, miner). Equations of motion of the coupled model are derived with respect to the each local coordinates system. Four Euler parameters are used to express the orientations of the sub-systems. To solve the equations of motion of the total dynamic model, an incremental-iterative formulation is employed. Newmark-b method is used for time-domain integration. The total dynamic responses of integrated mining system are investigated.