Extending conceptualisation modes for generalised formal concept analysis

DOI10.1016/j.ins.2010.04.014zbMath1216.68285OpenAlexW2076308416MaRDI QIDQ545323

Francisco J. Valverde-Albacete, Carmen Peláez-Moreno

Publication date: 22 June 2011

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10016/13106

zbMATH Keywords

concept latticeconfusion matrixdioididempotent semiringgeneralised formal concept analysisneighbourhood lattice

Mathematics Subject Classification ID

Knowledge representation (68T30) Complete lattices, completions (06B23)

Related Items

The spectra of irreducible matrices over completed idempotent semifields ⋮ \(\mathcal{K}\)-formal concept analysis as linear algebra over idempotent semifields ⋮ Systemic approach to fuzzy logic formalization for approximate reasoning ⋮ Towards Galois Connections over Positive Semifields ⋮ Activating Generalized Fuzzy Implications from Galois Connections ⋮ Gene Expression Array Exploration Using $\mathcal{K}$ -Formal Concept Analysis ⋮ Formal query systems on contexts and a representation of algebraic lattices ⋮ On the definition of suitable orderings to generate adjunctions over an unstructured codomain ⋮ Constraint heterogeneous concept lattices and concept lattices with heterogeneous hedges ⋮ A polynomial algorithm for solving system of inequalities in max-plus algebra ⋮ Formal concept analysis based on fuzzy granularity base for different granulations ⋮ Tolerance types of interval eigenvectors in max-plus algebra ⋮ AE and EA robustness of interval circulant matrices in max-product algebra ⋮ On Fuzzy Generalizations of Concept Lattices ⋮ The spectra of reducible matrices over complete commutative idempotent semifields and their spectral lattices ⋮ On homogeneousL-bonds and heterogeneousL-bonds ⋮ Interval robustness of (interval) max-plus matrices ⋮ The Linear Algebra in Formal Concept Analysis over Idempotent Semifields

Uses Software

• ToscanaJ

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Residuated lattices. An algebraic glimpse at substructural logics
• Formal concept analysis via multi-adjoint concept lattices
• Minimax algebra
• \(({\ast},s)\)-dualities
• Some relations between linear mappings and conjugations in idempotent analysis
• Duality and separation theorems in idempotent semimodules.
• Associatively tied implications.
• The basic theorem of triadic concept analysis
• Multi-adjoint t-concept lattices
• A note on variable threshold concept lattices: threshold-based operators are reducible to classical concept-forming operators
• Graphs, dioids and semirings. New models and algorithms.
• Variable threshold concept lattices
• Inf-convolution, sous-additivite, convexite des fonctions numériques
• Galois Connections Between Semimodules and Applications in Data Mining
• A Generalized Concept Lattice
• Formal Concept Analysis
• Theory and Applications of Relational Structures as Knowledge Instruments