A spectral algorithm with additive clustering for the recovery of overlapping communities in networks (Q1663638): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4907706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elements of Information Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rotation of Eigenvectors by a Perturbation. III / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral redemption in clustering sparse networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consistency of spectral clustering in stochastic block models / rank
 
Normal rank
Property / cites work
 
Property / cites work: User-friendly tail bounds for sums of random matrices / rank
 
Normal rank

Latest revision as of 09:53, 16 July 2024

scientific article; zbMATH DE number 6650182
  • A Spectral Algorithm with Additive Clustering for the Recovery of Overlapping Communities in Networks
Language Label Description Also known as
English
A spectral algorithm with additive clustering for the recovery of overlapping communities in networks
scientific article; zbMATH DE number 6650182
  • A Spectral Algorithm with Additive Clustering for the Recovery of Overlapping Communities in Networks

Statements

A spectral algorithm with additive clustering for the recovery of overlapping communities in networks (English)
0 references
A Spectral Algorithm with Additive Clustering for the Recovery of Overlapping Communities in Networks (English)
0 references
0 references
0 references
0 references
22 August 2018
0 references
9 November 2016
0 references
community detection
0 references
stochastic blockmodel
0 references
0 references
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references