scientific article; zbMATH DE number 1943768
From MaRDI portal
Publication:4409792
zbMath1019.68715MaRDI QIDQ4409792
Publication date: 1 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2447/24470092.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Database theory (68P15) Pattern recognition, speech recognition (68T10) Computing methodologies and applications (68U99) Knowledge representation (68T30) Information storage and retrieval of data (68P20)
Related Items (7)
Generalization of association rules through disjunction ⋮ Generalized disjunction-free representation of frequent patterns with negation ⋮ A fast compound algorithm for mining generators, closed itemsets, and computing links between equivalence classes ⋮ Succinct System of Minimal Generators: A Thorough Study, Limitations and New Definitions ⋮ Generic Association Rule Bases: Are They so Succinct? ⋮ Closed-Set-Based Discovery of Representative Association Rules ⋮ Measuring the Implications of the D-Basis in Analysis of Data in Biomedical Studies
This page was built for publication:
