Dynamic node adaptive incremental interaction optimisation in micro-blogging community Online publication date: Mon, 04-May-2020
by Fei Shang; Xiaobo Nie
International Journal of Innovative Computing and Applications (IJICA), Vol. 11, No. 2/3, 2020
Abstract: Most community discovery methods are based on network topology and edge density for best community determination, but these methods have very high computational complexity and are very sensitive to the form and type of network. In order to solve these problems, this paper proposes a micro-blogging community interaction optimisation algorithm based on dynamic node adaptive increment model, which is based on optimising the interaction of members in each community, and uses greedy algorithm to search the best candidate for the optimal community effectively without traversing all nodes. The model can quickly and accurately measure the interaction difference between the community and the community. Finally, the simulation tests on the datum test network and the Sohu micro-blogging platform show that the proposed algorithm is better than the selected contrast algorithm in the index of recall, accuracy, algorithm calculation time and network coverage.
Online publication date: Mon, 04-May-2020
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Innovative Computing and Applications (IJICA):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email email@example.com