Formal Concept Analysis Approximations via Atomic Priming

de Fréin, Ruairí (2013) Formal Concept Analysis Approximations via Atomic Priming. In: Formal Concept Analysis. Lecture Notes in Computer Science, 7880 . Springer, Dresden, Germany, pp. 92-108. ISBN 978-3-642-38316-8

[thumbnail of RdFICFCAArxiv.pdf]

Download (201kB) | Preview
Official URL:


Formal Concept Analysis (FCA) looks to decompose a matrix of objects-attributes into a set of sparse matrices capturing the underlying structure of a formal context. We propose a Rank Reduction (RR) method to prime approximate FCAs, namely RRFCA. While many existing FCA algorithms are complete, lectic ordering of the lattice may not minimize search/decomposition time. Initially, RRFCA decompositions are not unique or complete; however, a set of good closures with high support is learned quickly, and then, made complete. RRFCA has its novelty in that we propose a new multiplicative two-stage method. First, we describe the theoretical foundations underpinning our RR approach. Second, we provide a representative exemplar, showing how RRFCA can be implemented. Further experiments demonstrate that RRFCA methods are efficient, scalable and yield time-savings. We demonstrate the resulting methods lend themselves to parallelization.

Item Type: Book Section
Departments or Groups: *NONE OF THESE*
Telecommunications Software and Systems Group
Divisions: School of Science > Department of Computing, Maths and Physics
Depositing User: Ruairi De Frein
Date Deposited: 17 Sep 2013 09:11
Last Modified: 22 Aug 2016 10:27

Actions (login required)

View Item View Item