Recommending places blased on the wisdom-of-the-crowd

The collective opinion of a great number of users, popularly known as wisdom of the crowd, has been seen as powerful tool for solving problems. As suggested by Surowiecki in his books [134], large groups of people are now considered smarter than an elite few, regardless of how brilliant at solving problems or coming to wise decisions they are. This phenomenon together with the availability of a huge amount of data on the Web has propitiated the development of solutions which employ the wisdom-of-the-crowd to solve a variety of problems in different domains, such as recommender systems [128], social networks [100] and combinatorial problems [152, 151]. The vast majority of data on the Web has been generated in the last few years by billions of users around the globe using their mobile devices and web applications, mainly on social networks. This information carries astonishing details of daily activities ranging from urban mobility and tourism behavior, to emotions and interests. The largest social network nowadays is Facebook, which in December 2015 had incredible 1.31 billion mobile active users, 4.5 billion “likes” generated daily. In addition, every 60 seconds 510 comments are posted, 293, 000 statuses are updated, and 136,000 photos are uploaded1. This flood of data has brought great opportunities to discover individual and collective preferences, and use this information to offer services to meet people’s needs, such as recommending relevant and interesting items (e.g. news, places, movies). Furthermore, it is now possible to exploit the experiences of groups of people as a collective behavior so as to augment the experience of other. This latter illustrates the important scenario where the discovery of collective behavioral patterns, the wisdom-of-the-crowd, may enrich the experience of individual users. In this light, this thesis has the objective of taking advantage of the wisdom of the crowd in order to better understand human mobility behavior so as to achieve the final purpose of supporting users (e.g. people) by providing intelligent and effective recommendations. We accomplish this objective by following three main lines of investigation as discussed below. In the first line of investigation we conduct a study of human mobility using the wisdom-of- the-crowd, culminating in the development of an analytical framework that offers a methodology to understand how the points of interest (PoIs) in a city are related to each other on the basis of the displacement of people. We experimented our methodology by using the PoI network topology to identify new classes of points of interest based on visiting patterns, spatial displacement from one PoI to another as well as popularity of the PoIs. Important relationships between PoIs are mined by discovering communities (groups) of PoIs that are closely related to each other based on user movements, where different analytical metrics are proposed to better understand such a perspective. The second line of investigation exploits the wisdom-of-the-crowd collected through user-generated content to recommend itineraries in tourist cities. To this end, we propose an unsupervised framework, called TripBuilder, that leverages large collections of Flickr photos, as the wisdom-of- the-crowd, and points of interest from Wikipedia in order to support tourists in planning their visits to the cities. We extensively experimented our framework using real data, thus demonstrating the effectiveness and efficiency of the proposal. Based on the theoretical framework, we designed and developed a platform encompassing the main features required to create personalized sightseeing tours. This platform has received significant interest within the research community, since it is recognized as crucial to understand the needs of tourists when they are planning a visit to a new city. Consequently this led to outstanding scientific results. In the third line of investigation, we exploit the wisdom-of-the-crowd to leverage recommendations of groups of people (e.g. friends) who can enjoy an item (e.g. restaurant) together. We propose GroupFinder to address the novel user-item group formation problem aimed at recommending the best group of friends for a pair. The proposal combines user-item relevance information with the user’s social network (ego network), while trying to balance the satisfaction of all the members of the group for the item with the intra-group relationships. Algorithmic solutions are proposed and experimented in the location-based recommendation domain by using four publicly available Location-Based Social Network (LBSN) datasets, showing that our solution is effective and outperforms strong baselines

Subhaloes gone Notts: the clustering properties of subhaloes

We present a study of the substructure finder dependence of subhalo clustering in the Aquarius Simulation. We run 11 different subhalo finders on the haloes of the Aquarius Simulation and study their differences in the density profile, mass fraction and two-point correlation function of subhaloes in haloes. We also study the mass and vmax dependence of subhalo clustering. As the Aquarius Simulation has been run at different resolutions, we study the convergence with higher resolutions. We find that the agreement between finders is at around the 10 per cent level inside R200 and at intermediate resolutions when a mass threshold is applied, and better than 5 per cent when vmax is restricted instead of mass. However, some discrepancies appear in the highest resolution, underlined by an observed resolution dependence of subhalo clustering. This dependence is stronger for the smallest subhaloes, which are more clustered in the highest resolution, due to the detection of subhaloes within subhaloes (the sub-subhalo term). This effect modifies the mass dependence of clustering in the highest resolutions. We discuss implications of our results for models of subhalo clustering and their relation with galaxy clustering

Representing, Matching, and Generalising Structural Descriptions of Complex Physical Objects

This thesis addresses the problem of representing, matching, and generalising descriptions of complex structured physical objects, in the absence of functional and domain-specific knowledge. A system called GRAM is described, which includes a representation scheme, an instance-constructor, a matcher, and a generaliser. These components incorporate and extend ideas from a number of other structured-object learning systems, as well as introducing several new ideas. A central contribution of this thesis is to show that descriptions of complex physical objects can be matched and generalised effectively and efficiently by exploiting their structure. GRAM does this by a number of means, such as by representing objects at multiple levels of detail; using 'neighbour relationships' to allow a more flexible traversal of object graphs during matching; explicitly distinguishing between substructure and context to allow partial matching and a simple form of disjunction; and using an explicit representation of groups to describe several similar objects as a single descriptive entity. A second contribution is to show that complex objects can be matched without having to enforce consistency between object correspondences. This is possible partly because of the richness of physical objects, and partly because GRAM represents concepts as simple entities defined by relationships with other concepts, rather than as a complete set of subcomponents defined locally within the concept description itself. This scheme leads to greater simplicity, efficiency, and robustness

Simulating cosmic structure formation with the GADGET-4 code

Numerical methods have become a powerful tool for research in astrophysics, but their utility depends critically on the availability of suitable simulation codes. This calls for continuous efforts in code development, which is necessitated also by the rapidly evolving technology underlying today's computing hardware. Here we discuss recent methodological progress in the GADGET code, which has been widely applied in cosmic structure formation over the past two decades. The new version offers improvements in force accuracy, in time-stepping, in adaptivity to a large dynamic range in timescales, in computational efficiency, and in parallel scalability through a special MPI/shared-memory parallelization and communication strategy, and a more-sophisticated domain decomposition algorithm. A manifestly momentum conserving fast multipole method (FMM) can be employed as an alternative to the one-sided TreePM gravity solver introduced in earlier versions. Two different flavours of smoothed particle hydrodynamics, a classic entropy-conserving formulation and a pressure-based approach, are supported for dealing with gaseous flows. The code is able to cope with very large problem sizes, thus allowing accurate predictions for cosmic structure formation in support of future precision tests of cosmology, and at the same time is well adapted to high dynamic range zoom-calculations with extreme variability of the particle number density in the simulated volume. The GADGET-4 code is publicly released to the community and contains infrastructure for on-the-fly group and substructure finding and tracking, as well as merger tree building, a simple model for radiative cooling and star formation, a high dynamic range power spectrum estimator, and an initial conditions generator based on second-order Lagrangian perturbation theory.Comment: 82 pages, 65 figures, accepted by MNRAS, for the code see https://wwwmpa.mpa-garching.mpg.de/gadget