Fairness on the Web: Alternatives to the Power Law

•

1 gefällt mir•465 views

This document discusses alternatives to power law distributions for modeling networks. It presents the zeta distribution and normalized entropy as alternatives that can model networks with similar accuracy to power laws but are faster to compute. It also discusses using the Gini coefficient to measure inequality in networks as an alternative to power law fitting. These alternative methods are evaluated based on their generality, interpretability, runtime and ability to model all nodes in a network.

Bildung Business

Web Science and Technologies
University of Koblenz–Landau, Germany

Fairness on the Web:
Alternatives to the Power Law
Jérôme Kunegis
University of Koblenz–Landau
(with Julia Preusse)
GESIS Cologne, Mai 2012

Jérôme Kunegis Fairness on the Web: Alternatives to the Power Law
kunegis@uni-koblenz.de 2 / 19

A IR
N F
U
Jérôme Kunegis Fairness on the Web: Alternatives to the Power Law
kunegis@uni-koblenz.de 3 / 19

Edge distribution Degree distribution
Jérôme Kunegis Fairness on the Web: Alternatives to the Power Law
kunegis@uni-koblenz.de 4 / 19

Power-law degree distribution
C(n) ~ n−γ

Jérôme Kunegis Fairness on the Web: Alternatives to the Power Law
kunegis@uni-koblenz.de 5 / 19

TODO

Jérôme Kunegis Fairness on the Web: Alternatives to the Power Law
kunegis@uni-koblenz.de 6 / 19

Flickr Digg

todo

Jérôme Kunegis Fairness on the Web: Alternatives to the Power Law
kunegis@uni-koblenz.de 7 / 19

The Pareto Principle

20% of people own 80% of land.
(In 1920 Italy)

Jérôme Kunegis Fairness on the Web: Alternatives to the Power Law
kunegis@uni-koblenz.de 8 / 19

8.9% of bands make up 91.1% of plays on Last.fm.

14.6% of user groups account for 75.4% of group memberships on Flickr.

17.4% of movies receive 82.6% of ratings on MovieLens.

17.7% of proﬁles receive 82.3% of ratings on Czech dating site Libimseti.cz.

20.3% of all users receive 79.7% of “friend” and “foe” links on Slashdot.

21.3% of users receive 78.7% of wall posts on Facebook.

22.9% of users make up 77.1% of all “@” mentions on Twitter.

23.1% of projects receive 76.9% of project memberships on Github.

27.3% of users receive 72.7% of replies on Digg.

30.4% of all sites receive 69.6% of all hyperlinks on the Web.

Jérôme Kunegis Fairness on the Web: Alternatives to the Power Law
kunegis@uni-koblenz.de 9 / 19

Gini Coefficient – Lorenz Curve

Jérôme Kunegis Fairness on the Web: Alternatives to the Power Law
kunegis@uni-koblenz.de 10 / 19

todo

Jérôme Kunegis Fairness on the Web: Alternatives to the Power Law
kunegis@uni-koblenz.de 11 / 19

Zeta distribution C(n) = n−γ / ζ(γ)

Jérôme Kunegis Fairness on the Web: Alternatives to the Power Law
kunegis@uni-koblenz.de 12 / 19

Random Edge→Vertex

P(u) = d(u) / 2|E|

Jérôme Kunegis Fairness on the Web: Alternatives to the Power Law
kunegis@uni-koblenz.de 13 / 19

Entropy

Jérôme Kunegis Fairness on the Web: Alternatives to the Power Law
kunegis@uni-koblenz.de 14 / 19

Maximum Entropy

max He = ln |V|

Jérôme Kunegis Fairness on the Web: Alternatives to the Power Law
kunegis@uni-koblenz.de 15 / 19

Normalized Entropy

Jérôme Kunegis Fairness on the Web: Alternatives to the Power Law
kunegis@uni-koblenz.de 16 / 19

Jérôme Kunegis Fairness on the Web: Alternatives to the Power Law
kunegis@uni-koblenz.de 17 / 19

Comparison
Power Law Gini Norm. Entropy

Generality Power-law All networks All networks

Interpretation ––– Economy Physical

Runtime Slow Fast Fast

Coverage d(u) ≥ dmin All All

Jérôme Kunegis Fairness on the Web: Alternatives to the Power Law
kunegis@uni-koblenz.de 18 / 19

