0
Your cart

Your cart is empty

Books > Computing & IT > General theory of computing

Buy Now

Data Mining (Paperback) Loot Price: R1,555
Discovery Miles 15 550
Data Mining (Paperback): Dhaliwal Dalvinder Singh

Data Mining (Paperback)

Dhaliwal Dalvinder Singh

 (sign in to rate)
Loot Price R1,555 Discovery Miles 15 550 | Repayment Terms: R146 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

Data mining is the process of automatically extracting new and useful knowledge hidden in large datasets. This book focuses on the enhancement of following three data mining techniques for achieving the better mining results: Association Rule Mining (ARM), Clustering Classification In Association Rule Mining (ARM), two algorithms known as Apriori algorithm and FP-Growth algorithm have been enhanced for better mining results. An efficient partitional clustering algorithm utilizing the well-known technique, k-means clustering is proposed in this book to tackle the problem of empty clusters. Classification operation usually uses supervised learning methods that induce a classification model from a database. The k-Nearest Neighbor (k-NN) is one of the simplest classification methods used in data mining and machine learning. in this book, the proposed algorithm improved the performance of conventional k-NN algorithm by identifying the optimal value of k."

General

Imprint: Lap Lambert Academic Publishing
Country of origin: United States
Release date: November 2012
First published: November 2012
Authors: Dhaliwal Dalvinder Singh
Dimensions: 229 x 152 x 10mm (L x W x T)
Format: Paperback - Trade
Pages: 164
ISBN-13: 978-3-659-29154-8
Categories: Books > Computing & IT > General theory of computing > General
LSN: 3-659-29154-4
Barcode: 9783659291548

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners