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: | Waranya Mahanan, Juggapong Natwichai, Kazuo Mori |
---|---|
Format: | Conference Proceeding |
Published: |
2018
|
Subjects: | |
Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84946686844&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/53385 |
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: Mahanan,W., et al.
Published: (2015) -
An efficient approach for data-duplication detection based on RDBMS
by: Kiettisak Chanhom, et al.
Published: (2018) -
Data anonymization: a novel optimal k-anonymity algorithm for identical generalization hierarchy data in IoT
by: Waranya Mahanan, et al.
Published: (2020) -
Efficient data update for location-based recommendation systems
by: Narin Jantaraprapa, et al.
Published: (2018)