On concept reduction based on some graph properties
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F16%3A33160736" target="_blank" >RIV/61989592:15310/16:33160736 - isvavai.cz</a>
Result on the web
<a href="http://www.sciencedirect.com/science/article/pii/S0950705115004219" target="_blank" >http://www.sciencedirect.com/science/article/pii/S0950705115004219</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.knosys.2015.11.003" target="_blank" >10.1016/j.knosys.2015.11.003</a>
Alternative languages
Result language
angličtina
Original language name
On concept reduction based on some graph properties
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/EE2.3.30.0041" target="_blank" >EE2.3.30.0041: POST-UP II.</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2016
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Knowledge-Based Systems
ISSN
0950-7051
e-ISSN
—
Volume of the periodical
93
Issue of the periodical within the volume
FEB
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
8
Pages from-to
"67-74"
UT code for WoS article
000369195100005
EID of the result in the Scopus database
—