20,051 Hits in 3.4 sec

Relevance Proximity Graphs for Fast Relevance Retrieval [article]

Stanislav Morozov, Artem Babenko
2019 arXiv   pre-print
To address this issue, we introduce Relevance Proximity Graphs (RPG): an efficient non-exhaustive approach that provides a high-quality approximate solution for maximal relevance retrieval.  ...  We open-source our implementation as well as two large-scale datasets to support further research on relevance retrieval.  ...  Conclusion In this paper, we have proposed and evaluated the Relevance Proximity Graph (RPG) framework for non-exhaustive maximal relevance retrieval with highly-nonlinear models.  ... 
arXiv:1908.06887v3 fatcat:ox5y64afwbdyzczyjec4fgqey4

Evaluating Geospatial Geometry and Proximity Queries Using Distributed Hash Tables

Matthew Malensek, Sangmi Pallickara, Shrideep Pallickara
2014 Computing in science & engineering (Print)  
In this paper, we explore the challenges associated with supporting geospatial retrievals constrained by arbitrary geometric bounds, geographic proximity, and relevance rankings.  ...  Data volumes in the geosciences and related domains have grown significantly as sensing equipment designed to continuously gather readings and produce data streams for geographic regions have proliferated  ...  Metadata and Information Retrieval Each node in the system maintains a metadata graph for quickly evaluating local queries.  ... 
doi:10.1109/mcse.2014.48 fatcat:drllwp5hjraanf3uw7zi7amyta

Fast query execution for retrieval models based on path-constrained random walks

Ni Lao, William W. Cohen
2010 Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '10  
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labeled edges representing  ...  In experiments on several recommendation and retrieval problems using two large scientific publications corpora we show speedups of factors of 2 to 100 with little loss in accuracy.  ...  The number of nodes with non-zero probability grows very fast on a well connected graph.  ... 
doi:10.1145/1835804.1835916 dblp:conf/kdd/LaoC10 fatcat:ygn2mmh3tnbancpoz4pd6qruxi

Inducing a perceptual relevance shape classifier

Victoria J. Hodge, John Eakins, James Austin
2007 Proceedings of the 6th ACM international conference on Image and video retrieval - CIVR '07  
The work indicated that there is a core set of segmentations for each image that people perceive.  ...  We demonstrate that a perceptual relevance classifier is attainable and identify a good methodology to achieve this.  ...  INTRODUCTION There has recently been tremendous growth in the storage of digital imagery producing a need for accurate and fast indexing and retrieval systems.  ... 
doi:10.1145/1282280.1282306 dblp:conf/civr/HodgeEA07 fatcat:lo7av235qzhuvj77y7t7g6vzkm

Sketch-based retrieval of drawings using spatial proximity

Pedro Sousa, Manuel J. Fonseca
2010 Journal of Visual Languages and Computing  
Experimental evaluation reveal that the use of topological proximity results in better retrieval results than topology alone.  ...  In this paper, we present a new approach to enrich the topological information by integrating spatial proximity in the topology graph, through the use of weights in adjacency links.  ...  Acknowledgments This work was funded in part by the Portuguese Foundation for Science and Technology, project A-CSCW, PTDC/EIA/67589/2006.  ... 
doi:10.1016/j.jvlc.2009.12.001 fatcat:44n3nf2uxvczxgjxygbhbgznfe

A multimedia interactive search engine based on graph-based and non-linear multimodal fusion

Anastasia Moumtzidou, Ilias Gialampoukidis, Theodoros Mironidis, Dimitris Liparas, Stefanos Vrochidis, Ioannis Kompatsiaris
2016 2016 14th International Workshop on Content-Based Multimedia Indexing (CBMI)  
The images of the multimedia collection are organized by color, offering fast browsing in the image collection.  ...  Apart from multimedia search, the engine is able to perform text search and image retrieval independently using both high-level and lowlevel information.  ...  Moreover, VERGE's multimodal fusion allows for combining all modalities for retrieving relevant-to-a-query multimodal objects, where queries are served as an image collection.  ... 
doi:10.1109/cbmi.2016.7500276 dblp:conf/cbmi/MoumtzidouGMLVK16 fatcat:zx3tgnl6dbcljaaezmakgmc72y

Beyond Precision: A Study on Recall of Initial Retrieval with Neural Representations [article]

Yan Xiao, Jiafeng Guo, Yixing Fan, Yanyan Lan, Jun Xu, Xueqi Cheng
2018 arXiv   pre-print
Vocabulary mismatch is a central problem in information retrieval (IR), i.e., the relevant documents may not contain the same (symbolic) terms of the query.  ...  Therefore, in this paper, we study the problem how to employ neural representations to improve the recall of relevant documents in the initial retrieval stage.  ...  [18] proposed the two-stage hashing scheme for fast document retrieval.  ... 
arXiv:1806.10869v2 fatcat:f7ggl2nnszchzdhqmkupfc63y4

Measuring Proximity on Graphs with Side Information

Hanghang Tong, Huiming Qu, Hani Jamjoom
2008 2008 Eighth IEEE International Conference on Data Mining  
This paper studies how to incorporate side information (such as users' feedback) in measuring node proximity on large graphs.  ...  Given the potential computational complexity of ProSIN, we also propose a fast algorithm (Fast-ProSIN) that exploits the smoothness of the graph structures with/without side information.  ...  Introduction Measuring proximity (i.e., relevance/closeness) between nodes on large graphs is a very important aspect in graph mining and has many real applications in ranking, anomaly nodes indentification  ... 
doi:10.1109/icdm.2008.42 dblp:conf/icdm/TongQJ08 fatcat:vxh64ocir5bw7ae6ghreo3axou

Kernel on Graphs Based on Dictionary of Paths for Image Retrieval

Jean-Emmanuel Haugeard, Sylvie Philipp-Foliguet, Philippe-Henri Gosselin
2010 2010 20th International Conference on Pattern Recognition  
A common strategy for graph retrieval is to perform pairwise comparisons.  ...  Recent approaches of graph comparison consider graphs as sets of paths [6, 5] . Kernels on graphs are then computed from kernels on paths.  ...  The topological information (such as parallelism, proximity) can be considered only for the nearest neighbors of each line segment.  ... 
doi:10.1109/icpr.2010.726 dblp:conf/icpr/HaugeardPG10 fatcat:c2abmpkowra2vkeojtaywbtgza

Data Extraction Of Xml Files Using Searching And Indexing Techniques

Sushma Satpute, Vaishali Katkar, Nilesh Sahare
2008 Zenodo  
By studying the format or semantics of the grammar it will be helpful for fast retrieval of the data. There are many algorithms which describes about searching the data from XML files.  ...  This paper presents fast XML retrieval techniques by using new indexing technique and the concept of RXML.  ...  Like in traditional information retrieval, we think that keyword proximity in a document enhances the relevance judgment of this document.  ... 
doi:10.5281/zenodo.1055992 fatcat:wumctx3zfvcpxnpwqzgo3c7lna

Location Aware Keyword Query Suggestion Based on Document Proximity

Shuyao Qi, Dingming Wu, Nikos Mamoulis
2016 IEEE Transactions on Knowledge and Data Engineering  
., the spatial proximity of a user to the retrieved results is not taken as a factor in the recommendation.  ...  However, the relevance of search results in many applications (e.g., location-based services) is known to be correlated with their spatial proximity to the query issuer.  ...  LKS, on the other hand, captures textual proximity based on the whole structure of KD-graph and thus retrieves more reliable suggestions.  ... 
doi:10.1109/tkde.2015.2465391 fatcat:oopb46wjjzhobedja5a57aunly

Location aware keyword query suggestion based on document proximity

Shuyao Qi, Dingming Wu, Nikos Mamoulis
2016 2016 IEEE 32nd International Conference on Data Engineering (ICDE)  
., the spatial proximity of a user to the retrieved results is not taken as a factor in the recommendation.  ...  However, the relevance of search results in many applications (e.g., location-based services) is known to be correlated with their spatial proximity to the query issuer.  ...  LKS, on the other hand, captures textual proximity based on the whole structure of KD-graph and thus retrieves more reliable suggestions.  ... 
doi:10.1109/icde.2016.7498428 dblp:conf/icde/QiWM16 fatcat:tace2a34obbetocted7tjn5wvm

An effective and versatile keyword search engine on heterogenous data sources

Guoliang Li, Jianhua Feng, Jianyong Wang, Lizhu Zhou
2008 Proceedings of the VLDB Endowment  
To provide such capability, EASE models unstructured, semi-structured and structured data as graphs, summarizes the graphs, and constructs graph indices instead of using traditional inverted indices for  ...  EASE adopts an extended inverted index to facilitate keyword-based search, and employs a novel ranking mechanism for enhancing search effectiveness. *  ...  ACKNOWLEDGEMENT Sincere thanks go to Professor Beng Chin Ooi for his insightful guidance and earnest help all through the analysis and paper-writing stages.  ... 
doi:10.14778/1454159.1454198 fatcat:drqu3okoafhatewkim3b3bgcmy

Automatically incorporating context meaning for query expansion using graph connectivity measures

Amita Jain, Kanika Mittal, Devendra K. Tayal
2014 Progress in Artificial Intelligence  
The relevant nodes representing word senses are identified from the graph and can be chosen as additional terms to be added to the query for improving the retrieval of web pages.  ...  The basis of this query expansion method is to investigate the role of graph structure (which is being created for the query) and determining the importance of each node in the graph using WordNet.  ...  In this way, the user's query is enriched with more relevant terms for efficient retrieval of relevant web pages.  ... 
doi:10.1007/s13748-014-0041-x fatcat:x6cf4bnopzgo5cqlhl5nslxnju

Sentence-based relevance flow analysis for high accuracy retrieval

Jung-Tae Lee, Jangwon Seo, Jiwoon Jeon, Hae-Chang Rim
2011 Journal of the American Society for Information Science and Technology  
Traditional ranking models for information retrieval lack the ability to make a clear distinction between relevant and nonrelevant documents at top ranks if both have similar bag-of-words representations  ...  We then present a framework to learn a function for ranking documents effectively based on various features extracted from their relevance flows and leverage the output to enhance existing retrieval models  ...  Relevance flow graph of two top-ranked documents for TREC topic #102.  ... 
doi:10.1002/asi.21564 fatcat:3ibx4wrfw5g67cdcvnv5sarqry
« Previous Showing results 1 — 15 out of 20,051 results