• Journal of Intelligence and Information Systems
• /
• v.17 no.4
• /
• pp.109-130
• /
• 2011

One of the major problems in the area of data mining is the size of the data, as most data set has huge volume these days. Streams of data are normally accumulated into data storages or databases. Transactions in internet, mobile devices and ubiquitous environment produce streams of data continuously. Some data set are just buried un-used inside huge data storage due to its huge size. Some data set is quickly lost as soon as it is created as it is not saved due to many reasons. How to use this large size data and to use data on stream efficiently are challenging questions in the study of data mining. Stream data is a data set that is accumulated to the data storage from a data source continuously. The size of this data set, in many cases, becomes increasingly large over time. To mine information from this massive data, it takes too many resources such as storage, money and time. These unique characteristics of the stream data make it difficult and expensive to store all the stream data sets accumulated over time. Otherwise, if one uses only recent or partial of data to mine information or pattern, there can be losses of valuable information, which can be useful. To avoid these problems, this study suggests a method efficiently accumulates information or patterns in the form of rule set over time. A rule set is mined from a data set in stream and this rule set is accumulated into a master rule set storage, which is also a model for real-time decision making. One of the main advantages of this method is that it takes much smaller storage space compared to the traditional method, which saves the whole data set. Another advantage of using this method is that the accumulated rule set is used as a prediction model. Prompt response to the request from users is possible anytime as the rule set is ready anytime to be used to make decisions. This makes real-time decision making possible, which is the greatest advantage of this method. Based on theories of ensemble approaches, combination of many different models can produce better prediction model in performance. The consolidated rule set actually covers all the data set while the traditional sampling approach only covers part of the whole data set. This study uses a stock market data that has a heterogeneous data set as the characteristic of data varies over time. The indexes in stock market data can fluctuate in different situations whenever there is an event influencing the stock market index. Therefore the variance of the values in each variable is large compared to that of the homogeneous data set. Prediction with heterogeneous data set is naturally much more difficult, compared to that of homogeneous data set as it is more difficult to predict in unpredictable situation. This study tests two general mining approaches and compare prediction performances of these two suggested methods with the method we suggest in this study. The first approach is inducing a rule set from the recent data set to predict new data set. The seocnd one is inducing a rule set from all the data which have been accumulated from the beginning every time one has to predict new data set. We found neither of these two is as good as the method of accumulated rule set in its performance. Furthermore, the study shows experiments with different prediction models. The first approach is building a prediction model only with more important rule sets and the second approach is the method using all the rule sets by assigning weights on the rules based on their performance. The second approach shows better performance compared to the first one. The experiments also show that the suggested method in this study can be an efficient approach for mining information and pattern with stream data. This method has a limitation of bounding its application to stock market data. More dynamic real-time steam data set is desirable for the application of this method. There is also another problem in this study. When the number of rules is increasing over time, it has to manage special rules such as redundant rules or conflicting rules efficiently.

• Korean Journal of Microbiology
• /
• v.53 no.4
• /
• pp.286-291
• /
• 2017

In eukaryotic cells, histone modification is an important mechanism to regulate the chromatin structure. The methylation of the fourth lysine on histone H3 (H3K4) by Set1 complex is one of the various well-known histone modifications. Set1 complex has seven subunits including Swd2, which is known to be important for H2B ubiquitination dependent on H3K4 methylation. Swd2 was reported to regulate Set1's methyltransferase activity by binding to near RNA recognition motif (RRM) domain of Set1 and to act as a component of CPF (Cleavage and Polyadenylation Factors) complex involved in RNA 3' end processing. According to the recent reports, two functions of Swd2 work independently of each other and the lethality of Swd2 knockout strain was known to be caused by its function as a component of CPF complex. In this study, we found that Swd2 could influence the Set1's stability as well as histone methyltransferase activity through the association with RRM domain of Set1. Also, we found that ${\Delta}swd2$ mutant bearing truncated-Set1, which cannot interact with Swd2, lost its lethality and grew normally. These results suggest that the dual functions of Swd2 in H3K4 methylation and RNA 3' end processing are not independent in Saccharomyces cerevisiae.

• Communications of the Korean Mathematical Society
• /
• v.24 no.2
• /
• pp.227-237
• /
• 2009

