Refine my results

Specific Collection

Language

Université de Fribourg

Unbiased evaluation of ranking metrics reveals consistent performance in science and technology citation data

Xu, Shuqi ; Mariani, Manuel Sebastian ; Lü, Linyuan ; Medo, Matúš

In: Journal of Informetrics, 2020, vol. 14, no. 1, p. 101005

Despite the increasing use of citation-based metrics for research evaluation purposes, we do not know yet which metrics best deliver on their promise to gauge the significance of a scientific paper or a patent. We assess 17 network-based metrics by their ability to identify milestone papers and patents in three large citation datasets. We find that traditional information-retrieval evaluation...

Université de Fribourg

The long-term impact of ranking algorithms in growing networks

Zhang, Shilun ; Medo, Matúš ; Lü, Linyuan ; Mariani, Manuel Sebastian

In: Information Sciences, 2019, vol. 488, p. 257–271

When users search online for content, they are constantly exposed to rankings. For example, web search results are presented as a ranking of relevant websites, and online bookstores often show us lists of best-selling books. While popularity-based ranking algorithms (like Google’s PageRank) have been extensively studied in previous works, we still lack a clear understanding of their...

Université de Fribourg

Discoverers in scientific citation data

Shi, Gui-Yuan ; Kong, Yi-Xiu ; Yuan, Guang-Hui ; Wu, Rui-Jie ; Zeng, An ; Medo, Matúš

In: Journal of Informetrics, 2019, vol. 13, no. 2, p. 717–725

Identifying the future influential papers among the newly published ones is an important yet challenging issue in bibliometrics. As newly published papers have no or limited citation history, linear extrapolation of their citation counts—which is motivated by the well-known preferential attachment mechanism—is not applicable. We translate the recently introduced notion of discoverers to...

Université de Fribourg

Link prediction in bipartite nested networks

Medo, Matúš ; Mariani, Manuel Sebastian ; Lü, Linyuan

In: Entropy, 2018, vol. 20, no. 10, p. 777

Real networks typically studied in various research fields—ecology and economic complexity, for example—often exhibit a nested topology, which means that the neighborhoods of high-degree nodes tend to include the neighborhoods of low-degree nodes. Focusing on nested networks, we study the problem of link prediction in complex networks, which aims at identifying likely candidates for...

Université de Fribourg

Randomizing growing networks with a time-respecting null model

Ren, Zhuo-Ming ; Mariani, Manuel Sebastian ; Zhang, Yi-Cheng ; Medo, Matú?

In: Physical Review E, 2018, vol. 97, no. 5, p. 052311

Complex networks are often used to represent systems that are not static but grow with time: People make new friendships, new papers are published and refer to the existing ones, and so forth. To assess the statistical significance of measurements made on such networks, we propose a randomization methodology—a time- respecting null model—that preserves both the network's degree sequence...

Consortium of Swiss Academic Libraries

Self-organized model of cascade spreading

Gualdi, S. ; Medo, M. ; Zhang, Y.-C

In: The European Physical Journal B, 2011, vol. 79, no. 1, p. 91-98

Consortium of Swiss Academic Libraries

The effect of the initial network configuration on preferential attachment

Berset, Yves ; Medo, Matúš

In: The European Physical Journal B, 2013, vol. 86, no. 6, p. 1-7

Consortium of Swiss Academic Libraries

The role of a matchmaker in buyer-vendor interactions

Lü, Linyuan ; Medo, M. ; Zhang, Y.-C

In: The European Physical Journal B, 2009, vol. 71, no. 4, p. 565-571

Consortium of Swiss Academic Libraries

Heterogeneous network with distance dependent connectivity

Medo, M. ; Smrek, J.

In: The European Physical Journal B, 2008, vol. 63, no. 2, p. 273-278

See also: similar author names
4 Medo, M.
1 Medo, Matsúš
1 Medo, Matú?
40 Medo, Matúš