scientific article; zbMATH DE number 1249514
From MaRDI portal
Publication:4230685
zbMath0909.06001MaRDI QIDQ4230685
Publication date: 8 February 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
tensormeasuresatlasdecompositioncomplete latticesautomorphismsdistributivitylattice theoryformal concept analysisGalois connectionsmodularitypartial orderingconcept latticesglueingformal contextshierarchies of concepts
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Complete lattices, completions (06B23) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to ordered structures (06-01)
Related Items (only showing first 100 items - show all)
On computing the Galois lattice of bipartite distance hereditary graphs ⋮ Computing the least common subsumer w.r.t. a background terminology ⋮ A note on variable threshold concept lattices: threshold-based operators are reducible to classical concept-forming operators ⋮ Reduction method for concept lattices based on rough set theory and its application ⋮ Comparison of reduction in formal decision contexts ⋮ Soft rough approximation operators and related results ⋮ Optimal factorization of three-way binary data using triadic concepts ⋮ Rough sets approach to symbolic value partition ⋮ On stability of a formal concept ⋮ The Galois lattice as a hierarchical structure for topological relations ⋮ Relational concept discovery in structured datasets ⋮ Attribute-incremental construction of the canonical implication basis ⋮ The structure of the overhanging relations associated with some types of closure systems ⋮ A local approach to concept generation ⋮ Dedekind-MacNeille completion of \(n\)-ordered sets ⋮ Fast factorization by similarity in formal concept analysis of data with fuzzy attributes ⋮ On the notion of concept. I ⋮ Approaches to knowledge reduction in generalized consistent decision formal context ⋮ Grouping fuzzy sets by similarity ⋮ On very true operators on pocrims ⋮ Fixed points of adjoint functors enriched in a quantaloid ⋮ From equivalence queries to PAC learning: the case of implication theories ⋮ Knowledge representation using interval-valued fuzzy formal concept lattice ⋮ Decision bireducts and decision reducts -- a comparison ⋮ Simplicial complexes and closure systems induced by indistinguishability relations ⋮ Complex vague set based concept lattice ⋮ Dependency structures for decision tables ⋮ Duality results for (co)residuated lattices ⋮ Dichotomic lattices and local discretization for Galois lattices ⋮ Optimal decompositions of matrices with grades into binary and graded matrices ⋮ On the connection between many-valued contexts and general geometric structures ⋮ Factorization of fuzzy concept lattices with hedges by modification of input data ⋮ Generalization of association rules through disjunction ⋮ On the isomorphism problem of concept algebras ⋮ A formal concept analysis of harmonic forms and interval structures ⋮ Parallel algorithm for computing fixpoints of Galois connections ⋮ Formal concept analysis based on the topology for attributes of a formal context ⋮ Closure-based constraints in formal concept analysis ⋮ A convexity upper bound for the number of maximal bicliques of a bipartite graph ⋮ Counting proper mergings of chains and antichains ⋮ Rough sets determined by tolerances ⋮ Variable threshold concept lattices ⋮ Set approximations in fuzzy formal concept analysis ⋮ On the join dependency relation in multinomial lattices ⋮ A multiview approach for intelligent data analysis based on data operators ⋮ Rough fuzzy approximations on two universes of discourse ⋮ Quasi-concave functions on meet-semilattices ⋮ A framework for incremental generation of closed itemsets ⋮ \textsc{QualityCover}: efficient binary relation coverage guided by induced knowledge quality ⋮ L-concept analysis with positive and negative attributes ⋮ On biconcepts in formal fuzzy concept analysis ⋮ Canonical dichotomous direct bases ⋮ Efficient incremental maintenance for distributive and non-distributive aggregate functions ⋮ Object-oriented interval-set concept lattices ⋮ Ontology-based concept similarity in formal concept analysis ⋮ Link key candidate extraction with relational concept analysis ⋮ On implication bases in \(n\)-lattices ⋮ Probably approximately correct learning of Horn envelopes from queries ⋮ FCA for software product line representation: mixing configuration and feature relationships in a unique canonical representation ⋮ A closed sets based learning classifier for implicit authentication in web browsing ⋮ Graph-FCA: an extension of formal concept analysis to knowledge graphs ⋮ A hybrid and exploratory approach to knowledge discovery in metabolomic data ⋮ Approximating concept stability using variance reduction techniques ⋮ Reinventing known results in FCA: notes on two recently published algorithms for computation of formal concepts ⋮ Conjunctive query pattern structures: a relational database model for formal concept analysis ⋮ Most specific consequences in the description logic \(\mathcal{E} \mathcal{L} \) ⋮ On the size of \(\exists \)-generalized concept lattices ⋮ Contribution to attributive and object subcontexts in inferring good maximally redundant tests ⋮ \textsc{RCA-seq}: an original approach for enhancing the analysis of sequential data based on hierarchies of multilevel closed partially-ordered patterns ⋮ Attribute reduction in generalized one-sided formal contexts ⋮ A characterization of the concept of independence in knowledge structures ⋮ The granular partition lattice of an information table ⋮ A methodology for analysis of concept lattice reduction ⋮ Description of sup- and inf-preserving aggregation functions via families of clusters in data tables ⋮ Aggregation on a finite lattice ⋮ Algebras of incidence structures: representations of regular double p-algebras ⋮ Evolution of objects and concepts ⋮ A theoretical study on the object (property) oriented concept lattices based on three-way decisions ⋮ Soft concept lattice for formal concept analysis based on soft sets: theoretical foundations and applications ⋮ Data meaning and knowledge discovery: semantical aspects of information systems ⋮ A representation of continuous domains via relationally approximable concepts in a generalized framework of formal concept analysis ⋮ Three-way dual concept analysis ⋮ Textural formal context ⋮ Knowledge structure preserving fuzzy attribute reduction in fuzzy formal context ⋮ Three-way granular computing, rough sets, and formal concept analysis ⋮ Logic of typical and atypical instances of a concept -- a mathematical model ⋮ Attribute implications in \textbf{L}-concept analysis with positive and negative attributes: validity and properties of models ⋮ Bipolar fuzzy concept learning using next neighbor and Euclidean distance ⋮ Factorization of matrices with grades via essential entries ⋮ A reduction theorem to compute fixpoints of fuzzy closure operators ⋮ On the calculation of formal concept stability ⋮ Lattice-based and topological representations of binary relations with an application to music ⋮ Moore systems and Moore convergence classes of families of nets ⋮ On heterogeneous formal contexts ⋮ On the Galois lattice of bipartite distance hereditary graphs ⋮ Multi-adjoint fuzzy rough sets: definition, properties and attribute selection ⋮ Axiomatic characterizations of dual concept lattices ⋮ Ordinally equivalent data: a measurement-theoretic look at formal concept analysis of fuzzy attributes ⋮ A novel cognitive system model and approach to transformation of information granules ⋮ A categorical representation of algebraic domains based on variations of rough approximable concepts
This page was built for publication:
