PRODUCT BUNDLING APPLICATION TO SUPPORT IMPLEMENTATION OF  ASSOCIATION RULE MINING USING FP-GROWTH

Online media has been proven to gave good impact especially in the business field, for opening and widen access to people and society, and so giving more opportunity to any business broader and easy access through electronic commerce (e-commerce). This is the basic idea for the need to improve business reach for a decorative plants store in Tangerang Area. The association transaction pattern as the outcome of data mining process by implementing the Fp-Growth Algorithm that is injected to a mobile application with the purpose to get the buyer’s shopping pattern, which is also packed as the products bundling promotion media and finally open the opportunity to broaden reach for business and information.

Download Full-text

Present State-of-The-Art of Association Rule Mining Algorithms

International Journal of Engineering and Advanced Technology - Regular Issue ◽

10.35940/ijeat.a2202.109119 ◽

2019 ◽

Vol 9 (1) ◽

pp. 6398-6405

Keyword(s):

Data Mining ◽

Association Rule ◽

Association Rule Mining ◽

State Of The Art ◽

Synthetic Data ◽

Data Sets ◽

Evolutionary Analysis ◽

Rule Mining ◽

Transaction Database ◽

Mining Algorithms

A Data mining is the method of extracting useful information from various repositories such as Relational Database, Transaction database, spatial database, Temporal and Time-series database, Data Warehouses, World Wide Web. Various functionalities of Data mining include Characterization and Discrimination, Classification and prediction, Association Rule Mining, Cluster analysis, Evolutionary analysis. Association Rule mining is one of the most important techniques of Data Mining, that aims at extracting interesting relationships within the data. In this paper we study various Association Rule mining algorithms, also compare them by using synthetic data sets, and we provide the results obtained from the experimental analysis

Download Full-text

ASSOCIATION RULE MINING UNTUK MENINGKATKAN PROMOSI PRODUK ( STUDI KASUS PADA PD. XYZ )

JURNAL FASILKOM ◽

10.37859/jf.v7i2.789 ◽

2018 ◽

Vol 7 (2) ◽

pp. 284-288

Author(s):

Doni Winarso ◽

Anwar Karnaidi

Keyword(s):

Data Mining ◽

Association Rule ◽

Association Rule Mining ◽

Rule Mining

Analisis association rule adalah teknik data mining yang digunakan untuk menemukan aturan asosiatif antara suatu kombinasi item. penelitian ini menggunakan algoritma apriori. Dengan algoritma tersebut dilakukan pencarian frekuensi dan item barang yang paling sering muncul. hasil dari penelitian in menunjukkan bahwa algoritma apriori dapat digunakan untuk menganalisis data transaksi sehingga diketahui mana produk yang harus dipromosikan. Perhitungan metode apriori menghasilkan suatu pola pembelian yang terjadi di PD. XYZ. dengan menganalisis pola tersebut dihasilakn kesimpulan bahwa produk yang akan dipromosikan yaitu cat tembok ekonomis dan peralatan cat berupa kuas tangan dengan nilai support 11% dan confidence 75% .

Download Full-text

Artificial Bee Colony-Based Associative Classifier for Healthcare Data Diagnosis

Handbook of Research on Disease Prediction Through Data Analytics and Machine Learning - Advances in Medical Diagnosis, Treatment, and Care ◽

10.4018/978-1-7998-2742-9.ch012 ◽

2021 ◽

pp. 237-253

Author(s):

M. Nandhini ◽

S. N. Sivanandam ◽

S. Renugadevi

Keyword(s):

Data Mining ◽

Association Rule ◽

Association Rule Mining ◽

Artificial Bee Colony ◽

Optimization Technique ◽

Rule Mining ◽

Healthcare Data ◽

Bee Colony ◽

Small Set ◽

Significant Class

