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
Distributed Formal Concept Analysis Algorithms Based on an Iterative MapReduce Framework
Waterford Institute of Technology, Ireland.ORCID iD: 0000-0002-3912-1470
Waterford Institute of Technology, Ireland.
Waterford Institute of Technology, Ireland.
2012 (English)In: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, Vol. 7278, 292-308 p.Article in journal (Refereed) Published
Abstract [en]

While many existing formal concept analysis algorithms are efficient, they are typically unsuitable for distributed implementation. Taking the MapReduce (MR) framework as our inspiration we introduce a distributed approach for performing formal concept mining. Our method has its novelty in that we use a light-weight MapReduce runtime called Twister which is better suited to iterative algorithms than recent distributed approaches. First, we describe the theoretical foundations underpinning our distributed formal concept analysis approach. Second, we provide a representative exemplar of how a classic centralized algorithm can be implemented in a distributed fashion using our methodology: we modify Ganter’s classic algorithm by introducing a family of MR⋆ algorithms, namely MRGanter and MRGanter+ where the prefix denotes the algorithm’s lineage. To evaluate the factors that impact distributed algorithm performance, we compare our MR∗ algorithms with the state-of-the-art. Experiments conducted on real datasets demonstrate that MRGanter+ is efficient, scalable and an appealing algorithm for distributed problems.

Place, publisher, year, edition, pages
Leuven, Belgium: Springer Berlin/Heidelberg, 2012. Vol. 7278, 292-308 p.
Keyword [en]
Formal Concept Analysis; Distributed Mining; MapReduce
National Category
Signal Processing
Research subject
Applied and Computational Mathematics
Identifiers
URN: urn:nbn:se:kth:diva-174033DOI: 10.1007/978-3-642-29892-9_26Scopus ID: 2-s2.0-84864057128ISBN: 978-3-642-29892-9 (print)OAI: oai:DiVA.org:kth-174033DiVA: diva2:856942
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-29892-9_26

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
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 20 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