Pages that link to "Item:Q4538719"
From MaRDI portal
The following pages link to Computing iceberg concept lattices with Titanic (Q4538719):
Displayed 50 items.
- Disclosed: an efficient depth-first, top-down algorithm for mining disjunctive closed itemsets in high-dimensional data (Q507623) (← links)
- Valuations and closure operators on finite lattices (Q548273) (← links)
- A heuristic knowledge-reduction method for decision formal contexts (Q552269) (← links)
- A new algebraic structure for formal concept analysis (Q621606) (← links)
- Query-based association rule mining supporting user perspective (Q644885) (← links)
- An efficient method to factorize fuzzy attribute-oriented concept lattices (Q723260) (← links)
- Decision implication canonical basis: a logical perspective (Q743121) (← links)
- On cognitive preferences and the plausibility of rule-based models (Q782445) (← links)
- Approaches to the representations and logic operations of fuzzy concepts in the framework of axiomatic fuzzy set theory. II. (Q867663) (← links)
- Concept analysis via rough set and AFS algebra (Q955720) (← links)
- The multiple facets of the canonical direct unit implicational basis (Q974107) (← links)
- Treatment of L-fuzzy contexts with absent values (Q1007849) (← links)
- Sampling frequent and minimal Boolean patterns: theory and application in classification (Q1741140) (← links)
- Exploratory knowledge discovery over web of data (Q1800378) (← links)
- Boolean substructures in formal concept analysis (Q2117116) (← links)
- Knowledge cores in large formal contexts (Q2149803) (← links)
- Interface between logical analysis of data and formal concept analysis (Q2178106) (← links)
- On interestingness measures of formal concepts (Q2198028) (← links)
- A fast compound algorithm for mining generators, closed itemsets, and computing links between equivalence classes (Q2248536) (← links)
- Generalized pattern extraction from concept lattices (Q2254621) (← links)
- FCA for software product line representation: mixing configuration and feature relationships in a unique canonical representation (Q2286383) (← links)
- On the size of \(\exists \)-generalized concept lattices (Q2286401) (← links)
- \textsc{RCA-seq}: an original approach for enhancing the analysis of sequential data based on hierarchies of multilevel closed partially-ordered patterns (Q2286407) (← links)
- A methodology for analysis of concept lattice reduction (Q2293159) (← links)
- Closed and noise-tolerant patterns in \(n\)-ary relations (Q2377278) (← links)
- Formal concept analysis based on the topology for attributes of a formal context (Q2446428) (← links)
- A framework for incremental generation of closed itemsets (Q2478435) (← links)
- Ontology-based concept similarity in formal concept analysis (Q2509212) (← links)
- Attribute selection using contranominal scales (Q2670898) (← links)
- Introducing the closure structure and the GDPM algorithm for mining and understanding a tabular dataset (Q2671748) (← links)
- A heuristic concept construction approach to collaborative recommendation (Q2671765) (← links)
- Performance-friendly rule extraction in large water data-sets with AOC posets and relational concept analysis (Q2817084) (← links)
- Data mining algorithms to compute mixed concepts with negative attributes: an application to breast cancer data analysis (Q2831029) (← links)
- Biclustering Numerical Data in Formal Concept Analysis (Q3003415) (← links)
- The Agree Concept Lattice for Multidimensional Database Analysis (Q3003421) (← links)
- A PARAMETERIZED ALGORITHM TO EXPLORE FORMAL CONTEXTS WITH A TAXONOMY (Q3526977) (← links)
- ON SUCCINCT REPRESENTATION OF KNOWLEDGE COMMUNITY TAXONOMIES WITH FORMAL CONCEPT ANALYSIS (Q3526981) (← links)
- Camelis: a logical information system to organise and browse a collection of documents (Q3631380) (← links)
- ZooM: a nested Galois lattices-based system for conceptual clustering (Q4409025) (← links)
- Formal Concept Analysis and Extensions for Complex Data Analytics (Q5054972) (← links)
- Scalable Visual Analytics in FCA (Q5054985) (← links)
- Formal Methods in FCA and Big Data (Q5054986) (← links)
- Can triconcepts become triclusters? (Q5326152) (← links)
- Actionability and Formal Concepts: A Data Mining Perspective (Q5445320) (← links)
- From Concepts to Concept Lattice: A Border Algorithm for Making Covers Explicit (Q5445325) (← links)
- Formal Concept Analysis for the Identification of Combinatorial Biomarkers in Breast Cancer (Q5445338) (← links)
- Succinct System of Minimal Generators: A Thorough Study, Limitations and New Definitions (Q5452415) (← links)
- Generic Association Rule Bases: Are They so Succinct? (Q5452425) (← links)
- Towards Concise Representation for Taxonomies of Epistemic Communities (Q5452429) (← links)
- Using Formal Concept Analysis for Mining and Interpreting Patient Flows within a Healthcare Network (Q5452431) (← links)