Thank You!
→ 22 - 24 June, Web Science Conference

Dr. Jérôme Kunegis
<kunegis@uni-koblenz.de>
Institute for Web Science and Technologies
University of Koblenz–Landau (Campus Koblenz)

http://konect.uni-koblenz.de/plots/degree_distribution

http://konect.uni-koblenz.de/plots/lorenz_curve

Jérôme Kunegis Fairness on the Web: Alternatives to the Power Law
kunegis@uni-koblenz.de 19 / 19

Weitere ähnliche Inhalte

Mehr von Jérôme KUNEGIS

Winning Science Slam by Jérôme Kunegis – First Prize at ICWSM 2016

Jérôme KUNEGIS

In this talk, I present recent results on the measurement of conflict in signed social network. A signed social network is a network in which both positive and negative ties are present, for instance representing friendship and enmity, or trust and distrust. Such networks have long been studied under the aspect of balance theory, i.e., considering whether the individuals can be grouped into two groups, such that the sign of all ties reflects the partition, or equivalently in terms of the individual configuration of tryads. The failure of such a structure to be present in a signed social network is usually designated as conflict, and measuring the amount of conflict in a given signed social network is an open problem. In this work, I present a novel measure of conflict, based on algebraic graph theory, and considering a previously known variant of the Laplacian matrix for signed graphs. The talk will show both theoretical motivations for the measure, as well as an evaluation of its utility at signed social network analysis using multiple real-world signed social networks.

Algebraic Graph-theoretic Measures of Conflict

Jérôme KUNEGIS

Generating Networks with Arbitrary Properties

Jérôme KUNEGIS

Karriere Lounge – INFORMATIK 2013

Jérôme KUNEGIS

Eight Formalisms for Defining Graph Models

Jérôme KUNEGIS

We investigate the "negative link" feature of social networks that allows users to tag other users as foes or as distrusted in addition to the usual friend and trusted links. To answer the question whether negative links have an added value for an online social network, we investigate the machine learning problem of predicting the negative links of such a network using only the positive links as a basis, with the idea that if this problem can be solved with high accuracy, then the "negative link" feature is redundant. In doing so, we also present a general methodology for assessing the added value of any new link type in online social networks. Our evaluation is performed on two social networks that allow negative links: The technology news website Slashdot and the product review site Epinions. In experiments with these two datasets, we come to the conclusion that a combination of centrality-based and proximity-based link prediction functions can be used to predict the negative edges in the networks we analyse. We explain this result by an application of the models of preferential attachment and balance theory to our learning problem, and show that the "negative link" feature has a small but measurable added value for these social networks.

What Is the Added Value of Negative Links in Online Social Networks?

Jérôme KUNEGIS

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.

KONECT – The Koblenz Network Collection

Jérôme KUNEGIS

We perform an empirical study of the preferential attachment phenomenon in temporal networks and show that on the Web, networks follow a nonlinear preferential attachment model in which the exponent depends on the type of network considered. The classical preferential attachment model for networks by Barabási and Albert (1999) assumes a linear relationship between the number of neighbors of a node in a network and the probability of attachment. Although this assumption is widely made in Web Science and related fields, the underlying linearity is rarely measured. To fill this gap, this paper performs an empirical longitudinal (time-based) study on forty-seven diverse Web network datasets from seven network categories and including directed, undirected and bipartite networks. We show that contrary to the usual assumption, preferential attachment is nonlinear in the networks under consideration. Furthermore, we observe that the deviation from linearity is dependent on the type of network, giving sublinear attachment in certain types of networks, and superlinear attachment in others. Thus, we introduce the preferential attachment exponent $\beta$ as a novel numerical network measure that can be used to discriminate different types of networks. We propose explanations for the behavior of that network measure, based on the mechanisms that underly the growth of the network in question.

Preferential Attachment in Online Networks: Measurement and Explanations

Jérôme KUNEGIS

Predicting Directed Links using Nondiagonal Matrix Decompositions

Jérôme KUNEGIS

