• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.2 no.3
• /
• pp.210-214
• /
• 2002

Association rule mining is an exploratory learning task to discover some hidden dependency relationships among items in transaction data. Quantitative association rules denote association rules with both categorical and quantitative attributes. There have been several works on quantitative association rule mining such as the application of fuzzy techniques to quantitative association rule mining, the generalized association rule mining for quantitative association rules, and importance weight incorporation into association rule mining fer taking into account the users interest. This paper introduces a new method for generalized fuzzy quantitative association rule mining with importance weights. The method uses fuzzy concept hierarchies fer categorical attributes and generalization hierarchies of fuzzy linguistic terms fur quantitative attributes. It enables the users to flexibly perform the association rule mining by controlling the generalization levels for attributes and the importance weights f3r attributes.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.6
• /
• pp.764-770
• /
• 2004

This paper presents a hybrid data mining mechanism to extract expert knowledge from historical data and extend expert systems' reasoning capabilities by using fuzzy neural network (FNN)-based learning & rule extraction algorithm. Our hybrid data mining mechanism is based on association rule extraction mechanism, FNN learning and fuzzy rule extraction algorithm. Most of traditional data mining mechanisms are depended ()n association rule extraction algorithm. However, the basic association rule-based data mining systems has not the learning ability. Therefore, there is a problem to extend the knowledge base adaptively. In addition, sequential patterns of association rules can`t represent the complicate fuzzy logic in real-world. To resolve these problems, we suggest the hybrid data mining mechanism based on association rule-based data mining, FNN learning and fuzzy rule extraction algorithm. Our hybrid data mining mechanism is consisted of four phases. First, we use general association rule mining mechanism to develop an initial rule base. Then, in the second phase, we adopt the FNN learning algorithm to extract the hidden relationships or patterns embedded in the historical data. Third, after the learning of FNN, the fuzzy rule extraction algorithm will be used to extract the implicit knowledge from the FNN. Fourth, we will combine the association rules (initial rule base) and fuzzy rules. Implementation results show that the hybrid data mining mechanism can reflect both association rule-based knowledge extraction and FNN-based knowledge extension.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.05a
• /
• pp.884-888
• /
• 2003

In this paper, we introduce the hybrid data mining mechanism based in association rule and fuzzy neural networks (FNN). Most of data mining mechanisms are depended in the association rule extraction algorithm. However, the basic association rule-based data mining has not the learning ability. In addition, sequential patterns of association rules could not represent the complicate fuzzy logic. To resolve these problems, we suggest the hybrid mechanism using association rule-based data mining, and fuzzy neural networks. Our hybrid data mining mechanism was consisted of four phases. First, we used general association rule mining mechanism to develop the initial rule-base. Then, in the second phase, we used the fuzzy neural networks to learn the past historical patterns embedded in the database. Third, fuzzy rule extraction algorithm was used to extract the implicit knowledge from the FNN. Fourth, we combine the association knowledge base and fuzzy rules. Our proposed hybrid data mining mechanism can reflect both association rule-based logical inference and complicate fuzzy logic.

• The Journal of Information Systems
• /
• v.14 no.3
• /
• pp.37-47
• /
• 2005

Mining of association rules is to find associations among data items that appear together in some transactions or business activities. As of today, algorithms for association rule mining, as well as for other data mining tasks, are mostly applied to relational databases. As XML being adopted as the universal format for data storage and exchange, mining associations from XML data becomes an area of attention for researchers and developers. The challenge is that the semi-structured data format in XML is not directly suitable for traditional data mining algorithms and tools. In this paper we present an encoding method to encode XML tree-nodes. This method is used to store the XML data in Value Table and Transaction Table that can be easily accessed via indexing. The hierarchical relationship in the original XML tree structure is embedded in the encoding. We applied this method to association rules mining of XML data that may have missing data.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.24 no.63
• /
• pp.23-31
• /
• 2001

Data mining can be either directed or undirected. One way of thinking about it is that we use undirected data mining to recognize relationship in the data and directed data mining to explain those relationships once they have been found. Several data mining techniques have received considerable research attention. In this paper, we propose an algorithm for discovering association rules as directed data mining and applying them to classification. In the first phase, we find frequent closed itemsets and association rules. After this phase, we construct the decision trees using discovered association rules. The algorithm can be applicable to customer relationship management.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.3
• /
• pp.366-370
• /
• 2003

In this research, we suggest a hybrid intelligent Web recommendation systems based on Web data mining and case-based reasoning (CBR). One of the important research topics in the field of Internet business is blending artificial intelligence (AI) techniques with knowledge discovering in database (KDD) or data mining (DM). Data mining is used as an efficient mechanism in reasoning for association knowledge between goods and customers＇ preference. In the field of data mining, the features, called attributes, are often selected primary for mining the association knowledge between related products. Therefore, most of researches, in the arena of Web data mining, used association rules extraction mechanism. However, association rules extraction mechanism has a potential limitation in flexibility of reasoning. If there are some goods, which were not retrieved by association rules-based reasoning, we can＇t present more information to customer. To overcome this limitation case, we combined CBR with Web data mining. CBR is one of the AI techniques and used in problems for which it is difficult to solve with logical (association) rules. A Web-log data gathered in real-world Web shopping mall was given to illustrate the quality of the proposed hybrid recommendation mechanism. This Web shopping mall deals with remote-controlled plastic models such as remote-controlled car, yacht, airplane, and helicopter. The experimental results showed that our hybrid recommendation mechanism could reflect both association knowledge and implicit human knowledge extracted from cases in Web databases.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.28 no.3
• /
• pp.135-148
• /
• 2003

In this paper we introduce the Internet-based purchase support systems using data mining and case-based reasoning (CBR). Internet Business activity that involves the end user is undergoing a significant revolution. The ability to track users browsing behavior has brought the vendor and end customer's closer than ever before. It is now possible for a vendor to personalize his product message for individual customers at massive scale. Most of former researchers, in this research arena, used data mining techniques to pursue the customer's future behavior and to improve the frequency of repurchase. The area of data mining can be defined as efficiently discovering association rules from large collections of data. However, the basic association rule-based data mining technique was not flexible. If there were no inference rules to track the customer's future behavior, association rule-based data mining systems may not present more information. To resolve this problem, we combined association rule-based data mining with CBR mechanism. CBR is used in reasoning for customer's preference searching and training through the cases. Data mining and CBR-based hybrid purchase support mechanism can reflect both association rule-based logical inference and case-based information reuse. A Web-log data gathered in the real-world Internet shopping mall is given to illustrate the quality of the proposed systems.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.1
• /
• pp.133-140
• /
• 2011

For both customers and companies, it is very important to analyze online customer reviews, which consist of small documents that include opinions or experiences about products or services, because the customers can get good informations and the companies can establish good marketing strategies. In this paper, we propose the association model for the opinion mining which can analyze customer opinions posted on web. The association model is to modify the association rules mining model in data mining in order to apply efficiently and effectively the association mining techniques to the opinion mining. We designed and implemented the opinion mining systems based on the modified association model and the grouping idea which would enable it to generate significant rules more.

• Journal of Korean Institute of Industrial Engineers
• /
• v.32 no.3
• /
• pp.242-252
• /
• 2006

Data mining is the exploration and analysis of huge amounts of data to discover meaningful patterns. One of the most important data mining problems is association rule mining. Recent studies of mining association rules have proposed a closure mechanism. It is no longer necessary to mine the set of all of the frequent itemsets and their association rules. Rather, it is sufficient to mine the frequent closed itemsets and their corresponding rules. In the past, a number of algorithms for mining frequent closed itemsets have been based on items. In this paper, we use the transaction itself for mining frequent closed itemsets. An efficient algorithm is proposed that is based on a link structure between transactions. Our experimental results show that our algorithm is faster than previously proposed methods. Furthermore, our approach is significantly more efficient for dense databases.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.31 no.2
• /
• pp.104-111
• /
• 2008

A process mining is considered to support the discovery of business process for unstructured process model, and a process mining algorithm by using the associated rule and sequence pattern of data mining is developed to extract information about processes from event-log, and to discover process of alternative, concurrent and hidden activities. Some numerical examples are presented to show the effectiveness and efficiency of the algorithm.