Centrality-burst detection in social networks: An efficient approach for data stream
© 2014 IEEE. In large social networks, being able to identify the key members, or so called central members, is one of the most important issues. Such members could be a good starting point for further analyzing. For example, the key members' activities with regard to the targeted products coul...
Saved in:
Main Authors: | Mahanan,W., Natwichai,J., Mori,K. |
---|---|
Format: | Conference or Workshop Item |
Published: |
2015
|
Online Access: | http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=84923995230&origin=inward http://cmuir.cmu.ac.th/handle/6653943832/39110 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Chiang Mai University |
Similar Items
-
Centrality-burst detection in social networks: An efficient approach for data stream
by: Waranya Mahanan, et al.
Published: (2018) -
Centrality-burst detection in social networks: An efficient approach for data stream
by: Waranya Mahanan, et al.
Published: (2018) -
An efficient approach for data-duplication detection based on RDBMS
by: Chanhom K., et al.
Published: (2014) -
An efficient approach for data-duplication detection based on RDBMS
by: Kiettisak Chanhom, et al.
Published: (2018) -
Algorithms for burst rescheduling in WDM optical burst switching networks
by: Tan, S.K., et al.
Published: (2014)