Lovro Šubelj

Prof. Dr. Lovro Šubelj

orcid

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

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

Representative Publications

View All Publications
4 May 2011 in The European Physical Journal B
Verified
Journal Article
Closed access
PDF file
LŠLovro Šubelj
Lovro Šubelj
MBM. Bajec
M. Bajec

8 March 2011 in Physical Review E
Verified
Journal Article
Closed access
LŠLovro Šubelj
Lovro Šubelj
Marko BajecMarko Bajec
Marko Bajec
Label propagation has proven to be a fast method for detecting communities in large complex networks. Recent developments have also improved the accuracy of the approach; however, a general algorithm is still an open issue. We present an advanced label propagation algorithm that combines two unique strategies of community formation, namely, defensive preservation and offensive expansion of communities. The two strategies are combined in a hierarchical manner to recursively extract the core of the network and to identify whisker communities. The algorithm was evaluated on two classes of benchmark networks with planted partition and on 23 real-world networks ranging from networks with tens of nodes to networks with several tens of millions of edges. It is shown to be comparable to the current state-of-the-art community detection algorithms and superior to all previous label propagation algorithms, with comparable time complexity. In particular, analysis on real-world networks has proven that the algorithm has almost linear complexity, O(m1.19), and scales even better than the basic label propagation algorithm (m is the number of edges in the network).

28 April 2016 in PLOS ONE
Verified
Journal Article
Open access
PDF file
LŠLovro Šubelj
Lovro Šubelj
Nees Jan van EckNees Jan van Eck
Nees Jan van Eck
LWLudo Waltman
Ludo Waltman
Clustering methods are applied regularly in the bibliometric literature to identify research areas or scientific fields. These methods are for instance used to group publications into clusters based on their relations in a citation network. In the network science literature, many clustering methods, often referred to as graph partitioning or community detection techniques, have been developed. Focusing on the problem of clustering the publications in a citation network, we present a systematic comparison of the performance of a large number of these clustering methods. Using a number of different citation networks, some of them relatively small and others very large, we extensively study the statistical properties of the results provided by different methods. In addition, we also carry out an expert-based assessment of the results produced by different methods. The expert-based assessment focuses on publications in the field of scientometrics. Our findings seem to indicate that there is a trade-off between different properties that may be considered desirable for a good clustering of publications. Overall, map equation methods appear to perform best in our analysis, suggesting that these methods deserve more attention from the bibliometric community.

4 February 2021 in PeerJ Computer Science
Verified
Journal Article
Open access
PDF file
IMIlya Makarov
Ilya Makarov
DKDmitrii Kiselev
Dmitrii Kiselev
NNNikita Nikitinsky
Nikita Nikitinsky
LŠLovro Šubelj
Lovro Šubelj
Dealing with relational data always required significant computational resources, domain expertise and task-dependent feature engineering to incorporate structural information into a predictive model. Nowadays, a family of automated graph feature engineering techniques has been proposed in different streams of literature. So-called graph embeddings provide a powerful tool to construct vectorized feature spaces for graphs and their components, such as nodes, edges and subgraphs under preserving inner graph properties. Using the constructed feature spaces, many machine learning problems on graphs can be solved via standard frameworks suitable for vectorized feature representation. Our survey aims to describe the core concepts of graph embeddings and provide several taxonomies for their description. First, we start with the methodological approach and extract three types of graph embedding models based on matrix factorization, random-walks and deep learning approaches. Next, we describe how different types of networks impact the ability of models to incorporate structural and attributed data into a unified embedding. Going further, we perform a thorough evaluation of graph embedding applications to machine learning problems on graphs, among which are node classification, link prediction, clustering, visualization, compression, and a family of the whole graph embedding algorithms suitable for graph classification, similarity and alignment problems. Finally, we overview the existing applications of graph embeddings to computer science domains, formulate open problems and provide experiment results, explaining how different networks properties result in graph embeddings quality in the four classic machine learning problems on graphs, such as node classification, link prediction, clustering and graph visualization. As a result, our survey covers a new rapidly growing field of network feature engineering, presents an in-depth analysis of models based on network types, and overviews a wide range of applications to machine learning problems on graphs.

1 January 2011 in Expert Systems with Applications
Verified
Journal Article
Closed access
LŠLovro Šubelj
Lovro Šubelj
ŠFŠtefan Furlan
Štefan Furlan
MBMarko Bajec
Marko Bajec

1 April 2012 in Physica A: Statistical Mechanics and its Applications
Verified
Journal Article
Closed access
NBNeli Blagus
Neli Blagus
LŠLovro Šubelj
Lovro Šubelj
MBMarko Bajec
Marko Bajec