Proceedings of the 4th Annual ACM Web Science Conference 2012
DOI: 10.1145/2380718.2380741
|View full text |Cite
|
Sign up to set email alerts
|

Fairness on the web

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
2
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
3
3

Relationship

1
5

Authors

Journals

citations
Cited by 28 publications
(3 citation statements)
references
References 16 publications
0
2
0
Order By: Relevance
“…To quantify the centralization of research communities C for each claim, we employed the Gini coefficient. The Gini coefficient is used to measure the heterogeneity of distributions in social and information networks (Kunegis and Preusse, 2012). The coefficient ranges between 0 and 1.…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…To quantify the centralization of research communities C for each claim, we employed the Gini coefficient. The Gini coefficient is used to measure the heterogeneity of distributions in social and information networks (Kunegis and Preusse, 2012). The coefficient ranges between 0 and 1.…”
Section: Methodsmentioning
confidence: 99%
“…The Gini coefficient can be also represented as a percentage ranging from 0 to 100, as in Figure 2D–E. While other measures of network centralization are available (e.g., Freeman’s centralization [Freeman, 1978]), the Gini coefficient, and the Lorenz curve on which it is based, is independent from the underlying degree distribution, making it suitable for comparisons among networks with different size and mean degree (Kunegis and Preusse, 2012; Badham, 2013).…”
Section: Methodsmentioning
confidence: 99%
“…we use the Shannon's Entropy measure in its normalized version (Shannon, 1951). It is worth noting that other measures of heterogenity like the Gini coefficient (Kunegis and Preusse, 2012), could be used to pursue such a scope. The entropy of the actual networks N (p) and N (d) is tested against a set of 100 random networks per actual network, with the same number of nodes and links.…”
Section: Complexity Of Nmentioning
confidence: 99%