output
20072026
most citedCatBoost: unbiased boosting with categorical features

1.1k citations

Showing cs.SIShow all

6 papers · 1 filter

cs.SI2019

Spring-Electrical Models For Link Prediction

Yana Kashinskaya, Egor Samosvat, Akmal Artikov

We propose a link prediction algorithm that is based on spring-electrical models. The idea to study these models came from the fact that spring-electrical models have been successf…

cs.SI2018

Community Detection through Likelihood Optimization: In Search of a Sound Model

Liudmila Prokhorenkova, Alexey Tikhonov

Community detection is one of the most important problems in network analysis. Among many algorithms proposed for this task, methods based on statistical inference are of particula…

cs.SI2015★ 10 cited

PageRank in undirected random graphs

Konstantin Avrachenkov, Arun Kadavankandy, Liudmila Ostroumova +1

PageRank has numerous applications in information retrieval, reputation systems, machine learning, and graph partitioning.In this paper, we study PageRank in undirected random grap…

cs.SI2015

Factorization threshold models for scale-free networks generation

Akmal Artikov, Aleksandr Dorodnykh, Yana Kashinskaya +1

Many real networks such as the World Wide Web, financial, biological, citation and social networks have a power-law degree distribution. Networks with this feature are also called…

cs.SI2015

Global clustering coefficient in scale-free weighted and unweighted networks

Liudmila Ostroumova Prokhorenkova

In this paper, we present a detailed analysis of the global clustering coefficient in scale-free graphs. Many observed real-world networks of diverse nature have a power-law degree…

cs.SI2012★ 1 cited

Empirical Validation of the Buckley--Osthus Model for the Web Host Graph: Degree and Edge Distributions

Maxim Zhukovskiy, Dmitry Vinogradov, Yuri Pritykin +5

There has been a lot of research on random graph models for large real-world networks such as those formed by hyperlinks between web pages in the world wide web. Though largely suc…