Framework of EcomTDMA for Transactional Data Mining Using Frequent Item Set for E-Commerce Application

2021 ◽  
pp. 317-330
Author(s):  
Pradeep Ambavane ◽  
Sarika Zaware ◽  
Nitin Zaware
Keyword(s):  
Data Mining ◽  
Frequent Item ◽  
Transactional Data

Pemanfaatan Metode K-Means Dalam Penentuan Persediaan Barang

2018 ◽  
Vol 6 (1) ◽  
pp. 41-48
Author(s):  
Santoso Setiawan
Keyword(s):  
Data Mining ◽  
Stock Management ◽  
Transaction Data ◽  
Business People ◽  
Cluster Data ◽  
Data Clusters ◽  
Inventory Strategy ◽  
Transactional Data

Abstract   Inaccurate stock management will lead to high and uneconomical storage costs, as there may be a void or surplus of certain products. This will certainly be very dangerous for all business people. The K-Means method is one of the techniques that can be used to assist in designing an effective inventory strategy by utilizing the sales transaction data that is already available in the company. The K-Means algorithm will group the products sold into several large transactional data clusters, so it is expected to help entrepreneurs in designing stock inventory strategies.   Keywords: inventory, k-means, product transaction data, rapidminer, data mining   Abstrak   Manajemen stok yang tidak akurat akan menyebabkan biaya penyimpanan yang tinggi dan tidak ekonomis, karena kemungkinan terjadinya kekosongan atau kelebihan produk tertentu. Hal ini sangat berbahaya bagi para pelaku bisnis. Metode K-Means adalah salah satu teknik yang dapat digunakan untuk membantu dalam merancang strategi persediaan yang efektif dengan memanfaatkan data transaksi penjualan yang telah tersedia di perusahaan. Algoritma K-Means akan mengelompokkan produk yang dijual ke beberapa cluster data transaksi yang umumnya besar, sehingga diharapkan dapat membantu pengusaha dalam merancang strategi persediaan stok.   Kata kunci: data transaksi produk, k-means, persediaan, rapidminer, data mining.

scholarly journals Comparative Study of Frequent Item Set in Data Mining

2015 ◽  
Vol 5 (1) ◽  
pp. 01-08
Author(s):  
Brijendra Dhar Dubey ◽  
Mayank Sharma ◽  
Ritesh Shah
Keyword(s):  
Data Mining ◽  
Comparative Study ◽  
Frequent Item

Mining Association Rules in Data Warehouses

2008 ◽  
pp. 303-335
Author(s):  
Haorianto Cokrowijoyo Tjioe ◽  
David Taniar
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Strategic Decision ◽  
Multidimensional Data ◽  
Data Warehouses ◽  
Multidimensional Databases ◽  
Efficient Data ◽  
Decision Making Processes ◽  
Mining Association Rules ◽  
Transactional Data

Data mining applications have enormously altered the strategic decision-making processes of organizations. The application of association rules algorithms is one of the well-known data mining techniques that have been developed to cope with multidimensional databases. However, most of these algorithms focus on multidimensional data models for transactional data. As data warehouses can be presented using a multidimensional model, in this paper we provide another perspective to mine association rules in data warehouses by focusing on a measurement of summarized data. We propose four algorithms — VAvg, HAvg, WMAvg, and ModusFilter — to provide efficient data initialization for mining association rules in data warehouses by concentrating on the measurement of aggregate data. Then we apply those algorithms both on a non-repeatable predicate, which is known as mining normal association rules, using GenNLI, and a repeatable predicate using ComDims and GenHLI, which is known as mining hybrid association rules.

Security and Verification of Server Data Using Frequent Itemset Mining in Ecommerce