A typical recommender setting is based on two kinds of relations: similarity between users (or between objects) and the taste of users towards certain objects. In environments such as online dating websites, these two relations are difficult to separate, as the users can be similar to each other, but also have preferences towards other users, i.e., rate other users. In this paper, we present a novel and unified way to model this duality of the relations by using split-complex numbers, a number system related to the complex numbers that is used in mathematics, physics and other fields. We show that this unified representation is capable of modeling both notions of relations between users in a joint expression and apply it for recommending potential partners. In experiments with the Czech dating website Libimseti.cz we show that our modeling approach leads to an improvement over baseline recommendation methods in this scenario.

Online Dating Recommender Systems: The Split-complex Number Approach

Jérôme KUNEGIS

Why Beyoncé Is More Popular Than Me – Fairness, Diversity and Other Measures

Jérôme KUNEGIS

In the Winter 2011/2012 run at the Future SOC Lab, we used the KONECT framework (Koblenz Network Collection) to compute ten different network statistics on a large collection of downsampled versions of a large network dataset, with the goal of determining whether sampling of a large network can be used to reduce the computational effort needed to compute a network statistic. Preliminary results show that this is indeed the case.

KONECT Cloud – Large Scale Network Mining in the Cloud

Jérôme KUNEGIS

In this thesis, I study the spectral characteristics of large dynamic networks and formulate the spectral evolution model. The spectral evolution model applies to networks that evolve over time, and describes their spectral decompositions such as the eigenvalue and singular value decomposition. The spectral evolution model states that over time, the eigenvalues of a network change while its eigenvectors stay approximately constant.

On the Spectral Evolution of Large Networks (PhD Thesis by Jérôme Kunegis)

Jérôme KUNEGIS

Searching Microblogs: Coping with Sparsity and Document Quality

Jérôme KUNEGIS

On the microblogging site Twitter, users can forward any message they receive to all of their followers. This is called a retweet and is usually done when users find a message particularly interesting and worth sharing with others. Thus, retweets reflect what the Twitter community considers interesting on a global scale, and can be used as a function of interestingness to generate a model to describe the content-based characteristics of retweets. In this paper, we analyze a set of high- and low-level content-based features on several large collections of Twitter messages. We train a prediction model to forecast for a given tweet its likelihood of being retweeted based on its contents. From the parameters learned by the model we deduce what are the influential content features that contribute to the likelihood of a retweet. As a result we obtain insights into what makes a message on Twitter worth retweeting and, thus, interesting.

Bad News Travel Fast: A Content-based Analysis of Interestingness on Twitter

Jérôme KUNEGIS

We present a unified framework for learning link prediction and edge weight prediction functions in large networks, based on the transformation of a graph’s algebraic spectrum. Our approach generalizes several graph kernels and dimensionality reduction methods and provides a method to estimate their parameters eﬃciently. We show how the parameters of these prediction functions can be learned by reducing the problem to a one-dimensional regression problem whose runtime only depends on the method’s reduced rank and that can be inspected visually. We derive variants that apply to undirected, weighted, unweighted, unipartite and bipartite graphs. We evaluate our method experimentally using examples from social networks, collaborative filtering, trust networks, citation networks, authorship graphs and hyperlink networks.

Learning Spectral Graph Transformations for Link Prediction

Jérôme KUNEGIS

We analyse the corpus of user relationships of the Slashdot technology news site. The data was collected from the Slashdot Zoo feature where users of the website can tag other users as friends and foes, providing positive and negative endorsements. We adapt social network analysis techniques to the problem of negative edge weights. In particular, we consider signed variants of global network characteristics such as the clustering coefficient, node-level characteristics such as centrality and popularity measures, and link-level characteristics such as distances and similarity measures. We evaluate these measures on the task of identifying unpopular users, as well as on the task of predicting the sign of links and show that the network exhibits multiplicative transitivity which allows algebraic methods based on matrix multiplication to be used. We compare our methods to traditional methods which are only suitable for positively weighted edges.

The Slashdot Zoo: Mining a Social Network with Negative Edges

Jérôme KUNEGIS

We study the application of spectral clustering, prediction and visualization methods to graphs with negatively weighted edges. We show that several characteristic matrices of graphs can be extended to graphs with positively and negatively weighted edges, giving signed spectral clustering methods, signed graph kernels and network visualization methods that apply to signed graphs. In particular, we review a signed variant of the graph Laplacian. We derive our results by considering random walks, graph clustering, graph drawing and electrical networks, showing that they all result in the same formalism for handling negatively weighted edges. We illustrate our methods using examples from social networks with negative edges and bipartite rating graphs.

