default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatús Medo
Person information
- unicode name: Matúš Medo
- affiliation: University of Electronic Science and Technology of China, Institute of Fundamental and Frontier Sciences, Chengdu, China
- affiliation: Inselspital University Hospital of Bern, Department of Radiation Oncolog, Switzerland
- affiliation: University of Fribourg, Department of Physics, Switzerland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j14]Mengtian Cui
, Manuel Sebastian Mariani, Matús Medo:
Algorithmic bias amplification via temporal effects: The case of PageRank in evolving networks. Commun. Nonlinear Sci. Numer. Simul. 104: 106029 (2022)- [j13]Fanyuan Meng, Matús Medo, Berno Buechel:
Whom to trust in a signed network? Optimal solution and two heuristic rules. Inf. Sci. 606: 742-762 (2022) - [j12]Matús Medo, Manuel Sebastian Mariani, Linyuan Lü:
The simple regularities in the dynamics of online news impact. J. Comput. Soc. Sci. 5(1): 629-646 (2022) - [j11]Yuhao Zhou, Ruijie Wang, Yi-Cheng Zhang, An Zeng, Matús Medo:
Improving PageRank using sports results modeling. Knowl. Based Syst. 241: 108168 (2022) - 2020
- [j10]Shuqi Xu, Manuel Sebastian Mariani, Linyuan Lü, Matús Medo:
Unbiased evaluation of ranking metrics reveals consistent performance in science and technology citation data. J. Informetrics 14(1): 101005 (2020) - [i40]Shuqi Xu, Manuel Sebastian Mariani, Linyuan Lü, Matús Medo:
Unbiased evaluation of ranking metrics reveals consistent performance in science and technology citation data. CoRR abs/2001.05414 (2020) - [i39]Matús Medo, Manuel Sebastian Mariani, Linyuan Lü:
Universal patterns of online news impact. CoRR abs/2001.05955 (2020) - [i38]Jun Sun, Matús Medo, Steffen Staab:
Time-invariant degree growth in preferential attachment network models. CoRR abs/2001.08132 (2020) - [i37]Matús Medo, Manuel Sebastian Mariani, Linyuan Lü:
The fragility of opinion formation in a complex world. CoRR abs/2010.12355 (2020) - [i36]Yuhao Zhou, Ruijie Wang, Yi-Cheng Zhang, An Zeng, Matús Medo:
Limits of PageRank-based ranking methods in sports data. CoRR abs/2012.06366 (2020)
2010 – 2019
- 2019
- [j9]Matús Medo, Daniel M. Aebersold, Michaela Medová:
ProtRank: bypassing the imputation of missing values in differential expression analysis of proteomic data. BMC Bioinform. 20(1): 563:1-563:12 (2019) - [j8]Shilun Zhang, Matús Medo, Linyuan Lü, Manuel Sebastian Mariani:
The long-term impact of ranking algorithms in growing networks. Inf. Sci. 488: 257-271 (2019) - [j7]Gui-Yuan Shi, Yi-Xiu Kong, Guang-Hui Yuan, Rui-Jie Wu, An Zeng, Matús Medo:
Discoverers in scientific citation data. J. Informetrics 13(2): 717-725 (2019) - 2018
- [j6]Matús Medo, Manuel Sebastian Mariani, Linyuan Lü:
Link Prediction in Bipartite Nested Networks. Entropy 20(10): 777 (2018) - [i35]Shilun Zhang, Matús Medo, Linyuan Lü, Manuel Sebastian Mariani:
The long-term impact of ranking algorithms in growing networks. CoRR abs/1805.12505 (2018) - [i34]Matús Medo, An Zeng, Yi-Cheng Zhang, Manuel Sebastian Mariani:
Optimal timescale of community detection in growing networks. CoRR abs/1809.04943 (2018) - 2017
- [j5]Giacomo Vaccario, Matús Medo, Nicolas Wider, Manuel Sebastian Mariani:
Quantifying and suppressing ranking bias in a large citation network. J. Informetrics 11(3): 766-782 (2017) - [i33]Zhuo-Ming Ren, Manuel Sebastian Mariani, Yi-Cheng Zhang, Matús Medo:
A time-respecting null model to explore the structure of growing networks. CoRR abs/1703.07656 (2017) - [i32]Giacomo Vaccario, Matús Medo, Nicolas Wider, Manuel Sebastian Mariani:
Quantifying and suppressing ranking bias in a large citation network. CoRR abs/1703.08071 (2017) - [i31]Hao Liao, Manuel Sebastian Mariani, Matús Medo, Yi-Cheng Zhang, Ming-Yang Zhou:
Ranking in evolving complex networks. CoRR abs/1704.08027 (2017) - [i30]Manuel Sebastian Mariani, Matús Medo, François Lafond:
Early identification of important patents through network centrality. CoRR abs/1710.09182 (2017) - 2016
- [j4]Manuel Sebastian Mariani, Matús Medo, Yi-Cheng Zhang:
Identification of milestone papers through time-balanced network centrality. J. Informetrics 10(4): 1207-1223 (2016) - [i29]Matús Medo, Giulio Cimini:
Model-based evaluation of scientific impact indicators. CoRR abs/1606.04319 (2016) - [i28]Alexandre Vidmer, Matús Medo:
The essential role of time in network-based recommendation. CoRR abs/1606.04666 (2016) - [i27]Manuel Sebastian Mariani, Matús Medo, Yi-Cheng Zhang:
Identification of milestone papers through time-balanced network centrality. CoRR abs/1608.08414 (2016) - 2015
- [j3]Alexandre Vidmer, Matús Medo, Yi-Cheng Zhang:
Unbiased metrics of friends' influence in multi-level networks. EPJ Data Sci. 4(1): 20 (2015) - [i26]An Zeng, Chi Ho Yeung, Matús Medo, Yi-Cheng Zhang:
Modeling mutual feedback between users and recommender systems. CoRR abs/1508.01672 (2015) - [i25]Manuel Sebastian Mariani, Matús Medo, Yi-Cheng Zhang:
Ranking nodes in growing networks: When PageRank fails. CoRR abs/1509.01476 (2015) - [i24]Matús Medo, Manuel Sebastian Mariani, An Zeng, Yi-Cheng Zhang:
Identification and modeling of discoverers in online social systems. CoRR abs/1509.01477 (2015) - [i23]Alexandre Vidmer, An Zeng, Matús Medo, Yi-Cheng Zhang:
Prediction in complex systems: the case of the international trade network. CoRR abs/1511.05404 (2015) - [i22]Fei Yu, An Zeng, Sébastien Gillard, Matús Medo:
Network-based recommendation algorithms: A review. CoRR abs/1511.06252 (2015) - 2013
- [j2]Giulio Cimini, An Zeng, Matús Medo, Duanbing Chen:
The Role of Taste Affinity in Agent-Based Models for Social Recommendation. Adv. Complex Syst. 16(4-5) (2013) - [j1]An Zeng, Stanislao Gualdi, Matús Medo, Yi-Cheng Zhang:
Trend Prediction in Temporal bipartite Networks: the Case of MovieLens, Netflix, and Digg. Adv. Complex Syst. 16(4-5) (2013) - [i21]Stanislao Gualdi, Matús Medo, Yi-Cheng Zhang:
Crowd Avoidance and Diversity in Socio-Economic Systems and Recommendation. CoRR abs/1301.1887 (2013) - [i20]Giulio Cimini, An Zeng, Matús Medo, Duanbing Chen:
The role of taste affinity in agent-based models for social recommendation. CoRR abs/1301.4417 (2013) - [i19]An Zeng, Stanislao Gualdi, Matús Medo, Yi-Cheng Zhang:
Trend prediction in temporal bipartite networks: the case of Movielens, Netflix, and Digg. CoRR abs/1302.3101 (2013) - [i18]Yves Berset, Matús Medo:
The effect of the initial network configuration on preferential attachment. CoRR abs/1305.0205 (2013) - [i17]An Zeng, Alexandre Vidmer, Matús Medo, Yi-Cheng Zhang:
Information filtering via hybridization of similarity preferential diffusion processes. CoRR abs/1309.0129 (2013) - [i16]Matús Medo:
Statistical validation of high-dimensional models of growing networks. CoRR abs/1311.2008 (2013) - [i15]Hao Liao, Rui Xiao, Giulio Cimini, Matús Medo:
Ranking users, papers and authors in online scientific communities. CoRR abs/1311.3064 (2013) - 2012
- [c2]Hao Liao, Giulio Cimini, Matús Medo:
Measuring Quality, Reputation and Trust in Online Communities. ISMIS 2012: 405-414 - [c1]Marcel Blattner, Matús Medo:
Recommendation Systems in the Scope of Opinion Formation: a Model. Decisions@RecSys 2012: 32-39 - [i14]Linyuan Lü, Matús Medo, Chi Ho Yeung, Yi-Cheng Zhang, Zi-Ke Zhang, Tao Zhou:
Recommender Systems. CoRR abs/1202.1112 (2012) - [i13]Marcel Blattner, Matús Medo:
Recommendation systems in the scope of opinion formation: a model. CoRR abs/1206.3924 (2012) - [i12]Hao Liao, Giulio Cimini, Matús Medo:
Measuring quality, reputation and trust in online communities. CoRR abs/1208.4042 (2012) - [i11]Matús Medo:
Network-based information filtering algorithms: ranking and recommendation. CoRR abs/1208.4552 (2012) - 2011
- [i10]Tao Zhou, Matús Medo, Giulio Cimini, Zi-Ke Zhang, Yi-Cheng Zhang:
Emergence of scale-free leadership structure in social recommender systems. CoRR abs/1103.5120 (2011) - [i9]Duanbing Chen, Giulio Cimini, Linyuan Lu, Matús Medo, Yi-Cheng Zhang, Tao Zhou:
Adaptive topology evolution in information-sharing social networks. CoRR abs/1107.4491 (2011) - [i8]Stanislao Gualdi, Matús Medo, Yi-Cheng Zhang:
Influence, originality and similarity in directed acyclic graphs. CoRR abs/1108.3691 (2011) - [i7]Matús Medo, Giulio Cimini, Stanislao Gualdi:
Temporal effects in the growth of networks. CoRR abs/1109.5560 (2011) - 2010
- [i6]Luo-Luo Jiang, Matús Medo, Joseph R. Wakeling, Yi-Cheng Zhang, Tao Zhou:
Building reputation systems for better ranking. CoRR abs/1001.2186 (2010) - [i5]Matús Medo, Joseph R. Wakeling:
The effect of discrete vs. continuous-valued ratings on reputation and ranking systems. CoRR abs/1001.3745 (2010) - [i4]Giulio Cimini, Matús Medo, Tao Zhou, Dong Wei, Yi-Cheng Zhang:
Heterogeneity, quality, and reputation in an adaptive recommendation model. CoRR abs/1012.1099 (2010)
2000 – 2009
- 2009
- [i3]Matús Medo, Yi-Cheng Zhang, Tao Zhou:
Adaptive model for recommendation of news. CoRR abs/0910.3490 (2009) - 2008
- [i2]Tao Zhou, Jian-Guo Liu, Zoltan Kuscsik, Matús Medo, Yi-Cheng Zhang:
Being accurate is not enough: measuring and optimizing the diversity of recommendations. CoRR abs/0808.2670 (2008) - 2007
- [i1]Yi-Cheng Zhang, Matús Medo, Jie Ren, Tao Zhou, Tao Li, Fan Yang:
Recommendation model based on opinion diffusion. CoRR abs/0710.2228 (2007)
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:47 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:
