Privacy-Preserving Data Mining with Random decision tree framework
Journal Title: IOSR Journals (IOSR Journal of Computer Engineering) - Year 2017, Vol 19, Issue 4
Abstract
Data mining is the useful tool to discovering the knowledge from large data. Different methods & algorithms are available in data mining. Classification is most common method used for finding the mine rule from the large database. Decision tree method generally used for the Classification, because it is the simple hierarchical structure for the user understanding & decision making. Various data mining algorithms available for classification based on Artificial Neural Network, Nearest Neighbour Rule & Bayesian classifiers but decision tree mining is simple one. ID3 and C4.5 algorithms have been introduced by J.R Quinlan which produce reasonable decision trees. The objective of this paper is to present these algorithms. At first we present the classical algorithm that is ID3, then highlights of this study we will discuss in more detail C4.5 this one is a natural extension of the ID3 algorithm. And we will make a comparison between these two algorithms and others algorithms such as C5.0 and CART. Indexterms: Data mining, Privacy-preserving data mining, classification horizontal partitioning, vertical partitioning
Authors and Affiliations
Ms. Ch. Likitha Sravya, Mrs. G. V Rajya Lakshmi
Keywords
Related Articles
- EP ID EP385559
- DOI 10.9790/0661-1904034349.
- Views 117
- Downloads 0
A Review: Hadoop Storage and Clustering Algorithms
Abstract : In the last few years there has been voluminous increase in the storing and processing of data, which require convincing speed and also requirement of storage space. Big data is a defined as large, diverseand...
VRIT: An Innovative Approach of Industrial Training through Virtual Reality
The emerging global competition and increasing costs are a great challenge to industries. New cost effective training methods are explored to cope with this demand. In-depth knowledge of the functions in a fact...
Control of coding in DTN’s for progressive packet arrivals dynamically”
Abstract: In Delay Tolerant Networks (DTNs) the core challenge is to cope with lack of persistent connectivity and yet be able to deliver messages from source to destination. In particular, routing schemes that leverage...
Search Accelerator
Abstract: Optimization problem consists of maximizing or minimizing a real function by systematically Choosing input values from within an allowed set and the value of the function can be solved. Whenever the use...
WMNs: The Design and Analysis of Fair Scheduling
Abstract: In this paper an attempt has been made to address the matter of scheduling in wireless mesh networks. First, we offer a comparison of existing scheduling algorithms and then classify them based on the schedulin...