Spectral Analysis of Signed Graphs for Clustering, Prediction and Visualization

Jérôme KUNEGIS

We introduce and study the spectral evolution model, which characterizes the growth of large networks in terms of the eigenvalue decomposition of their adjacency matrices: In large networks, changes over time result in a change of a graph's spectrum, leaving the eigenvectors unchanged. We validate this hypothesis for several large social, collaboration, authorship, rating, citation, communication and tagging networks, covering unipartite, bipartite, signed and unsigned graphs. Following these observations, we introduce a link prediction algorithm based on the extrapolation of a network's spectral evolution. This new link prediction method generalizes several common graph kernels that can be expressed as spectral transformations. In contrast to these graph kernels, the spectral extrapolation algorithm does not make assumptions about specific growth patterns beyond the spectral evolution model. We thus show that it performs particularly well for networks with irregular, but spectral, growth patterns.

Network Growth and the Spectral Evolution Model

Jérôme KUNEGIS

Mehr von Jérôme KUNEGIS (19)

Winning Science Slam by Jérôme Kunegis – First Prize at ICWSM 2016

Algebraic Graph-theoretic Measures of Conflict

Generating Networks with Arbitrary Properties

Karriere Lounge – INFORMATIK 2013

Eight Formalisms for Defining Graph Models

What Is the Added Value of Negative Links in Online Social Networks?

KONECT – The Koblenz Network Collection

Preferential Attachment in Online Networks: Measurement and Explanations

Predicting Directed Links using Nondiagonal Matrix Decompositions

Online Dating Recommender Systems: The Split-complex Number Approach

Why Beyoncé Is More Popular Than Me – Fairness, Diversity and Other Measures

KONECT Cloud – Large Scale Network Mining in the Cloud

On the Spectral Evolution of Large Networks (PhD Thesis by Jérôme Kunegis)

Searching Microblogs: Coping with Sparsity and Document Quality

Bad News Travel Fast: A Content-based Analysis of Interestingness on Twitter

Learning Spectral Graph Transformations for Link Prediction

The Slashdot Zoo: Mining a Social Network with Negative Edges

Spectral Analysis of Signed Graphs for Clustering, Prediction and Visualization

Network Growth and the Spectral Evolution Model

Kürzlich hochgeladen

On National Teacher Day, meet the 2024-25 Kenan Fellows

Mebane Rash

𝐋𝐞𝐬𝐬𝐨𝐧 𝐎𝐮𝐭𝐜𝐨𝐦𝐞𝐬: -Discern accommodations and modifications within inclusive classroom environments, distinguishing between their respective roles and applications. -Through critical analysis of hypothetical scenarios, learners will adeptly select appropriate accommodations and modifications, honing their ability to foster an inclusive learning environment for students with disabilities or unique challenges.

Understanding Accommodations and Modifications

MJDuyan

Accessible Digital Futures project (20/03/2024)

Jisc

Mixin Classes in Odoo 17 How to Extend Models Using Mixin Classes

Celine George

Mehran University Newsletter Vol-X, Issue-I, 2024

Mehran University of Engineering & Technology, Jamshoro

How to Give a Domain for a Field in Odoo 17

Celine George

SKILL OF INTRODUCING THE LESSON MICRO SKILLS.pptx

Amanpreet Kaur

General Principles of Intellectual Property: Concepts of Intellectual Proper...

Poonam Aher Patil

psychiatric nursing HISTORY COLLECTION .docx

PoojaSen20

SOC 101 Demonstration of Learning Presentation

camerronhm

Sociology 101 Demonstration of Learning Exhibit

jbellavia9

2024-NATIONAL-LEARNING-CAMP-AND-OTHER.pptx

MaritesTamaniVerdade

Micro-Scholarship, What it is, How can it help me.pdf

Poh-Sun Goh

microwave assisted reaction. General introduction

Maksud Ahmed

Grant Readiness 101 TechSoup and Remy Consulting

TechSoup

Introduction to Nonprofit Accounting: The Basics

TechSoup

