22,097 Hits in 5.7 sec

SocialGQ: Towards Semantically Approximated and User-aware Querying of Social-Graph Data

Riccardo Martoglia
2018 Proceedings of the 30th International Conference on Software Engineering and Knowledge Engineering  
SocialGQ allows users to compose complex queries in a simple way, and is able to retrieve useful knowledge (top-k answers) by jointly exploiting: (a) the structure of the graph, semantically approximating  ...  In this paper, we present SocialGQ ("Social-Graph Querying"), a novel approach for the effective and efficient querying of socialgraph data overcoming the limitations of typical search approaches proposed  ...  Query processing and ranking The goal of the query processor and ranking modules is to exploit the data structures made available by the data manager to generate the top-k answers approximating the query  ... 
doi:10.18293/seke2018-052 dblp:conf/seke/Martoglia18 fatcat:lirsmtnas5cgre2snh24yoxhg4

ONTOSEARCH2: Searching Ontologies Semantically

Edward Thomas, Jeff Z. Pan, Derek H. Sleeman
2007 W3C Web Ontology Language (OWL) Experiences and Directions Workshop (OWLED)  
Existing approaches are mainly based on keywords and metadata information of ontologies, rather than semantic entailments of ontologies.  ...  These approaches take advantage of ON-TOSEARCH2's efficient query answering capability.  ...  We would also like to thank Giorgos Stamou and Giorgos Stoilos for their discussions and contributions on the fuzzy query answering component.  ... 
dblp:conf/owled/ThomasPS07 fatcat:m2mpti5tejblxmjgcyaiclun3a


Gjergji Kasneci, Fabian M. Suchanek, Georgiana Ifrim, Shady Elbassuoni, Maya Ramanath, Gerhard Weikum
2008 Proceedings of the 2008 ACM SIGMOD international conference on Management of data - SIGMOD '08  
We propose a demonstration of NAGA which will allow users to browse the knowledge base through a user interface, enter queries in NAGA's query language and tune the ranking parameters to test various ranking  ...  Searching for explicit knowledge needs to consider inherent semantic structures involving entities and relationships. In this demonstration proposal, we describe a semantic search system named NAGA.  ...  Note that there are multiple answers to this query and NAGA returns a ranked list of answers.  ... 
doi:10.1145/1376616.1376756 dblp:conf/sigmod/KasneciSIERW08 fatcat:e3a2x4olfrgyrd6awttu2ih2tm

An Integrated Query Relaxation Approach Adopting Data Abstraction and Fuzzy Relation

Soon-Young Huh, Kae-Hyun Moon, Jinsoo Park
2010 Journal of Database Management  
To provide a wider range of approximate answers by relaxing search conditions, cooperative query answering requires a human expert's knowledge of the underlying database semantics (e.g., similarity strength  ...  Based on FAH, the authors develop query relaxation operators like query generalization, approximation, and specialization of a value.  ... 
doi:10.4018/jdm.2010100103 fatcat:yddyhij7jndyzjvcmcvns4a2ae


Thiago Arruda, Damires Souza, Ana Carolina Salgado
2010 Proceedings of the 12th International Conference on Information Integration and Web-based Applications & Services - iiWAS '10  
One key issue for query answering in dynamic distributed environments is the reformulation of a query posed at a peer into another one over a target peer.  ...  More specifically, we address query personalization at reformulation time, producing a ranked set of answers according to user's preferences.  ...  Acknowledgments: The work was partially supported by the National Institute of Science and Technology for Software Engineering (INES), funded by CNPQ and FACEPE, grants 573964/2008-4 and APQ-1037-1.03/  ... 
doi:10.1145/1967486.1967595 dblp:conf/iiwas/ArrudaSS10 fatcat:5e66mewdqjhzzh6j6cvmk5ihrm

Toward Approximate GML Retrieval Based on Structural and Semantic Characteristics [chapter]

Joe Tekli, Richard Chbeir, Fernando Ferri, Patrizia Grifoni
2010 Lecture Notes in Computer Science  
In this study, we address the problem of approximate querying and ranked results for GML data and provide a method for GML query evaluation. Our method consists of two main contributions.  ...  GML is emerging as the new standard for representing geographic information in GISs on the Web, allowing the encoding of structurally and semantically rich geographic data in self describing XML-based  ...  , organized in knowledge bases or semantic networks.  ... 
doi:10.1007/978-3-642-13911-6_2 fatcat:sb5yej2hazh7xeukdqnwvv7vje

Linguistic knowledge can improve information retrieval

William A. Woods, Lawrence A. Bookman, Ann Houston, Robert J. Kuhns, Paul Martin, Stephen Green
2000 Proceedings of the sixth conference on Applied natural language processing -  
technique for relevance estimation and passage retrieval.  ...  This paper describes the results of some experiments using a new approach to information access that combines techniques from natural language processing and knowledge representation with a penalty-based  ...  Sun, Sun Microsystems, and SearchIt are trademarks or registered trademarks of Sun Microsystems, Inc. in the U.S. and other countries.  ... 
doi:10.3115/974147.974183 dblp:conf/anlp/WoodsBHKMG00 fatcat:qq4lq3ztdnf3vhyxuhmn74hgbm

Learning a Compositional Semantics for Freebase with an Open Predicate Vocabulary

Jayant Krishnamurthy, Tom M. Mitchell
2015 Transactions of the Association for Computational Linguistics  
A training phase produces this probabilistic database using a corpus of entity-linked text and probabilistic matrix factorization with a novel ranking objective function.  ...  We present an approach to learning a model-theoretic semantics for natural language tied to Freebase.  ...  We additionally thank Matt Gardner, Ndapa Nakashole, Amos Azaria and the anonymous reviewers for their helpful comments.  ... 
doi:10.1162/tacl_a_00137 fatcat:vuoo5747drfkdmjaa344kdli6q

