Name: Designing a Multi Level Support Based Association Mining Algorithm (en Inglés)
Price: 598.33 MXN
Availability: InStock
Author: Vasanthapriyan, Shanmuganathan ; Samaraweera, Wishma J.
ISBN: 9781312559516

Envío gratis

portada Designing a Multi Level Support Based Association Mining Algorithm (en Inglés)

Formato

Libro Físico

Autor

Shanmuganathan Vasanthapriyan

Wishma J. Samaraweera

Editorial

Lulu.com

Idioma

Inglés

N° páginas

Encuadernación

Tapa Blanda

Dimensiones

22.9 x 15.2 x 0.6 cm

Peso

0.15 kg.

ISBN13

9781312559516

Categorías

Gestión empresarial

Designing a Multi Level Support Based Association Mining Algorithm (en Inglés)

Shanmuganathan Vasanthapriyan (Autor) · Wishma J. Samaraweera (Autor) · Lulu.com · Tapa Blanda

Libro Nuevo

$ 598.33

$ 997.21

Ahorras: $ 398.89

40% descuento

Envío normal

Origen: Estados Unidos (Costos de importación incluídos en el precio)

Se enviará desde nuestra bodega entre el Miércoles 17 de Julio y el Jueves 25 de Julio.

Lo recibirás en cualquier lugar de México entre 1 y 3 días hábiles luego del envío.

Reseña del libro "Designing a Multi Level Support Based Association Mining Algorithm (en Inglés)"

Finding of hidden and previously unknown information in large collection of data is the process of data mining. Mining association rules is a very important model in data mining. Using association rules different type of regularities and patterns can be identified. The main approach of association rules is the market basket analysis which exposes relationships between the items customers are regularly buying. In most of the previous approaches of finding association rules a single minimum support threshold value is used for all the items or itemsets. But all the items in an itemset do not behave in the same way where some appear very frequently and some appear very rarely. Therefore the support requirements should vary with different items. Here we proposed new algorithm and was tested using different data sets to prove the advantages. The analysis showed that the proposed algorithm is easy and efficient and it saves time by focusing only on necessary associations comparing to existing algorithms.