Computing iceberg concept lattices with Titanic
From MaRDI portal
Publication:4538719
DOI10.1016/S0169-023X(02)00057-5zbMath0996.68046OpenAlexW2051508823MaRDI QIDQ4538719
Lotfi Lakhal, Yves Bastide, Nicolas Pasquier, Rafik Taouil, Gerd Stumme
Publication date: 15 July 2002
Published in: Data & Knowledge Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0169-023x(02)00057-5
Related Items (55)
Formal Concept Analysis and Extensions for Complex Data Analytics ⋮ Scalable Visual Analytics in FCA ⋮ Formal Methods in FCA and Big Data ⋮ Closed and noise-tolerant patterns in \(n\)-ary relations ⋮ Knowledge cores in large formal contexts ⋮ Approaches to the representations and logic operations of fuzzy concepts in the framework of axiomatic fuzzy set theory. II. ⋮ Can triconcepts become triclusters? ⋮ Interface between logical analysis of data and formal concept analysis ⋮ Attribute selection using contranominal scales ⋮ Introducing the closure structure and the GDPM algorithm for mining and understanding a tabular dataset ⋮ A heuristic concept construction approach to collaborative recommendation ⋮ A new algebraic structure for formal concept analysis ⋮ Factorizing lattices by interval relations ⋮ Conceptual views on tree ensemble classifiers ⋮ On interestingness measures of formal concepts ⋮ Formal concept analysis for the generation of plural referring expressions ⋮ On the lattice of conceptual measurements ⋮ A PARAMETERIZED ALGORITHM TO EXPLORE FORMAL CONTEXTS WITH A TAXONOMY ⋮ ON SUCCINCT REPRESENTATION OF KNOWLEDGE COMMUNITY TAXONOMIES WITH FORMAL CONCEPT ANALYSIS ⋮ Query-based association rule mining supporting user perspective ⋮ Formal concept analysis based on the topology for attributes of a formal context ⋮ Biclustering Numerical Data in Formal Concept Analysis ⋮ The Agree Concept Lattice for Multidimensional Database Analysis ⋮ Sampling frequent and minimal Boolean patterns: theory and application in classification ⋮ Disclosed: an efficient depth-first, top-down algorithm for mining disjunctive closed itemsets in high-dimensional data ⋮ Concept analysis via rough set and AFS algebra ⋮ A fast compound algorithm for mining generators, closed itemsets, and computing links between equivalence classes ⋮ A framework for incremental generation of closed itemsets ⋮ Generalized pattern extraction from concept lattices ⋮ Valuations and closure operators on finite lattices ⋮ The multiple facets of the canonical direct unit implicational basis ⋮ A heuristic knowledge-reduction method for decision formal contexts ⋮ ZooM: a nested Galois lattices-based system for conceptual clustering ⋮ An efficient method to factorize fuzzy attribute-oriented concept lattices ⋮ Actionability and Formal Concepts: A Data Mining Perspective ⋮ From Concepts to Concept Lattice: A Border Algorithm for Making Covers Explicit ⋮ Formal Concept Analysis for the Identification of Combinatorial Biomarkers in Breast Cancer ⋮ Ontology-based concept similarity in formal concept analysis ⋮ FCA for software product line representation: mixing configuration and feature relationships in a unique canonical representation ⋮ On the size of \(\exists \)-generalized concept lattices ⋮ \textsc{RCA-seq}: an original approach for enhancing the analysis of sequential data based on hierarchies of multilevel closed partially-ordered patterns ⋮ Succinct System of Minimal Generators: A Thorough Study, Limitations and New Definitions ⋮ Generic Association Rule Bases: Are They so Succinct? ⋮ Towards Concise Representation for Taxonomies of Epistemic Communities ⋮ Using Formal Concept Analysis for Mining and Interpreting Patient Flows within a Healthcare Network ⋮ Exploratory knowledge discovery over web of data ⋮ A methodology for analysis of concept lattice reduction ⋮ Treatment of L-fuzzy contexts with absent values ⋮ A Formal Concept Analysis Approach to Rough Data Tables ⋮ Decision implication canonical basis: a logical perspective ⋮ Camelis: a logical information system to organise and browse a collection of documents ⋮ Performance-friendly rule extraction in large water data-sets with AOC posets and relational concept analysis ⋮ Data mining algorithms to compute mixed concepts with negative attributes: an application to breast cancer data analysis ⋮ On cognitive preferences and the plausibility of rule-based models ⋮ Boolean substructures in formal concept analysis
Uses Software
This page was built for publication: Computing iceberg concept lattices with Titanic
