7 research outputs found

    Linked data and libraries

    Get PDF
    U radu je dan prikaz koncepta povezanih podataka (linked data) kao semantičke nadogradnje postojeće mreže te razmotrena mogućnost integracije knjižničnih kataloga i usluga pomoću spomenutog koncepta u globalnu inteligentno povezanu mrežu – semantički web. Na početku rada govori se općenito o semantičkom webu i osnovnim načelima na kojima počiva. U dijelu rada koji razmatra koncept povezanih podataka, obrađene su njegove glavne sastavnice – URI (Uniform Resource Identifiers) i RDF (Resource Description Framework) – načela, koraci za objavu povezanih podataka na mreži te licenciranje i neka sigurnosna pitanja u vezi istih. U posebnom dijelu rada objašnjena je prednost pretraživanja povezanih podataka u odnosu na klasično pretraživanje mreže kao i problem primjene koncepta povezanih podataka na knjižničnim zapisima. Analiziraju se svojstva MARC zapisa u mrežnom okruženju te razlika između povezanih podataka i tradicionalnih kataloga. Pokazano je da je knjižnični zapis u MARC formatu samo čitljiv dok bi isti takav zapis u RDF/XML obliku, integriran u povezane podatke, bio ne samo čitljiv, nego i stroju “razumljiv” u semantičkom smislu. Na kraju rada zaključeno je kako je tehnologija povezanih podataka velika prigoda za razvoj knjižničnih kataloga i usluga koje bi svoju ulogu u globalnoj inteligentno povezanoj mreži – semantički webu – ispunjavale na mnogo učinkovitiji način.The paper brings a review of the linked data concept as a semantic upgrade of the existing World Wide Web. It also analyzes the possibility of integrating library catalog and services into the intelligently linked network – semantic web. The first part of the paper presents some basic principles of the semantic web in general. Then we discuss the main elements of the linked data (URI - Uniform Resource Identifiers and RDF - Resource Description Framework), its principal concepts, publishing procedure, licensing and some security issues. The next section explains the main advantage of linked data searching in comparison with the conventional web search. Furthermore, we discuss the application of linked data on library catalogue records. MARC properties are analyzed in a network environment as well as the difference between catalogue with linked data and traditional library catalogue. The analysis has shown that MARC record is only readable, while the same record in RDF/XML format integrated into linked data is also understandable in the semantic sense. The conclusion is that the linked data technology presents a great opportunity for further development of library catalogues and library services, but also a was to improve efficiency in the intelligently linked global network

    Liage de données RDF : évaluation d'approches interlingues

    Get PDF
    The Semantic Web extends the Web by publishing structured and interlinked data using RDF.An RDF data set is a graph where resources are nodes labelled in natural languages. One of the key challenges of linked data is to be able to discover links across RDF data sets. Given two data sets, equivalent resources should be identified and linked by owl:sameAs links. This problem is particularly difficult when resources are described in different natural languages.This thesis investigates the effectiveness of linguistic resources for interlinking RDF data sets. For this purpose, we introduce a general framework in which each RDF resource is represented as a virtual document containing text information of neighboring nodes. The context of a resource are the labels of the neighboring nodes. Once virtual documents are created, they are projected in the same space in order to be compared. This can be achieved by using machine translation or multilingual lexical resources. Once documents are in the same space, similarity measures to find identical resources are applied. Similarity between elements of this space is taken for similarity between RDF resources.We performed evaluation of cross-lingual techniques within the proposed framework. We experimentally evaluate different methods for linking RDF data. In particular, two strategies are explored: applying machine translation or using references to multilingual resources. Overall, evaluation shows the effectiveness of cross-lingual string-based approaches for linking RDF resources expressed in different languages. The methods have been evaluated on resources in English, Chinese, French and German. The best performance (over 0.90 F-measure) was obtained by the machine translation approach. This shows that the similarity-based method can be successfully applied on RDF resources independently of their type (named entities or thesauri concepts). The best experimental results involving just a pair of languages demonstrated the usefulness of such techniques for interlinking RDF resources cross-lingually.Le Web des données étend le Web en publiant des données structurées et liées en RDF. Un jeu de données RDF est un graphe orienté où les ressources peuvent être des sommets étiquetées dans des langues naturelles. Un des principaux défis est de découvrir les liens entre jeux de données RDF. Étant donnés deux jeux de données, cela consiste à trouver les ressources équivalentes et les lier avec des liens owl:sameAs. Ce problème est particulièrement difficile lorsque les ressources sont décrites dans différentes langues naturelles.Cette thèse étudie l'efficacité des ressources linguistiques pour le liage des données exprimées dans différentes langues. Chaque ressource RDF est représentée comme un document virtuel contenant les informations textuelles des sommets voisins. Les étiquettes des sommets voisins constituent le contexte d'une ressource. Une fois que les documents sont créés, ils sont projetés dans un même espace afin d'être comparés. Ceci peut être réalisé à l'aide de la traduction automatique ou de ressources lexicales multilingues. Une fois que les documents sont dans le même espace, des mesures de similarité sont appliquées afin de trouver les ressources identiques. La similarité entre les documents est prise pour la similarité entre les ressources RDF.Nous évaluons expérimentalement différentes méthodes pour lier les données RDF. En particulier, deux stratégies sont explorées: l'application de la traduction automatique et l'usage des banques de données terminologiques et lexicales multilingues. Dans l'ensemble, l'évaluation montre l'efficacité de ce type d'approches. Les méthodes ont été évaluées sur les ressources en anglais, chinois, français, et allemand. Les meilleurs résultats (F-mesure > 0.90) ont été obtenus par la traduction automatique. L'évaluation montre que la méthode basée sur la similarité peut être appliquée avec succès sur les ressources RDF indépendamment de leur type (entités nommées ou concepts de dictionnaires)

    User interfaces supporting entity search for linked data

    Get PDF
    One of the main goals of semantic search is to retrieve and connect information related to queries, offering users rich structured information about a topic instead of a set of documents relevant to the topic. Previous work reports that searching for information about individual entities such as persons, places and organisations is the most common form of Web search. Since the Semantic Web was first proposed, the amount of structured data on the Web has increased dramatically. This is particularly the case for what is known as Linked Data, information that has been published using Semantic Web standards such as RDF and OWL. Such structured data opens up new possibilities for improving entity search on the Web, integrating facts from independent sources, and presenting users with contextually-rich information about entities. This research focuses on entity search of Linked Data in terms of three different forms of search: structured queries, where users can use the SPARQL query language for manipulating data sources; exploratory search, where users can browse from one entity to another; and focused search, where users can input an entity query as a free text keyword search. We undertake a comparative study between two distinct information architectures for structured querying to manipulate Linked Data over the Web. Specifically, we evaluate some of the main operators in SPARQL using several datasets of Linked Data. We introduce a framework of five criteria to evaluate 15 current state-of-the-art semantic tools available for exploratory search of Linked Data, in order to establish how well these browsers make available the benefits of Linked Data and entity search for human users. We also use the criteria to determine the browsers that are best suited to entity exploration. Further, we propose a new model, the Attribute Importance Model, for entity-aggregated search, with the purpose of improving user experience when finding information about entities. The model develops three techniques: (1) presenting entity type-based query suggestions; (2) clustering aggregated attributes; and (3) ranking attributes based on their importance to a given query. Together these constitute a model for developing more informative views and enhancing users’ understanding of entity descriptions on the Web. We then use our model to provide an interactive approach, with the Information Visualisation toolkit InfoVis, that enables users to visualise entity clusters generated by our Attribute Importance Model. Thus this thesis addresses two challenges of searching Linked Data. The first challenge concerns the specific issue of information resolution during the search: the reduction of query ambiguity and redundant results that contain irrelevant descriptions when searching for information about an entity. The second challenge concerns the more general problem of technical complexity, and addresses to the limited adoption of Linked Data that we ascribe to the lack of understanding of Semantic Web technologies and data structures among general users. These technologies pose new design problems for human interaction such as overloading data, navigation styles, and browsing mechanisms. The Attribute Importance Model addresses both these challenges

    Distributed Semantic Social Networks: Architecture, Protocols and Applications

    Get PDF
    Online social networking has become one of the most popular services on the Web. Especially Facebook with its 845Mio+ monthly active users and 100Mrd+ friendship relations creates a Web inside the Web. Drawing on the metaphor of islands, Facebook is becoming more like a continent. However, users are locked up on this continent with hardly any opportunity to communicate easily with users on other islands and continents or even to relocate trans-continentally. In addition to that, privacy, data ownership and freedom of communication issues are problematically in centralized environments. The idea of distributed social networking enables users to overcome the drawbacks of centralized social networks. The goal of this thesis is to provide an architecture for distributed social networking based on semantic technologies. This architecture consists of semantic artifacts, protocols and services which enable social network applications to work in a distributed environment and with semantic interoperability. Furthermore, this thesis presents applications for distributed semantic social networking and discusses user interfaces, architecture and communication strategies for this application category.Soziale Netzwerke gehören zu den beliebtesten Online Diensten im World Wide Web. Insbesondere Facebook mit seinen mehr als 845 Mio. aktiven Nutzern im Monat und mehr als 100 Mrd. Nutzer- Beziehungen erzeugt ein eigenständiges Web im Web. Den Nutzern dieser Sozialen Netzwerke ist es jedoch schwer möglich mit Nutzern in anderen Sozialen Netzwerken zu kommunizieren oder aber mit ihren Daten in ein anderes Netzwerk zu ziehen. Zusätzlich dazu werden u.a. Privatsphäre, Eigentumsrechte an den eigenen Daten und uneingeschränkte Freiheit in der Kommunikation als problematisch empfunden. Die Idee verteilter Soziale Netzwerke ermöglicht es, diese Probleme zentralisierter Sozialer Netzwerke zu überwinden. Das Ziel dieser Arbeit ist die Darstellung einer Architektur verteilter Soziale Netzwerke welche auf semantischen Technologien basiert. Diese Architektur besteht aus semantischen Artefakten, Protokollen und Diensten und ermöglicht die Kommunikation von Sozialen Anwendungen in einer verteilten Infrastruktur. Darüber hinaus präsentiert diese Arbeit mehrere Applikationen für verteilte semantische Soziale Netzwerke und diskutiert deren Nutzer-Schnittstellen, Architektur und Kommunikationsstrategien. 

    Business Intelligence on Non-Conventional Data

    Get PDF
    The revolution in digital communications witnessed over the last decade had a significant impact on the world of Business Intelligence (BI). In the big data era, the amount and diversity of data that can be collected and analyzed for the decision-making process transcends the restricted and structured set of internal data that BI systems are conventionally limited to. This thesis investigates the unique challenges imposed by three specific categories of non-conventional data: social data, linked data and schemaless data. Social data comprises the user-generated contents published through websites and social media, which can provide a fresh and timely perception about people’s tastes and opinions. In Social BI (SBI), the analysis focuses on topics, meant as specific concepts of interest within the subject area. In this context, this thesis proposes meta-star, an alternative strategy to the traditional star-schema for modeling hierarchies of topics to enable OLAP analyses. The thesis also presents an architectural framework of a real SBI project and a cross-disciplinary benchmark for SBI. Linked data employ the Resource Description Framework (RDF) to provide a public network of interlinked, structured, cross-domain knowledge. In this context, this thesis proposes an interactive and collaborative approach to build aggregation hierarchies from linked data. Schemaless data refers to the storage of data in NoSQL databases that do not force a predefined schema, but let database instances embed their own local schemata. In this context, this thesis proposes an approach to determine the schema profile of a document-based database; the goal is to facilitate users in a schema-on-read analysis process by understanding the rules that drove the usage of the different schemata. A final and complementary contribution of this thesis is an innovative technique in the field of recommendation systems to overcome user disorientation in the analysis of a large and heterogeneous wealth of data

    Multi-Agent Systems

    Get PDF
    This Special Issue ""Multi-Agent Systems"" gathers original research articles reporting results on the steadily growing area of agent-oriented computing and multi-agent systems technologies. After more than 20 years of academic research on multi-agent systems (MASs), in fact, agent-oriented models and technologies have been promoted as the most suitable candidates for the design and development of distributed and intelligent applications in complex and dynamic environments. With respect to both their quality and range, the papers in this Special Issue already represent a meaningful sample of the most recent advancements in the field of agent-oriented models and technologies. In particular, the 17 contributions cover agent-based modeling and simulation, situated multi-agent systems, socio-technical multi-agent systems, and semantic technologies applied to multi-agent systems. In fact, it is surprising to witness how such a limited portion of MAS research already highlights the most relevant usage of agent-based models and technologies, as well as their most appreciated characteristics. We are thus confident that the readers of Applied Sciences will be able to appreciate the growing role that MASs will play in the design and development of the next generation of complex intelligent systems. This Special Issue has been converted into a yearly series, for which a new call for papers is already available at the Applied Sciences journal’s website: https://www.mdpi.com/journal/applsci/special_issues/Multi-Agent_Systems_2019
    corecore