# On the Inverse Problem for Generalized One-Sided Concept Lattices

@article{Pcs2014OnTI, title={On the Inverse Problem for Generalized One-Sided Concept Lattices}, author={Jozef P{\'o}cs and Jana P{\'o}csov{\'a}}, journal={Informatica (Slovenia)}, year={2014}, volume={38} }

Generalized one-sided concept lattices represent a generalization of the classical concept lattices convenient
for analysis of object-attribute models with different types of attributes. Formally, to each objectattribute
model (represented by the notion of formal context) there is assigned a pair of concept-forming
operators. Fixed points of these operators form a hierarchical structure consisting of extent-intent pairs.
From the algebraic point of view this structure forms a complete lattice…

## 3 Citations

Reduction ratio for GOSCL constrained by Moore co-families on object set

- Computer Science2015 IEEE 13th International Symposium on Applied Machine Intelligence and Informatics (SAMI)
- 2015

Generalized one-sided concept lattices (GOSCL) represent an FCA-like method for analysis of object-attribute models with different types of attributes and a reduction ratio for randomly generated contexts is experimentally studied.

On intent stability index for one-sided concept lattices

- Computer Science2015 IEEE 10th Jubilee International Symposium on Applied Computational Intelligence and Informatics
- 2015

The intent stability index represents an useful relevancy measure of the extracted patterns in the FCA data mining method for the so-called one-sided concept lattices, which represent a fuzzy generalization of the classical FCA.

Editorial: "Michie-Turing" IS2014 Award Recipient: Janez Grad"

- Education
- 2014

The 2014 "Donald Michie and Alan Turing" prize recipient Janez Grad for Life Achievements in Slovenian Information Society is introduced and the nomination procedure inspired by the procedure Nobel prizes are awarded is set.

## References

SHOWING 1-10 OF 192 REFERENCES

Generalization of One-Sided Concept Lattices

- Computer Science, MathematicsComput. Informatics
- 2013

It is proved that this method of creating one-sided concept lattices is the most general one, i.e., with respect to the set of admissible formal contexts, it produces all Galois connections between power sets and the products of complete lattices.

Formal concept analysis via multi-adjoint concept lattices

- Computer ScienceFuzzy Sets Syst.
- 2009

One approach to combination of FCA-based local conceptual models for text analysis — grid-based approach

- Computer Science2008 6th International Symposium on Applied Machine Intelligence and Informatics
- 2008

This paper describes one simple approach to creation of simple hierarchy of concepts using FCA method for Grid-based solution in which time consuming building of several local models is distributed between grid computing nodes and then it leads to speed-up of computing of final model.

Development and application of a metric on semantic nets

- Computer ScienceIEEE Trans. Syst. Man Cybern.
- 1989

Experiments in which distance is applied to pairs of concepts and to sets of concepts in a hierarchical knowledge base show the power of hierarchical relations in representing information about the conceptual distance between concepts.

Hiding a Semantic Class Hierarchy in a Markov Model

- Computer Science
- 1998

A new model of selectional preference induction is introduced that provides a stochastic generation model for the words that appear as arguments of a predicate and a hidden Markov model with the general shape of the semantic class hierarchy is deeneed.

Selection and information: a class-based approach to lexical relationships

- Computer Science
- 1993

A new, information-theoretic account of selectional constraints is proposed, which assumes that lexical items are organized in a conceptual taxonomy according to class membership, where classes are defined simply as sets rather than in terms of explicit features or properties.

Note on generating fuzzy concept lattices via Galois connections

- Computer Science, MathematicsInf. Sci.
- 2012

Class-Based Probability Estimation Using a Semantic Hierarchy

- Computer ScienceNAACL
- 2001

This article concerns the estimation of a particular kind of probability, namely, the probability of a noun sense appearing as a particular argument of a predicate, and a procedure is developed that uses a chi-square test to determine a suitable level of generalization.

Galois connection, formal concepts and Galois lattice in real relations: application in a real classifier

- Computer ScienceJ. Syst. Softw.
- 2002