Back to search

University of Peloponesse

Data analytics on graphs

Abstract

dc:description

Nowadays, there is an increasing need for brands (stakeholders) to effectively and efficiently connect with their customers in both spatial and social domains so as to grow their revenues. In spatial field, there is a variety of location-based services (e.g., Google Maps, Uber, Foursquare) for utilization by brands, whereas in social area, there are several social networks (e.g., Facebook, Instagram, VK) in which brands can maintain their own social network pages for advertising. In this thesis, we analyze and study fundamental social and spatial data operations on graphs that can significantly contribute to successful connection among brands and customers.In spatial domain, our contribution is the development of a spatial RDF system, named SRX and built upon the popular RDF-3X store, that provides efficient spatial RDF data operations. In particular, SRX supports three types of spatial queries: range selections (e.g. find entities within a given polygon), spatial joins (e.g. find pairs of entities whose locations are close to each other), and spatial k nearest neighbors (e.g. find the three closest entities from a given location). Further, SRX supports spatial updates (e.g., insertions and deletions of spatial RDF triples). SRX relies its good performance on a grid-scheme that approximates the geometries of the spatial entities inside their integer IDs. We extensively evaluate the performance of SRX for both queries and updates by comparing it with the systems RDF-3X, Virtuoso, GraphDB, and Strabon on LGD and YAGO datasets. Results show that SRX outperforms other systems for queries and incurs a little overhead to RDF-3X for updates.In social domain, we contribute by studying three novel content-aware recommendation problems relative to the Influence Maximization (IM) problem; IM seeks for the k users who can maximize the influence of a given post in a social network.The first problem we study, named Content-Aware Influence Maximization (CAIM), is the inverse variant of IM and seeks for the k features that can form the content of a non-given post so as to make it viral in a social network, starting its diffusion from a given set of initial adopters (subscribers of brand's social network page). We prove that CAIM does not have influence guarantees, and our experimental results on Gnutella and VK datasets show that our deployed heuristic algorithm is more practical than baseline and conventional greedy approaches to solve CAIM.The second problem we study is an adaptive (online) version of CAIM, named Adaptive Content-Aware Influence Maximization (ACAIM), that takes place in many rounds. In each round, the content of a post is sought, comprising k features, and the influence feedback of posts in previous rounds is utilized for the content decision of posts in next rounds. The target is to maximize the cumulative influence over all rounds. To solve ACAIM, we integrate Online Learning to Rank (OLR) techniques to our machine learning IM framework, and we further deploy a propagation model, a simulator running that model to generate realistic feedback, three ACAIM learners, and a thorough experimental study on various VK datasets for several brands.Finally, the third problem we study relates with how brands can maximize their subscription (instead of influence as happens in CAIM and ACAIM) in social networks. Specifically, we propose a content recommendation policy to brands for Gaining Subscribers by Messaging (GSM). The GSM problem applies in many rounds. In each round, GSM recommends to brands what content (consisting of k features) to publish in their social network pages and which m users to notify of that content. The aim is to maximize the cumulative subscription gain over all rounds. We develop three GSM solvers, and by conducting a rich experimental evaluation on different VK datasets, we ascertain the importance and practical value of GSM.

Degree

thesis:*
Grantor dc:publisher
University of Peloponesse
Year dc:date
2022

Author and committee

dc:creator, dc:contributor.*
Authors dc:creator
  • Theocharidis, Konstantinos
  • Θεοχαρίδης, Κωνσταντίνος

Subjects

dc:subject × 16

Rights

Language dc:language
eng

Identifiers

dc:identifier.*
Identifier
10.12681/eadd/52238

Chain of custody

source
Harvested from
Greek National Archive of PhD Theses
Base URL
phdtheses.ekt.gr/eadd_oai/request
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
citation

Theocharidis, Konstantinos; Θεοχαρίδης, Κωνσταντίνος. Data analytics on graphs. University of Peloponesse, 2022. http://hdl.handle.net/10442/hedi/52238