Mining N-Most Interesting Itemsets Without Support Threshold by the COFI-tree

International Journal of Business Intelligence and Data Mining - United Kingdom
doi 10.1504/ijbidm.2005.007320
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Inderscience Publishers

Related search

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

Healthcare Trajectory Mining by Combining Multidimensional Component and Itemsets

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Mining Frequent Closed Itemsets Out of Core

2006English

Deducing Bounds on the Support of Itemsets

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Mining Frequent Itemsets With Convertible Constraints

English

Mining Association Rules for Low-Frequency Itemsets

PLoS ONE
Multidisciplinary
2018English

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

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy