Enhancing the KDD Process in the Relational Database Mining Framework by Quantitative Evaluation of Association Rules

2005 ◽  
pp. 325-350
Author(s):  
Giuseppe Psaila
Keyword(s):  
Quantitative Evaluation ◽  
Association Rules ◽  
Relational Database ◽  
Database Mining

Analysis and Evaluation of a Framework for Sampling Database in Recommenders

2018 ◽  
Vol 26 (1) ◽  
pp. 41-57 ◽  
Author(s):  
Hodjat Hamidi ◽  
Reza Mousavi
Keyword(s):  
Association Rules ◽  
Relational Database ◽  
Input Data ◽  
Sampling Method ◽  
Data Integrity ◽  
Sampling Techniques ◽  
System Efficiency ◽  
Production Environment ◽  
Analysis And Evaluation

In this paper the authors proposed a database sampling framework that aims to minimize the time necessary to produce a sample database. They argue that the performance of current relational database sampling techniques that maintain the data integrity of the sample database is low and a faster strategy needs to be devised. The sampling method targets the production environment of a system under development that generally consists of large amounts of data computationally costly to analyze. The results have been improved due to the fact that the authors have selected the users that they had more information about them and they have made the data table denser. Therefore, by increasing the data and making the rating more comprehensive for all the users they can help to produce the more and better association rules. The obtained results were not that much suitable for Jester dataset but with their proposed methods the authors have tried to improve the quantity and quality of the rules. These results indicate that the effectiveness of the system greatly depends on the input data and the applied dataset. In addition, if the user rates more number of the items the system efficiency will be more increased.

Data Mining with Cubegrades

2011 ◽  
pp. 288-292
Author(s):  
Amin A. Abdulghani
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Database Mining

Much interest has been expressed in database mining by using association rules (Agrawal, Imielinski, & Swami, 1993). In this article, I provide a different view of the association rules, which are referred to as cubegrades (Imielinski, Khachiyan, & Abdulghani, 2002) .

A Study of Negative Association Rules Mining Algorithm Based on Multi-Database

2013 ◽  
Vol 756-759 ◽  
pp. 3435-3439
Author(s):  
Xu Shan Peng ◽  
Ping Cheng ◽  
Mo Gei Wang
Keyword(s):  
Decision Making ◽  
Association Rules ◽  
Mutual Exclusion ◽  
Negative Association ◽  
Database Mining ◽  
Technology Research ◽  
Association Rules Mining ◽  
Mining Algorithm ◽  
Database Technology ◽  
Negative Association Rules

the mutual exclusion relationships among data items are reflected by negative association rules, whitch is very important on the decision-making analysis. In the last several years, negative association rules are frequently researched, while the study object of it is single mining of database now. With the development of database technology, multi-database mining is more and more important. On the basis of analyzing the related technology, research status and shortage of present negative association rules mining , the selecting rules, weighted synthesis and algorithm are discussed on multi-datobase.

Dynamic Fast Database Mining Algorithm Based on Association Rules

2012 ◽  
Vol 433-440 ◽  
pp. 6049-6053
Author(s):  
Zong Jiang Wang
Keyword(s):  
Real Time ◽  
Association Rules ◽  
Decision Makers ◽  
Apriori Algorithm ◽  
Database Mining ◽  
Time Data ◽  
Mining Algorithm ◽  
Definition Of ◽  
Real Time Information ◽  
Time Information

In order to resolve the problems of real-time data mining, a dynamic fast mining algorithm is proposed in this paper based on association rules. The algorithm do not need to scan the original database again, and overcome the weaknesses of Apriori Algorithm, which is the most representative mining approach using association rules, such as time-consuming, no online digging, and so on. The algorithm meets the demand of online and progressive mining. With the properties of multilayer processing simultaneously and updating promptly, as well as the definition of sensitivity parameter, the algorithm can be used to mine useful real-time information for the decision makers.

A General Framework Based on Composite Granules for Mining Association Rules

2014 ◽  
Vol 23 (05) ◽  
pp. 1450009 ◽  
Author(s):  
Gang Fang ◽  
Yue Wu
Keyword(s):  
Information System ◽  
Association Rules ◽  
Relational Database ◽  
General Framework ◽  
Frequent Itemsets ◽  
Data Sets ◽  
Complex Data ◽  
Information Granule ◽  
Mining Association Rules ◽  
Composite Granules

At present many algorithms for mining association rules have been proposed, but most of them are only suitable for discovering specific frequent itemsets from characteristic data sets on the appointed environments, namely, these algorithms are not general enough when mining association rules. In this paper, a general framework based on composite granules for mining association rules is proposed, which is a general data mining model without appointed restriction from frequent itemsets, data sets or mining environments and so on. An iterative method is efficiently applied to the general mining framework for discovering frequent itemsets, which adopts repartitioning frequent attributes to iteratively reconstruct the mixed radix information system for reducing a relational database. In order that the framework for discovering frequent itemsets has a generality, in discussing and establishing the general mining framework, this paper introduces a novel conception and data model, namely, a mixed radix information system is applied to describe a relational database, and a composite granules is used to build a specific relationship between an information system and a mixed radix information system, which can hold the same extension and simultaneously exist in two different information systems. The mixed radix information system can help the general framework to reduce information data and improve the performance of the framework for generating frequent itemsets. The composite granules model can create a relationship between an information granule and a digital information granule, and help the framework for computing the support to avoid reading the database repeatedly or using the complex data structure. Finally, a new taxonomy is presented to verify the generality and the high efficiency of the mining framework and all the experiments based on the taxonomy indicate that the general mining framework has the required generality, and the performance of the framework is better than these classical mining frameworks.

Sign in / Sign up

Export Citation Format

Share Document