In this paper, we describe our work on discovering missing links in Wikipedia articles. This task is important for both readers and authors of Wikipedia. The readers will benefit from the increased article quality with better navigation support. On the other hand, the system can be employed to support the authors during editing. This study combines the strengths of different approaches previously applied for the task, and adds its own techniques to reach satisfactory results. Because of the subjectivity in the nature of the task; automatic evaluation is hard to apply. Comparing approaches seems to be the best method to evaluate new techniques, and we offer a semi-automatized method for evaluation of the results. The recall is calculated automatically using existing links in Wikipedia. The precision is calculated according to manual evaluations of human assessors. Comparative results for different techniques are presented, showing the success of our improvements. We employ Turkish Wikipedia, we are the first to study on it, to examine whether a small instance is scalable enough for such purposes.

In this position paper, we argue that the Linked Open Data (LoD) Cloud, in its current form, is only of limited value for furthering the Semantic Web vision. Being merely a weakly linked triple collection, it will only be of very limited benefit for the AI or Semantic Web communities. We describe the corresponding problems with the LoD Cloud and give directions for research to remedy the situation.

Painters write about their what artists say about their own work, using motivations; photographers, about details of the concept mapping as a conceptual capture tool (Eskridge et.

Browsing linked open data (LOD) is a promising, yet, often unsatisfactory experience today. User-support for the identification of relevant information within the fast-growing cloud of LOD is limited. This paper presents LENA-TR, a browser for LOD that highlights relevant information with respect to different knowledge aspects hidden in linked data. Its interpretation of faceted navigation facilitates the sense-making and browsing of LOD, solving many of the shortcomings experienced in LOD browsing today.

In this paper we describe the production and consumption of linked data in the scenario of the Italian news agency ANSA portal. The goal of the use-case is to provide viewers of a news item with background information and links to related news articles contained on the portal. This information enrichment process is entity-based: ANSA news archive is analyzed using Name Entity Recognition, and each detected entity is annotated with a unique identifier. These identifiers are obtained using the Entity Name Server developed within the scope of the OKKAM European project. Subsequently the news are published on the portal using RDFa and linked to a semantic search engine that provides background information harvested from sources such as DBpedia and links to additional news sources. The presented project has the potential to contribute to Linked Data by creating and publishing a large quantity of entities and assertions about them coming from the ANSA news archive.

Modern web sites provide easy access to large amounts of data via open application programming interfaces. Users interacting with these sites constantly change the underlying data sets, which can be represented in graph-structured form. Nodes in these dynamic graph structures exhibit dependencies over time. Analysing these dependencies is crucial for understanding and predicting the dynamics inherent to temporally changing graph structures on the web. When the graphs become large however, it is not feasible to take into account all properties of the graph and in general it is unclear how to choose the appropriate features. Moreover, comparing two nodes becomes difficult, if the nodes do not share exactly the same features. In this work we propose an algorithm that automatically learns the features that govern temporal dependencies between nodes in large dynamic graph structures. We present preliminary results of applying the algorithm to data collected from the web, discuss potential extensions of the framework and anticipate how a major problem in data mining, sparse data, could be tackled by leveraging Linked Data.

Several solutions exist for semantically describing Web Services (WSs) from the perspective of orchestration but little is known about how semantics benefit WS choreography. The most extreme example of a choreography problem occurs in peer-to-peer systems where shared semantics of data may need to be established via services interactions. We present a solution to this problem by sharing micro-data via interaction models. No pre-unified ontology is required in our approach so peers can make use of existing heterogeneous resources having been described in the RDF data model flexibly and compatibly. The experimental results indicate that our approach semantically enhances WS choreography in a lightweight way which complies with principles of Linked Data and republished Interaction Models (IMs) can further facilitate the progress of the Web of data as well as the formation of peer communities generated through peers' interactions.

GORT is a system that combines Linked Data from across several Semantic Web data sources to solve guesstimation problems, with user assistance. The system uses customised inference rules over the relationships in the OpenCyc ontology, combined with data from DBPedia, to reason and perform its calculations. The system is extensible with new Linked Data, as it becomes available, and is capable of answering a small range of guesstimation questions.

This communication is accomplished via and Scheutz in preparation). The observed naturallytimed strategies which necessarily incorporate time. The interaction interaction is used to argue that in at least some interesting between the agents is naturally extended over time, yet interactive situations, explicit representation of or in neither agent does any explicit representation of or reasoning operation on time is not necessary. Observing that many interactive about time occur. Kelso et al's Virtual Partner Interaction situations will be similar, we hypothesize that in (Kelso et al. 2009) is a paradigm in which a virtual fact most interactions will require no explicit representation hand is guided by a dynamical system known to guide most or reasoning about time.

The correct recognition of behaviours based on sensor observations in a smart home is a challenging problem; the sensor observations themselves can be noisy, and the pattern activity seen for a behaviour is rarely identical for different occurrences of the behaviour. For this reason, probabilistic methods such as Hidden Markov Models are preferred over symbolic reasoning approaches. However, these models do not deal well with interleaved behaviours, nor do they allow small variations in behaviour to be detected as abnormal, although this might be useful for the smart home, since changes in ingrained habit could be early signs of illness. We propose methods for using Allen's temporal relations in order to solve these problems, and demonstrate how they can be used to recognise the interleaving of different behaviours, as well as to reason about behaviours that are frequently seen together, and therefore form a behavioural pattern or habit. In this way we have been able to extend our behaviour recognition system to recognise unusual presentations of behaviours.