• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.454-457
• /
• 2005

Mining frequent patterns in transaction databases, time-series databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous studies adopt an Apriori-like candidate set generation-and-test approach. However, candidate set generation is still costly, especially when there exist prolific patterns and/or long patterns. And calendar based on temporal association rules proposes the discovery of association rules along with their temporal patterns in terms of calendar schemas, but this approach is also adopt an Apriori-like candidate set generation. In this paper, we propose an efficient temporal frequent pattern mining using TFP-tree (Temporal Frequent Pattern tree). This approach has three advantages: (1) this method separates many partitions by according to maximum size domain and only scans the transaction once for reducing the I/O cost. (2) This method maintains all of transactions using FP-trees. (3) We only have the FP-trees of I-star pattern and other star pattern nodes only link them step by step for efficient mining and the saving memory. Our performance study shows that the TFP-tree is efficient and scalable for mining, and is about an order of magnitude faster than the Apriori algorithm and also faster than calendar based on temporal frequent pattern mining methods.

• The KIPS Transactions:PartD
• /
• v.16D no.2
• /
• pp.169-176
• /
• 2009

Rule discovery is an operation that discovers patterns frequently occurring in a given database. Rule discovery makes it possible to find useful rules from a stock database, thereby recommending buying or selling times to stock investors. In this paper, we discuss storage structures for efficient processing of queries in a system that recommends stock investments. First, we propose five storage structures for efficient recommending of stock investments. Next, we discuss their characteristics, advantages, and disadvantages. Then, we verify their performances by extensive experiments with real-life stock data. The results show that the histogram-based structure improves the query performance of the previous one up to about 170 times.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.23 no.61
• /
• pp.51-58
• /
• 2000

Discovery of association rules has been used useful in many fields, especially in the fields of the inventory display, catalog design and cross selling. In previous works, all transactions In the database are treated uniformly. In this paper, we present a method for partitioning transactions in the database using time weights. Transactions are assigned different weights as time goes on. Examples show that these method provides purchasing patterns in the database as well as finding association rules.

• Journal of KIISE:Information Networking
• /
• v.31 no.6
• /
• pp.573-581
• /
• 2004

Recently, the rapid growth of Internet technology and the deployment of high speed networks make many kinds of multimedia services possible. Preexisting multimedia services are designed based on the client/server model which has the problems such as the network failure and the low speed communication due to the high load on the central server. In order to solve these problems, peer-to-peer networks are introduced and expanded through Internet environments. In this paper, we propose a pure peer-to-peer network based resource discovery mechanism for multimedia services. In the proposed scheme, each host maintains the location information of resources which are recently requested by other hosts as well as that oi the replicas of local resources. The proposed scheme has the faster response time and incurs the smaller traffic than the preexisting discovery schemes in pure peer-to-peer network environments. Also, by decentralizing the location information and differentiating the reply path, our proposed scheme can solve the search result loss problem that occurs when the network is unsettled.

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2004.11a
• /
• pp.181-190
• /
• 2004

The docking and in silico ligand screening procedures can select small sets of lead -like candidates from large libraries of either commercially or synthetically available compounds; however, the vast number of such molecules make the potential size of this task enormous. To accelerate the discovery of drugs to inhibit several targets, we have exploited massively distributed computing to screen compound libraries virtually. The Korea@HOME project was launched in Feb. 2002, and one year later, more than 1200 PC's have been recruited. This has created a 31 -gigaflop machine that has already provided more than 1400 hours of CPU time. It has all owed databases of millions of compounds to be screened against protein targets in a matter of days. Now, the virtual screening software suitable for distributed environments is developed by BMD. It has been evaluated in terms of the accuracy of the scoring function and the search algorithm for the correct binding mode.

• The Journal of Society for e-Business Studies
• /
• v.13 no.2
• /
• pp.213-223
• /
• 2008

The efficient discovery of services from a large scale collection of services has become an important issue[7, 24]. We studied a syntactic method for Web service discovery, rather than a semantic method. We regarded a service discovery as a retrieval problem on the proprietary XML formats, which were service descriptions in a registry DB. We modeled services and queries as probabilistic values and devised similarity-based retrieval techniques. The benefits of our way are follows. First, our system supports ranked service retrieval by keyword search. Second, we considers both of UDDI data and WSDL definitions of services amid query evaluation time. Last, our technique can be easily implemented on the off-theshelf DBMS and also utilize good features of DBMS maintenance.

• Journal of Korean Classical Literature and Education
• /
• no.33
• /
• pp.83-120
• /
• 2016

This discussion presents the results obtained from the implementation of a self-discovery career program using photo diaries and picture books. The program was conducted with 34 college students in 2015 during the 2nd semester of the liberal arts class. The program guided college students, who are faced with career decisions before employment, with information that helped them to understand their individual characteristics. Therefore, they could identify the jobs they aspired for or would be successful in based on that information. At this time, we believed that literature that is based on the essence of human life would be helpful. As a result, college students understood their personality type through the 1 st, 2nd, and 3rd stages of the self-development process and recognized the aspects of themselves which they had previously misunderstood, which they did not know, and which they already knew. This aided them in their career exploration. Therefore, the results showed that although self-discovery career programs based on literature are in their nascent stage, they facilitate college students in their career exploration.

• Journal of Korean Philosophical Society
• /
• v.148
• /
• pp.157-181
• /
• 2018

The aim of this essay is to identify elements of methodologies to investigate the development of Newtonian dynamics. This methodology involves the transformation and synthesis of preceding theories. My essay attempts to confirm my assertion by analyzing historical case of Newton's discovery of his dynamics. While discovering his mechanistic theory, Newton reconstructed theoretical concepts and structures of intellectual predecessors, such as Aristotle, Descartes, Galileo, and Kepler. Newton's synthesis was possible only after carefully reconstructing the appropriate and useful ideas of previous natural philosophers' ideas. As a result, Newtonian dynamics are completed with these modified and integrated concepts incorporated into Newton's law of motion and space-time concepts. This study consists of two parts. First, Lakatos' research program has been applied in order to analyze the structure of Newtonian dynamics. Second, the aforementioned methodologies of discovery are distilled from the case study.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.5
• /
• pp.701-708
• /
• 2021

In this paper, I investigate the performances of the discovery and the message transmission of the DDS (Data Distribution Service) included the security function. The DDS serves the communication protocol, a publication- subscription method, for the real-time communication in the distributed system. The publication-subscription method is used in the various area in terms of defence, traffic and medical due to the strength such as a performance, scailability and availability. Nowadays, many communication standard has included and re-defined the security function to prepare from dramatically increased a threat of the security, the DDS also publishes the standard included the security function. But it had been not researched that the effect of increased a overhead for legacy systems due to the using of the security DDS function. The experimental results show that the comparative performance of legacy DDS and security DDS in terms of the discovery and the message transmission.

• KNOM Review
• /
• v.23 no.1
• /
• pp.1-9
• /
• 2020

With the rapid development of science and technology in recent years, the network environment are growing, and a huge amount of traffic is generated. In particular, the development of 5G networks and edge computing will accelerate this phenomenon. However, according to these trends, network malicious behaviors and traffic overloads are also frequently occurring. To solve these problems, network administrators need to build a network management system to implement a high-speed network and should know exactly about the connection topology of network devices through the network management system. However, the existing network topology discovery method is inefficient because it is passively managed by an administrator and it is a time consuming task. Therefore, we proposes a method of network topology discovery according to the amount of in and out network traffic. The proposed method is applied to a real network to verify the validity of this paper.