scholarly journals Researchon Classification Techniques in Data Mining

2019 ◽  
Vol 8 (6S4) ◽  
pp. 357-361
Keyword(s):  
Neural Network ◽  
Data Mining ◽  
Association Rule ◽  
Group Membership ◽  
Large Data ◽  
Data Sources ◽  
Classification Rules ◽  
Class Label ◽  
Different Types ◽  
Data Extrapolation

Data Mining means a procedure to extracting the information out of large data. Data miningapproaches includes classification, association rule, clustering, etc. Data mining is applied in four stages such as data sources, data extrapolation / gathering, modeling and deploying modules. Classification is a method in data mining to predict the group membership of data instances. It’s an method useful in data mining with vast applications for classifying the different types of data used in almost every fields. Classification is giving a class label to in determine set of cases. In this survey, we would like discuss Bayesian classification, rules based classification, Decision trees &neural network.

Visual Data Mining for Discovering Association Rules

2008 ◽  
pp. 2105-2120
Author(s):  
Kesaraporn Techapichetvanich ◽  
Amitava Datta
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Association Rule ◽  
Large Data ◽  
Data Sets ◽  
Visual Data Mining ◽  
Useful Knowledge ◽  
Large Databases ◽  
A New Technique ◽  
Mining Association Rule

Both visualization and data mining have become important tools in discovering hidden relationships in large data sets, and in extracting useful knowledge and information from large databases. Even though many algorithms for mining association rules have been researched extensively in the past decade, they do not incorporate users in the association-rule mining process. Most of these algorithms generate a large number of association rules, some of which are not practically interesting. This chapter presents a new technique that integrates visualization into the mining association rule process. Users can apply their knowledge and be involved in finding interesting association rules through interactive visualization, after obtaining visual feedback as the algorithm generates association rules. In addition, the users gain insight and deeper understanding of their data sets, as well as control over mining meaningful association rules.

Ant Miner

2020 ◽  
Vol 10 (1) ◽  
pp. 45-59
Author(s):  
Bijaya Kumar Nanda ◽  
Satchidananda Dehuri
Keyword(s):  
Data Mining ◽  
Large Data ◽  
Classification Rule ◽  
Classification Rules ◽  
Rule Mining ◽  
Ant Colonies ◽  
Benchmark Datasets ◽  
Objective Classification ◽  
Single Objective ◽  
Better Than

In data mining the task of extracting classification rules from large data is an important task and is gaining considerable attention. This article presents a novel ant miner for classification rule mining. The ant miner is inspired by researches on the behaviour of real ant colonies, simulated annealing, and some data mining concepts as well as principles. This paper presents a Pittsburgh style approach for single objective classification rule mining. The algorithm is tested on a few benchmark datasets drawn from UCI repository. The experimental outcomes confirm that ant miner-HPB (Hybrid Pittsburgh Style Classification) is significantly better than ant-miner-PB (Pittsburgh Style Classification).

Visual Data Mining for Discovering Association Rules

2011 ◽  
pp. 209-226
Author(s):  
Kesaraporn Techapichetvanich ◽  
Amitava Datta
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Association Rule ◽  
Large Data ◽  
Data Sets ◽  
Visual Data Mining ◽  
Useful Knowledge ◽  
Large Databases ◽  
A New Technique ◽  
Mining Association Rule

Both visualization and data mining have become important tools in discovering hidden relationships in large data sets, and in extracting useful knowledge and information from large databases. Even though many algorithms for mining association rules have been researched extensively in the past decade, they do not incorporate users in the association-rule mining process. Most of these algorithms generate a large number of association rules, some of which are not practically interesting. This chapter presents a new technique that integrates visualization into the mining association rule process. Users can apply their knowledge and be involved in finding interesting association rules through interactive visualization, after obtaining visual feedback as the algorithm generates association rules. In addition, the users gain insight and deeper understanding of their data sets, as well as control over mining meaningful association rules.

scholarly journals Analisa Algoritma Apriori dengan Association Rule Untuk Rekomendasi Promosi Produk Elektronik Di Toko UD Surya Kisaran

2021 ◽  
Vol 1 (2) ◽  
pp. 89-94
Author(s):  
Yustika Margolang ◽  
Fauriatun Helmiah ◽  
Mardalius Mardalius
Keyword(s):  
Data Mining ◽  
Association Rule ◽  
Item Analysis ◽  
A Priori ◽  
Large Data ◽  
Electronic Products ◽  
Abstract Data ◽  
Using Data ◽  
Purchasing Patterns ◽  
Item Item

Abstract: Data Mining is a term used to describe the processes in each itemset to be able to find the results of each item. Analysis is used to determine the promotion of electronic products, namely the a priori algorithm association rules, therefore UD Surya Elektronik Shop for increasing sales results must have other strategies to be able to improve the sales system. One way is to determine the goods to be promoted to consumers. The collection of sales data that is owned can actually be processed using data mining to see customer buying patterns, with data mining for large data it will not be wasted and can be useful so that it can provide benefits to the company. In this study, the data processing uses the Apriori Algorithm, which is a data mining method that aims to find association patterns based on purchasing patterns made by consumers, so that it can be seen which items are often purchased simultaneously. Kata Kunci : Data Mining, Apriori Algorithms, Product Promotion  Abstrak: Data Mining adalah suatu istilah yang digunakan untuk menguraikan proses-proses di setiap itemset untuk dapat menemukan hasil setiap item-item nya, Analisa yang digunakan untuk menentukan promosi produk-produk elektronik yaitu dengan aturan asosiasi algoritma apriori, oleh karena itu Toko UD Surya Elektronik untuk meningkatkan hasil penjualan maka harus memiliki strategi lain untuk dapat meningkatkan sistem penjualannya. Salah satunya adalah dengan menentukan barang yang akan dipromosikan kepada konsumen. Kumpulan data penjualan yang dimiliki sebenarnya dapat diolah menggunakan data mining untuk melihat pola pembelian pelanggan, dengan data mining untuk data yang besar tidak akan terbuang begitu saja dan dapat bermanfaat sehingga dapat memberikan keuntungan kepada perusahaan. Pada penelitian ini, proses pengolahan data menggunakan Algoritma Apriori yang merupakan salah satu metode data mining yang bertujuan untuk mencari pola assosiasi berdasarkan pola pembelian yang dilakukan oleh konsumen, sehingga bisa diketahui item-item barang apa saja yang sering dibeli secara bersamaan. Kata Kunci : Data Mining, Algoritma Apriori, Promosi Produk.

Penggunaan Association Rule Data Mining Untuk Menentukan Pola Lama Studi Mahasiswa F-MIPA UNSRAT

d'CARTESIAN ◽  
2014 ◽  
Vol 3 (1) ◽  
pp. 1
Author(s):  
M. Zainal Mahmudin ◽  
Altien Rindengan ◽  
Winsy Weku
Keyword(s):  
Data Mining ◽  
Association Rule ◽  
Large Data ◽  
Apriori Algorithm ◽  
Data Mining Algorithms ◽  
Adequate Information ◽  
Processing Data ◽  
Rule Method ◽  
Mining Algorithms ◽  
Confidence Value

Abstract The requirement of highest information sometimes is not balance with the provision of adequate information, so that the information must be re-excavated in large data. By using the technique of association rule we can obtain information from large data such as the college data. The purposes of this research is to determine the patterns of study from student in F-MIPA UNSRAT by using association rule method of data mining algorithms and to compare in the apriori method and a hash-based algorithms. The major’s student data of F-MIPA UNSRAT as a data were processed by association rule method of data mining with the apriori algorithm and a hash-based algorithm by using support and confidance at least 1 %. The results of processing data with apriori algorithms was same with the processing results of hash-based algorithms is as much as 49 combinations of 2-itemset. The pattern that formed between 7,5% of graduates from mathematics major that studied for more 5 years with confidence value is 38,5%. Keywords: Apriori algorithm, hash-based algorithm, association rule, data mining. Abstrak Kebutuhan informasi yang sangat tinggi terkadang tidak diimbangi dengan pemberian informasi yang memadai, sehingga informasi tersebut harus kembali digali dalam data yang besar. Dengan menggunakan teknik association rule kita dapat memperoleh informasi dari data yang besar seperti data yang ada di perguruan tinggi. Tujuan penelitian ini adalah menentukan pola lama studi mahasiswa F-MIPA UNSRAT dengan menggunakan metode association rule data mining serta membandingkan algoritma apriori dan algoritma hash-based. Data yang digunakan adalah data induk mahasiswa F-MIPA UNSRAT yang  diolah menggunakan teknik association rule data mining dengan algoritma apriori dan algoritma hash-based dengan minimum support 1% dan minimum confidance 1%. Hasil pengolahan data dengan algoritma apriori sama dengan hasil pengolahan data dengan algoritma hash-based yaitu sebanyak 49 kombinasi 2-itemset. Pola yang terbentuk antara lain 7,5% lulusan yang berasal dari jurusan matematika menempuh studi selama lebih dari     5 tahun dengan nilai confidence 38,5%. Kata kunci : Association rule data mining, algoritma apriori, algoritma hash-based

From data to knowledge mining

2009 ◽  
Vol 23 (4) ◽  
pp. 427-441 ◽  
Author(s):  
Ana Cristina Bicharra Garcia ◽  
Inhauma Ferraz ◽  
Adriana S. Vivacqua
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Association Rule ◽  
Evaluation Criteria ◽  
Large Data ◽  
Large Data Sets ◽  
Data Sets ◽  
Data Mining Technique ◽  
Mining Technique ◽  
Data Points

