Amanote Research

Amanote Research

    RegisterSign In

Estimating the Number of Frequent Itemsets in a Large Database

doi 10.1145/1516360.1516420
Full Text
Open PDF
Abstract

Available in full text

Date

January 1, 2009

Authors
Ruoming JinScott McCallenYuri BreitbartDave FuhryDong Wang
Publisher

ACM Press


Related search

Constructing a Large Node Chow-Liu Tree Based on Frequent Itemsets

English

Hiding Co-Occurring Frequent Itemsets

2009English

Mining Frequent Itemsets: A Perspective From Operations Research

Statistica Neerlandica
UncertaintyStatisticsProbability
2010English

Mining Frequent Closed Itemsets Out of Core

2006English

Maintaining Frequent Closed Itemsets Over a Sliding Window

Journal of Intelligent Information Systems
Information SystemsComputer NetworksHardwareCommunicationsArchitectureArtificial IntelligenceSoftware
2007English

Computing Frequent Itemsets Inside Oracle 10G

2004English

Mining Frequent Itemsets With Convertible Constraints

English

Improvements in the Data Partitioning Approach for Frequent Itemsets Mining

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Apriori Algorithm Using Hashing for Frequent Itemsets Mining

International Journal of Education and Management Engineering
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy