Query-Based Multicontexts for Knowledge Base Browsing: An Evaluation

In [7], we introduced the query-based multicontext theory, which allows to define a virtual space of views on ontological data. Each view is then materialised as a formal context. While this formal context can be visualised in a usual formal concept analysis framework such as Conexp or ToscanaJ, [7] also briefly described how the approach allowed the creation of a novel navigation framework for knowledge bases. The principle of this navigation is based on supporting the user in defining pertinent views. The purpose of this article is to discuss the benefits of the browsing interface. This discussion is performed, on the one hand, by comparing the approach to other Formal Concept Analysis based frameworks. On the other hand, it exposes the preliminary evaluation of the visualisation of formal contexts by comparing the display of a lattice to two other approaches based on trees and graphs

Query-Based Multicontexts for Knowledge Base Browsing: an Evaluation

Tane J, Cimiano P, Hitzler P. Query-Based Multicontexts for Knowledge Base Browsing: an Evaluation. In: Schärfe H, Hitzler P, Øhrstrøm P, eds. Conceptual Structures: Inspiration and Application: 14th International Conference on Conceptual Structures, ICCS 2006, Aalborg, Denmark, July 16-21, 2006. Proceedings. Lecture Notes in Computer Science, 4068. Springer; 2006: 413-426

A New Formal Context for Symmetric Dependencies

In this paper we present a new formal context for symmetric dependencies. We study its properties and compare it with previous approaches. We also discuss how this new context may open the door to solve some open problems for symmetric dependencies.Postprint (published version

Query-Based Multicontexts for Knowledge Base Browsing: An Evaluation

In [7], we introduced the query-based multicontext theory, which allows to define a virtual space of views on ontological data. Each view is then materialised as a formal context. While this formal context can be visualised in a usual formal concept analysis framework such as Conexp or ToscanaJ, [7] also briefly described how the approach allowed the creation of a novel navigation framework for knowledge bases. The principle of this navigation is based on supporting the user in defining pertinent views. The purpose of this article is to discuss the benefits of the browsing interface. This discussion is performed, on the one hand, by comparing the approach to other Formal Concept Analysis based frameworks. On the other hand, it exposes the preliminary evaluation of the visualisation of formal contexts by comparing the display of a lattice to two other approaches based on trees and graphs

CORON: A Framework for Levelwise Itemset Mining Algorithms

CORON is a framework for levelwise algorithms that are designed to find frequent and/or frequent closed itemsets in binary contexts. Datasets can be very different in size, number of objects, number of attributes, density, etc. As there is no one best algorithm for arbitrary datasets, we want to give a possibility for users to try different algorithms and choose the one that best suits their needs

Linked data and online classifications to organise mined patterns in patient data

In this paper, we investigate the use of web data resources in medicine, especially through medical classifications made available using the principles of Linked Data, to support the interpretation of patterns mined from patient care trajectories. Interpreting such patterns is naturally a challenge for an analyst, as it requires going through large amounts of results and access to sufficient background knowledge. We employ linked data, especially as exposed through the BioPortal system, to create a navigation structure within the patterns obtained form sequential pattern mining. We show how this approach provides a flexible way to explore data about trajectories of diagnoses and treatments according to different medical classifications

Visualizing Social Photos on a Hasse Diagram for Eliciting Relations and Indexing New Photos

International audienceSocial photos, which are taken during family events or parties, represent individuals or groups of people. We show in this paper how a Hasse diagram is an efficient visualization strategy for eliciting different groups and navigating through them. However, we do not limit this strategy to these traditional uses. Instead we show how it can also be used for assisting in indexing new photos. Indexing consists of identifying the event and people in photos. It is an integral phase that takes place before searching and sharing. In our method we use existing indexed photos to index new photos. This is performed through a manual drag and drop procedure followed by a content fusion process that we call ‘propagation'. At the core of this process is the necessity to organize and visualize the photos that will be used for indexing in a manner that is easily recognizable and accessible by the user. In this respect we make use of an Object Galois Sub-Hierarchy and display it using a Hasse diagram. The need for an incremental display that maintains the user's mental map also leads us to propose a novel way of building the Hasse diagram. To validate the approach, we present some tests conducted with a sample of users that confirm the interest of this organization, visualization and indexation approach. Finally, we conclude by considering scalability, the possibility to extract social networks and automatically create personalised albums