Formal Concept Analysis - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

20

(FIVE YEARS 0)

H-INDEX

5

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540708285, 9783540709015

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Custom Asymmetric Page Split Generalized Index Search Trees and Formal Concept Analysis

Formal Concept Analysis - Lecture Notes in Computer Science ◽

10.1007/978-3-540-70901-5_6 ◽

2007 ◽

pp. 82-97 ◽

Author(s):

Ben Martin ◽

Peter Eklund

Keyword(s):

Formal Concept Analysis ◽

Concept Analysis ◽

Formal Concept ◽

Search Trees ◽

Download Full-text

The Basic Theorem on Labelled Line Diagrams of Finite Concept Lattices

Formal Concept Analysis - Lecture Notes in Computer Science ◽

10.1007/978-3-540-70901-5_19 ◽

2007 ◽

pp. 303-312 ◽

Author(s):

Rudolf Wille

Keyword(s):

Concept Lattices ◽

Download Full-text

About the Lossless Reduction of the Minimal Generator Family of a Context

Formal Concept Analysis - Lecture Notes in Computer Science ◽

10.1007/978-3-540-70901-5_9 ◽

2007 ◽

pp. 130-150 ◽

Author(s):

Tarek Hamrouni ◽

Petko Valtchev ◽

Sadok Ben Yahia ◽

Engelbert Mephu Nguifo

Keyword(s):

Minimal Generator

Download Full-text

Polynomial Embeddings and Representations

Formal Concept Analysis - Lecture Notes in Computer Science ◽

10.1007/978-3-540-70901-5_18 ◽

2007 ◽

pp. 281-302 ◽

Author(s):

Tim Becker

Download Full-text

Galois Connections Between Semimodules and Applications in Data Mining

Formal Concept Analysis - Lecture Notes in Computer Science ◽

10.1007/978-3-540-70901-5_12 ◽

2007 ◽

pp. 181-196 ◽

Author(s):

Francisco J. Valverde-Albacete ◽

Carmen Peláez-Moreno

Keyword(s):

Data Mining ◽

Galois Connections

Download Full-text

The Efficient Computation of Complete and Concise Substring Scales with Suffix Trees

Formal Concept Analysis - Lecture Notes in Computer Science ◽

10.1007/978-3-540-70901-5_7 ◽

2007 ◽

pp. 98-113 ◽

Author(s):

Sébastien Ferré

Keyword(s):

Efficient Computation ◽

Download Full-text

Semantology as Basis for Conceptual Knowledge Processing

Formal Concept Analysis - Lecture Notes in Computer Science ◽

10.1007/978-3-540-70901-5_2 ◽

2007 ◽

pp. 18-38 ◽

Author(s):

Peter Eklund ◽

Rudolf Wille

Keyword(s):

Conceptual Knowledge ◽

Knowledge Processing

Download Full-text

Base Points, Non-unit Implications, and Convex Geometries

Formal Concept Analysis - Lecture Notes in Computer Science ◽

10.1007/978-3-540-70901-5_14 ◽

2007 ◽

pp. 210-220 ◽

Author(s):

Bernhard Ganter ◽

Heiko Reppe

Keyword(s):

Base Points ◽

Convex Geometries

Download Full-text

Some Notes on Pseudo-closed Sets

Formal Concept Analysis - Lecture Notes in Computer Science ◽

10.1007/978-3-540-70901-5_10 ◽

2007 ◽

pp. 151-165 ◽

Author(s):

Sebastian Rudolph

Keyword(s):

Download Full-text

A Proposal for Combining Formal Concept Analysis and Description Logics for Mining Relational Data

Formal Concept Analysis - Lecture Notes in Computer Science ◽

10.1007/978-3-540-70901-5_4 ◽

2007 ◽

pp. 51-65 ◽

Author(s):

Mohamed Hacene Rouane ◽

Marianne Huchard ◽

Amedeo Napoli ◽

Petko Valtchev

Keyword(s):

Formal Concept Analysis ◽

Description Logics ◽

Concept Analysis ◽

Relational Data ◽

Download Full-text