Data mining is likely to explore hidden patterns from the huge quantity of data and provides a way of analyzing and categorizing the data. Associative classification (AC) is an integration of two data mining tasks, association rule mining, and classification which is used to classify the unknown data. Though association rule mining techniques are successfully utilized to construct classifiers, it lacks in generating a small set of significant class association rules (CARs) to build an accurate associative classifier. In this work, an attempt is made to generate significant CARs using Artificial Bee Colony (ABC) algorithm, an optimization technique to construct an efficient associative classifier. Associative classifier, thus built using ABC discovered CARs achieve high prognostic accurateness and interestingness value. Promising results were provided by the ABC based AC when experiments were conducted using health care datasets from the UCI machine learning repository.

Download Full-text

Constraint-Based Association Rule Mining

Encyclopedia of Data Warehousing and Mining, Second Edition ◽

10.4018/978-1-60566-010-3.ch049 ◽

2011 ◽

pp. 307-312 ◽

Cited By ~ 10

Author(s):

Carson Kai-Sang Leung

Keyword(s):

Data Mining ◽

Association Rules ◽

Association Rule ◽

Association Rule Mining ◽

Computational Cost ◽

Knowledge Discovery In Databases ◽

Rule Mining ◽

The Subject ◽

User Focus ◽

High Computational Cost

The problem of association rule mining was introduced in 1993 (Agrawal et al., 1993). Since then, it has been the subject of numerous studies. Most of these studies focused on either performance issues or functionality issues. The former considered how to compute association rules efficiently, whereas the latter considered what kinds of rules to compute. Examples of the former include the Apriori-based mining framework (Agrawal & Srikant, 1994), its performance enhancements (Park et al., 1997; Leung et al., 2002), and the tree-based mining framework (Han et al., 2000); examples of the latter include extensions of the initial notion of association rules to other rules such as dependence rules (Silverstein et al., 1998) and ratio rules (Korn et al., 1998). In general, most of these studies basically considered the data mining exercise in isolation. They did not explore how data mining can interact with the human user, which is a key component in the broader picture of knowledge discovery in databases. Hence, they provided little or no support for user focus. Consequently, the user usually needs to wait for a long period of time to get numerous association rules, out of which only a small fraction may be interesting to the user. In other words, the user often incurs a high computational cost that is disproportionate to what he wants to get. This calls for constraint-based association rule mining.

Download Full-text

Association Rule Mining of Relational Data

Encyclopedia of Data Warehousing and Mining, Second Edition ◽

10.4018/978-1-60566-010-3.ch015 ◽

2011 ◽

pp. 87-93

Author(s):

Anne Denton

Keyword(s):

Data Mining ◽

Data Structures ◽

Association Rule ◽

Association Rule Mining ◽

Relational Data ◽

Rule Mining ◽

Data Mining Algorithms ◽

Mining Algorithms ◽

Relational Database Management ◽

Relational Database Management Systems

Most data of practical relevance are structured in more complex ways than is assumed in traditional data mining algorithms, which are based on a single table. The concept of relations allows for discussing many data structures such as trees and graphs. Relational data have much generality and are of significant importance, as demonstrated by the ubiquity of relational database management systems. It is, therefore, not surprising that popular data mining techniques, such as association rule mining, have been generalized to relational data. An important aspect of the generalization process is the identification of challenges that are new to the generalized setting.

Download Full-text

On Association Rule Mining for the QSAR Problem

Encyclopedia of Data Warehousing and Mining, Second Edition ◽

10.4018/978-1-60566-010-3.ch014 ◽

2011 ◽

pp. 83-86

Author(s):

Luminita Dumitriu

Keyword(s):

Data Mining ◽

Association Rule ◽

Association Rule Mining ◽

Predictive Ability ◽

Quantitative Structure Activity Relationship ◽

Rule Mining ◽

Data Mining Techniques ◽

Neuro Fuzzy ◽

The 1960S ◽

New Compounds

