• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.3
• /
• pp.155-164
• /
• 2016

For frequency pattern analysis of large databases, the new tree-based frequency pattern analysis algorithm which can compensate for the disadvantages of the Apriori method has been variously studied. In frequency pattern tree, the number of nodes is associated with memory allocation, but also affects memory resource consumption and processing speed of the growth. Therefore, reducing the number of nodes in the tree is very important in the frequency pattern mining. However, the absolute criteria which need to order the transaction items for construction frequency pattern tree has lowered the compression ratio of the tree nodes. But most of the frequency based tree construction methods adapted the absolute criteria. FP-tree is typically frequency pattern tree structure which is an extended prefix-tree structure for storing compressed frequent crucial information about frequent patterns. For construction the tree, all the frequent items in different transactions are sorted according to the absolute criteria, frequency descending order. CanTree also need to absolute criteria, canonical order, to construct the tree. In this paper, we proposed a novel frequency pattern tree construction method that does not use the absolute criteria, IRFP-tree algorithm. IRFP-tree(Intersection Rule based FP-tree). IRFP-tree is constituted with the new paradigm of the intersection rule without the use of the absolute criteria. It increased the compression ratio of the tree nodes, and reduced the tree construction time. Our method has the additional advantage that it provides incremental mining. The reported test result demonstrate the applicability and effectiveness of the proposed approach.

• Journal of the Korea Society of Computer and Information
• /
• v.3 no.3
• /
• pp.55-61
• /
• 1998

The learning order of teaching materials to be a learning data in CAI is arranged from an easy item to a difficult one A learning in not necessary to be learned arranged this order. Actually the learning is done by the rules of trial and error on the sequences of an arrangement among items. In this papers, the constructed is modelled by the fuzzy inference after leaning the understanding on items by the intelligent CAI through the rile of trial and error of fuzziness. Given the difference of leaning and understanding, the leaning model is quantified by the order relationship among items and by the rules of fuzzy inference. The rule of trial and error of learning is restricted to the treatment of CAL system minimizing the rules of inference.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.6 no.1
• /
• pp.21-26
• /
• 2006

In this paper, we propose a customer personalized system that presents the web pages to users which are customized to their individuality. It analyzes the action of users who visit the shopping mall, and preferentially supplies the necessary information to them. When they actually buy some items, it forecasts the user's access pattern to web site and their following purchasable items and improves their web page on the bases of their individuality. It reasons the relation among the web documents and among the items by using the log data of web server and the purchase information of DB. For reasoning, it employs Apriori algorithm, which is a method that searches the association rule. It reasons the web pages by considering the user's access pattern and time by using the web log and reasons the user's purchase pattern by using the purchase information of DB. On the basis of the relation among them, it appends the related web pages to link of user's web pages and displays the inferred goods on user's web pages.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2006.11a
• /
• pp.29-32
• /
• 2006

In this paper, we propose a customer personalized system that presents the web pages to users which are customized to their individuality. It analyzes the action of users who visit the shopping mall, and preferentially supplies the necessary information to them. When they actually buy some items, it forecasts the users' access pattern to web site and their following purchasable items and improves their web pare on the bases of their individuality. It reasons the relation among the web documents and among the items by using the log data of web server and the purchase information of DB. For reasoning it employs Rough Set, which is a method that searches the association rule and offers most suitable cases by reduces cases. It reasons the web pages by considering the users' access pattern and time by using the web log and reasons the users' purchase pattern by using the purchase information of DB. On the basis of the relation among them, it appends the related web pages to link of users' web pages and displays the inferred goods on users' web pages.

• Journal of Korea Technology Innovation Society
• /
• v.16 no.4
• /
• pp.1090-1108
• /
• 2013

Recently national technology commercialization policy using the outcomes of public R&D has been promoting the activities of technology transfer and licensing. Firms also are considering licensing strategies to make great strides and strengthen their future competitiveness. In the licensing deals, objective and reasonable royalty determination is required to be accepted for both negotiation parties. This study analyzed the appropriate royalty range for various types of business and established three royalty influential factors with ten valuation items to explain royalty difference. This study suggested new method to estimate rationally reasonable running royalty rate, combining the appropriate royalty range from classic 25% rule and the result evaluated from royalty influential factors. The adequacy of royalty range from classic 25% rule is confirmed because its range is similar to that of royalty of transfer cases. The final estimate of running royalty can be made from linear function for royalty determination using the results of royalty range and royalty influential factors. This method suggested here is expected to practically useful to determine an appropriate running royalty rate for licensing negotiation.

• Journal of the Korean Data and Information Science Society
• /
• v.20 no.6
• /
• pp.1129-1143
• /
• 2009

This paper proposes a recommendation system (Association Rule System for Targeting) which considers target which is not considered by previous Logistic Regression system, and proves that the efficiency of the recommendation system is better than that of the current and previous Apriori algorithm system. Also this study shows that the click and purchasing rate of the proposed Association Rule System for Targeting is much higher than those of current Apriori algorithm system after the purchasing campaign even though the open rate of the former is lower than that of the latter. In comparison with Logistic Regression methodology, this paper proves with experimental data that the purchasing effect of the proposed system for specific items is much higher in accuracy than that of current Apriori algorithm system even though the purchasing rate of current Apriori algorithm system is higher in whole shopping malls than that of the proposed Association Rule System for Targeting.

• 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.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.21 no.5
• /
• pp.891-899
• /
• 2010

Association rule is the technique to represent the relationship between two or more items by numerical representing for the relevance of each item in vast amounts of databases, and is most being used in data mining. The basic thresholds for association rule are support, confidence, and lift. these are used to generate the association rules. We need standardization of lift because the range of lift value is different from that of support and confidence. And also we need standardization of support and confidence to compare objectively association level of antecedent variables for one descendant variable. In this paper we propose a method for standardization of association thresholds considering marginal probability for each item to grasp objectively and exactly association level, check the conditions for association criteria and then compare association thresholds with standardized association thresholds using some concrete examples.

• 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}$.