Sciweavers

2446 search results - page 28 / 490
» Polyadic Concept Analysis
Sort
View
MDAI
2009
Springer
15 years 10 months ago
Comparison of Data Structures for Computing Formal Concepts
Presented is preliminary study of the role of data structures in algorithms for formal concept analysis. Studied is performance of selected algorithms in dependence on chosen data ...
Petr Krajca, Vilém Vychodil
MDAI
2007
Springer
16 years 1 days ago
Lindig's Algorithm for Concept Lattices over Graded Attributes
Formal concept analysis (FCA) is a method of exploratory data analysis. The data is in the form of a table describing relationship between objects (rows) and attributes (columns), ...
Radim Belohlávek, Bernard De Baets, Jan Out...
FPCA
1995
15 years 9 months ago
Pi-Calculus, Dialogue Games and PCF
Game semantics is an unusual denotational semantics in that it captures the intensional (or algorithmic) and dynamical aspects of the computation. This makes it an ideal semantica...
J. M. E. Hyland, C.-H. Luke Ong