Russian Escort Service in Delhi 11k Hotel Foreigner Russian Call Girls in Delhi Welcome to VIP Call Girl In Delhi Hello! Delhi Call Girls is one of the most popular cities in India. Girls who call in Delhi frequently Advertise their services in small promgons in magazines, as well as on the Internet but We do not act as a direct-promoter. We will do everything we can to make sure that you're safe to the max to the best of our abilities and making sure of our ability and ensuring that you're obtained to the best of our abilities and making sure that you get what you want. Sexuality of our females is recognized by our Business proposals. Top-of-the-line, fully-featured Delhi girl call number and we offer To be aware of it is a major reason in deciding to use our services to ensure that our customers realize the worth of their lives swiftly and in a pleasant manner by engaging with web series performers for a cost of 10000.Here you are able to be Relax knowing that personal information is stored in the business proposals, giving an appearance of like you're as if you are a full affirmation. Call Girls Service Now Delhi +91-9899900591 *********** N.M.************* 01/04/2024 ▬█⓿▀█▀ 𝐈𝐍𝐃𝐄𝐏𝐄𝐍𝐃𝐄𝐍𝐓 CALL 𝐆𝐈𝐑𝐋 𝐕𝐈𝐏 𝐄𝐒𝐂𝐎𝐑𝐓 SERVICE ✅ ❣️ ⭐➡️HOT & SEXY MODELS // COLLEGE GIRLS AVAILABLE FOR COMPLETE ENJOYMENT WITH HIGH PROFILE INDIAN MODEL AVAILABLE HOTEL & HOME ★ SAFE AND SECURE HIGH CLASS SERVICE AFFORDABLE RATE ★ SATISFACTION,UNLIMITED ENJOYMENT. ★ All Meetings are confidential and no information is provided to any one at any cost. ★ EXCLUSIVE PROFILes Are Safe and Consensual with Most Limits Respected ★ Service Available In: - HOME & HOTEL Star Hotel Service .In Call & Out call SeRvIcEs : ★ A-Level (star escort) ★ Strip-tease ★ BBBJ (Bareback Blowjob)Receive advanced sexual techniques in different mode make their life more pleasurable. ★ Spending time in hotel rooms ★ BJ (Blowjob Without a Condom) ★ Completion (Oral to completion) ★ Covered (Covered blowjob Without condom SAFE AND SECURE

Russian Escort Service in Delhi 11k Hotel Foreigner Russian Call Girls in Delhi

kauryashika82

Unit-IV- Pharma. Marketing Channels.pptx

VishalSingh1417

Unit-IV; Professional Sales Representative (PSR).pptx

VishalSingh1417

Activity 01 - Artificial Culture (1).pdf

ciinovamais

Kürzlich hochgeladen (20)

On National Teacher Day, meet the 2024-25 Kenan Fellows

Understanding Accommodations and Modifications

Accessible Digital Futures project (20/03/2024)

Mixin Classes in Odoo 17 How to Extend Models Using Mixin Classes

Mehran University Newsletter Vol-X, Issue-I, 2024

How to Give a Domain for a Field in Odoo 17

SKILL OF INTRODUCING THE LESSON MICRO SKILLS.pptx

General Principles of Intellectual Property: Concepts of Intellectual Proper...

psychiatric nursing HISTORY COLLECTION .docx

SOC 101 Demonstration of Learning Presentation

Sociology 101 Demonstration of Learning Exhibit

2024-NATIONAL-LEARNING-CAMP-AND-OTHER.pptx

Micro-Scholarship, What it is, How can it help me.pdf

microwave assisted reaction. General introduction

Grant Readiness 101 TechSoup and Remy Consulting

Introduction to Nonprofit Accounting: The Basics

Russian Escort Service in Delhi 11k Hotel Foreigner Russian Call Girls in Delhi

Unit-IV- Pharma. Marketing Channels.pptx

Unit-IV; Professional Sales Representative (PSR).pptx

Activity 01 - Artificial Culture (1).pdf

Fairness on the Web: Alternatives to the Power Law

1. Web Science and Technologies University of Koblenz–Landau, Germany Fairness on the Web: Alternatives to the Power Law Jérôme Kunegis University of Koblenz–Landau (with Julia Preusse) GESIS Cologne, Mai 2012

2. Jérôme Kunegis Fairness on the Web: Alternatives to the Power Law kunegis@uni-koblenz.de 2 / 19

