Analysis Of The Neighborhood Pattern Similarity Measure For The Role Extraction Problem

In this paper we analyze an indirect approach, called the Neighborhood Pattern Similarity approach, to solve the so-called role extraction problem of a large-scale graph. The method is based on the preliminary construction of a node similarity matrix, which allows in a second stage to group together, with an appropriate clustering technique, the nodes that are assigned to have the same role. The analysis builds on the notion of ideal graphs where all nodes with the same role are also structurally equivalent.