scientific article; zbMATH DE number 2168560

Publication date: 18 May 2005

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

information retrieval data mining machine learning concept lattice information processing data visualization

Learning and adaptive systems in artificial intelligence (68T05) Knowledge representation (68T30) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Information storage and retrieval of data (68P20) Lattices (06B99)

Related Items

Block relations in formal fuzzy concept analysis ⋮ Efficient algorithms for the periodic subgraphs mining problem ⋮ Fast factorization by similarity in formal concept analysis of data with fuzzy attributes ⋮ Horn axiomatizations for sequential data ⋮ Knowledge representation using interval-valued fuzzy formal concept lattice ⋮ Interface between logical analysis of data and formal concept analysis ⋮ Improving the performance of Lindig-style algorithms with empty intersections ⋮ The structure theorem of three-way concept lattice ⋮ Connecting concept lattices with bonds induced by external information ⋮ A logic of graded attributes ⋮ Generalized decision directed acyclic graphs for classification tasks ⋮ Systematic categorization and evaluation of CbO-based algorithms in FCA ⋮ Triadic concept approximation ⋮ Pruning techniques in lincbo for the computation of the duquenne-guigues basis ⋮ Retículos teóricos y el análisis de conceptos formales, herramientas para el estructuralismo metateórico ⋮ Granularity of attributes in formal concept analysis ⋮ Selection of appropriate bonds between \(\mathcal{L}\)-fuzzy formal contexts for recommendation tasks ⋮ Optimal decompositions of matrices with grades into binary and graded matrices ⋮ Factorization of fuzzy concept lattices with hedges by modification of input data ⋮ Parallel algorithm for computing fixpoints of Galois connections ⋮ On attribute reduction in concept lattices: experimental evaluation shows discernibility matrix based methods inefficient ⋮ Associative models for storing and retrieving concept lattices ⋮ On attribute reduction in concept lattices: the polynomial time discernibility matrix-based method becomes the CR-method ⋮ Formal concept analysis based on the topology for attributes of a formal context ⋮ Closure-based constraints in formal concept analysis ⋮ Formal Concept Analysis with Constraints by EM Operators ⋮ Selecting Important Concepts Using Weights ⋮ Discovery of the \(D\)-basis in binary tables based on hypergraph dualization ⋮ Characterization and reduction of concept lattices through matroid theory ⋮ Constraint heterogeneous concept lattices and concept lattices with heterogeneous hedges ⋮ Boolean factors as a means of clustering of interestingness measures of association rules ⋮ A `best-of-breed' approach for designing a fast algorithm for computing fixpoints of Galois connections ⋮ A semantic approach to concept lattice-based information retrieval ⋮ Modeling Ceteris Paribus Preferences in Formal Concept Analysis ⋮ Valuations and closure operators on finite lattices ⋮ General framework for consistencies in decision contexts ⋮ L-concept analysis with positive and negative attributes ⋮ From Concepts to Concept Lattice: A Border Algorithm for Making Covers Explicit ⋮ Reinventing known results in FCA: notes on two recently published algorithms for computation of formal concepts ⋮ Contribution to attributive and object subcontexts in inferring good maximally redundant tests ⋮ Direct Factorization by Similarity of Fuzzy Concept Lattices by Factorization of Input Data ⋮ Graded LinClosure and Its Role in Relational Data Analysis ⋮ Discovery of optimal factors in binary data via a novel method of matrix decomposition ⋮ An incremental algorithm to construct a lattice of set intersections ⋮ Document plagiarism detection using a new concept similarity in formal concept analysis ⋮ Exploratory knowledge discovery over web of data ⋮ On Fuzzy Generalizations of Concept Lattices ⋮ Decision implication canonical basis: a logical perspective ⋮ Knowledge structure preserving fuzzy attribute reduction in fuzzy formal context ⋮ Typicality: a formal concept analysis account ⋮ A study of algorithms relating distributive lattices, median graphs, and Formal Concept Analysis ⋮ Multicriteria prioritization and partial order in environmental and ecological statistics ⋮ On attribute reduction in concept lattices: methods based on discernibility matrix are outperformed by basic clarification and reduction ⋮ A Method for Reduction of Fuzzy Relation in Fuzzy Formal Context ⋮ Formal concept analysis with background knowledge: a case study in paleobiological taxonomy of belemnites ⋮ Fuzzy Concept Lattices with Incomplete Knowledge ⋮ Ordinally equivalent data: a measurement-theoretic look at formal concept analysis of fuzzy attributes

Uses Software

GVF