CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
A latent model for ad hoc table retrieval
Authors
Feras Al-Obeidat
Ebrahim Bagheri
Publication date
1 January 2020
Publisher
'Springer Science and Business Media LLC'
Doi
Cite
Abstract
© Springer Nature Switzerland AG 2020. The ad hoc table retrieval task is concerned with satisfying a query with a ranked list of tables. While there are strong baselines in the literature that exploit learning to rank and semantic matching techniques, there are still a set of hard queries that are difficult for these baseline methods to address. We find that such hard queries are those whose constituting tokens (i.e., terms or entities) are not fully or partially observed in the relevant tables. We focus on proposing a latent factor model to address such hard queries. Our proposed model factorizes the token-table co-occurrence matrix into two low dimensional latent factor matrices that can be used for measuring table and query similarity even if no shared tokens exist between them. We find that the variation of our proposed model that considers keywords provides statistically significant improvement over three strong baselines in terms of NDCG and ERR
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
ZU Scholars (Zayed University)
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:zuscholars.zu.ac.ae:works-...
Last time updated on 03/12/2021