Amanote Research

Amanote Research

  • Register
  • Sign In

Efficient Vertical Mining of Frequent Closures and Generators

Lecture Notes in Computer Science- Germany

doi 10.1007/978-3-642-03915-7_34

Full Text

Abstract

Available in

Categories

Computer ScienceTheoretical Computer Science

Date

January 1, 2009

Authors

Laszlo SzathmaryPetko ValtchevAmedeo NapoliRobert Godin

Publisher

Springer Berlin Heidelberg


Related search

Efficient Frequent Pattern Mining on Web Logs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

An Efficient R-Apriori Algorithm for Frequent Item Set Mining in Python

International Journal of Recent Technology and Engineering
EngineeringManagement of TechnologyInnovation
2019English

Frequent Substructure Mining of GPCR Ligands

Chemistry Central Journal
Chemistry
2009English

Mining Billion-Node Graphs: Patterns, Generators and Tools

2010English

A Survey of Frequent Subgraph Mining Algorithms

International Journal of Engineering and Technology(UAE)
ArchitectureHardwareEngineeringChemical EngineeringBiotechnologyEnvironmental EngineeringComputer Science
2018English

On Differentially Private Frequent Itemset Mining

Proceedings of the VLDB Endowment
Computer Science
2012English

Frequent Tree Pattern Mining: A Survey

Intelligent Data Analysis
Computer VisionPattern RecognitionArtificial IntelligenceTheoretical Computer Science
2010English

Mining Frequent Closed Itemsets Out of Core

2006English

Mining Frequent Spatio-Temporal Sequential Patterns

English

Amanote Research

Note-taking for researchers

Follow Amanote


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

Privacy PolicyRefund Policy