Algorithms that find clusters in networks or rank their nodes, such as the Louvain method, the Leiden algorithm, the Girvan-Newman algorithm, PageRank and HITS. An algorithm belongs here when its cited article describes detecting communities or ranking nodes by their links. It excludes route finding and flow algorithms. A member is placed here by what its own cited article states about it, not by the name of the algorithm or by the uses it is put to today, so each entry sits in the group its source describes it as belonging to.
Browse By
Community Detection and Link Analysis Algorithms
Filter Results7 entries
Sources
Wikipedia: EdgeRank
Has Member: EdgeRank, IntroductionQuote, Has Member: EdgeRank, Introduction
EdgeRank is the name commonly given to the algorithm that Facebook uses to determine what articles should be displayed in a user's News Feed.
View the Source Louvain method (Wikipedia)
Has Member: Louvain Method, Lead sectionQuote, Has Member: Louvain Method, Lead section
method for community detection
View the Source Girvan-Newman algorithm (Wikipedia)
Has Member: Girvan-Newman Algorithm, Lead sectionQuote, Has Member: Girvan-Newman Algorithm, Lead section
used to detect communities in complex systems
View the Source Leiden algorithm (Wikipedia)
Has Member: Leiden Algorithm, Lead sectionQuote, Has Member: Leiden Algorithm, Lead section
is a community detection algorithm
View the Source Wikipedia: PageRank
Wikimedia FoundationHas Member: PageRank Algorithm, Lead sectionQuote, Has Member: PageRank Algorithm, Lead section
used by Google Search to rank web pages
View the Source HITS algorithm (Wikipedia)
Has Member: HITS Algorithm, Lead sectionQuote, Has Member: HITS Algorithm, Lead section
link analysis algorithm that rates Web pages
View the Source Label propagation algorithm (Wikipedia)
Has Member: Label Propagation Algorithm, LeadQuote, Has Member: Label Propagation Algorithm, Lead
Label propagation is a semi-supervised algorithm in machine learning that assigns labels to previously unlabeled data points.
View the Source Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.