Fast Algorithm for Computing Fixpoints of Galois Connections Induced by Object-Attribute Relational Data

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F12%3A10225072" target="_blank" >RIV/61989592:15310/12:10225072 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.ins.2011.09.023" target="_blank" >http://dx.doi.org/10.1016/j.ins.2011.09.023</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.ins.2011.09.023" target="_blank" >10.1016/j.ins.2011.09.023</a>

Result language
angličtina
Original language name
Fast Algorithm for Computing Fixpoints of Galois Connections Induced by Object-Attribute Relational Data
Original language description
Fixpoints of Galois connections induced by object-attribute data tables represent important patterns that can be found in relational data. Such patterns are used in several data mining disciplines including formal concept analysis, frequent itemset and association rule mining, and Boolean factor analysis. In this paper we propose efficient algorithm for listing all fixpoints of Galois connections induced by object-attribute data. The algorithm, called FCbO, results as a modification of Kuznetsov's CbO in which we use more efficient canonicity test. We describe the algorithm, prove its correctness, discuss efficiency issues, and present an experimental evaluation of its performance and comparison with other algorithms.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)