GTE-Rank: A time-aware search engine to answer time-sensitive queries

被引:13
|
作者
Campos, Ricardo [1 ,2 ]
Dias, Gael [4 ]
Jorge, Alipio [2 ,3 ]
Nunes, Celia [5 ,6 ]
机构
[1] Polytech Inst Tomar, Tomar, Portugal
[2] LIAAD INESC TEC INESC Technol & Sci, Oporto, Portugal
[3] Univ Porto, DCC FCUP, Rua Campo Alegre 823, P-4100 Oporto, Portugal
[4] Univ Caen Basse Normandie, HULTECH GREYC, Caen, France
[5] Univ Beira Interior, Dept Math, Covilha, Portugal
[6] Univ Beira Interior, Ctr Math, Covilha, Portugal
关键词
Temporal information retrieval; Time-sensitive queries; Temporal re-ranking; Temporal query understanding; ASSOCIATION;
D O I
10.1016/j.ipm.2015.07.006
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In the web environment, most of the queries issued by users are implicit by nature. Inferring the different temporal intents of this type of query enhances the overall temporal part of the web search results. Previous works tackling this problem usually focused on news queries, where the retrieval of the most recent results related to the query are usually sufficient to meet the user's information needs. However, few works have studied the importance of time in queries such as "Philip Seymour Hoffman" where the results may require no recency at all. In this work, we focus on this type of queries named "time-sensitive queries" where the results are preferably from a diversified time span, not necessarily the most recent one. Unlike related work, we follow a content-based approach to identify the most important time periods of the query and integrate time into a re-ranking model to boost the retrieval of documents whose contents match the query time period. For that purpose, we define a linear combination of topical and temporal scores, which reflects the relevance of any web document both in the topical and temporal dimensions, thus contributing to improve the effectiveness of the ranked results across different types of queries. Our approach relies on a novel temporal similarity measure that is capable of determining the most important dates for a query, while filtering out the non-relevant ones. Through extensive experimental evaluation over web corpora, we show that our model offers promising results compared to baseline approaches. As a result of our investigation, we publicly provide a set of web services and a web search interface so that the system can be graphically explored by the research community. (C) 2015 Elsevier Ltd. All rights reserved.
引用
收藏
页码:273 / 298
页数:26
相关论文
共 50 条
  • [1] Asynchronous Time-Aware Shaper for Time-Sensitive Networking
    Mate, Miklos
    Simon, Csaba
    Maliosz, Markosz
    JOURNAL OF NETWORK AND SYSTEMS MANAGEMENT, 2022, 30 (04)
  • [2] Asynchronous Time-Aware Shaper for Time-Sensitive Networking
    Miklós Máté
    Csaba Simon
    Markosz Maliosz
    Journal of Network and Systems Management, 2022, 30
  • [3] Asynchronous Time-Aware Shaper for Time-Sensitive Networking
    Mate, Miklos
    Simon, Csaba
    Maliosz, Markosz
    PROCEEDINGS OF THE 2021 17TH INTERNATIONAL CONFERENCE ON NETWORK AND SERVICE MANAGEMENT (CNSM 2021): SMART MANAGEMENT FOR FUTURE NETWORKS AND SERVICES, 2021, : 565 - 571
  • [4] Time-Aware Traffic Scheduling with Virtual Queues in Time-Sensitive Networking
    Xue, Junli
    Shou, Guochu
    Liu, Yaqiong
    Hu, Yihong
    Guo, Zhigang
    2021 IFIP/IEEE INTERNATIONAL SYMPOSIUM ON INTEGRATED NETWORK MANAGEMENT (IM 2021), 2021, : 604 - 607
  • [5] Software-Based Time-Aware Shaper for Time-Sensitive Networks
    Oge, Yasin
    Kobayashi, Yuta
    Yamaura, Takahiro
    Maegawa, Tomonori
    IEICE TRANSACTIONS ON COMMUNICATIONS, 2020, E103B (03) : 167 - 180
  • [6] uTAS: Ultra-Reliable Time-Aware Shaper for Time-Sensitive Networks
    Li, Guizhen
    Wang, Shuo
    Huang, Yudong
    Zhong, Xingyu
    Zhang, Guiyu
    Bai, Luying
    Huang, Tao
    IEEE CONFERENCE ON GLOBAL COMMUNICATIONS, GLOBECOM, 2023, : 4283 - 4288
  • [7] Efficient Robust Schedules (ERS) for Time-Aware Shaping in Time-Sensitive Networking
    Stuber, Thomas
    Osswald, Lukas
    Menth, Michael
    IEEE Open Journal of the Communications Society, 2024, 5 : 6655 - 6673
  • [8] A Survey of Scheduling Algorithms for the Time-Aware Shaper in Time-Sensitive Networking (TSN)
    Stueber, Thomas
    Osswald, Lukas
    Lindner, Steffen
    Menth, Michael
    IEEE ACCESS, 2023, 11 : 61192 - 61233
  • [9] Reinforcement learning based routing for time-aware shaper scheduling in time-sensitive networks
    Min, Junhong
    Kim, Yongjun
    Kim, Moonbeom
    Paek, Jeongyeup
    Govindan, Ramesh
    COMPUTER NETWORKS, 2023, 235
  • [10] eTAS: Enhanced Time-Aware Shaper for Supporting Nonisochronous Emergency Traffic in Time-Sensitive Networks
    Kim, Moonbeom
    Hyeon, Doyeon
    Paek, Jeongyeup
    IEEE INTERNET OF THINGS JOURNAL, 2022, 9 (13) : 10480 - 10491