Tour recommendation and trip planning using location-based social media: A survey

KH Lim, J Chan, S Karunasekera, C Leckie - Knowledge and Information …, 2019 - Springer
Tourism is both an important industry and popular leisure activity undertaken by millions
around the world. One important task for tourists is to plan and schedule tour itineraries that …

Data mining of social networks represented as graphs

DF Nettleton - Computer Science Review, 2013 - Elsevier
In this survey we review the literature and concepts of the data mining of social networks,
with special emphasis on their representation as a graph structure. The survey is divided …

Graph based anomaly detection and description: a survey

L Akoglu, H Tong, D Koutra - Data mining and knowledge discovery, 2015 - Springer
Detecting anomalies in data is a vital task, with numerous high-impact applications in areas
such as security, finance, health care, and law enforcement. While numerous techniques …

Supervised random walks: predicting and recommending links in social networks

L Backstrom, J Leskovec - Proceedings of the fourth ACM international …, 2011 - dl.acm.org
Predicting the occurrence of links is a fundamental problem in networks. In the link
prediction problem we are given a snapshot of a network and would like to infer which …

Graph clustering based on structural/attribute similarities

Y Zhou, H Cheng, JX Yu - Proceedings of the VLDB Endowment, 2009 - dl.acm.org
The goal of graph clustering is to partition vertices in a large graph into different clusters
based on various criteria such as vertex connectivity or neighborhood similarity. Graph …

The community-search problem and how to plan a successful cocktail party

M Sozio, A Gionis - Proceedings of the 16th ACM SIGKDD international …, 2010 - dl.acm.org
A lot of research in graph mining has been devoted in the discovery of communities. Most of
the work has focused in the scenario where communities need to be discovered with only …

Fast random walk with restart and its applications

H Tong, C Faloutsos, JY Pan - Sixth international conference on …, 2006 - ieeexplore.ieee.org
How closely related are two nodes in a graph? How to compute this score quickly, on huge,
disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance …

Knowledge graphs: An information retrieval perspective

R Reinanda, E Meij, M de Rijke - Foundations and Trends® …, 2020 - nowpublishers.com
In this survey, we provide an overview of the literature on knowledge graphs (KGs) in the
context of information retrieval (IR). Modern IR systems can benefit from information …

K-isomorphism: privacy preserving network publication against structural attacks

J Cheng, AW Fu, J Liu - Proceedings of the 2010 ACM SIGMOD …, 2010 - dl.acm.org
Serious concerns on privacy protection in social networks have been raised in recent years;
however, research in this area is still in its infancy. The problem is challenging due to the …

Random walk with restart: fast solutions and applications

H Tong, C Faloutsos, JY Pan - Knowledge and Information Systems, 2008 - Springer
How closely related are two nodes in a graph? How to compute this score quickly, on huge,
disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance …