Skip to search formSkip to main contentSkip to account menu

Clustering coefficient

Known as: Clustering 
In graph theory, a clustering coefficient is a measure of the degree to which nodes in a graph tend to cluster together. Evidence suggests that in… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
The automatic disambiguation of word senses (i.e., the identification of which of the meanings is used in a given context for a… 
2011
2011
Nanobiopharmaceuticals is a hopeful research domain from recent scientific advances with massive marketable potential. Although… 
2010
2010
This paper describes an approach to evaluating teams of contributors in Wikipedia based on social network analysis. We present… 
2010
2010
The extraction of social groups from social networks existing among employees in the company, its customers or users of various… 
2007
2007
For resource discovery in social networks, people can directly contact some acquaintances that have knowledge about the resources… 
2007
2007
We present an empirical study of the evolution of a social network constructed under the influence of musical tastes. The network… 
2006
2006
Several topology generator algorithms have been proposed to match the heavy-tailed behavior of the real Internet AS-level… 
2005
2005
The phenomenon of epidemic spreading in a population with a hierarchical structure of interpersonal interactions is described and…