2017 2nd International Conference on Image, Vision and Computing (ICIVC) 2017
DOI: 10.1109/icivc.2017.7984692
|View full text |Cite
|
Sign up to set email alerts
|

Efficient star nodes discovery algorithm in social networks based on acquaintance immunization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2017
2017
2017
2017

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 10 publications
0
1
0
Order By: Relevance
“…In a similarity network, the nodes (vertices) are all the tags whose valid status is 1, and if the similarity between two tags is bigger than a threshold determined by a group of experts or some kind of mechanism, then links an edge between the two tags. We can firstly conduct community detection, and then mine the star node in each community in such a network [32]. The star nodes and the isolated nodes in the network form a simplifying tag set.…”
Section: Resultsmentioning
confidence: 99%
“…In a similarity network, the nodes (vertices) are all the tags whose valid status is 1, and if the similarity between two tags is bigger than a threshold determined by a group of experts or some kind of mechanism, then links an edge between the two tags. We can firstly conduct community detection, and then mine the star node in each community in such a network [32]. The star nodes and the isolated nodes in the network form a simplifying tag set.…”
Section: Resultsmentioning
confidence: 99%