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

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-44497-8_1
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Improvements in the Data Partitioning Approach for Frequent Itemsets Mining

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Hiding Co-Occurring Frequent Itemsets

2009English

Mining Frequent Closed Itemsets Out of Core

2006English

Computing Frequent Itemsets Inside Oracle 10G

2004English

Mining Frequent Itemsets With Convertible Constraints

English

Mining Frequent Itemsets: A Perspective From Operations Research

Statistica Neerlandica
UncertaintyStatisticsProbability
2010English

Estimating the Number of Frequent Itemsets in a Large Database

2009English

Maintaining Frequent Closed Itemsets Over a Sliding Window

Journal of Intelligent Information Systems
Information SystemsComputer NetworksHardwareCommunicationsArchitectureArtificial IntelligenceSoftware
2007English

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