Data Mining Algorithms, Fog Computing

2018 ◽  
pp. 231-264
Author(s):  
S. Thilagamani ◽  
A. Jayanthiladevi ◽  
N. Arunkumar
Keyword(s):  
Data Mining ◽  
Association Rule ◽  
Fog Computing ◽  
Data Warehouses ◽  
Data Repositories ◽  
Data Mining Algorithms ◽  
Classification Prediction ◽  
Mining Algorithms

Different methods are used to mine the large amount of data presents in databases, data warehouses, and data repositories. The methods used for mining include clustering, classification, prediction, regression, and association rule. This chapter explores data mining algorithms and fog computing.

Association Rule Mining of Relational Data

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.

scholarly journals Using Data Mining Algorithms to Discover Regular Sound Changes among Languages

2019 ◽  
Vol 292 ◽  
pp. 03018
Author(s):  
Peter Z. Revesz
Keyword(s):  
Data Mining ◽  
Association Rule ◽  
Sound Change ◽  
Mining Method ◽  
Data Mining Method ◽  
Data Mining Algorithms ◽  
Sound Changes ◽  
Using Data ◽  
Mining Algorithms

This paper presents a method of using association rule data mining algorithms to discover regular sound changes among languages. The method presented has a great potential to facilitate linguistic studies aimed at identifying distantly related cognate languages. As an experimental example, this paper presents the application of the data mining method to the discovery of regular sound changes between the Hungarian and the Sumerian languages, which separated at least five thousand years ago when the Proto-Sumerian reached Mesopotamia. The data mining method discovered an important regular sound change between Hungarian word initial /f/ and Sumerian word initial /b/ phonemes.

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

Data Mining Algorithms and Techniques

2018 ◽  
pp. 195-208
Author(s):  
Ambika P.
Keyword(s):  
Data Mining ◽  
Fog Computing ◽  
Research Directions ◽  
Comprehensive Review ◽  
Data Mining Techniques ◽  
Targeted Advertising ◽  
Data Mining Algorithms ◽  
Processing Cost ◽  
Mining Algorithms

Integration of data mining tasks in day-to-day life has become popular and common. Everyday people are confronted with opportunities and challenges with targeted advertising, and data mining techniques will help the businesses to become more efficient by reducing processing cost. This goal of this chapter is to provide a comprehensive review about data mining, data mining techniques, popular algorithms, and their impact on fog computing. This chapter also gives further research directions on data mining on fog computing.

Association Rule Mining of Regional Data

2011 ◽  
pp. 70-73
Author(s):  
Anne Denton ◽  
Christopher Besemann
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 problems that are new to the generalized setting.

Algorithms of Mining Maximum Frequent Itemsets Based on Compression Matrix

2014 ◽  
Vol 571-572 ◽  
pp. 57-62
Author(s):  
Si Hui Shu ◽  
Zi Zhi Lin
Keyword(s):  
Data Mining ◽  
Association Rule ◽  
Association Rule Mining ◽  
Recursive Algorithm ◽  
Frequent Itemsets ◽  
Rule Mining ◽  
Temporal Complexity ◽  
Data Mining Algorithms ◽  
Association Data ◽  
Mining Algorithms

Association rule mining is one of the most important and well researched techniques of data mining, the key procedure of the association rule mining is to find frequent itemsets , the frequent itemsets are easily obtained by maximum frequent itemsets. so finding maximum frequent itemsets is one of the most important strategies of association data mining. Algorithms of mining maximum frequent itemsets based on compression matrix are introduced in this paper. It mainly obtains all maximum frequent itemsets by simply removing a set of rows and columns of transaction matrix, which is easily programmed recursive algorithm. The new algorithm optimizes the known association rule mining algorithms based on matrix given by some researchers in recent years, which greatly reduces the temporal complexity and spatial complexity, and highly promotes the efficiency of association rule mining.

Sensitive Items in Privacy Preserving — Association Rule Mining

2008 ◽  
Vol 07 (01) ◽  
pp. 31-35
Author(s):  
K. Duraiswamy ◽  
N. Maheswari
Keyword(s):  
Data Mining ◽  
Private Information ◽  
Association Rule ◽  
Association Rule Mining ◽  
Privacy Preserving ◽  
Data Input ◽  
Rule Mining ◽  
Privacy Preserving Data Mining ◽  
Data Mining Algorithms ◽  
Mining Algorithms

Privacy-preserving has recently been proposed in response to the concerns of preserving personal or sensible information derived from data-mining algorithms. For example, through data-mining, sensible information such as private information or patterns may be inferred from non-sensible information or unclassified data. As large repositories of data contain confidential rules that must be protected before published, association rule hiding becomes one of important privacy preserving data-mining problems. There have been two types of privacy concerning data-mining. Output privacy tries to hide the mining results by minimally altering the data. Input privacy tries to manipulate the data so that the mining result is not affected or minimally affected. For some applications certain sensitive predictive rules are hidden that contain given sensitive items. To identify the sensitive items an algorithm SENSITEM is proposed. The results of the work have been given.

scholarly journals Developing a New Project Evaluation Systems Based on Knowledge

2013 ◽  
Vol 5 (2) ◽  
pp. 59-68 ◽  
Author(s):  
Tadeusz A. Grzeszczyk
Keyword(s):  
Data Mining ◽  
Association Rule ◽  
Evaluation System ◽  
Project Evaluation ◽  
Systems Development ◽  
Rule Base ◽  
Data Sets ◽  
Evaluation Systems ◽  
Data Mining Algorithms ◽  
Mining Algorithms

Abstract The article is dedicated to the modelling of a new project evaluation systems based on knowledge. Author suggests possible direction of project evaluation systems development. This enabled the application of data mining algorithms for discovering patterns in data sets. The concept of a new evaluation system based on knowledge is synthetically discussed. The example of using association rule base for analysis of project stakeholders surveys is also presented.

Sign in / Sign up

Export Citation Format

Share Document