AbstractMost past approaches to data mining have been based on association rules. However, the simple application of association rules usually only changes the user's problem from dealing with millions of data points to dealing with thousands of rules. Although this may somewhat reduce the scale of the problem, it is not a completely satisfactory solution. This paper presents a new data mining technique, called knowledge cohesion (KC), which takes into account a domain ontology and the user's interest in exploring certain data sets to extract knowledge, in the form of semantic nets, from large data sets. The KC method has been successfully applied to mine causal relations from oil platform accident reports. In a comparison with association rule techniques for the same domain, KC has shown a significant improvement in the extraction of relevant knowledge, using processing complexity and knowledge manageability as the evaluation criteria.

Different Types of Association Rules Mining Review

2012 ◽  
Vol 241-244 ◽  
pp. 1589-1592
Author(s):  
Jun Tan
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Association Rule ◽  
Rule Mining ◽  
Association Rules Mining ◽  
Fuzzy Association Rules ◽  
Weighted Association Rules ◽  
Application Systems ◽  
Different Types ◽  
Multi Level

In recent years, many application systems have generate large quantities of data, so it is no longer practical to rely on traditional database technique to analyze these data. Data mining offers tools for extracting knowledge from data, leading to significant improvement in the decision-making process. Association rules mining is one of the most important data mining technology. The paper first presents the basic concept of association rule mining, then discuss a few different types of association rules mining including multi-level association rules, multidimensional association rules, weighted association rules, multi-relational association rules, fuzzy association rules.

scholarly journals An Intelligent Recommender System Based on Association Rule Analysis for Requirement Engineering

2020 ◽  
Vol 26 (1) ◽  
pp. 33-49
Author(s):  
Mohammad Muhairat ◽  
Shadi Bi ◽  
Bilal Hawashin ◽  
Mohammad Elbes ◽  
Mahmoud Al-Ayyoub
Keyword(s):  
Data Mining ◽  
Software Engineering ◽  
Recommender System ◽  
Association Rule ◽  
Large Data ◽  
Requirement Engineering ◽  
Main Category ◽  
Data Mining Techniques ◽  
Rule Analysis

Requirement gathering is a vital step in software engineering. Even though many recent researches concentrated on the improvement of the requirement gathering process, many of their works lack completeness especially when the number of users is large. Data Mining techniques have been recently employed in various domains with promising results. In this work, we propose an intelligent recommender system for requirement engineering based on association rule analysis, which is a main category in Data Mining. Such recommender would contribute in enhancing the accuracy of the gathered requirements and provide more comprehensive results. Conducted experiments in this work prove that FP Growth outperformed Apriori in terms of execution and space consumption, while both methods were efficient in term of accuracy.

scholarly journals PREDICTIVE MODELING OF TECHNOLOGICAL DEVELOPMENT TRENDS

2020 ◽  
Vol 55 ◽  
pp. 103-108
Author(s):  
Alla G. Kravets ◽  
◽  
Natalia A. Salnikova ◽  
Keyword(s):  
Neural Network ◽  
Data Mining ◽  
Predictive Modeling ◽  
Technological Development ◽  
Data Sources ◽  
Development Trends ◽  
Data Mining Techniques ◽  
The Neural Network ◽  
Existing Data

In the work, the problem of forecasting technological development trends was considered. A review of the sources of the global patent space, an analysis of technological development trends, a survey of data sources for training the neural network were carried out. Existing data mining techniques were analyzed for more accurate and faster forecasting. A module for predictive modeling of trends in technological development was developed, algorithms for the module for predictive modeling of trends in technological development were described.

Collusion-Free Privacy Preserving Data Mining

2010 ◽  
Vol 6 (4) ◽  
pp. 30-45 ◽  
Author(s):  
M. Rajalakshmi ◽  
T. Purusothaman ◽  
S. Pratheeba
Keyword(s):  
Data Mining ◽  
Association Rule ◽  
Privacy Preserving ◽  
Frequent Itemsets ◽  
Data Sources ◽  
Sensitive Information ◽  
Distributed Data ◽  
Distributed Environment ◽  
Rule Mining ◽  
Privacy Preserving Data Mining

Distributed association rule mining is an integral part of data mining that extracts useful information hidden in distributed data sources. As local frequent itemsets are globalized from data sources, sensitive information about individual data sources needs high protection. Different privacy preserving data mining approaches for distributed environment have been proposed but in the existing approaches, collusion among the participating sites reveal sensitive information about the other sites. In this paper, the authors propose a collusion-free algorithm for mining global frequent itemsets in a distributed environment with minimal communication among sites. This algorithm uses the techniques of splitting and sanitizing the itemsets and communicates to random sites in two different phases, thus making it difficult for the colluders to retrieve sensitive information. Results show that the consequence of collusion is reduced to a greater extent without affecting mining performance and confirms optimal communication among sites.

Sign in / Sign up

Export Citation Format

Share Document