The concept of Quantitative Structure-Activity Relationship (QSAR), introduced by Hansch and co-workers in the 1960s, attempts to discover the relationship between the structure and the activity of chemical compounds (SAR), in order to allow the prediction of the activity of new compounds based on knowledge of their chemical structure alone. These predictions can be achieved by quantifying the SAR. Initially, statistical methods have been applied to solve the QSAR problem. For example, pattern recognition techniques facilitate data dimension reduction and transformation techniques from multiple experiments to the underlying patterns of information. Partial least squares (PLS) is used for performing the same operations on the target properties. The predictive ability of this method can be tested using cross-validation on the test set of compounds. Later, data mining techniques have been considered for this prediction problem. Among data mining techniques, the most popular ones are based on neural networks (Wang, Durst, Eberhart, Boyd, & Ben-Miled, 2004) or on neuro-fuzzy approaches (Neagu, Benfenati, Gini, Mazzatorta, & Roncaglioni, 2002) or on genetic programming (Langdon, &Barrett, 2004). All these approaches predict the activity of a chemical compound, without being able to explain the predicted value. In order to increase the understanding on the prediction process, descriptive data mining techniques have started to be used related to the QSAR problem. These techniques are based on association rule mining. In this chapter, we describe the use of association rule-based approaches related to the QSAR problem.

Download Full-text

Association Rule and Quantitative Association Rule Mining among Infrequent Items

Rare Association Rule Mining and Knowledge Discovery ◽

10.4018/978-1-60566-754-6.ch002 ◽

2010 ◽

pp. 15-32 ◽

Cited By ~ 1

Author(s):

Ling Zhou ◽

Stephen Yau

Keyword(s):

Data Mining ◽

Association Rules ◽

Association Rule ◽

Association Rule Mining ◽

Rule Mining ◽

Transactional Databases ◽

Frequent Items ◽

Increasing Demand ◽

Quantitative Association Rule

Association rule mining among frequent items has been extensively studied in data mining research. However, in recent years, there is an increasing demand for mining infrequent items (such as rare but expensive items). Since exploring interesting relationships among infrequent items has not been discussed much in the literature, in this chapter, the authors propose two simple, practical and effective schemes to mine association rules among rare items. Their algorithms can also be applied to frequent items with bounded length. Experiments are performed on the well-known IBM synthetic database. The authors’ schemes compare favorably to Apriori and FP-growth under the situation being evaluated. In addition, they explore quantitative association rule mining in transactional databases among infrequent items by associating quantities of items: some interesting examples are drawn to illustrate the significance of such mining.

Download Full-text

Association Rule Mining in Collaborative Filtering

Collaborative Filtering Using Data Mining and Analysis - Advances in Data Mining and Database Management ◽

10.4018/978-1-5225-0489-4.ch009 ◽

2017 ◽

pp. 159-179 ◽

Cited By ~ 8

Author(s):

Carson K.-S. Leung ◽

Fan Jiang ◽

Edson M. Dela Cruz ◽

Vijay Sekar Elango

Keyword(s):

Data Mining ◽

Collaborative Filtering ◽

Association Rules ◽

Data Structures ◽

Association Rule ◽

Association Rule Mining ◽

Real Life ◽

Frequent Patterns ◽

Rule Mining ◽

Association Rule Miner

Collaborative filtering uses data mining and analysis to develop a system that helps users make appropriate decisions in real-life applications by removing redundant information and providing valuable to information users. Data mining aims to extract from data the implicit, previously unknown and potentially useful information such as association rules that reveals relationships between frequently co-occurring patterns in antecedent and consequent parts of association rules. This chapter presents an algorithm called CF-Miner for collaborative filtering with association rule miner. The CF-Miner algorithm first constructs bitwise data structures to capture important contents in the data. It then finds frequent patterns from the bitwise structures. Based on the mined frequent patterns, the algorithm forms association rules. Finally, the algorithm ranks the mined association rules to recommend appropriate merchandise products, goods or services to users. Evaluation results show the effectiveness of CF-Miner in using association rule mining in collaborative filtering.

Download Full-text