Apostolos N. Papadopoulos

Apostolos N. Papadopoulos

Auto-generated profile, based on publicly available information

Apostolos N. Papadopoulos

School of Informatics, Aristotle University of Thessaloniki, 54124 Thessaloniki, Greece

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 November 2019 in The VLDB Journal
Verified
Journal Article
Closed access
PDF file
FMFragkiskos D. Malliaros
Fragkiskos D. Malliaros
CGChristos Giatsidis
Christos Giatsidis
APApostolos N. Papadopoulos
Apostolos N. Papadopoulos
MVMichalis Vazirgiannis
Michalis Vazirgiannis

13 January 2021 in Knowledge and Information Systems
Verified
Journal Article
Closed access
PDF file
GCGiannis Christoforidis
Giannis Christoforidis
PKPavlos Kefalas
Pavlos Kefalas
APApostolos N. Papadopoulos
Apostolos N. Papadopoulos
Yannis ManolopoulosYannis Manolopoulos
Yannis Manolopoulos

24 April 2011 in The VLDB Journal
Verified
Journal Article
Closed access
PDF file
ETEleftherios Tiakas
Eleftherios Tiakas
APApostolos N. Papadopoulos
Apostolos N. Papadopoulos
Yannis ManolopoulosYannis Manolopoulos
Yannis Manolopoulos

Verified
Journal Article
Open access
PDF file
ONOlivera Novović
Olivera Novović
SBSanja Brdar
Sanja Brdar
MMMinučer Mesaroš
Minučer Mesaroš
VCVladimir Crnojević
Vladimir Crnojević
APApostolos N. Papadopoulos
Apostolos N. Papadopoulos
CDR (Call Detail Record) data are one type of mobile phone data collected by operators each time a user initiates/receives a phone call or sends/receives an sms. CDR data are a rich geo-referenced source of user behaviour information. In this work, we perform an analysis of CDR data for the city of Milan that originate from Telecom Italia Big Data Challenge. A set of graphs is generated from aggregated CDR data, where each node represents a centroid of an RBS (Radio Base Station) polygon, and each edge represents aggregated telecom traffic between two RBSs. To explore the community structure, we apply a modularity-based algorithm. Community structure between days is highly dynamic, with variations in number, size and spatial distribution. One general rule observed is that communities formed over the urban core of the city are small in size and prone to dynamic change in spatial distribution, while communities formed in the suburban areas are larger in size and more consistent with respect to their spatial distribution. To evaluate the dynamics of change in community structure between days, we introduced different graph based and spatial community properties which contain latent footprint of human dynamics. We created land use profiles for each RBS polygon based on the Copernicus Land Monitoring Service Urban Atlas data set to quantify the correlation and predictivennes of human dynamics properties based on land use. The results reveal a strong correlation between some properties and land use which motivated us to further explore this topic. The proposed methodology has been implemented in the programming language Scala inside the Apache Spark engine to support the most computationally intensive tasks and in Python using the rich portfolio of data analytics and machine learning libraries for the less demanding tasks.

1 August 2008
Verified
Conference Paper
Open access
MKMaria Kontaki
Maria Kontaki
APApostolos N. Papadopoulos
Apostolos N. Papadopoulos
Yannis ManolopoulosYannis Manolopoulos
Yannis Manolopoulos
Dominating queries are significant tools for preference-based query processing in databases and decision support applications. An important preference-based query is the top-k dominating query, which reports the k most important objects according to their domination capabilities (score). In this paper, we address the following issues to tackle two limitations of previously proposed approaches: (i) we allow dominating queries to be expressed in a subset of the available dimensions and (ii) we provide the necessary techniques to enable continuous processing of multiple queries. We use a grid-based indexing scheme to facilitate efficient search and update operations, avoiding expensive reorganization costs. In addition, several optimizations are proposed to enhance efficiency. Performance evaluation results, based on real-life and synthetic data sets, show the efficiency and scalability of the proposed scheme.

11 April 2017
Verified
Book Chapter
Closed access
PDF file
VKVasileios Kassiano
Vasileios Kassiano
AGAnastasios Gounaris
Anastasios Gounaris
APApostolos N. Papadopoulos
Apostolos N. Papadopoulos
KTKostas Tsichlas
Kostas Tsichlas