Recurrent Autoencoder with Skip Connections and Exogenous Variables for Traffic ForecastingPedro Herruzo, Josep L. Larriba-Pey
The increasing complexity of mobility plus the growing population in cities, together with the importance of privacy when sharing data from vehicles or any device, makes traffic forecasting that uses data from infrastructure and citizens an open and challenging task. In this paper, we introduce a novel approach to deal with predictions of speed, volume, and main traffic direction, in a new aggregated way of traffic data presented as videos. The approach leverages the continuity in a sequence of frames and its dynamics, learning to predict changing areas in a low dimensional space and then, recovering static features when reconstructing the original space. Exogenous variables like weather, time and calendar are also added in the model. Furthermore, we introduce a novel sampling approach for sequences that ensures diversity when creating batches, running in parallel to the optimization process.
8.2IRFeb 23, 2016
Query Expansion via structural motifs in Wikipedia GraphJoan Guisado-Gámez, Arnau Prat-Pérez, Josep Lluís Larriba-Pey
The search for relevant information can be very frustrating for users who, unintentionally, use too general or inappropriate keywords to express their requests. To overcome this situation, query expansion techniques aim at transforming the user request by adding new terms, referred as expansion features, that better describe the real intent of the users. We propose a method that relies exclusively on relevant structures (as opposed to the use of semantics) found in knowledge bases (KBs) to extract the expansion features. We call our method Structural Query Expansion (SQE). The structural analysis of KBs takes us to propose a set of structural motifs that connect their strongly related entries, which can be used to extract expansion features. In this paper we use Wikipedia as our KB, which is probably one of the largest sources of information. SQE is capable of achieving more than 150% improvement over non expanded queries and is able to identify the expansion features in less than 0.2 seconds in the worst case scenario. Most significantly, we believe that we are contributing to open new research directions in query expansion, proposing a method that is orthogonal to many current systems. For example, SQE improves pseudo-relevance feedback techniques up to 13%
5.9IROct 21, 2013
Massive Query Expansion by Exploiting Graph Knowledge BasesJoan Guisado-Gámez, David Dominguez-Sal, Josep-LLuis Larriba-Pey
Keyword based search engines have problems with term ambiguity and vocabulary mismatch. In this paper, we propose a query expansion technique that enriches queries expressed as keywords and short natural language descriptions. We present a new massive query expansion strategy that enriches queries using a knowledge base by identifying the query concepts, and adding relevant synonyms and semantically related terms. We propose two approaches: (i) lexical expansion that locates the relevant concepts in the knowledge base; and, (ii) topological expansion that analyzes the network of relations among the concepts, and suggests semantically related terms by path and community analysis of the knowledge graph. We perform our expansions by using two versions of the Wikipedia as knowledge base, concluding that the combination of both lexical and topological expansion provides improvements of the system's precision up to more than 27%.