3. A IR N F U Jérôme Kunegis Fairness on the Web: Alternatives to the Power Law kunegis@uni-koblenz.de 3 / 19

4. Edge distribution Degree distribution Jérôme Kunegis Fairness on the Web: Alternatives to the Power Law kunegis@uni-koblenz.de 4 / 19

5. Power-law degree distribution C(n) ~ n−γ Jérôme Kunegis Fairness on the Web: Alternatives to the Power Law kunegis@uni-koblenz.de 5 / 19

6. TODO Jérôme Kunegis Fairness on the Web: Alternatives to the Power Law kunegis@uni-koblenz.de 6 / 19

7. Flickr Digg todo Jérôme Kunegis Fairness on the Web: Alternatives to the Power Law kunegis@uni-koblenz.de 7 / 19

8. The Pareto Principle 20% of people own 80% of land. (In 1920 Italy) Jérôme Kunegis Fairness on the Web: Alternatives to the Power Law kunegis@uni-koblenz.de 8 / 19

9. 8.9% of bands make up 91.1% of plays on Last.fm. 14.6% of user groups account for 75.4% of group memberships on Flickr. 17.4% of movies receive 82.6% of ratings on MovieLens. 17.7% of proﬁles receive 82.3% of ratings on Czech dating site Libimseti.cz. 20.3% of all users receive 79.7% of “friend” and “foe” links on Slashdot. 21.3% of users receive 78.7% of wall posts on Facebook. 22.9% of users make up 77.1% of all “@” mentions on Twitter. 23.1% of projects receive 76.9% of project memberships on Github. 27.3% of users receive 72.7% of replies on Digg. 30.4% of all sites receive 69.6% of all hyperlinks on the Web. Jérôme Kunegis Fairness on the Web: Alternatives to the Power Law kunegis@uni-koblenz.de 9 / 19

10. Gini Coefficient – Lorenz Curve Jérôme Kunegis Fairness on the Web: Alternatives to the Power Law kunegis@uni-koblenz.de 10 / 19

11. todo Jérôme Kunegis Fairness on the Web: Alternatives to the Power Law kunegis@uni-koblenz.de 11 / 19

12. Zeta distribution C(n) = n−γ / ζ(γ) Jérôme Kunegis Fairness on the Web: Alternatives to the Power Law kunegis@uni-koblenz.de 12 / 19

13. Random Edge→Vertex P(u) = d(u) / 2|E| Jérôme Kunegis Fairness on the Web: Alternatives to the Power Law kunegis@uni-koblenz.de 13 / 19

14. Entropy Jérôme Kunegis Fairness on the Web: Alternatives to the Power Law kunegis@uni-koblenz.de 14 / 19

15. Maximum Entropy max He = ln |V| Jérôme Kunegis Fairness on the Web: Alternatives to the Power Law kunegis@uni-koblenz.de 15 / 19

16. Normalized Entropy Jérôme Kunegis Fairness on the Web: Alternatives to the Power Law kunegis@uni-koblenz.de 16 / 19

17. Jérôme Kunegis Fairness on the Web: Alternatives to the Power Law kunegis@uni-koblenz.de 17 / 19

18. Comparison Power Law Gini Norm. Entropy Generality Power-law All networks All networks Interpretation ––– Economy Physical Runtime Slow Fast Fast Coverage d(u) ≥ dmin All All Jérôme Kunegis Fairness on the Web: Alternatives to the Power Law kunegis@uni-koblenz.de 18 / 19

19. Thank You! → 22 - 24 June, Web Science Conference Dr. Jérôme Kunegis <kunegis@uni-koblenz.de> Institute for Web Science and Technologies University of Koblenz–Landau (Campus Koblenz) http://konect.uni-koblenz.de/plots/degree_distribution http://konect.uni-koblenz.de/plots/lorenz_curve Jérôme Kunegis Fairness on the Web: Alternatives to the Power Law kunegis@uni-koblenz.de 19 / 19

Fairness on the Web: Alternatives to the Power Law

Empfohlen

Empfohlen

Weitere ähnliche Inhalte

Mehr von Jérôme KUNEGIS

Mehr von Jérôme KUNEGIS (19)

Kürzlich hochgeladen

Kürzlich hochgeladen (20)

Fairness on the Web: Alternatives to the Power Law