Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Formal Concept Analysis via Atomic Priming
Telecommunications Software and Systems Group, Waterford Institute of Technology, Ireland.ORCID iD: 0000-0002-3912-1470
2013 (English)In: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, Vol. 7880, 92-108 p.Article in journal (Refereed) Published
Abstract [en]

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.

Place, publisher, year, edition, pages
Dresden: Springer Berlin/Heidelberg, 2013, 7880. Vol. 7880, 92-108 p.
Keyword [en]
Formal Concept Analysis; Rank Reduction; Factorization
National Category
Signal Processing
Research subject
Applied and Computational Mathematics
Identifiers
URN: urn:nbn:se:kth:diva-174032DOI: 10.1007/978-3-642-38317-5_6Scopus ID: 2-s2.0-84883404234OAI: oai:DiVA.org:kth-174032DiVA: diva2:856941
Conference
11th International Conference on Formal Concept Analysis, ICFCA 2013; Dresden; Germany; 21 May 2013 through 24 May 2013
Projects
EOLAS
Note

QC 20150928

Available from: 2015-09-26 Created: 2015-09-26 Last updated: 2017-12-01Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopushttp://link.springer.com/chapter/10.1007%2F978-3-642-38317-5_6

Authority records BETA

de Fréin, Ruairí

Search in DiVA

By author/editor
de Fréin, Ruairí
In the same journal
Lecture Notes in Computer Science
Signal Processing

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 21 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf