Jérôme Kunegis
ABSTRACT
We present the Koblenz Network Collection (KONECT), a project to collect network datasets in the areas of web science, network science and related areas, as well as provide tools for their analysis. In the cited areas, a surprisingly large number of very heterogeneous data can be modeled as networks and consequently, a unified representation of networks can be used to gain insight into many kinds of problems. Due to the emergence of the World Wide Web in the last decades many such datasets are now openly available. The KONECT project thus has the goal of collecting many diverse network datasets from the Web, and providing a way for their systematic study. The main parts of KONECT are (1) a collection of over 160 network datasets, consisting of directed, undirected, unipartite, bipartite, weighted, unweighted, signed and temporal networks collected from the Web, (2) a Matlab toolbox for network analysis and (3) a website giving a compact overview the various computed statistics and plots. In this paper, we describe KONECT's taxonomy of networks datasets, give an overview of the datasets included, review the supported statistics and plots, and briefly discuss KONECT's role in the area of web science and network science.
- A.-L. Barabási and R. Albert. Emergence of scaling in random networks. Science, 286(5439):509--512, 1999.Google Scholar
Cross Ref
- B. Bollobás. Modern Graph Theory. Springer, 1998.Google ScholarCross Ref
- F. Chung. Spectral Graph Theory. American Math. Soc., 1997.Google Scholar
- M. Fiedler. Algebraic connectivity of graphs. Czechoslovak Math. J., 23(98):298--305, 1973.Google ScholarCross Ref
- C. D. Godsil and G. Royle. Algebraic Graph Theory. Springer, 2001.Google ScholarCross Ref
- J. Kunegis and J. Preusse. Fairness on the web: Alternatives to the power law. In Proc. Web Science Conf., pages 175--184, 2012. Google ScholarDigital Library
- M. E. J. Newman. Power laws, Pareto distributions and Zipf's law. Contemporary Phys., 46(5):323--351, 2006.Google ScholarCross Ref
Index Terms
- KONECT: the Koblenz network collection
Recommendations
Effective co-betweenness centrality computation
WSDM '14: Proceedings of the 7th ACM international conference on Web search and data miningBetweenness centrality of vertices is essential in the analysis of social and information networks, and co-betweenness centrality is one of two natural ways to extend it to sets of vertices. Existing algorithms for co-betweenness centrality computation ...
A novel measure of edge centrality in social networks
The problem of assigning centrality values to nodes and edges in graphs has been widely investigated during last years. Recently, a novel measure of node centrality has been proposed, called @k-path centrality index, which is based on the propagation of ...
Incorporating Gene Annotations as Node Metadata to Improve Network Centrality Measures for Better Node Ranking
BCB'13: Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical InformaticsNetwork centrality measures allow ranking of nodes and edges based on their importance to the network topology. Closeness centrality [1] and shortest path betweenness centrality [2] are two of the most popular and well-utilized centrality measures that ...
Comments