99 Hits in 4.6 sec

Anytime Query Answering in RDF through Evolutionary Algorithms [chapter]

Eyal Oren, Christophe Guéret, Stefan Schlobach
2008 Lecture Notes in Computer Science  
We present a technique for answering queries over RDF data through an evolutionary search algorithm, using fingerprinting and Bloom filters for rapid approximate evaluation of generated solutions.  ...  Our evolutionary approach has several advantages compared to traditional databasestyle query answering.  ...  RDF Query Answering Existing RDF stores such as Sesame [5] or YARS [10] mostly employ standard database techniques for query answering.  ... 
doi:10.1007/978-3-540-88564-1_7 fatcat:dblgrch33jbudewxhtnkknenea

An Evolutionary Perspective on Approximate RDF Query Answering [chapter]

Christophe Guéret, Eyal Oren, Stefan Schlobach, Martijn Schut
2008 Lecture Notes in Computer Science  
RDF is increasingly being used to represent large amounts of data on the Web. Current query evaluation strategies for RDF are inspired by databases, assuming perfect answers on finite repositories.  ...  In this paper, we focus on a query method based on evolutionary computing, which allows us to handle uncertainty, incompleteness and unsatisfiability, and deal with large datasets, all within a single  ...  After giving some background in section 2 we describe our evolutionary algorithm for RDF query answering in section 3. In section 4, we study the space and run-time requirements of our algorithm.  ... 
doi:10.1007/978-3-540-87993-0_18 fatcat:pvaymijwpzbtjipsqio47tglla

Evolutionary and Swarm Computing for the Semantic Web

Christophe Gueret, Stefan Schlobach, Kathrin Dentler, Martijn Schut, Gusz Eiben
2012 IEEE Computational Intelligence Magazine  
Finally, we will discuss two case studies in which we successfully applied soft computing methods to two of the main reasoning tasks; an evolutionary approach to querying, and a swarm algorithm for entailment  ...  For each of these primitive reasoning tasks we will discuss possible problem solving methods grounded in Evolutionary and Swarm computing, with short descriptions of existing approaches.  ...  Two RDF graphs about publications cg:ISWC08 pub:title "Anytime Query Answering in RDF through Evolutionary Algorithms"; rdf:type pub:InProceedings; AGENT SCHEMA TRIPLE AGENT MEMORY IF PATTERN FOUND THEN  ... 
doi:10.1109/mci.2012.2188583 fatcat:5guizi4b2nbhjmdhopyqwlev74

Scalable Reduction of Large Datasets to Interesting Subsets

Gregory Todd Williams, Jesse Weaver, Medha Atre, James Hendler
2010 Social Science Research Network  
the extracted data using a personal computer, all in the order of tens of minutes.  ...  Traditional approaches to storing, querying, and reasoning fall short when faced with web-scale data.  ...  Sofka for providing support in performing our evaluation at Rensselaer Polytechnic Institute's Computational Center for Nanotechnology Innovations.  ... 
doi:10.2139/ssrn.3199489 fatcat:josf5g6fozhxlkcwq7md36n5qe

Scalable reduction of large datasets to interesting subsets

Gregory Todd Williams, Jesse Weaver, Medha Atre, James A. Hendler
2010 Journal of Web Semantics  
the extracted data using a personal computer, all in the order of tens of minutes.  ...  Traditional approaches to storing, querying, and reasoning fall short when faced with web-scale data.  ...  Sofka for providing support in performing our evaluation at Rensselaer Polytechnic Institute's Computational Center for Nanotechnology Innovations.  ... 
doi:10.1016/j.websem.2010.08.002 fatcat:33njao7cjfdrlgjk6jnm4wip7y

Abstracts of Recent PhDs

2009 Knowledge engineering review (Print)  
With this in mind, we develop a novel, anytime algorithm for solving the coalition structure generation problem.  ...  Using this representation, the algorithm can then search through the selected sub-space(s) very efficiently using a branch-andbound technique.  ...  Such rules are similar to usual rules in logic programs with negation as failure, but may also contain queries to L, possibly defaultnegated, in their bodies.  ... 
doi:10.1017/s0269888909000228 fatcat:nwrvnpjobjeglkwr2sxbnzgrqm

Federated Data Management and Query Optimization for Linked Open Data [chapter]

Olaf Görlitz, Steffen Staab
2011 Studies in Computational Intelligence  
Since Linked Open Data is based on standards like the RDF format and the SPARQL query language, it is possible to implement a federation infrastructure without the need for specific data wrappers.  ...  In this chapter we consider some details and implications of these limitations and presents an improved query optimization approach based on dynamic programming.  ...  For example, there is RCQ-GA [31] , a genetic algorithm for optimizing chain queries. An evolutionary algorithm for approximate querying with anytime behavior is presented in [21] .  ... 
doi:10.1007/978-3-642-17551-0_5 fatcat:4xbxxkewrbhifpir6sr57cmxay

An introduction to knowledge computing

Vagan Terziyan, Oleksandr Shevchenko, Mariia Golovianko
2014 Eastern-European Journal of Enterprise Technologies  
Unlike the knowledge answering machines, where computations over knowledge are used just for addressing a user query, the knowledge computing in addition provides computations for various self-management  ...  We offer an extension to a traditional RDF model of describing knowledge graphs according to the Semantic Web standards so that it will also allow to a knowledge entity to autonomously perform or query  ...  and what answers they get.  ... 
doi:10.15587/1729-4061.2014.21830 fatcat:qjgw6dgdjnh2hd2la53ltn7giy

