scientific article

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

Publication date: 28 April 2002

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Related Items (55)

Formal Methods in FCA and Big Data ⋮ Closed and noise-tolerant patterns in \(n\)-ary relations ⋮ Discovering significant patterns ⋮ MAX-FISM: mining (recently) maximal frequent itemsets over data streams using the sliding window model ⋮ Horn axiomatizations for sequential data ⋮ A survey on enhanced subspace clustering ⋮ RFIMiner: A regression-based algorithm for recently frequent patterns in multiple time granularity data streams ⋮ Introducing the closure structure and the GDPM algorithm for mining and understanding a tabular dataset ⋮ Triadic formal concept analysis and triclustering: searching for optimal patterns ⋮ Krimp: mining itemsets that compress ⋮ Selective association rule generator ⋮ Summarizing categorical data by clustering attributes ⋮ Mining closed strict episodes ⋮ Extracting compact and information lossless sets of fuzzy association rules ⋮ ABACUS: frequent pattern mining-based community discovery in multidimensional networks ⋮ A statistical significance testing approach to mining the most informative set of patterns ⋮ G-Tries: a data structure for storing and finding subgraphs ⋮ New and efficient algorithms for producing frequent itemsets with the Map-Reduce framework ⋮ Learning multi-linear representations of distributions for efficient inference ⋮ Discrimination- and privacy-aware patterns ⋮ Itemset mining: a constraint programming perspective ⋮ Formal concept analysis based on the topology for attributes of a formal context ⋮ A tutorial on statistically sound pattern discovery ⋮ A convexity upper bound for the number of maximal bicliques of a bipartite graph ⋮ The Agree Concept Lattice for Multidimensional Database Analysis ⋮ Mining significant association rules from uncertain data ⋮ Identifying consistent statements about numerical data with dispersion-corrected subgroup discovery ⋮ Interpretation of text patterns ⋮ Expressive generalized itemsets ⋮ Mining closed patterns in relational, graph and network data ⋮ A fast compound algorithm for mining generators, closed itemsets, and computing links between equivalence classes ⋮ Probabilistic generalization of formal concepts ⋮ Itemset frequency satisfiability: complexity and axiomatization ⋮ Valuations and closure operators on finite lattices ⋮ Frequency-based views to pattern collections ⋮ Generating dual-bounded hypergraphs ⋮ Generating a condensed representation for association rules ⋮ Generating frequent itemsets incrementally: two novel approaches based on Galois lattice theory ⋮ ZooM: a nested Galois lattices-based system for conceptual clustering ⋮ Comparing performance of algorithms for generating concept lattices ⋮ Formal Concept Analysis for the Identification of Combinatorial Biomarkers in Breast Cancer ⋮ Hybridization of GRASP metaheuristic with data mining techniques ⋮ An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence ⋮ Succinct System of Minimal Generators: A Thorough Study, Limitations and New Definitions ⋮ Generic Association Rule Bases: Are They so Succinct? ⋮ Parallel algorithms for enumerating closed patterns from multi-relational data ⋮ Top-down mining of frequent closed patterns from very high dimensional data ⋮ \textsc{Para}\textsc{Miner}: a generic pattern mining algorithm for multi-core architectures ⋮ A time-efficient breadth-first level-wise lattice-traversal algorithm to discover rare itemsets ⋮ Layered critical values: a powerful direct-adjustment approach to discovering significant patterns ⋮ Association Rules Network: Definition and Applications ⋮ Meta itemset: a new concise representation of frequent itemset ⋮ An algorithm for discovering the frequent closed itemsets in a large database ⋮ The minimum description length principle for pattern mining: a survey ⋮ Exact and Approximate Minimal Pattern Mining

This page was built for publication: