Publication:
Galois Connections between Semimodules and Applications in Data Mining

Thumbnail Image
Identifiers
URI: https://hdl.handle.net/10016/1594
ISSN: 0302-9743 [print]
ISSN: 1611-3349 [online]
ISBN: 978-3-540-70828-5
DOI: 10.1007/978-3-540-70901-5_12
Files
valverde02.pdf (337.55 KB)
Publication date
2007
Defense date
Authors
Advisors
Tutors
Journal Title
Journal ISSN
Volume Title
Publisher
Springer
Impact
Google Scholar
Export
Research Projects
Organizational Units
Journal Issue
Abstract
In [1] a generalisation of Formal Concept Analysis was introduced with data mining applications in mind, K-Formal Concept Analysis, where incidences take values in certain kinds of semirings, instead of the standard Boolean carrier set. A fundamental result was missing there, namely the second half of the equivalent of the main theorem of Formal Concept Analysis. In this continuation we introduce the structural lattice of such generalised contexts, providing a limited equivalent to the main theorem of K-Formal Concept Analysis which allows to interpret the standard version as a privileged case in yet another direction. We motivate our results by providing instances of their use to analyse the confusion matrices of multiple-input multiple-output classifiers.
Description
Keywords
Bibliographic citation
Formal Concept Analysis. 5th International Conference, ICFCA 2007, Clermont-Ferrand, France, February 12-16, 2007. Proceedings. PP. 181-196
Collections
DTSC - GPM - Capítulos de Monografías