3,087 Hits in 7.0 sec

A greedy algorithm for finding sets of entity linking interpretations in queries

Faegheh Hasibi, Krisztian Balog, Svein Erik Bratsberg
2014 Proceedings of the first international workshop on Entity recognition & disambiguation - ERD '14  
Finally, we use a greedy algorithm to find all valid interpretation sets for the query. We report on evaluation results using the official ERD challenge platform.  ...  We describe our participation in the short text track of the Entity Recognition and Disambiguation (ERD) challenge, where the task is to find all interpretations of entity-related queries and link them  ...  In the last step of our framework, we use a greedy algorithm to find valid interpretations.  ... 
doi:10.1145/2633211.2634356 dblp:conf/sigir/HasibiBB14 fatcat:zceq2korjbgkplvby2g3qkohoe

Entity Linking in Queries: Efficiency vs. Effectiveness [chapter]

Faegheh Hasibi, Krisztian Balog, Svein Erik Bratsberg
2017 Lecture Notes in Computer Science  
While there is a large body of work on entity linking in documents, entity linking in queries poses new challenges due to the limited context the query provides coupled with the efficiency requirements  ...  Our goal is to gain a deeper understanding of how to approach entity linking in queries, with a special focus on how to strike a balance between effectiveness and efficiency.  ...  plugged in for two core components: candidate entity ranking and disambiguation.  ... 
doi:10.1007/978-3-319-56608-5_4 fatcat:u3wntwzxtzc4dm5nk34zb6cp6y

Keyword Search on RDF Graphs - A Query Graph Assembly Approach [article]

Shuo Han, Lei Zou, Jeffrey Xu Yu, Dongyan Zhao
2017 arXiv   pre-print
In order to solve that, we design some heuristic lower bounds and propose a bipartite graph matching-based best-first search algorithm.  ...  Keyword search provides ordinary users an easy-to-use interface for querying RDF data.  ...  Greedy-LB: Inspired by the matching-based KM-LB, we propose a greedy strategy (Algorithm 2) to find an approximate matching of Z in O(|Z |) time. It has been proved in [27] .  ... 
arXiv:1704.00205v2 fatcat:4jejfhlexbbebnvkaoqb4volam

Entity Linking in Queries

Faegheh Hasibi, Krisztian Balog, Svein Erik Bratsberg
2015 Proceedings of the 2015 International Conference on Theory of Information Retrieval - ICTIR '15  
While seeming similar, the task of entity linking in queries is different from entity linking in documents and requires a methodological departure due to the inherent ambiguity of queries.  ...  Annotating queries with entities is one of the core problem areas in query understanding.  ...  We present an algorithm, named Greedy Interpretation Finding (GIF), that can detect multiple interpretations of a query; see Algorithm 1.  ... 
doi:10.1145/2808194.2809473 dblp:conf/ictir/HasibiBB15 fatcat:pjmzixgqwzbz7axllnwrahdxbm


Ahmed El-Roby, Ashraf Aboulnaga
2015 Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data - SIGMOD '15  
ALEX starts with a set of candidate links obtained using any automatic linking algorithm.  ...  ALEX discovers these new links by finding links that are similar to a link approved by the user through feedback on queries.  ...  The way ALEX finds similar links is as follows: An entity in an RDF data set is represented by a URI.  ... 
doi:10.1145/2723372.2749428 dblp:conf/sigmod/El-RobyA15 fatcat:vyqqjttgmrfshnzuldc3pg3b7a

Understanding Information Needs [chapter]

Krisztian Balog
2018 Advanced Topics in Information Retrieval  
In Sect. 7.3, we perform entity linking in queries, which is about recognizing specific entity mentions and annotating them with unique identifiers from the underlying knowledge repository.  ...  Such semantic analysis of queries has been a longstanding research area in information retrieval. In Sect. 7.1, we give a brief overview of IR approaches to query understanding.  ...  [32] present the greedy interpretation finding (GIF) algorithm, shown in Algorithm 7.1, which consists of three steps: (1) pruning, (2) containment mention filtering, and (3) set generation.  ... 
doi:10.1007/978-3-319-93935-3_7 fatcat:kbqo7rhshrcivlfsauptk3z3oa

Managing road route networks using userdefined keywords

Gopalika Sharma, Shubham Mehrotra, Drishti Chauhan
2018 International Journal of Engineering and Technology  
First, we propose a greedy algorithm and then we move on to a dynamic programming algorithm. These algorithms form the headlines of the aforesaid idea.  ...  For improving the efficiency of our algorithm we take the help of Branch and Bound algorithm which is known to cut down the extra and unnecessary details which might be present in any of the vertices.  ...  The examples of greedy algorithms for finding the minimum spanning trees are Kruskals and Prims algorithm, and the algorithm to find optimum Huffman trees.  ... 
doi:10.21817/ijet/2018/v10i3/181003005 fatcat:m6xxivcd3fgadbjrlxfbk3xdta

Graph Ranking for Collective Named Entity Disambiguation

