By Topic

Discovery of Core-Nodes in Event-Based Social Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Shaojie Yuan ; Sch. of Comput. Sci. & Software Eng., Univ. of Wollongong, Wollongong, NSW, Australia ; Quan Bai ; Minjie Zhang ; Khin Than Win

Most previous actor-node ranking algorithms for event-based social networks only consider how many events an actor participates in. However in event-based social networks, we should also consider the influence of events when we rank actor-nodes. In this paper we formally define event-based social networks and related concepts, then we propose rules to construct an event-based social network. Algorithms are presented to discover the activity and importance of each actor-node. We test the algorithms by analysing the DBLP data set. In the experiment actors in DBLP data set are ranked based on their activity, importance, and combination of activity and importance, respectively.

Published in:

Fuzzy Systems and Knowledge Discovery, 2009. FSKD '09. Sixth International Conference on  (Volume:2 )

Date of Conference:

14-16 Aug. 2009