The graph model networks are investigated to determine centrality, weights and the significance of vertices. For centrality analysis appliesa typical method that includesany one of the properties of graph vertices. In graph theory, methods of analyzing centrality are used: in terms by degree, closeness, betweenness, radiality, eccentricity, page-rank, status, Katz and eigenvector. We have proposed a new method of multi-parametric centrality, which includes a number of basic properties of the network member. The mathematical model of multi-parametric centrality method is developed. Comparison of results for the presented method with the centrality methods is carried out. For evaluate the results for the multi-parametric centrality methodthe graph model with hundreds of vertices is analyzed. The comparative analysis showed the accuracy of presented method, includes simultaneously a number of basic properties of vertices.

1.
K. M.
Borgwardt
,
H.-P.
Kriegel
,
P.
Wackersreuther
, “
Pattern Mining in Frequent Dynamic Subgraphs
”,
Proceedings of the IEEE International Conference on Data Mining
, (
2006
), pp.
818
822
.
2.
F.
Bonchi
,
C.
Castillo
,
A.
Gionis
,
A.
Jaimes
, “
Social Network Analysis and Mining for Business Applications
”,
ACM TIST
, Vol.
2
(
3
), (
2011
), pp.
22
58
.
3.
C. Aggarwal.
Charu
, “
Social Network Data Analytics
”, (
2011
),
520
p.
4.
J.
Ferlez
,
C.
Faloutsos
,
J.
Leskovec
,
D.
Mladenic
,
M.
Grobelnik
, “
Monitoring Network Evolution Using MDL
”,
Proceedings of the International Conference on Data Engineering
, (
2008
) pp.
1328
1330
.
5.
S.
Fortunato
, and
C.
Castellano
, “
Encyclopedia of Complexity and Systems Science
”, edited by
R. A.
Meyers
(
Springer
,
Berlin, Germany
), volume
1
(
2009
)
6.
A.
Inokuchi
,
T.
Washio
, “
A Fast Method to Mine Frequent Subsequences from Graph Sequence Data
”,
Proceedings of the IEEE International Conference on Data Mining
, (
2008
), pp.
303
312
.
7.
J.
Leskovec
,
L.
Backstrom
,
R.
Kumar
,
A.
Tomkins
, “
Microscopic Evolution of Social Networks
”,
Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
.
N. Y.
, (
2008
), pp.
462
470
.
8.
Z.
Liu
,
J.
Yu
,
Y.
Ke
,
X.
Lin
,
L.
Chen
, “
Spotting Significant Changing Subgraphs in Evolving Graphs
”,
Proceedings of the 8th International Conference on Data Mining
, (
2008
), pp.
917
922
.
9.
S.
Wasserman
,
K.
Faust
, “
Social Network Analysis: Methods And Applications
N. Y
.:
Cambridge University Press
, (
1994
),
825
p.
This content is only available via PDF.
You do not currently have access to this content.