Multiple Models for Recommending Temporal Aspects of Entities
Tu Nguyen, Nattiya Kanhabua, Wolfgang Nejdl
TL;DR
This work tackles temporal entity aspect recommendation by explicitly modeling event-driven dynamics through time and event type. It introduces an event-centric ensemble ranking framework that combines multiple time- and type-dependent models, an aspect-extraction pipeline from co-click query-URL data, and a cascaded time/type identification module, all guided by a unified loss. The approach leverages both salience and short-term features drawn from Wikipedia and query logs, and validates with real AOL/Google logs and Wikipedia alignment, showing robust improvements over baselines in both classification and ranking tasks. The results indicate that balancing long-term salience with short-term recency is crucial for accurately surfacing temporally relevant aspects of event-driven entities, with potential impact on search experience and relevance modeling.
Abstract
Entity aspect recommendation is an emerging task in semantic search that helps users discover serendipitous and prominent information with respect to an entity, of which salience (e.g., popularity) is the most important factor in previous work. However, entity aspects are temporally dynamic and often driven by events happening over time. For such cases, aspect suggestion based solely on salience features can give unsatisfactory results, for two reasons. First, salience is often accumulated over a long time period and does not account for recency. Second, many aspects related to an event entity are strongly time-dependent. In this paper, we study the task of temporal aspect recommendation for a given entity, which aims at recommending the most relevant aspects and takes into account time in order to improve search experience. We propose a novel event-centric ensemble ranking method that learns from multiple time and type-dependent models and dynamically trades off salience and recency characteristics. Through extensive experiments on real-world query logs, we demonstrate that our method is robust and achieves better effectiveness than competitive baselines.
