Exploiting Cluster-Skipping Inverted Index Structure for Semantic Place Retrieval

Download

index.pdf

Date

2022-11-30

Author

Çınar, Enes Recep

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

97
views

14
downloads

Semantic place retrieval is a popular research problem that aims to search over knowledge graphs using both text and location information. While handling such queries, it is crucial to appropriately balance the relevance and spatial distance of places to the user's query, to satisfy the user's information needs. Furthermore, given modern users' expectations, it is also critical to return results in a short time, which implies the necessity of using advanced index structures in the underlying retrieval system. In this work, our contribution toward improving the efficiency of semantic place retrieval is two-fold. First, we show that by applying some ad hoc yet intuitive restrictions on the depth of search on the knowledge graph, it is possible to adopt several well-known index structures, so-called geo-textual indices that are introduced for processing the spatial keyword queries, for the semantic place retrieval scenario. Secondly, as a novel solution to the semantic place retrieval problem, we adapt the idea of cluster-skipping inverted index (CS-IIS), which has been originally proposed for retrieval over topically clustered document collections. In our adaptation, we also use an early-stopping technique based on the textual and spatial scores of the spatial grids that are being processed. Our exhaustive experiments lead to several interesting findings. We show that while some of the earlier geo-textual indices in the literature yield high efficiency in terms of in memory processing time, they may cause a large number of direct disk accesses. In contrast, our approach based on CS-IIS requires a few direct disk accesses (which is equal to the number of terms in the query) and hence, performs considerably better than the baseline approaches in terms of the total query processing time.

Subject Keywords

Semantic place retrieval, Indexing, Query processing

URI

https://hdl.handle.net/11511/101859

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

PROGRESSIVE CLUSTERING OF MANIFOLD-MODELED DATA BASED ON TANGENT SPACE VARIATIONS Gokdogan, Gokhan; Vural, Elif (2017-09-28) An important research topic of the recent years has been to understand and analyze manifold-modeled data for clustering and classification applications. Most clustering methods developed for data of non-linear and low-dimensional structure are based on local linearity assumptions. However, clustering algorithms based on locally linear representations can tolerate difficult sampling conditions only to some extent, and may fail for scarcely sampled data manifolds or at high-curvature regions. In this paper, w...
Multi-Modal Learning With Generalizable Nonlinear Dimensionality Reduction KAYA, SEMİH; Vural, Elif (2019-08-26) In practical machine learning settings, there often exist relations or links between data from different modalities. The goal of multimodal learning algorithms is to efficiently use the information available in different modalities to solve multi-modal classification or retrieval problems. In this study, we propose a multi-modal supervised representation learning algorithm based on nonlinear dimensionality reduction. Nonlinear embeddings often yield more flexible representations compared to linear counterpa...
A Cost-Aware Strategy for Query Result Caching in Web Search Engines Altıngövde, İsmail Sengör; Ulusoy, Oezguer (2009-01-01) Search engines and large scale IR systems need to cache query results for efficiency and scalability purposes. In this study, we propose to explicitly incorporate the query costs in the static caching policy. To this end, a query’s cost is represented by its execution time, which involves CPU time to decompress the postings and compute the query-document similarities to obtain the final top-N answers. Simulation results using a large Web crawl data and a real query log reveal that the proposed strategy impr...
USING FUZZY TOPSIS AND REGRESSION BASED WEIGHTS TO RANK E-COMMERCE WEBSITES ÖZKAN, NECMETTİN FIRAT; Gökalp Yavuz, Fulya (2019-07-01) Website usability is a widespread study area which incorporates researches from various disciplines. Several methods are available to evaluate usability of a website. Checklists, heuristic evaluations, expert evaluations, surveys and user tests are presented as the most popular methods for the evaluation of websites. Especially e - commerce websites’ usability has a critical importance due to the rising in competence and the rising in the number of e-commerce websites. The diversity of e-commerce websites e...
Secure logical schema and decomposition algorithm for proactive context dependent attribute based inference control Turan, Ugur; Toroslu, İsmail Hakkı; Kantarcioglu, Murat (2017-09-01) Inference problem has always been an important and challenging topic of data privacy in databases. In relational databases, the traditional solution to this problem was to define views on relational schemas to restrict the subset of attributes and operations available to the users in order to prevent unwanted inferences. This method is a form of decomposition strategy, which mainly concentrates on the granularity of the accessible fields to the users, to prevent sensitive information inference. Nowadays, du...

Citation Formats

E. R. Çınar, “Exploiting Cluster-Skipping Inverted Index Structure for Semantic Place Retrieval,” M.S. - Master of Science, Middle East Technical University, 2022.