Amanote Research

Amanote Research

    RegisterSign In

Mining Frequent Itemsets With Convertible Constraints

doi 10.1109/icde.2001.914856
Full Text
Open PDF
Abstract

Available in full text

Date

Unknown

Authors
L.V.S. Lakshmanan
Publisher

IEEE Comput. Soc


Related search

Pushing Convertible Constraints in Frequent Itemset Mining

Data Mining and Knowledge Discovery
Computer NetworksComputer Science ApplicationsInformation SystemsCommunications
2004English

Mining Frequent Closed Itemsets Out of Core

2006English

Mining Frequent Itemsets: A Perspective From Operations Research

Statistica Neerlandica
UncertaintyStatisticsProbability
2010English

Apriori Algorithm Using Hashing for Frequent Itemsets Mining

International Journal of Education and Management Engineering
2018English

Improvements in the Data Partitioning Approach for Frequent Itemsets Mining

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Closed Frequent Itemset Mining With Arbitrary Side Constraints

2018English

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

The Algorithm for Mining Global Frequent Itemsets Based on Big Data

2015English

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

American Journal of Applied Sciences
Multidisciplinary
2005English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy