Generating a condensed representation for association rules

DOI10.1007/S10844-005-0266-ZzbMATH Open1071.68022OpenAlexW1997309399MaRDI QIDQ1774512FDOQ1774512

Nicolas Pasquier, Yves Bastide, Rafik Taouil, Gerd Stumme, Lotfi Lakhal

Publication date: 17 May 2005

Published in: Journal of Intelligent Information Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10844-005-0266-z

zbMATH Keywords

data mininggeneratorsbasis for association rulescondensed representationfrequent closed itemsetsGalois closure operatormin-max association rules

Mathematics Subject Classification ID

Database theory (68P15) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)

Cites Work

• CLOSET
• Minimum Covers in Relational Database Model
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (9)

• Closed-Set-Based Discovery of Representative Association Rules
• The Agree Concept Lattice for Multidimensional Database Analysis
• Valuations and closure operators on finite lattices
• Succinct System of Minimal Generators: A Thorough Study, Limitations and New Definitions
• Abstract Concept Lattices
• Generic Association Rule Bases: Are They so Succinct?
• ON THE NON-REDUNDANT REPRESENTATION OF THE MINIMAX BASIS OF STRONG ASSOCIATIONS
• Introducing the closure structure and the GDPM algorithm for mining and understanding a tabular dataset
• Extracting attribute implications from a formal context: unifying the basic approaches

Uses Software

• UCI-ml
• CLOSET

This page was built for publication: Generating a condensed representation for association rules

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1774512)