Đăng nhập
 
Tìm kiếm nâng cao
 
Tên bài báo
Tác giả
Năm xuất bản
Tóm tắt
Lĩnh vực
Phân loại
Số tạp chí
 

Bản tin định kỳ
Báo cáo thường niên
Tạp chí khoa học ĐHCT
Tạp chí tiếng anh ĐHCT
Tạp chí trong nước
Tạp chí quốc tế
Kỷ yếu HN trong nước
Kỷ yếu HN quốc tế
Book chapter
Bài báo - Tạp chí
11 (2015) Trang: 53-58
Tạp chí: RIVF-2015: The 11th IEEE-RIVF International Conference on Computing and Communication Technologies

Maximizing the spread of influence was recently studied in several models of social networks. For location-based social networks, it also plays an important role, so a further research about this field is necessary. In this study, based on users? movement histories and their friendships, we first design the Predicting Mobility in the Near Future (PMNF) model to capture human mobility. Human mobility is inferred from the model by taking into account the following three features: (1) the regular movement of users, (2) the movement of friends of users, (3) hot regions, the most attractive places for all users. Second, from the result of predicting movements of users at each location, we determine influence of each user on friends with the condition that friends are predicted to come to the location. Third, the Influence Maximization (IM) algorithms are proposed to find a set of k influential users who can make the maximum influence on their friends according to either the number of influenced users (IM num) or the total of probability of moving the considered location of influenced users (IM score). The model and algorithms are evaluated on three large datasets collected by from 40,000 to over 60,000 users for each dataset over a period of two years in the real world at over 500,000 checked-in points as well as 400,000 to nearly 2,000,000 friendships also considered. The points are clustered into locations by density-based clustering algorithms such as OPTICS and GRID. As a result, our algorithms give an order of magnitude better performance than baseline approaches like choosing influential users based on the number of check-ins of users and selecting influential users by the number of friends of users. From the result of experiments, we are able to apply to some areas like advertisement to get the most efficient with the minimum costs. We show that our framework reliably determines the most influential users with high accuracy

Các bài báo khác
Marcin Hernes, Krystian Wojtkiewicz, Edward Szczerbicki (2020) Trang: 74-86
Tạp chí: Communications in Computer and Information Science book series
Tran Khanh Dang, Josef Küng, Makoto Takizawa, Tai M. Chung (2020) Trang: 130-148
Tạp chí: Communications in Computer and Information Science
11 (2020) Trang: 667-675
Tạp chí: International Journal of Advanced Computer Science and Applications,
Tran Khanh Dang, Josef Küng, Makoto Takizawa, Tai M. Chung (2020) Trang: 340-357
Tạp chí: Communications in Computer and Information Science
11 (2020) Trang: 651-657
Tạp chí: International Journal of Advanced Computer Science and Applications
11814 (2019) Trang: 307-319
Tạp chí: Lecture Notes in Computer Science book series (LNCS)
11 (2020) Trang: 630 - 638
Tạp chí: International Journal of Advanced Computer Science and Applications
(2019) Trang: 381-385
Tạp chí: The 11th International Conference on Knowledge and Systems Engineering (KSE 2019) --- October 24-26, 2019 | Da Nang, Vietnam
(2019) Trang: 231-236
Tạp chí: RIVF (Research, Innovation and Vision for the Future), Đà Nẵng, 20-22/03/2019
(2017) Trang:
Tạp chí: NIPS 2017 Workshop on Machine Learning for Health, in Long Beach, CA, USA 08/12/2017
(2016) Trang: 106-115
Tạp chí: 8th Asian Conference on Intelligent Information and Database Systems
 


Vietnamese | English






 
 
Vui lòng chờ...