Social Graph Community Differentiated by Node Features with Partly Missing Information
<p>This paper proposes a new algorithm for community differentiation in social graphs, which uses information both on the graph structure and on the vertices. We consider user's ego-network i.e. his friends, with no himself, where each vertex has a set of features such as details on a wor...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
MGTU im. N.È. Baumana
2015-01-01
|
| Series: | Nauka i Obrazovanie |
| Subjects: | |
| Online Access: | http://technomag.edu.ru/jour/article/view/187 |