2017 ◽  
Vol 8 (1) ◽  
pp. 31-43
Author(s):  
Zuber Shaikh ◽  
Antara Mohadikar ◽  
Rachana Nayak ◽  
Rohith Padamadan
Keyword(s):  
Data Mining ◽  
Frequent Itemsets ◽  
Frequent Itemset ◽  
Graphical Password ◽  
Itemset Mining ◽  
Frequent Item ◽  
Data Mining Algorithms ◽  
Shoulder Surfing ◽  
Mining Algorithms ◽  
Frequent Item Sets

Frequent itemsets refer to a set of data values (e.g., product items) whose number of co-occurrences exceeds a given threshold. The challenge is that the design of proofs and verification objects has to be customized for different data mining algorithms. Intended method will implement a basic idea of completeness verification and authentication approach in which the client will uses a set of frequent item sets as the evidence, and checks whether the server has missed any frequent item set as evidence in its returned result. It will help client detect untrusted server and system will become much more efficiency by reducing time. In authentication process CaRP is both a captcha and a graphical password scheme. CaRP addresses a number of security problems altogether, such as online guessing attacks, relay attacks, and, if combined with dual-view technologies, shoulder-surfing attacks.

Data Mining Pembentukan Pola Penggunaan Alat Kontrasepsi Dengan Metode Association Rule

2020 ◽  
Vol 4 (1) ◽  
pp. 186-191
Author(s):  
Elisa Hafrida ◽  
◽  
Febrina Sari ◽  
Desyanti Desyanti ◽  
Siti Nurjannah ◽  
...  
Keyword(s):  
Data Mining ◽  
Association Rule ◽  
Frequent Item ◽  
Mining Association Rule

Penggunaan Alat Kontrasepsi secara berkelanjutan merupakan faktor yang mempengaruhi keberhasilan Program Keluarga Berencana (KB). Seperti yang diketahui tidak semua alat kontrasepsi cocok dengan kondisi setiap orang, oleh karenanya setiap pribadi harus bisa memilih alat kontrasepsi yang cocok untuk dirinya. Permasalahannya banyak para wanita sulit untuk menentukan pilihan alat kontrasepsi yang akan digunakan, selain kurangnya pengetahuan dan informasi, Sampai saat ini belum ada konsep atau Pola untuk pemilihan alat kontrasepsi. Tujuan dari penelitian ini adalah Menemukan pola penggunaan alat kontrasepsi dengan menggunakan metode Data Mining Association Rule. Hasil kinerja Algoritma Apriori menghasilkan pola kombinasi yang menggambarkan kumpulan frequent item set dengan nilai confidence tertinggi yakni sebesar 90% pada Rule Jika Alat Kontrasepsi Suntik 3 Bulan Maka Usia Ibu 17-35 Tahun. Pola yang terbentuk merupakan hasil formulasi konsep, sehingga pola ini dapat dijadikan acuan bagi para calon akseptor dalam menentukan pilihan alat kontrasepsi yang cocok untuk digunakan.

scholarly journals A Weighted Frequent Item-Set Mining using WD-FIM Algorithm

2019 ◽  
Vol 8 (12) ◽  
pp. 4792-4796
Keyword(s):  
Data Mining ◽  
Decision Making ◽  
Research Area ◽  
Data Sets ◽  
Weight Factor ◽  
Smart Systems ◽  
Frequent Item ◽  
Significant Research ◽  
Downward Closure ◽  
The One

Smart systems are the one of the most significant inventions of our times. These systems rely on powerful information mining techniques to achieve intelligence in decision making. Frequent item set mining (FIM), has become one of the most significant research area of data mining. The information present in databases is in-general ambiguous and uncertain. In such databases, one should think of weighted FIM to discover item sets which are significant from end user’s perspective. Be that as it may, with introduction of weight-factor for FIM makes the weighted continuous item sets may not fulfil the descending conclusion property anymore. Subsequently, the pursuit space of successive item set can't be limited by descending conclusion property which prompts a poor time effectiveness. In this paper, we introduce two properties for FIM, first one is, weight judgment downward closure property (WD-FIM), it is for weighted FIM and the second one is existence property for its subsets. In view of above two properties, the WD-FIM calculation is proposed to limit the looking through space of the weighted regular item sets and improve the time effectiveness. In addition, the culmination and time productivity of WD-FIM calculation are examined hypothetically. At last, the exhibition of the proposed WD-FIM calculation is confirmed on both engineered and genuine data sets