In this paper, we introduce the Denjoy-Pettis integral of set-valued mappings and investigate some properties of the set-valued Denjoy-Pettis integral. Finally we obtain the Dominated Convergence Theorem and Monotone Convergence Theorem for set-valued Denjoy-Pettis integrable mappings.

• Journal of the Chungcheong Mathematical Society
• /
• v.16 no.2
• /
• pp.1-10
• /
• 2003

We compare a self-similar measure on a self-similar Cantor set with a quasi-self-similar measure on a deranged Cantor set. Further we study some properties of a self-similar measure on a self-similar Cantor set.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1996.10a
• /
• pp.45-49
• /
• 1996

In this paper, we will define Choquet integrals of set-valued functions. Then, we show some properties of Choquet integrals of set-valued functions.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.5B
• /
• pp.274-286
• /
• 2005

In this paper, we propose a new power-efficient and reliable connected dominating set based routing protocol in the mobile ad hoc networks. Gateway nodes must be elected in consideration of residual energy and mobility because frequent reconstruction of connected dominating set result in transmission error for route losses. If node density is high, it results in a lot of contentions and more delays for network congestion. Therefore, in this paper, we propose a new construction method of connected dominating set that supports reliable and efficient data transmission through minimizing reconstruction of connected dominating set by delaying neighbor set advertisement message broadcast in proportion to weighted sum of residual energy, mobility, and the number of neighbor nodes. The performance of the proposed protocol is proved by simulation of various conditions.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.1
• /
• pp.79-86
• /
• 2003

A new quantization constraint set based on the theory of Projection onto Convex Set(POCS) is proposed to reduce blocking artifact appearing in block-coded images. POCS-based postprocessing for alleviating the blocking artifact consists of iterative projections onto smoothness constraint set and quantization constraint set, respectively. In general, the conventional quantization constraint set has the maximum size of range where original image data can be included, therefore over-blurring of restored image is unavoidable as iteration proceeds. The projection onto the proposed quantization constraint set can reduce blocking artifact as well as maintain the clearness of the decoded image, since it controls adaptively the size of quantization constraint set according to the DCT coefficients. Simulation results using the proposed quantization constraint set as a substitute for conventional quantization constraint set show that the blocking artifact of the decoded image can be reduced by the small number of iterations, and we know that the postprocessed image maintains the distinction of the decoded image.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.3
• /
• pp.498-503
• /
• 2005

As important device that decide output load in superannuated thermoelectric power plant which do Turbine Load Set Motor device. This generation of electric power system operated Set Up Range Motor according to Set Up value that operator manufactures by hand circumvolve, and generation of electric power output load derision is consisted by internal action including Motor Therefore, in this research passively output load operated Turbine Motor Drive equipment that can have existing Turbine Load Set Motor Performance developing Digital Drive Unit device design. Also control algorithm implementation and existing Turbine Load Set Motor Drive and connection possibility through designed controlling system to connect basis function that decide development output load with Digital Drive Unit that designed also with existing Motor Drive Unit and can be operated.

• Journal of the Korean Society for information Management
• /
• v.11 no.1
• /
• pp.81-102
• /
• 1994

Accordmg to the development of various information retneval system suitable for Korean database, many researchers have realized the need of R Test ColleAon which can be r d y used for evaluatmg a retneval system. Therefore, This study developed the TEST SET whch helps ob&vely evaluatmg the retrieval performance of an Hangul Automatic Indexer or Korean Information Retrieval System. The developed Test Set has four files such as: 1) Korean Document Set( * . all): 2) Natural Language Query Set(KTsetnq1): 3) Boolean Query Set(Ktset.bq1): 4) Query-Relevance Judgment Set ( KTsetrel) .

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.9
• /
• pp.193-201
• /
• 2020

In this study, we developed a simulation app that performs the Test-and-Set algorithm. The test-and-set algorithm is a highly difficult algorithm, so this simulation app was created for learners who have difficulty understanding it. Learners who want to understand the Test-and-Set algorithm gather to form a team, and use this simulation app to discuss and practice, and these teams can practice at the same time. The test-and-set, which is assumed to be a machine language, is not interrupted by using a queue, and it can be seen that the configured simulation app performs well in all three conditions of 'mutual exclusion', 'progress', and 'bounded waiting' that must be solved in the critical area problem.