Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Tidjani Négadi
Alex Sivak
Daniel P. Kennedy
Barbara Aquilani
Tooley, R.D.
Maximilian Dürr
Jhonathan Pinzon
Liangliang Shang
Jürg Hulliger
Chen Ma
Home
/
Author
/
ATHANASIOS N. NIKOLAKOPOULOS
Author Info
Open Visualization
Name
Affiliation
Papers
ATHANASIOS N. NIKOLAKOPOULOS
Univ Patras, Comp Engn & Informat Dept, GR-26110 Patras, Greece
23
Collaborators
Citations
PageRank
24
59
9.02
Referers
Referees
References
88
442
311
Search Limit
100
442
Publications (23 rows)
Collaborators (24 rows)
Referers (88 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
Projection Techniques To Update The Truncated Svd Of Evolving Matrices With Applications
0
0.34
2021
Elements And Evolutionary Determinants Of Genomic Divergence Between Paired Primary And Metastatic Tumors
0
0.34
2021
Boosting Item-Based Collaborative Filtering Via Nearly Uncoupled Random Walks
0
0.34
2020
Personalized diffusions for top-n recommendation
0
0.34
2019
Scholars Walk - A Markov Chain Framework for Course Recommendation.
1
0.34
2019
EigenRec: generalizing PureSVD for effective and efficient top-N recommendations
4
0.41
2019
Adaptive Diffusions for Scalable Learning over Graphs.
6
0.45
2019
RecWalk - Nearly Uncoupled Random Walks for Top-N Recommendation.
9
0.59
2019
Fast Decentralized Optimization over Networks.
0
0.34
2018
Hybrid ADMM: a unifying and fast approach to decentralized optimization
0
0.34
2018
AdaDIF: Adaptive Diffusions for Efficient Semi-supervised Learning over Graphs
1
0.35
2018
Semi-parametric graph kernel-based reconstruction.
1
0.37
2017
Kernel-based Inference of Functions over Graphs.
0
0.34
2017
Factored Proximity Models for Top-N Recommendations
0
0.34
2017
Random surfing on multipartite graphs
4
0.39
2016
On the Multi-Level Near Complete Decomposability of a Class of Multiprocessing Systems.
0
0.34
2016
EIGENREC: An Efficient and Scalable Latent Factor Family for Top-N Recommendation.
1
0.36
2015
Top-N recommendations in the presence of sparsity: An NCD-based approach.
0
0.34
2015
Hierarchical Itemspace Rank: Exploiting hierarchy to alleviate sparsity in ranking-based recommendation.
4
0.40
2015
On the Use of Lanczos Vectors for Efficient Latent Factor-Based Top-N Recommendation
3
0.38
2014
NCDREC: A Decomposability Inspired Framework for Top-N Recommendation
8
0.49
2014
NCDawareRank: a novel ranking method that exploits the decomposable structure of the web
12
0.65
2013
A Novel Hierarchical Approach to Ranking-Based Collaborative Filtering.
5
0.45
2013
1