Data mining in distributed environment: a survey

2017 ◽  
Vol 7 (6) ◽  
Author(s):  
Wensheng Gan ◽  
Jerry Chun‐Wei Lin ◽  
Han‐Chieh Chao ◽  
Justin Zhan
Keyword(s):  
Data Mining ◽  
Distributed Environment

Issues of K Means Clustering While Migrating to Map Reduce Paradigm with Big Data: A Survey

2016 ◽  
Vol 6 (6) ◽  
pp. 3047 ◽  
Author(s):  
Khyati R Nirmal ◽  
K.V.V. Satyanarayana
Keyword(s):  
Data Mining ◽  
Big Data ◽  
Distinct Group ◽  
Map Reduce ◽  
Data Mining Algorithm ◽  
Distributed Environment ◽  
Significant Information ◽  
User Influence ◽  
Initial Cluster ◽  
Machine Learning Approach

<p><span>In recent times Big Data Analysis are imminent as essential area in the field of Computer Science. Taking out of significant information from Big Data by separating the data in to distinct group is crucial task and it is beyond the scope of commonly used personal machine. It is necessary to adopt the distributed environment similar to map reduce paradigm and migrate the data mining algorithm using it. In Data Mining the partition based K Means Clustering is one of the broadly used algorithms for grouping data according to the degree of similarities between data. It requires the number of K and initial centroid of cluster as input. By surveying the parameters preferred by algorithm or opted by user influence the functionality of Algorithm. It is the necessity to migrate the K means Clustering on MapReduce and predicts the value of k using machine learning approach. For selecting the initial cluster the efficient method is to be devised and united with it. This paper is comprised the survey of several methods for predicting the value of K in K means Clustering and also contains the survey of different methodologies to find out initial center of the cluster. Along with initial value of k and initial centroid selection the objective of proposed work is to compact with analysis of categorical data.</span></p>

scholarly journals Issues of K Means Clustering While Migrating to Map Reduce Paradigm with Big Data: A Survey

2016 ◽  
Vol 6 (6) ◽  
pp. 3047
Author(s):  
Khyati R Nirmal ◽  
K.V.V. Satyanarayana
Keyword(s):  
Data Mining ◽  
Big Data ◽  
Distinct Group ◽  
Map Reduce ◽  
Data Mining Algorithm ◽  
Distributed Environment ◽  
Significant Information ◽  
User Influence ◽  
Initial Cluster ◽  
Machine Learning Approach

<p><span>In recent times Big Data Analysis are imminent as essential area in the field of Computer Science. Taking out of significant information from Big Data by separating the data in to distinct group is crucial task and it is beyond the scope of commonly used personal machine. It is necessary to adopt the distributed environment similar to map reduce paradigm and migrate the data mining algorithm using it. In Data Mining the partition based K Means Clustering is one of the broadly used algorithms for grouping data according to the degree of similarities between data. It requires the number of K and initial centroid of cluster as input. By surveying the parameters preferred by algorithm or opted by user influence the functionality of Algorithm. It is the necessity to migrate the K means Clustering on MapReduce and predicts the value of k using machine learning approach. For selecting the initial cluster the efficient method is to be devised and united with it. This paper is comprised the survey of several methods for predicting the value of K in K means Clustering and also contains the survey of different methodologies to find out initial center of the cluster. Along with initial value of k and initial centroid selection the objective of proposed work is to compact with analysis of categorical data.</span></p>

Effective Fuzzy Ontology Based Distributed Document Using Non-Dominated Ranked Genetic Algorithm

2012 ◽  
pp. 243-264
Author(s):  
M. Thangamani ◽  
P. Thangaraj
Keyword(s):  
Artificial Intelligence ◽  
Data Mining ◽  
Genetic Algorithm ◽  
Document Clustering ◽  
Distributed Environment ◽  
Data Set ◽  
Clustering Technique ◽  
Machine Readable ◽  
Readable Format ◽  
Machine Readable Format

The increase in the number of documents has aggravated the difficulty of classifying those documents according to specific needs. Clustering analysis in a distributed environment is a thrust area in artificial intelligence and data mining. Its fundamental task is to utilize characters to compute the degree of related corresponding relationship between objects and to accomplish automatic classification without earlier knowledge. Document clustering utilizes clustering technique to gather the documents of high resemblance collectively by computing the documents resemblance. Recent studies have shown that ontologies are useful in improving the performance of document clustering. Ontology is concerned with the conceptualization of a domain into an individual identifiable format and machine-readable format containing entities, attributes, relationships, and axioms. By analyzing types of techniques for document clustering, a better clustering technique depending on Genetic Algorithm (GA) is determined. Non-Dominated Ranked Genetic Algorithm (NRGA) is used in this paper for clustering, which has the capability of providing a better classification result. The experiment is conducted in 20 newsgroups data set for evaluating the proposed technique. The result shows that the proposed approach is very effective in clustering the documents in the distributed environment.

Study on distributed privacy preserving data mining

2014 ◽  
Vol 11 (2) ◽  
pp. 163-170
Author(s):  
Binli Wang ◽  
Yanguang Shen
Keyword(s):  
Data Mining ◽  
Data Privacy ◽  
Rapid Development ◽  
Privacy Preserving ◽  
Future Research ◽  
Distributed Data ◽  
Distributed Environment ◽  
Privacy Preserving Data Mining ◽  
Advantages And Disadvantages ◽  
Future Research Directions

Recently, with the rapid development of network, communications and computer technology, privacy preserving data mining (PPDM) has become an increasingly important research in the field of data mining. In distributed environment, how to protect data privacy while doing data mining jobs from a large number of distributed data is more far-researching. This paper describes current research of PPDM at home and abroad. Then it puts emphasis on classifying the typical uses and algorithms of PPDM in distributed environment, and summarizing their advantages and disadvantages. Furthermore, it points out the future research directions in the field.

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.

Collusion-Free Privacy Preserving Data Mining

2012 ◽  
pp. 269-284
Author(s):  
T. Purusothaman ◽  
M. Rajalakshmi ◽  
S. Pratheeba
Keyword(s):  
Data Mining ◽  
Privacy Preserving ◽  
Frequent Itemsets ◽  
Data Sources ◽  
Sensitive Information ◽  
Distributed Data ◽  
Distributed Environment ◽  
Rule Mining ◽  
Privacy Preserving Data Mining ◽  
Distributed Association

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