pith. sign in

arxiv: 1702.06154 · v1 · pith:BRCEUR2Snew · submitted 2017-01-28 · 💻 cs.SI · physics.soc-ph

Role model detection using low rank similarity matrix

classification 💻 cs.SI physics.soc-ph
keywords similarityalgorithmanalyseextractionmatrixmeasureroletime
0
0 comments X
read the original abstract

Computing meaningful clusters of nodes is crucial to analyse large networks. In this paper, we apply new clustering methods to improve the computational time. We use the properties of the adjacency matrix to obtain better role extraction. We also define a new non-recursive similarity measure and compare its results with the ones obtained with Browet's similarity measure. We will show the extraction of the different roles with a linear time complexity. Finally, we test our algorithm with real data structures and analyse the limit of our algorithm.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.