Catálogo de publicaciones - libros

Compartir en
redes sociales


Conceptual Structures: Knowledge Architectures for Smart Applications: 15th International Conference on Conceptual Structures, ICCS 2007, Sheffield, UK, July 22-27, 2007. Proceedings

Uta Priss ; Simon Polovina ; Richard Hill (eds.)

En conferencia: 15º International Conference on Conceptual Structures (ICCS-ConceptStruct) . Sheffield, UK . July 22, 2007 - July 27, 2007

Resumen/Descripción – provisto por la editorial

No disponible.

Palabras clave – provistas por la editorial

Artificial Intelligence (incl. Robotics); Discrete Mathematics in Computer Science; Mathematical Logic and Formal Languages; Algorithm Analysis and Problem Complexity; Information Systems Applications (incl. Internet)

Disponibilidad
Institución detectada Año de publicación Navegá Descargá Solicitá
No detectada 2007 SpringerLink

Información

Tipo de recurso:

libros

ISBN impreso

978-3-540-73680-6

ISBN electrónico

978-3-540-73681-3

Editor responsable

Springer Nature

País de edición

Reino Unido

Fecha de publicación

Información sobre derechos de publicación

© Springer-Verlag Berlin Heidelberg 2007

Tabla de contenidos

Analysis of the Publication Sharing Behaviour in BibSonomy

Robert Jäschke; Andreas Hotho; Christoph Schmitz; Gerd Stumme

BibSonomy is a web-based social resource sharing system which allows users to organise and share bookmarks and publications in a collaborative manner. In this paper we present the system, followed by a description of the insights in the structure of its bibliographic data that we gained by applying techniques we developed in the area of Formal Concept Analysis.

- Formal Concept Analysis | Pp. 283-295

The MILL – Method for Informal Learning Logistics

Andreas Faatz; Manuel Goertz; Eicke Godehardt; Robert Lokaiczyk

The paper presents the MILL – a system which supports planning of training measures. Its background technique, task-competency modeling, is based on formal concept analysis as an indirect and qualitative way of determining the abilities of learners. In that context, the fulfillment or failure of a work task is the indicator of a set of necessary competencies. The core of the presented approach is a matrix structure – a formal context – which has tasks as labels for its rows and competencies labeling its columns. This matrix is the basis for defining formal concepts which can be ordered in a lattice for navigation and systematic decision support on training measures in an organisation.

- Formal Concept Analysis | Pp. 296-309

Bilingual Word Association Networks

Uta Priss; L. John Old

Bilingual word association networks can be beneficial as a tool in foreign language education because they show relationships among cognate words of different languages and correspond to structures in the mental lexicon. This paper discusses possible technologies that can be used to generate and represent word association networks.

- Formal Concept Analysis | Pp. 310-320

Using FCA for Encoding Closure Operators into Neural Networks

Sebastian Rudolph

After decades of concurrent development of symbolic and connectionist methods, recent years have shown intensifying efforts of integrating those two paradigms. This paper contributes to the development of methods for transferring present symbolic knowledge into connectionist representations. Motivated by basic ideas from formal concept analysis, we propose two ways of directly encoding closure operators on finite sets in a 3-layered feed forward neural network.

- Formal Concept Analysis | Pp. 321-332

Arc Consistency Projection: A New Generalization Relation for Graphs

Michel Liquiere

The projection problem (conceptual graph projection, homomorphism, injective morphism, -subsumption, OI-subsumption) is crucial to the efficiency of relational learning systems. How to manage this complexity has motivated numerous studies on learning biases, restricting the size and/or the number of hypotheses explored. The approach suggested in this paper advocates a projection operator based on the classical arc consistency algorithm used in constraint satisfaction problems. This projection method has the required properties : polynomiality, local validation, parallelization, structural interpretation. Using the arc consistency projection, we found a generalization operator between labeled graphs. Such an operator gives the structure of the classification space which is a concept lattice.

- Conceptual Structures | Pp. 333-346

Mining Frequent Closed Unordered Trees Through Natural Representations

José L. Balcázar; Albert Bifet; Antoni Lozano

Many knowledge representation mechanisms consist of link-based structures; they may be studied formally by means of unordered trees. Here we consider the case where labels on the nodes are nonexistent or unreliable, and propose data mining processes focusing on just the link structure. We propose a representation of ordered trees, describe a combinatorial characterization and some properties, and use them to propose an efficient algorithm for mining frequent closed subtrees from a set of input trees. Then we focus on unordered trees, and show that intrinsic characterizations of our representation provide for a way of avoiding the repeated exploration of unordered trees, and then we give an efficient algorithm for mining frequent closed unordered trees.

- Conceptual Structures | Pp. 347-359

Devolved Ontology for Smart Applications

Iain Duncan Stalker; Nikolay Mehandjiev; Martin Carpenter

Many smart applications allow enterprises to communicate effectively with and through interconnected computing resources, however, successful communication presupposes a shared understanding; a so-called Devolved ontology was developed to promote semantic alignment in agile partnerships. We consider the approach to be promising for environment where multiple contexts interface and co-locate, including, for example, the Pragmatic Web, virtual organisations and indeed smart applications. We motivate and introduce devolved ontology and show how to use this to foster semantic alignment.

- Conceptual Structures | Pp. 360-373

Historical and Conceptual Foundation of Diagrammatical Ontology

Peter Øhrstrøm; Sara L. Uckelman; Henrik Schärfe

During the Renaissance there was a growing interest for the use of diagrams within conceptual studies. This paper investigates the historical and philosophical foundation of this renewed use of diagrams in ontology as well as the modern relevance of this foundation. We discuss the historical and philosophical background for Jacob Lorhard’s invention of the word ‘ontology’ as well as the scientific status of ontology in the 16 and 17 century. We also consider the use of Ramean style diagrams and diagrammatic ontology in general. A modern implementation of Lorhard’s ontology is discussed and this classical ontology is compared to some modern ontologies.

- Conceptual Structures | Pp. 374-386

Learning Common Outcomes of Communicative Actions Represented by Labeled Graphs

Boris A. Galitsky; Boris Kovalerchuk; Sergei O. Kuznetsov

We build a generic methodology based on learning and reasoning to detect specific attitudes of human agents and patterns of their interactions. Human attitudes are determined in terms of communicative actions of agents; models of machine learning are used when it is rather hard to identify attitudes in a rule-based form directly. We employ scenario knowledge representation and learning techniques in such problems as predicting an outcome of international conflicts, assessment of an attitude of a security clearance candidate, mining emails for suspicious emotional profiles, mining wireless location data for suspicious behavior, and classification of textual customer complaints. A preliminary performance estimate evaluation is conducted in the above domains. Successful use of the proposed methodology in rather distinct domains shows its adequacy for mining human attitude-related data in a wide range of applications.

- Conceptual Structures | Pp. 387-400

Belief Flow in Assertion Networks

Sujata Ghosh; Benedikt Löwe; Erik Scorelle

We define an abstract model of belief propagation on a graph based on the methodology of the revision theory of truth together with the , a graphical interface designed to test our semantics.

- Conceptual Structures | Pp. 401-414