Panagiotis Symeonidis

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Pavlos Kefalas

> Home > Persons > Panagiotis Symeonidis

Publications

2018
[j20]
- view
  authority control:
- export record
  dblp key:
  - journals/www/KefalasSM18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/www/KefalasSM18
Pavlos Kefalas, Panagiotis Symeonidis, Yannis Manolopoulos:
Recommendations based on a heterogeneous spatio-temporal social network. World Wide Web 21(2): 345-371 (2018)
2016
[j19]
- view
  authority control:
- export record
  dblp key:
  - journals/tkde/KefalasSM16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tkde/KefalasSM16
Pavlos Kefalas, Panagiotis Symeonidis, Yannis Manolopoulos:
A Graph-Based Taxonomy of Recommendation Algorithms and Systems in LBSNs. IEEE Trans. Knowl. Data Eng. 28(3): 604-622 (2016)
2015
[c21]
- view
  authority control:
- export record
  dblp key:
  - conf/medi/KefalasS15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/medi/KefalasS15
Pavlos Kefalas, Panagiotis Symeonidis:
Recommending Friends and Locations over a Heterogeneous Spatio-Temporal Graph. MEDI 2015: 271-284
2013
[c17]
- view
  authority control:
- export record
  dblp key:
  - conf/medes/KefalasSM13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/medes/KefalasSM13
Pavlos Kefalas, Panagiotis Symeonidis, Yannis Manolopoulos:
New perspectives for recommendations in location-based social networks: time, privacy and explainability. MEDES 2013: 1-8

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.