• Journal of the Korean Society for information Management
• /
• v.9 no.2
• /
• pp.43-79
• /
• 1992

This study proposes a Korean aut.omatic abstracting system in microbiology by applying Case Grammar, Concept Dependency Grammar, and Unification-Based Grammar(PATR- I[. DCG). The sample abstracts are analyzesd to clarify the ideal structure of abstract-a purpose sentence as first sentcnce, 2-3 method and result sentences as middle sentences, and a conclusion sentence as last sentences. To extract and refine the representative sentences constructing an automated abstract requires tht. rules giving the role features to nouns. And t.he rules rearranging the extracted sentences and the rules generating the abstract sentences arc also required. Evaluat.ing the effic~ency of this system. the method used in this automatic abstracting system needs thc more precise role features and the rules of sentence generation to reach the level of the author abstracts.

• Journal of the Korean Data and Information Science Society
• /
• v.23 no.6
• /
• pp.1127-1135
• /
• 2012

Association rule mining is the method to quantify the relationship between each set of items in a large database. One of the well-studied problems in data mining is exploration for association rules. There are three primary quality measures for association rule, support and confidence and lift. We generate some association rules using confidence. Confidence is the most important measure of these measures, but it is an asymmetric measure and has only positive value. Thus we can face with difficult problems in generation of association rules. In this paper we apply the similarity measures by probabilistic interestingness measure to find a solution to this problem. The comparative studies with support, two confidences, lift, and some similarity measures by probabilistic interestingness measure are shown by numerical example. As the result, we knew that the similarity measures by probabilistic interestingness measure could be seen the degree of association same as confidence. And we could confirm the direction of association because they had the sign of their values.

• Journal of the Korean Data and Information Science Society
• /
• v.22 no.6
• /
• pp.1113-1121
• /
• 2011

Recently, a variety of data mining techniques has been applied in various fields like healthcare, insurance, and internet shopping mall. Association rule mining is a popular and well researched method for discovering interesting relations among large set of data items. Association rule mining is the method to quantify the relationship between each set of items in very huge database based on the association thresholds. There are three primary quality measures for association rules; support and confidence and lift. In this paper we consider some similarity measures with negative co-occurrence frequencies which is widely used in cluster analysis or multi-dimensional analysis as association thresholds. The comparative studies with support, confidence and some similarity measures are shown by numerical example.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10a
• /
• pp.226-228
• /
• 2004

베이지안 네트워크는 불확실한 상황을 모델링하기 위한 확률 기반의 모델이다. 베이지안 네트워크의 구조를 자동 학습하기 위한 연구가 많이 있었고, 최근에는 진화 알고리즘을 이용한 연구가 많이 진행되고 있다. 그러나 대부분은 마지막 세대의 가장 좋은 개체만을 이용하고 있다. 시스템이 요구하는 다양한 요구조건을 하나의 적합도 평가 수식으로 나타내기 어렵기 때문에, 마지막 세대의 가장 좋은 개체는 종종 편향되거나 변화하는 환경에 덜 적응적일 수 있다. 본 논문에서는 적합도 공유 방법으로 다양한 베이지안 네트워크를 생성하고, 이를 베이즈 규칙을 통해 결합하여 변화하는 환경에 적응적인 추론 모델을 구축할 수 있는 방법을 제안한다. 성능 평가를 위해 ALARM 네트워크에서 인공적으로 생성한 데이터를 이용한 구조 학습 및 추론 실험을 수행하였다. 다양한 조건에서 학습된 네트워크를 실험한 결과, 제안한 방법이 변화하는 환경에서 더욱 강건하고 적응적인 모델을 생성할 수 있음을 확인한 수 있었다.

• Journal of The Korean Association For Science Education
• /
• v.23 no.3
• /
• pp.215-228
• /
• 2003

The present study is to analyze the arguments about the generation of declarative scientific-knowledge in the philosophy of science and invent a structured model of the process of scientific-knowledge generation with the types of the generated scientific-knowledge. The invented model shows that scientific-knowledge generation is a distinctive process with the processes of inductive, abductive, and deductive thinking. Furthermore, inductive process is included with observation, which is consisted of simple observation and operative observation, and rule-discovery which is involved with the processes of commonness discovery, classification, pattern discovery, and hierarchical relationship. Also, abductive process has two components. One component generates question and second component generates hypothesis in which the process consists of representing question situation, identifying experienced situation, identifying causal explicans, and generating hypothetical explicans. Finally, deductive process is involved with logical inventing test method and evaluation criteria, concrete inventing test method and evaluation criteria, evaluating hypothesis, and making conclusion.

• The KIPS Transactions:PartD
• /
• v.11D no.5
• /
• pp.1189-1196
• /
• 2004

It is a major concern of e-shopping mall managers to satisfy a variety of customer's desire by recommending a proper product to the perspective purchaser. Customer information like customer's fondness, age, gender, etc. in shopping has not been used effectively for the customers or the suppliers. Conventionally, e-shopping mall managers have recommended specific items of products to their customers without considering thoroughly in a customer point of view. This study introduces the ways of a choosing and recommending of products using case-based reasoning and rule-based reasoning for customer themselves or others. A similarity measure between one member's idiosyncrasy and the other members' is developed based on the rule base and the case base. The case base is improved for the system intelligence by recognizing and learning the changes of customer's desire and shopping trend.

• Journal of the Korean Data and Information Science Society
• /
• v.28 no.1
• /
• pp.49-56
• /
• 2017

Among the techniques for analyzing big data, the association rule mining is a technique for searching for relationship between some items using various relevance evaluation criteria. This associative rule scheme is based on the direction of rule creation, and there are positive, negative, and inverse association rules. The purpose of this paper is to investigate the applicability of various types of relatively causal strength measures to the types of association rules from the point of view of interestingness measure. We also clarify the relationship between various types of confidence measures. As a result, if the rate of occurrence of the posterior item is more than 0.5, the first measure ($RCS_{IJ1}$) proposed by Good (1961) is more preferable to the first measure ($RCS_{LR1}$) proposed by Lewis (1986) because the variation of the value is larger than that of $RCS_{LR1}$, and if the ratio is less than 0.5, $RCS_{LR1}$ is more preferable to $RCS_{IJ1}$.

• KIISE Transactions on Computing Practices
• /
• v.23 no.3
• /
• pp.183-187
• /
• 2017

Smart phone users prefer fast reading and texting. Hence, users frequently use abbreviated sequences of words and phrases. Nowadays, abbreviations are widely used from chat terms to technical terms. Therefore, gathering abbreviations would be helpful to many services, including information retrieval, recommendation system, and so on. However, manually gathering abbreviations needs to much effort and cost. This is because new abbreviations are continuously generated whenever a new material such as a TV program or a phenomenon is made. Thus it is required to generate of abbreviations automatically. To generate Korean abbreviations, the existing methods use the rule-based approach. The rule-based approach has limitations, in that it is unable to generate irregular abbreviations. Another problem is to decide the correct abbreviation among candidate abbreviations generated rules. To address the limitations, we propose a method of generating Korean abbreviations automatically using sequence-to-sequence learning in this paper. The sequence-to-sequence learning can generate irregular abbreviation and does not lead to the problem of deciding correct abbreviation among candidate abbreviations. Accordingly, it is suitable for generating Korean abbreviations. To evaluate the proposed method, we use dataset of two type. As experimental results, we prove that our method is effective for irregular abbreviations.

• The Korean Journal of Applied Statistics
• /
• v.17 no.1
• /
• pp.135-144
• /
• 2004

We propose a reproducibility (validity) assessment procedure of K-means cluster analysis by randomly partitioning the data set into three parts, of which two subsets are used for developing clustering rules and one subset for testing consistency of clustering rules. Also, as an alternative to Rand index and corrected Rand index, we propose an entropy-based consistency measure between two clustering rules, and apply it to determination of the number of clusters in K-means clustering.

• Journal of Intelligence and Information Systems
• /
• v.8 no.2
• /
• pp.91-103
• /
• 2002

A collaborative filtering which supports personalized services of users has been common use in existing web sites for increasing the satisfaction of users. A collaborative filtering is demanded that items are estimated more than specified number. Besides, it tends to ignore information of other users as recommending them on the basis of information of partial users who have similar inclination. However, there are valuable hidden information into other users' one. In this paper, we use Association Rule, which is common wide use in Data Mining, with collaborative filtering for the purpose of discovering those information. In addition, this paper proved that Association Rule applied to Recommender System has a effects to recommend users by the relation between groups. In other words, Association Rule based on the history of all users is derived from. and the efficiency of Recommender System is improved by using Association Rule with collaborative filtering.