Comparative Analysis of Association Rule Mining Algorithms in Market Basket Analysis Using Transactional Data

2020 ◽  
Vol 27 (1) ◽  
Author(s):  
AA Izang ◽  
SO Kuyoro ◽  
OD Alao ◽  
RU Okoro ◽  
OA Adesegun
Keyword(s):  
Data Mining ◽  
Association Rule ◽  
Association Rule Mining ◽  
Market Basket Analysis ◽  
Rule Mining ◽  
Business Decisions ◽  
Market Basket ◽  
Minimum Support ◽  
Support Threshold ◽  
Transactional Data

Association rule mining (ARM) is an aspect of data mining that has revolutionized the area of predictive modelling paving way for data mining technique to become the recommended method for business owners to evaluate organizational performance. Market basket analysis (MBA), a useful modeling technique in data mining, is often used to analyze customer buying pattern. Choosing the right ARM algorithm to use in MBA is somewhat difficult, as most algorithms performance is determined by characteristics such as amount of data used, application domain, time variation, and customer’s preferences. Hence this study examines four ARM algorithm used in MBA systems for improved business Decisions. One million, one hundered and twele thousand (1,112,000) transactional data were extracted from Babcock University Superstore. The dataset was induced with Frequent Pattern Growth, Apiori, Association Outliers and Supervised Association Rule ARM algorithms. The outputs were compared using minimum support threshold, confidence level and execution time as metrics. The result showed that The FP Growth has minimum support threshold of 0.011 and confidence level of 0.013, Apriori 0.019 and 0.022, Association outliers 0.026 and 0.294 while Supervised Association Rule has 0.032 and 0.212 respectively. The FP Growth and Apirori ARM algorithms performed better than Association Outliers and Supervised Association Rule when the minimum support and confidence threshold were both set to 0.1. The study concluded by recommending a hybrid ARM algorithm to be used for building MBA Applications. The outcome of this study when adopted by business ventures will lead to improved business decisions thereby helping to achieve customer retention. Keywords: Association rule mining, Business ventures, Data mining, Market basket analysis, Transactional data.

scholarly journals A Federated Learning Approach to Frequent Itemset Mining in Cyber-Physical Systems

2021 ◽  
Vol 29 (4) ◽  
Author(s):  
Usman Ahmed ◽  
Gautam Srivastava ◽  
Jerry Chun-Wei Lin
Keyword(s):  
Cyber Physical Systems ◽  
Frequent Itemset ◽  
Security And Privacy ◽  
High Dimensional ◽  
Traditional Methods ◽  
Physical Systems ◽  
Frequent Item ◽  
Low Dimensional ◽  
Frequent Item Sets ◽  
Transactional Data

AbstractEffective vector representation has been proven useful for transaction classification and clustering tasks in Cyber-Physical Systems. Traditional methods use heuristic-based approaches and different pruning strategies to discover the required patterns efficiently. With the extensive and high dimensional availability of transactional data in cyber-physical systems, traditional methods that used frequent itemsets (FIs) as features suffer from dimensionality, sparsity, and privacy issues. In this paper, we first propose a federated learning-based embedding model for the transaction classification task. The model takes transaction data as a set of frequent item-sets. Afterward, the model can learn low dimensional continuous vectors by preserving the frequent item-sets contextual relationship. We perform an in-depth experimental analysis on the number of high dimensional transactional data to verify the developed models with attention-based mechanism and federated learning. From the results, it can be seen that the designed model can help and improve the decision boundary by reducing the global loss function while maintaining both security and privacy.

Sign in / Sign up

Export Citation Format

Share Document