Attributes | Values |
---|
rdf:type
| |
Description
| - 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), where table entries are grades representing degrees to which objects have attributes. The main output of FCA is a hierarchical structure (so-called concept lattice) of conceptual clusters (so-called formal concepts) present in the data. This paper focuses on algorithmic aspects of FCA of data with graded attributes. Namely, we focus on the problem of generating efficiently all clusters present in the data together with their subconcept-superconcept hierarchy. We present theoretical foundations, the algorithm, analysis of its efficiency, and comparison with other algorithms.
- 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), where table entries are grades representing degrees to which objects have attributes. The main output of FCA is a hierarchical structure (so-called concept lattice) of conceptual clusters (so-called formal concepts) present in the data. This paper focuses on algorithmic aspects of FCA of data with graded attributes. Namely, we focus on the problem of generating efficiently all clusters present in the data together with their subconcept-superconcept hierarchy. We present theoretical foundations, the algorithm, analysis of its efficiency, and comparison with other algorithms. (en)
- Článek se zabývá problémem efektivního generování všech shluků (konceptů FCA) přítomných v datech spolu s jejich hierarchií podkoncept-nadkoncept. (cs)
|
Title
| - Lindig's algorithm for concept lattices over graded attributes
- Lindigův algoritmus pro konceptuální svazy nad odstupňovanými atributy (cs)
- Lindig's algorithm for concept lattices over graded attributes (en)
|
skos:prefLabel
| - Lindig's algorithm for concept lattices over graded attributes
- Lindigův algoritmus pro konceptuální svazy nad odstupňovanými atributy (cs)
- Lindig's algorithm for concept lattices over graded attributes (en)
|
skos:notation
| - RIV/61989592:15310/07:00003603!RIV08-AV0-15310___
|
http://linked.open.../vavai/riv/strany
| |
http://linked.open...avai/riv/aktivita
| |
http://linked.open...avai/riv/aktivity
| - P(1ET101370417), P(GA201/05/0079), Z(MSM6198959214)
|
http://linked.open...iv/cisloPeriodika
| |
http://linked.open...vai/riv/dodaniDat
| |
http://linked.open...aciTvurceVysledku
| |
http://linked.open.../riv/druhVysledku
| |
http://linked.open...iv/duvernostUdaju
| |
http://linked.open...titaPredkladatele
| |
http://linked.open...dnocenehoVysledku
| |
http://linked.open...ai/riv/idVysledku
| - RIV/61989592:15310/07:00003603
|
http://linked.open...riv/jazykVysledku
| |
http://linked.open.../riv/klicovaSlova
| - formal concept analysis; graded attributes; concept lattice; Lindig algorithm (en)
|
http://linked.open.../riv/klicoveSlovo
| |
http://linked.open...odStatuVydavatele
| - DE - Spolková republika Německo
|
http://linked.open...ontrolniKodProRIV
| |
http://linked.open...i/riv/nazevZdroje
| - Lecture Notes in Artificial Intelligence
|
http://linked.open...in/vavai/riv/obor
| |
http://linked.open...ichTvurcuVysledku
| |
http://linked.open...cetTvurcuVysledku
| |
http://linked.open...vavai/riv/projekt
| |
http://linked.open...UplatneniVysledku
| |
http://linked.open...v/svazekPeriodika
| |
http://linked.open...iv/tvurceVysledku
| - Bělohlávek, Radim
- Outrata, Jan
- Vychodil, Vilém
- De Baets, Bernard
|
http://linked.open...n/vavai/riv/zamer
| |
issn
| |
number of pages
| |
http://localhost/t...ganizacniJednotka
| |
is http://linked.open...avai/riv/vysledek
of | |