Reducing the representation complexity of lattice-based taxonomies
S. Kuznetsov, S. Obiedkov, and C. Roth. Conceptual Structures: Knowledge Architectures for Smart Applications, Springer, (2007)
Abstract
Representing concept lattices constructed from large contexts often
results in heavy, complex diagrams that can be impractical to handle
and, eventually, to make sense of. In this respect, many concepts
could allegedly be dropped from the lattice without impairing its
relevance towards a taxonomy description task at a certain level of
detail. We propose a method where the notion of stability is
introduced to select potentially more pertinent concepts. We present
some theoretical properties of stability and discuss several use cases
where taxonomy building is an issue. 1
%0 Book Section
%1 kuznetsov2007reducing
%A Kuznetsov, Sergei
%A Obiedkov, Sergei
%A Roth, Camille
%B Conceptual Structures: Knowledge Architectures for Smart Applications
%D 2007
%I Springer
%K imported
%P 241--254
%T Reducing the representation complexity of lattice-based taxonomies
%U http://link.springer.com/chapter/10.1007/978-3-540-73681-3_18
%X Representing concept lattices constructed from large contexts often
results in heavy, complex diagrams that can be impractical to handle
and, eventually, to make sense of. In this respect, many concepts
could allegedly be dropped from the lattice without impairing its
relevance towards a taxonomy description task at a certain level of
detail. We propose a method where the notion of stability is
introduced to select potentially more pertinent concepts. We present
some theoretical properties of stability and discuss several use cases
where taxonomy building is an issue. 1
@incollection{kuznetsov2007reducing,
abstract = {Representing concept lattices constructed from large contexts often
results in heavy, complex diagrams that can be impractical to handle
and, eventually, to make sense of. In this respect, many concepts
could allegedly be dropped from the lattice without impairing its
relevance towards a taxonomy description task at a certain level of
detail. We propose a method where the notion of stability is
introduced to select potentially more pertinent concepts. We present
some theoretical properties of stability and discuss several use cases
where taxonomy building is an issue. 1},
added-at = {2013-08-04T16:52:54.000+0200},
author = {Kuznetsov, Sergei and Obiedkov, Sergei and Roth, Camille},
biburl = {https://www.bibsonomy.org/bibtex/217d2503edc71a72541bae9edd253be05/francesco.k},
booktitle = {Conceptual Structures: Knowledge Architectures for Smart Applications},
citations = {33},
citedbyid = {16682270457702490356},
file = {file://Reducing the Representation Complexity of Lattice-based Taxonomies.pdf:pdf},
interhash = {29e6d97fed3a32d028548c3f069936f1},
intrahash = {17d2503edc71a72541bae9edd253be05},
keywords = {imported},
mailhosts = {yandex.ru; gmail.com; polytechnique.edu},
md5sum = {c0dee97b67cf80d24189f30f8e3d49b9},
pages = {241--254},
pdfmeat = {timestamp: 2013-08-04 16:52:43; queries: 1; inode: 1704041},
publisher = {Springer},
timestamp = {2013-08-04T16:52:55.000+0200},
title = {Reducing the representation complexity of lattice-based taxonomies},
url = {http://link.springer.com/chapter/10.1007/978-3-540-73681-3_18},
year = 2007
}