Typed formal concept analysis

Peake, I, Thomas, I and Schmidt, H 2009, 'Typed formal concept analysis', in Karl Erich Wolff, Sebastian Rudolph, Sebastien Ferre (ed.) Contributions to ICFCA 2009 (Supplementary Proceedings), 7th International Conference on Formal Concept Analysis (ICFCA09), Darmstadt, Germany, 21st-24th May 2009, pp. 35-51.


Document type: Conference Paper
Collection: Conference Papers

Title Typed formal concept analysis
Author(s) Peake, I
Thomas, I
Schmidt, H
Year 2009
Conference name 7th International Conference on Formal Concept Analysis (ICFCA09)
Conference location Darmstadt, Germany
Conference dates 21st-24th May 2009
Proceedings title Contributions to ICFCA 2009 (Supplementary Proceedings), 7th International Conference on Formal Concept Analysis (ICFCA09)
Editor(s) Karl Erich Wolff, Sebastian Rudolph, Sebastien Ferre
Publisher Springer
Place of publication Berlin, Germany
Start page 35
End page 51
Total pages 17
Abstract Formal Concept Analysis (FCA) appears to be ideal for interpreting data in domains that are a-priori unstructured. In our research we focus on complex contexts with very large and rapidly changing numbers of real-world objects { for instance, data generated on-line and tracking real-time contexts in transport, enterprise warehousing, manufacturing control or social networking activities on the web. The ontology of such contexts, i.e., the types of attribute data and those of objects, and their interrelation (such as subtyping or which objects have which attributes or reference which other objects via surrogate attributes) is partly known to domain experts. Because of incomplete knowledge however, missing classes and relationships need to be inferred. In addition, domain experts need assistance in checking the partial ontology declarations against FCA interpretations added to the context. To make FCA more accessible in such applications, we explore the use of types similar to those available in object-oriented design and programming, for which methods, tools, training and skills are widely available. We present typed FCA and report about supporting tools. We also introduce typed priming and show that it is consistent with conceptual scaling without requiring the generation of binary lattices.
Subjects Computational Logic and Formal Languages
Copyright notice Springer-Verlag 2009
ISBN 3935924089
Versions
Version Filter Type
Access Statistics: 218 Abstract Views  -  Detailed Statistics
Created: Fri, 18 Nov 2011, 08:37:00 EST by Catalyst Administrator
© 2014 RMIT Research Repository • Powered by Fez SoftwareContact us