Introduction to Linked Data and Its Lifecycle on the Web [chapter]

Axel-Cyrille Ngonga Ngomo, Sören Auer, Jens Lehmann, Amrapali Zaveri
2014 Lecture Notes in Computer Science  
In this article we introduce the main concepts of Linked Data.  ...  With Linked Data, a very pragmatic approach towards achieving the vision of the Semantic Web has gained some traction in the last years.  ...  Acknowledgments We would like to thank our colleagues from the AKSW research group in Leipzig as well as the LOD2 and GeoKnow project consortia, without whom writing this chapter would not have been possible  ... 
doi:10.1007/978-3-319-10587-1_1 fatcat:2vba6rydjvehro3cwcakafnn5e

SML-Bench -- A Benchmarking Framework for Structured Machine Learning

Patrick Westphal, Lorenz Buhmann, Simon Bin, Hajira Jabeen, Jens Lehmann
2018 Zenodo  
In this paper, we present the foundations of SML-Bench, discuss the systematic selection of benchmarking datasets and learning problems, and showcase an actual benchmark run on the currently supported  ...  We believe to have closed this gap, which could in turn lead to similar improvements as we have seen for question answering, link discovery and query performance for RDF.  ...  It supports a wide range of algorithms, including refinement operator based algorithms and evolutionary inspired approaches, as well as different OWL profiles.  ... 
doi:10.5281/zenodo.3567901 fatcat:lhjpkfz5fnaf3dg67xggrrcm5m

Social Networks and the Semantic Web

Peter Mika
2015 Proceedings of the 24th International Conference on World Wide Web - WWW '15 Companion  
Further, when resources are limited we are not interested in the asymptotic behavior of the algorithm; on a short scale an approximate anytime algorithm with exponential complexity may be faster than a  ...  What we now call Web 2.0 is a collective name for these evolutionary changes.  ...  hurricane ever recorded in the Gulf of Mexico at the time as well (a record also later broken by Rita).  ... 
doi:10.1145/2740908.2742138 dblp:conf/www/Mika15 fatcat:ptyntdmnjrc4tcayyytykwlaba

Opportunistic Linked Data Querying Through Approximate Membership Metadata [chapter]

Miel Vander Sande, Ruben Verborgh, Joachim Van Herwegen, Erik Mannens, Rik Van de Walle
2015 Lecture Notes in Computer Science  
Increasing a client's efficiency means lowering the number of requests, which can among others be achieved through additional metadata in responses.  ...  In addition to reducing requests, such functions allow to achieve full result recall earlier when temporarily allowing lower precision.  ...  Although this is a centralized solution, it advocates anytime answers, which is in line with the opportunistic querying presented in this paper.  ... 
doi:10.1007/978-3-319-25007-6_6 fatcat:juod4k4o2rcjlpl2mdb2wmq6o4

Is Question Answering fit for the Semantic Web?: A survey

Vanessa Lopez, Victoria Uren, Marta Sabou, Enrico Motta
2011 Semantic Web Journal  
the 70s and later decades, through open domain QA stimulated by the QA track in TREC since 1999, to the latest commercial semantic QA solutions, before tacking the current state of the art in open userfriendly  ...  We present a survey on ontology-based Question Answering (QA), which has emerged in recent years to exploit the opportunities offered by structured semantic information on the Web.  ...  Given a keyword, it retrieves the first result in Sindice to launch a set of SPARQL queries in all SPARQL end points, by applying an evolutionary anytime query algorithm, based on substitutions of possible  ... 
doi:10.3233/sw-2011-0041 fatcat:ub7ja3qgzvcjrgeqdfk3g7huwa

Knowledge Graph Induction enabling Recommending and Trend Analysis: A Corporate Research Community Use Case [article]

Nandana Mihindukulasooriya, Mike Sava, Gaetano Rossiello, Md Faisal Mahbub Chowdhury, Irene Yachbes, Aditya Gidh, Jillian Duckwitz, Kovit Nisar, Michael Santos, Alfio Gliozzo
2022 arXiv   pre-print
A research division plays an important role of driving innovation in an organization.  ...  We will discuss these scenarios in detail and provide an empirical evaluation on entity recommendation specifically.  ...  [7] proposes an explainable recommender by generating the candidates using a KG and using an evolutionary algorithm.  ... 
arXiv:2207.05188v2 fatcat:qushrji4hvabvk2u4irsmv5eca

A Survey on Challenges of Semantics Application in the Internet of Things Domain

Marina Harlamova, Mārīte Kirikova, Kurt Sandkuhl
2017 Applied Computer Systems  
In the present survey, the semantic technology challenges in the IoT domain are amalgamated to provide background for further studies in the use of semantic technologies in the IoT.  ...  However, while there are particular advancements in research on application of Semantic Web in the IoT domain, the dynamic and complex nature of the IoT often requires case specific solutions hard to be  ...  Once the information is structured in RDF, a query processor engine can be used to find specific knowledge or information.  ... 
doi:10.1515/acss-2017-0002 fatcat:hhqj6u7tpng4bgsby3onrw72oq
« Previous Showing results 1 — 15 out of 99 results