Matúš Medo

Dr. Matúš Medo

orcid

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

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

Representative Publications

View All Publications
25 October 2007 in Physical Review E
Verified
Journal Article
Closed access
PDF file
Tao ZhouTao Zhou
Tao Zhou
JRJie Ren
Jie Ren
MMMatúš Medo
Matúš Medo
Yi Cheng ZhangYi Cheng Zhang
Yi Cheng Zhang
One-mode projecting is extensively used to compress bipartite networks. Since one-mode projection is always less informative than the bipartite representation, a proper weighting method is required to better retain the original information. In this article, inspired by the network-based resource-allocation dynamics, we raise a weighting method which can be directly applied in extracting the hidden information of networks, with remarkably better performance than the widely used global ranking method as well as collaborative filtering. This work not only provides a creditable method for compressing bipartite networks, but also highlights a possible way for the better solution of a long-standing challenge in modern information science: How to do a personal recommendation.

1 October 2012 in Physics Reports
Verified
Journal Article
Closed access
LLLinyuan Lü
Linyuan Lü
MMMatúš Medo
Matúš Medo
CYChi Ho Yeung
Chi Ho Yeung
YZYi-Cheng Zhang
Yi-Cheng Zhang
ZZZi-Ke Zhang
Zi-Ke Zhang
Tao ZhouTao Zhou
Tao Zhou

22 February 2010 in Proceedings of the National Academy of Sciences
Verified
Journal Article
Closed access
Tao ZhouTao Zhou
Tao Zhou
ZKZoltán Kuscsik
Zoltán Kuscsik
JLJian-Guo Liu
Jian-Guo Liu
MMMatúš Medo
Matúš Medo
JWJoseph Rushton Wakeling
Joseph Rushton Wakeling
Yi Cheng ZhangYi Cheng Zhang
Yi Cheng Zhang
Recommender systems use data on past user preferences to predict possible future likes and interests. A key challenge is that while the most useful individual recommendations are to be found among diverse niche objects, the most reliably accurate results are obtained by methods that recommend objects based on user or object similarity. In this paper we introduce a new algorithm specifically to address the challenge of diversity and show how it can be used to resolve this apparent dilemma when combined in an elegant hybrid with an accuracy-focused algorithm. By tuning the hybrid appropriately we are able to obtain, without relying on any semantic or context-specific information, simultaneous gains in both accuracy and diversity of recommendations.

1 May 2017 in Physics Reports
Verified
Journal Article
Closed access
HLHao Liao
Hao Liao
MMManuel Sebastian Mariani
Manuel Sebastian Mariani
MMMatúš Medo
Matúš Medo
YZYi-Cheng Zhang
Yi-Cheng Zhang
MZMing-Yang Zhou
Ming-Yang Zhou

1 December 2011 in Physical Review Letters
Verified
Journal Article
Closed access
MMMatúš Medo
Matúš Medo
GCGiulio Cimini
Giulio Cimini
SGStanislao Gualdi
Stanislao Gualdi
We show that to explain the growth of the citation network by preferential attachment (PA), one has to accept that individual nodes exhibit heterogeneous fitness values that decay with time. While previous PA-based models assumed either heterogeneity or decay in isolation, we propose a simple analytically treatable model that combines these two factors. Depending on the input assumptions, the resulting degree distribution shows an exponential, log-normal or power-law decay, which makes the model an apt candidate for modeling a wide range of real systems.

9 November 2015 in The European Physical Journal B
Verified
Journal Article
Closed access
PDF file
MMManuel Sebastian Mariani
Manuel Sebastian Mariani
AVAlexandre Vidmer
Alexandre Vidmer
MMMatúš Medo
Matúš Medo
YZYi-Cheng Zhang
Yi-Cheng Zhang