Deducing Bounds on the Support of Itemsets

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

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

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

International Journal of Business Intelligence and Data Mining
StatisticsProbabilityUncertaintyInformation SystemsManagementManagement Information Systems
2005English

On Deducing Causality in Metabolic Networks

BMC Bioinformatics
BiochemistryApplied MathematicsComputer Science ApplicationsStructural BiologyMolecular Biology
2008English

The Algorithm for Mining Global Frequent Itemsets Based on Big Data

2015English

Deducing the Milky Way's Massive Cluster Population

Proceedings of the International Astronomical Union
AstrophysicsAstronomyPlanetary ScienceSpace
2009English

Survey On: Mining High Utility Itemsets From Transactional Database

IOSR Journal of Computer Engineering
2014English

Mining Frequent Closed Itemsets Out of Core

2006English

Clustering Zebrafish Genes Based on Frequent-Itemsets and Frequency Levels

English

Sharp Bounds on the Bias of Trimean

Statistical Papers
UncertaintyStatisticsProbability
2014English

Deducing Linguistic Structure From the Statistics of Large Corpora

1990English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy