Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAthanasios N. Nikolakopoulos
Person information
- affiliation: University of Minnesota, Minneapolis, MN, USA
- affiliation (PhD 2016): University of Patras, Greece
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i11]Athanasios N. Nikolakopoulos, Swati Kaul, Siva Karthik Gade, Bella Dubrov, Umit Batur, Suleiman Ali Khan:
SAGE: Structured Attribute Value Generation for Billion-Scale Product Catalogs. CoRR abs/2309.05920 (2023)- 2022
- [r1]Athanasios N. Nikolakopoulos, Xia Ning, Christian Desrosiers, George Karypis:
Trust Your Neighbors: A Comprehensive Survey of Neighborhood-Based Methods for Recommender Systems. Recommender Systems Handbook 2022: 39-89 - 2021
- [j7]Ruping Sun
, Athanasios N. Nikolakopoulos:
Elements and evolutionary determinants of genomic divergence between paired primary and metastatic tumors. PLoS Comput. Biol. 17(3) (2021) - [c16]Vasileios Kalantzis, Georgios Kollias, Shashanka Ubaru, Athanasios N. Nikolakopoulos, Lior Horesh, Kenneth L. Clarkson:
Projection techniques to update the truncated SVD of evolving matrices with applications. ICML 2021: 5236-5246 - [i10]Athanasios N. Nikolakopoulos, Xia Ning, Christian Desrosiers, George Karypis:
Trust your neighbors: A comprehensive survey of neighborhood-based methods for recommender systems. CoRR abs/2109.04584 (2021) - 2020
- [j6]Athanasios N. Nikolakopoulos, George Karypis:
Boosting Item-based Collaborative Filtering via Nearly Uncoupled Random Walks. ACM Trans. Knowl. Discov. Data 14(6): 64:1-64:26 (2020) - [i9]Athanasios N. Nikolakopoulos:
Random Surfing Revisited: Generalizing PageRank's Teleportation Model. CoRR abs/2008.12916 (2020) - [i8]Vassilis Kalantzis, Georgios Kollias, Shashanka Ubaru, Athanasios N. Nikolakopoulos, Lior Horesh, Kenneth L. Clarkson:
Projection techniques to update the truncated SVD of evolving matrices. CoRR abs/2010.06392 (2020)
2010 – 2019
- 2019
- [j5]Athanasios N. Nikolakopoulos, Vassilis Kalantzis, Efstratios Gallopoulos, John D. Garofalakis:
EigenRec: generalizing PureSVD for effective and efficient top-N recommendations. Knowl. Inf. Syst. 58(1): 59-81 (2019) - [j4]Dimitris Berberidis, Athanasios N. Nikolakopoulos, Georgios B. Giannakis:
Adaptive Diffusions for Scalable Learning Over Graphs. IEEE Trans. Signal Process. 67(5): 1307-1321 (2019) - [c15]Agoritsa Polyzou, Athanasios N. Nikolakopoulos, George Karypis:
Scholars Walk: A Markov Chain Framework for Course Recommendation. EDM 2019 - [c14]Athanasios N. Nikolakopoulos, Dimitris Berberidis, George Karypis, Georgios B. Giannakis:
Personalized diffusions for top-n recommendation. RecSys 2019: 260-268 - [c13]Athanasios N. Nikolakopoulos, George Karypis:
RecWalk: Nearly Uncoupled Random Walks for Top-N Recommendation. WSDM 2019: 150-158 - [i7]Athanasios N. Nikolakopoulos, George Karypis:
Boosting Item-based Collaborative Filtering via Nearly Uncoupled Random Walks. CoRR abs/1909.03579 (2019) - 2018
- [j3]Meng Ma, Athanasios N. Nikolakopoulos, Georgios B. Giannakis:
Hybrid ADMM: a unifying and fast approach to decentralized optimization. EURASIP J. Adv. Signal Process. 2018: 73 (2018) - [c12]Dimitris Berberidis, Athanasios N. Nikolakopoulos, Georgios B. Giannakis:
AdaDIF: Adaptive Diffusions for Efficient Semi-supervised Learning over Graphs. IEEE BigData 2018: 92-99 - [c11]Dimitris Berberidis, Athanasios N. Nikolakopoulos, Georgios B. Giannakis:
Random Walks with Restarts for Graph-Based Classification: Teleportation Tuning and Sampling Design. ICASSP 2018: 2811-2815 - [c10]Meng Ma, Athanasios N. Nikolakopoulos, Georgios B. Giannakis:
Fast Decentralized Learning Via Hybrid Consensus Admm. ICASSP 2018: 3829-3833 - [i6]Dimitris Berberidis, Athanasios N. Nikolakopoulos, Georgios B. Giannakis:
Adaptive Diffusions for Scalable Learning over Graphs. CoRR abs/1804.02081 (2018) - [i5]Meng Ma, Athanasios N. Nikolakopoulos, Georgios B. Giannakis:
Fast Decentralized Optimization over Networks. CoRR abs/1804.02425 (2018) - 2017
- [c9]Vassilis N. Ioannidis, Athanasios N. Nikolakopoulos, Georgios B. Giannakis:
Semi-parametric graph kernel-based reconstruction. GlobalSIP 2017: 588-592 - [c8]Athanasios N. Nikolakopoulos, Vassilis Kalantzis, Efstratios Gallopoulos, John D. Garofalakis:
Factored Proximity Models for Top-N Recommendations. ICBK 2017: 80-87 - [i4]Vassilis N. Ioannidis, Meng Ma, Athanasios N. Nikolakopoulos, Georgios B. Giannakis:
Kernel-based Inference of Functions over Graphs. CoRR abs/1711.10353 (2017) - 2016
- [c7]Athanasios N. Nikolakopoulos, Antonia Korba, John D. Garofalakis:
Random surfing on multipartite graphs. IEEE BigData 2016: 736-745 - [c6]Athanasios N. Nikolakopoulos, John D. Garofalakis:
On the Multi-Level Near Complete Decomposability of a Class of Multiprocessing Systems. PCI 2016: 14 - 2015
- [j2]Athanasios N. Nikolakopoulos, Marianna A. Kouneli, John D. Garofalakis:
Hierarchical Itemspace Rank: Exploiting hierarchy to alleviate sparsity in ranking-based recommendation. Neurocomputing 163: 126-136 (2015) - [j1]Athanasios N. Nikolakopoulos, John D. Garofalakis:
Top-N recommendations in the presence of sparsity: An NCD-based approach. Web Intell. 13(4): 247-265 (2015) - [c5]Athanasios N. Nikolakopoulos, John D. Garofalakis:
Random Surfing Without Teleportation. Algorithms, Probability, Networks, and Games 2015: 344-357 - [i3]Athanasios N. Nikolakopoulos, John D. Garofalakis:
Random Surfing Without Teleportation. CoRR abs/1506.00092 (2015) - [i2]Athanasios N. Nikolakopoulos, John D. Garofalakis:
Top-N recommendations in the presence of sparsity: An NCD-based approach. CoRR abs/1507.00043 (2015) - [i1]Athanasios N. Nikolakopoulos, Vassilis Kalantzis, John D. Garofalakis:
EIGENREC: An Efficient and Scalable Latent Factor Family for Top-N Recommendation. CoRR abs/1511.06033 (2015) - 2014
- [c4]Athanasios N. Nikolakopoulos, John D. Garofalakis:
NCDREC: A Decomposability Inspired Framework for Top-N Recommendation. WI-IAT (2) 2014: 183-190 - [c3]Athanasios N. Nikolakopoulos, Maria Kalantzi, John D. Garofalakis:
On the Use of Lanczos Vectors for Efficient Latent Factor-Based Top-N Recommendation. WIMS 2014: 28:1-28:6 - 2013
- [c2]Athanasios N. Nikolakopoulos, Marianna A. Kouneli, John D. Garofalakis:
A Novel Hierarchical Approach to Ranking-Based Collaborative Filtering. EANN (2) 2013: 50-59 - [c1]Athanasios N. Nikolakopoulos, John D. Garofalakis:
NCDawareRank: a novel ranking method that exploits the decomposable structure of the web. WSDM 2013: 143-152
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
