All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
Public Member Functions | List of all members
NetworKit::PartitionHubDominance Class Reference

A quality measure that measures the dominance of hubs in clusters. More...

#include <PartitionHubDominance.h>

Public Member Functions

virtual void run () override
 Execute the algorithm. More...
 
virtual bool isSmallBetter () const override
 
virtual bool isParallel () const override
 
- Public Member Functions inherited from NetworKit::LocalPartitionEvaluation
 LocalPartitionEvaluation (const Graph &G, const Partition &P)
 Initialize the partition evaluation method. More...
 
- Public Member Functions inherited from NetworKit::LocalCommunityEvaluation
virtual ~LocalCommunityEvaluation ()=default
 Default destructor for the virtual base class. More...
 
double getWeightedAverage () const
 Get the average value weighted by cluster size. More...
 
double getUnweightedAverage () const
 Get the (unweighted) average value of all clusters. More...
 
double getMaximumValue () const
 Get the maximum value of all clusters. More...
 
double getMinimumValue () const
 Get the minimum value of all clusters. More...
 
double getValue (index i) const
 Get the value of the specified cluster. More...
 
std::vector< double > getValues () const
 Get the values of all clusters. More...
 
- Public Member Functions inherited from NetworKit::Algorithm
 Algorithm ()
 Constructor to the algorithm base class. More...
 
virtual ~Algorithm ()=default
 Virtual default destructor. More...
 
bool hasFinished () const
 Indicates whether an algorithm has completed computation or not. More...
 
void assureFinished () const
 Assure that the algorithm has been run, throws a std::runtime_error otherwise. More...
 
virtual std::string toString () const
 Returns a string with the algorithm's name and its parameters, if there are any. More...
 

Additional Inherited Members

- Protected Attributes inherited from NetworKit::LocalPartitionEvaluation
const GraphG
 
const PartitionP
 
- Protected Attributes inherited from NetworKit::LocalCommunityEvaluation
double weightedAverage
 
double unweightedAverage
 
double maximumValue
 
double minimumValue
 
std::vector< double > values
 
- Protected Attributes inherited from NetworKit::Algorithm
bool hasRun
 A boolean variable indicating whether an algorithm has finished its computation or not. More...
 

Detailed Description

A quality measure that measures the dominance of hubs in clusters.

The hub dominance of a single cluster is defined as the maximum cluster-internal degree of a node in that cluster divided by the maximum cluster-internal degree, i.e. the number of nodes in the cluster minus one. The value for all clusters is defined as the average of all clusters. Strictly speaking this is not a quality measure as this is rather dependent on the type of the considered graph, for more information see Lancichinetti A, Kivelä M, Saramäki J, Fortunato S (2010) Characterizing the Community Structure of Complex Networks PLoS ONE 5(8): e11976. doi: 10.1371/journal.pone.0011976 http://www.plosone.org/article/info%3Adoi%2F10.1371%2Fjournal.pone.0011976

Member Function Documentation

virtual bool NetworKit::PartitionHubDominance::isParallel ( ) const
inlineoverridevirtual
Returns
false - this implementation is not paralle.

Reimplemented from NetworKit::Algorithm.

virtual bool NetworKit::PartitionHubDominance::isSmallBetter ( ) const
inlineoverridevirtual
Returns
false - small values are not better, large values indicate better cluster cohesion.

Implements NetworKit::LocalCommunityEvaluation.

void NetworKit::PartitionHubDominance::run ( )
overridevirtual

Execute the algorithm.

Implements NetworKit::Algorithm.


The documentation for this class was generated from the following files: