Deakin University
Browse

File(s) under permanent embargo

Scalable performance of FCbO update algorithm on museum data

conference contribution
posted on 2016-01-01, 00:00 authored by T Wray, J Outrata, Peter EklundPeter Eklund
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 collections of content. These interaction approaches rely on performant algorithms 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 scalability limitations of existing interaction approaches and presents an implementation and evaluation of the FCbO update algorithm as a means of updating formal concepts from large and dynamically changing museum datasets.

History

Event

Concept lattices and their applications. International Conference (13th : 2016 : Moscow, Russia)

Volume

1624

Series

CEUR-WS.org

Pagination

363 - 374

Publisher

M. Jeusfeld c/o Redaktion Sun SITE, Informatik V, RWTH Aachen

Location

Moscow, Russia

Place of publication

Aachen, Germany

Start date

2016-07-18

End date

2016-07-22

ISSN

2311-701X

eISSN

1613-0073

Language

eng

Notes

CEUR Workshop Proceedings

Publication classification

E Conference publication; E1.1 Full written paper - refereed; X Not reportable

Copyright notice

2017, Marianne Huchard, Sergei O. Kuznetsov (Eds.).

Editor/Contributor(s)

Marianne Huchard, Sergei Kuznetsov

Title of proceedings

CLA 2016 : Proceedings of the Thirteenth International Conference on Concept Lattices and Their Applications

Usage metrics

    Research Publications

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC