Scalable Performance of FCbO Algorithm on Museum Data
- Tim Wray,
- Jan Outrata,
- Peter Eklund
- ,
- Palacký University Olomouc,
Research Output:
Journal Article or Conference Article in Journal
Conference article
Peer-reviewOpen access
Publication Information
Output type
Research Output:
Journal Article or Conference Article in Journal
Conference article
Peer-reviewOriginal language
EnglishPages from-to (Number of pages)
Pages 363-376 (14 pages)Journal (Volume, Issue Number)
CEUR Workshop Proceedings (Volume 1624)Publication milestones
- Published - 15/07/2016
Publication status
Published - 15/07/2016
ISSN
1613-0073Publication IDs
- Scopus: 84983394221
Abstract
Formal Concept Analysis – known as a technique for data analysis and visualisation – can also be applied as a means of creating interaction approaches that allow for knowledge discovery within collec- tions of content. These interaction approaches rely on performant algo- rithms that can generate conceptual neighbourhoods based on a single formal concept, or incrementally compute and update a set of formal concepts given changes to a formal context. Using case studies based on content from museum collections, this paper describes the scalabil- ity limitations of existing interaction approaches and presents an imple- mentation and evaluation of the FCbO update algorithm as a means of updating formal concepts from large and dynamically changing museum datasets.
Publication metrics
PlumX
Citations
3
Access to documents
Accepted author manuscript
Final published version
License:CC0, opens in new tab
