4.7 Article

On concept reduction based on some graph properties

Journal

KNOWLEDGE-BASED SYSTEMS
Volume 93, Issue -, Pages 67-74

Publisher

ELSEVIER SCIENCE BV
DOI: 10.1016/j.knosys.2015.11.003

Keywords

Galois connection; Concept lattice; Concept reduction; Mean value of concepts

Funding

  1. ESF Fund [CZ.1.07/2.3.00/30.0041]
  2. Slovak VEGA Grant [2/0028/13]
  3. Slovak Research and Development Agency [APVV-0482-11, APVV-14-0892]
  4. VEGA [1/0529/15, 1/0908/15]
  5. KEGA [040TUKE-4/2014]
  6. [ANR-10-IDEX-03-02]

Ask authors/readers for more resources

The theory of concept lattices represents a well established and widely used conceptual data-mining method. Considering additional information represented by a graph structure on a set of objects, we propose a reduction of concepts. Using graph-theoretical point of view on FCA together with simple probabilistic arguments we derive the mean value of the cardinality of the reduced hierarchical structure. (c) 2015 Elsevier B.V. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available