Athanasios N. Nikolakopoulos

Orcid: 0000-0001-9853-0621

Affiliations:
  • University of Minnesota, Minneapolis, MN, USA
  • University of Patras, Greece (PhD 2016)


According to our database1, Athanasios N. Nikolakopoulos authored at least 31 papers between 2013 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
SAGE: Structured Attribute Value Generation for Billion-Scale Product Catalogs.
CoRR, 2023

2022
Trust Your Neighbors: A Comprehensive Survey of Neighborhood-Based Methods for Recommender Systems.
Proceedings of the Recommender Systems Handbook, 2022

2021
Elements and evolutionary determinants of genomic divergence between paired primary and metastatic tumors.
PLoS Comput. Biol., 2021

Trust your neighbors: A comprehensive survey of neighborhood-based methods for recommender systems.
CoRR, 2021

Projection techniques to update the truncated SVD of evolving matrices with applications.
Proceedings of the 38th International Conference on Machine Learning, 2021

2020
Boosting Item-based Collaborative Filtering via Nearly Uncoupled Random Walks.
ACM Trans. Knowl. Discov. Data, 2020

Projection techniques to update the truncated SVD of evolving matrices.
CoRR, 2020

Random Surfing Revisited: Generalizing PageRank's Teleportation Model.
CoRR, 2020

2019
Adaptive Diffusions for Scalable Learning Over Graphs.
IEEE Trans. Signal Process., 2019

EigenRec: generalizing PureSVD for effective and efficient top-N recommendations.
Knowl. Inf. Syst., 2019

RecWalk: Nearly Uncoupled Random Walks for Top-N Recommendation.
Proceedings of the Twelfth ACM International Conference on Web Search and Data Mining, 2019

Personalized diffusions for top-n recommendation.
Proceedings of the 13th ACM Conference on Recommender Systems, 2019

Scholars Walk: A Markov Chain Framework for Course Recommendation.
Proceedings of the 12th International Conference on Educational Data Mining, 2019

2018
Hybrid ADMM: a unifying and fast approach to decentralized optimization.
EURASIP J. Adv. Signal Process., 2018

Fast Decentralized Optimization over Networks.
CoRR, 2018

Fast Decentralized Learning Via Hybrid Consensus Admm.
Proceedings of the 2018 IEEE International Conference on Acoustics, 2018

Random Walks with Restarts for Graph-Based Classification: Teleportation Tuning and Sampling Design.
Proceedings of the 2018 IEEE International Conference on Acoustics, 2018

AdaDIF: Adaptive Diffusions for Efficient Semi-supervised Learning over Graphs.
Proceedings of the IEEE International Conference on Big Data (IEEE BigData 2018), 2018

2017
Kernel-based Inference of Functions over Graphs.
CoRR, 2017

Factored Proximity Models for Top-N Recommendations.
Proceedings of the IEEE International Conference on Big Knowledge, 2017

Semi-parametric graph kernel-based reconstruction.
Proceedings of the 2017 IEEE Global Conference on Signal and Information Processing, 2017

2016
On the Multi-Level Near Complete Decomposability of a Class of Multiprocessing Systems.
Proceedings of the 20th Pan-Hellenic Conference on Informatics, 2016

Random surfing on multipartite graphs.
Proceedings of the 2016 IEEE International Conference on Big Data (IEEE BigData 2016), 2016

2015
Top-N recommendations in the presence of sparsity: An NCD-based approach.
Web Intell., 2015

Hierarchical Itemspace Rank: Exploiting hierarchy to alleviate sparsity in ranking-based recommendation.
Neurocomputing, 2015

EIGENREC: An Efficient and Scalable Latent Factor Family for Top-N Recommendation.
CoRR, 2015

Random Surfing Without Teleportation.
Proceedings of the Algorithms, Probability, Networks, and Games, 2015

2014
On the Use of Lanczos Vectors for Efficient Latent Factor-Based Top-N Recommendation.
Proceedings of the 4th International Conference on Web Intelligence, 2014

NCDREC: A Decomposability Inspired Framework for Top-N Recommendation.
Proceedings of the 2014 IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (IAT), Warsaw, Poland, August 11-14, 2014, 2014

2013
NCDawareRank: a novel ranking method that exploits the decomposable structure of the web.
Proceedings of the Sixth ACM International Conference on Web Search and Data Mining, 2013

A Novel Hierarchical Approach to Ranking-Based Collaborative Filtering.
Proceedings of the Engineering Applications of Neural Networks, 2013


  Loading...