Merging and Ranking Answers in the Semantic Web: The Wisdom of Crowds [chapter]

Vanessa Lopez, Andriy Nikolov, Miriam Fernandez, Marta Sabou, Victoria Uren, Enrico Motta
2009 Lecture Notes in Computer Science  
In this paper we propose algorithms for combining and ranking answers from distributed heterogeneous data sources in the context of a multi-ontology Question Answering task.  ...  Our proposal includes a merging algorithm that aggregates, combines and filters ontology-based search results and three different ranking algorithms that sort the final answers according to different criteria  ...  The merging algorithm is able to filter out up to 91% (32% on average) for union-based queries, and up to 99% (93% on average) for intersection based queries.  ... 
doi:10.1007/978-3-642-10871-6_10 fatcat:2upuagphvvcsffkwgtrjs5y2p4

COLINA: A Method for Ranking SPARQL Query Results through Content and Link Analysis

Azam Feyznia, Mohsen Kahani, Fattane Zarrinkalam
2014 International Semantic Web Conference  
To the best of our knowledge, all previous methods for ranking SPARQL query results are based on popularity calculation and currently there isn't any method for calculating the relevance of results with  ...  Further, the relevancy rank is based on the relevance of semantic documents with SPARQL query.  ...  To the best of our knowledge, all previous methods for ranking SPARQL query results are based on popularity calculation and currently there is no method for calculating the relevance of sub-graph results  ... 
dblp:conf/semweb/FeyzniaKZ14 fatcat:wgdy4qc2zfeitbfstv4lwxdjq4

A Distributional Semantic Search Infrastructure for Linked Dataspaces [chapter]

André Freitas, Seán O'Riain, Edward Curry
2013 Lecture Notes in Computer Science  
The center of the approach relies on the use of a distributional semantics infrastructure to provide semantic search and query services over data for users and applications, improving data accessibility  ...  By accessing the services through a REST API, users can semantically index and search over data using the distributional semantic knowledge embedded in the reference corpus.  ...  PowerMap uses WordNet based similarity approaches as a semantic approximation strategy. PowerAqua, a question answering system for Linked Data, uses PowerMap to match query terms to vocabulary terms.  ... 
doi:10.1007/978-3-642-41242-4_27 fatcat:tg2dx3so35addhnewvnu7m4owu

Querying and Searching Heterogeneous Knowledge Graphs in Real-time Linked Dataspaces [chapter]

André Freitas, Seán O'Riáin, Edward Curry
2019 Real-time Linked Dataspaces  
This chapter investigates the main challenges in constructing query and search services for knowledge graphs within a linked dataspace.  ...  Introduction As the volume and variety of data sources within a dataspace grow, it becomes a semantically heterogeneous and distributed environment; this presents a significant challenge to querying the  ...  Figure 7 .2 depicts an example of the semantic gap between the example user query and possible representations for the knowledge graphs supporting answers for the query.  ... 
doi:10.1007/978-3-030-29665-0_7 fatcat:7qb2boh7njgvjiknknaaig5cou

CLINIQA: A Machine Intelligence Based Clinical Question Answering System [article]

M A H Zahid, Ankush Mittal, R.C. Joshi, G. Atluri
2018 arXiv   pre-print
The system makes use of Unified Medical Language System for semantic analysis of both questions and medical documents.  ...  These facts reflect the urgent need of an information retrieval system that accepts the queries from medical practitioners' in natural language and returns the answers quickly and efficiently.  ...  Simple yet effective strategies are developed for answer extraction and ranking. Finally, the answer based on the rank is returned to the user.  ... 
arXiv:1805.05927v1 fatcat:uk2mal2cobcuvmxbyiqen2vh5y

Using semantic links to support top-K join queries in peer-to-peer networks

Jie Liu, Liang Feng, Hai Zhuge
2007 Concurrency and Computation  
Usually K is quite small compared to the total number of satisfactory answers. USING SEMANTIC LINKS TO SUPPORT TOP-K QUERIES IN P2P NETWORKS tuples and the top-K miss rate.  ...  Secondly, we plan to apply the proposed approach to answering top-K join queries in XML. Finally, we plan to look for a good method of answering top-K join queries in structured P2P networks.  ...  Other P2P top-K ranking approaches include a super-peer-based retrieval algorithm for processing top-K queries [29] and an approximate top-K algorithm KLEE for distributed query processing [30] .  ... 
doi:10.1002/cpe.1145 fatcat:c2vnwnrjlban7fq3vfi6uhgcz4

The SemSets model for ad-hoc semantic list search

Marek Ciglan, Kjetil Nørvåg, Ladislav Hluchý
2012 Proceedings of the 21st international conference on World Wide Web - WWW '12  
This facilitates interaction with semantic resources for the users so they can benefit from the knowledge covered by semantic data without the complexities of semantic query languages.  ...  One of the key challenges triggered by this growth is the ad-hoc querying, i.e., the ability to retrieve answers from semantic resources using natural language queries.  ...  CONCLUSION In this paper, we have proposed the SemSets retrieval model for answering semantic type queries from a semantic knowledge base.  ... 
doi:10.1145/2187836.2187855 dblp:conf/www/CiglanNH12 fatcat:gfbgf747vrd25jvfylbipm6yfu
« Previous Showing results 1 — 15 out of 22,097 results