Ayman Alhelbawy, Robert Gaizauskas
2014 Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers)  
Named Entity Disambiguation (NED) refers to the task of mapping different named entity mentions in running text to their correct interpretations in a specific knowledge base (KB).  ...  Each node has an initial confidence score, e.g. entity popularity. Page-Rank is used to rank nodes and the final rank is combined with the initial confidence for candidate selection.  ...  So, an algorithm originally used to find strongly interconnected, size-limited groups in social media is adopted to prune the graph, and then a greedy algorithm is used to find the densest graph.  ... 
doi:10.3115/v1/p14-2013 dblp:conf/acl/AlhelbawyG14 fatcat:ct2hvmsoxff53pcizdfqgxb6om

KlusTree: Clustering Answer Trees from Keyword Search on Graphs [article]

Madhulika Mohanty, Maya Ramanath
2017 arXiv   pre-print
We are concerned with a class of queries called relationship queries, which are usually expressed as a set of keywords (each keyword denoting a named entity).  ...  Effectively querying this graph structured data is non-trivial and has led to research in a variety of directions -- structured queries, keyword and natural language queries, automatic translation of these  ...  DisC [14] gives a concept of DisC diversity and proposes a greedy algorithm for finding diverse results. Other greedy based techniques are given in [3] , [37] and [7] .  ... 
arXiv:1705.09808v1 fatcat:zerrbzxvafhttfznpfsgjsytka

Mining Redescriptions with Siren

Esther Galbrun, Pauli Miettinen
2018 ACM Transactions on Knowledge Discovery from Data  
In many areas of science, scientists need to find distinct common characterizations of the same objects and, vice versa, to identify sets of objects that admit multiple shared descriptions.  ...  If a domain expert wants to use redescription mining in his research, merely being able to find redescriptions is not enough.  ...  Thus, they provide alternative descriptions for the same set of entities. We call such a pair of queries a redescription.  ... 
doi:10.1145/3007212 fatcat:3snuvns4zvbqvokduf5t3glz5y

A two-phase framework for quality-aware Web service selection

Qi Yu, Manjeet Rege, Athman Bouguettaya, Brahim Medjahed, Mourad Ouzzani
2010 Service Oriented Computing and Applications  
We conduct a set of experiments to assess the performance of the proposed algorithms.  ...  The expected large number of Web services poses a set of new challenges for efficiently accessing these services.  ...  Greedy algorithm We start by considering the minimum time required by the greedy algorithm. In this case, the algorithm finds a feasible conceptual choreography in a single iteration.  ... 
doi:10.1007/s11761-010-0055-6 fatcat:dt5ydnf7urd6fjyro5qmiawxw4

A Fresh Look on Knowledge Bases

Erdal Kuzey, Jilles Vreeken, Gerhard Weikum
2014 Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management - CIKM '14  
For distilling canonicalized events from this raw data, we present a novel graph coarsening algorithm based on the informationtheoretic principle of minimum description length.  ...  Our method captures similarity measures among news articles in a multi-view attributed graph, considering textual contents, entity occurrences, and temporal ordering.  ...  Acknowledgements Jilles Vreeken is supported by the Cluster of Excellence "Multimodal Computing and Interaction" within the Excellence Initiative of the German Federal Government.  ... 
doi:10.1145/2661829.2661984 dblp:conf/cikm/KuzeyVW14 fatcat:hgm6kv62kjgdlidyeh4shcgrfa

Multidimensional Assignment Problem for multipartite entity resolution [article]

Alla Kammerdiner and Alexander Semenov and Eduardo Pasiliao
2021 arXiv   pre-print
We derive a mathematical formulation for a general class of record linkage problems in multipartite entity resolution across many datasets as a combinatorial optimization problem known as the multidimensional  ...  of genetic algorithm, a general metaheuristic.  ...  Greedy algorithm for the MAP with discrete costs Here we describe a greedy solution algorithm proposed in [33] for solving the MAP with discrete costs.  ... 
arXiv:2112.03346v1 fatcat:dosulmdbmjapjcysxoqvndexhq

An overview of search strategies in distributed environments

E. Del Val, M. Rebollo, V. Botti
2013 Knowledge engineering review (Print)  
In these areas, the search for resources, services, or entities plays a key role for the proper performance of the systems built on them.  ...  In this paper, we present a comprehensive vision of search in distributed environments.  ...  Moreover, there is a set of Complex Network models that have a structure where greedy algorithms can locate the target resource in short paths. Local knowledge.  ... 
doi:10.1017/s0269888913000143 fatcat:my7o2yy4lbbnxc6mu57ajhrkja

Clearing the FOG: Fuzzy, overlapping groups for social networks

George B. Davis, Kathleen M. Carley
2008 Social Networks  
However, most group detection algorithms for social networks impose a strict partitioning on nodes, forcing entities to belong to a single group.  ...  We apply our algorithm to both link data and network data, where we use a random walk approach to generate rich links from networks.  ...  Consider a set of entities E and a set of groups G. Entities are elementary objects whose presence or absence is observable in a set L of links (which are sets of entities).  ... 
doi:10.1016/j.socnet.2008.03.001 fatcat:pxvayv2vp5glbfx56bjw7kkom4
« Previous Showing results 1 — 15 out of 3,087 results