• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site

Article

Combined method to detect communities in graphs of interacting objects

Business Informatics. 2017. Vol. 42. No. 4. P. 64-73.
Chepovskiy A., Lobanova S.

A method for detecting intersecting and nested communities in graphs of interacting objects of different nature is proposed and implemented. For this, two classical algorithms are taken: a hierarchical agglomerate and based on the search for k -cliques. The presented combined method is based on their consistent application. In addition, parametric options are developed that are responsible for actions with communities whose sizes are smaller than the given k , and also with single vertices. Varying these parameters allows to take into account differences in the topology of the original graph and thus to correct the algorithm. The testing was carried out on real data, including on the group of graphs of the social network, the qualitative content of the resulting partition was investigated. Proposals to develop this approach in the form of using a set of parametric algorithms are made.