Amanote Research

Amanote Research

    RegisterSign In

Improvements in the Data Partitioning Approach for Frequent Itemsets Mining

Lecture Notes in Computer Science - Germany
doi 10.1007/11564126_66
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2005

Authors
Son N. NguyenMaria E. Orlowska
Publisher

Springer Berlin Heidelberg


Related search

The Algorithm for Mining Global Frequent Itemsets Based on Big Data

2015English

Apriori Algorithm Using Hashing for Frequent Itemsets Mining

International Journal of Education and Management Engineering
2018English

Mining Frequent Itemsets With Convertible Constraints

English

Mining Frequent Closed Itemsets Out of Core

2006English

Mining Frequent Itemsets: A Perspective From Operations Research

Statistica Neerlandica
UncertaintyStatisticsProbability
2010English

Text Mining: Extraction of Interesting Association Rule With Frequent Itemsets Mining for Korean Language From Unstructured Data

International Journal of Multimedia and Ubiquitous Engineering
Computer Science
2015English

Model for Load Balancing on Processors in Parallel Mining of Frequent Itemsets

American Journal of Applied Sciences
Multidisciplinary
2005English

Inductive Databases and Multiple Uses of Frequent Itemsets: The cInQ Approach

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Hiding Co-Occurring Frequent Itemsets

2009English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy