Measure User Intimacy by Mining Maximum Information Transmission Paths
The Internet has become an important carrier of information. Its data contain abundant information about hot events, user relations and attitudes, and so on. Many enterprises use high-impact Internet users to promote products, so it is very important to understand the mechanism of information transm...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi-Wiley
2020-01-01
|
Series: | Complexity |
Online Access: | http://dx.doi.org/10.1155/2020/2376451 |
id |
doaj-f0788dabd3c949d0aef1373a447f98d7 |
---|---|
record_format |
Article |
spelling |
doaj-f0788dabd3c949d0aef1373a447f98d72020-11-25T02:21:02ZengHindawi-WileyComplexity1076-27871099-05262020-01-01202010.1155/2020/23764512376451Measure User Intimacy by Mining Maximum Information Transmission PathsLin Guo0Dongliang Zhang1School of Economics and Management, Changchun University of Science and Technology, Changchun, Jilin 130022, ChinaInstitution of Technical Science, Fudan University, Shanghai 200000, ChinaThe Internet has become an important carrier of information. Its data contain abundant information about hot events, user relations and attitudes, and so on. Many enterprises use high-impact Internet users to promote products, so it is very important to understand the mechanism of information transmission. Mining social network data can help people analyze the complex and changing relationships between users. The traditional method for doing this is to analyze information such as common interests and common friends, but this data cannot truly describe the degree of intimacy between users. What really connects different users on the Internet is the delivery of information. The algorithm proposed in this paper considers the dynamic characteristics of information transmission, finds maximum transmission paths from information transmission results, and finally calculates the intimacy degrees between users according to all the maximum information transmission paths within a certain period.http://dx.doi.org/10.1155/2020/2376451 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Lin Guo Dongliang Zhang |
spellingShingle |
Lin Guo Dongliang Zhang Measure User Intimacy by Mining Maximum Information Transmission Paths Complexity |
author_facet |
Lin Guo Dongliang Zhang |
author_sort |
Lin Guo |
title |
Measure User Intimacy by Mining Maximum Information Transmission Paths |
title_short |
Measure User Intimacy by Mining Maximum Information Transmission Paths |
title_full |
Measure User Intimacy by Mining Maximum Information Transmission Paths |
title_fullStr |
Measure User Intimacy by Mining Maximum Information Transmission Paths |
title_full_unstemmed |
Measure User Intimacy by Mining Maximum Information Transmission Paths |
title_sort |
measure user intimacy by mining maximum information transmission paths |
publisher |
Hindawi-Wiley |
series |
Complexity |
issn |
1076-2787 1099-0526 |
publishDate |
2020-01-01 |
description |
The Internet has become an important carrier of information. Its data contain abundant information about hot events, user relations and attitudes, and so on. Many enterprises use high-impact Internet users to promote products, so it is very important to understand the mechanism of information transmission. Mining social network data can help people analyze the complex and changing relationships between users. The traditional method for doing this is to analyze information such as common interests and common friends, but this data cannot truly describe the degree of intimacy between users. What really connects different users on the Internet is the delivery of information. The algorithm proposed in this paper considers the dynamic characteristics of information transmission, finds maximum transmission paths from information transmission results, and finally calculates the intimacy degrees between users according to all the maximum information transmission paths within a certain period. |
url |
http://dx.doi.org/10.1155/2020/2376451 |
work_keys_str_mv |
AT linguo measureuserintimacybyminingmaximuminformationtransmissionpaths AT dongliangzhang measureuserintimacybyminingmaximuminformationtransmissionpaths |
_version_ |
1715505896153415680 |