2014
DOI: 10.1109/tmm.2014.2298216
|View full text |Cite
|
Sign up to set email alerts
|

Topic-Sensitive Influencer Mining in Interest-Based Social Media Networks via Hypergraph Learning

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
47
0

Year Published

2015
2015
2018
2018

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 97 publications
(47 citation statements)
references
References 49 publications
0
47
0
Order By: Relevance
“…Therefore, we establish a hyperedge containing the users who commonly follow a target person. The weight of a user hyperedge is defined as the average similarity over all pairs of vertices linked with the hyperedge, which is in line with the intuition that a high weight should be assigned to a hyperedge if the users within it are close to each other [Fang et al 2014]. Similar to previous work [Cui et al 2014], for two users u ∈ I and v ∈ I, we estimate their similarity by measuring how many groups and persons are co-joined or co-followed by u and v:…”
Section: Bi-relational Hypergraph Representationmentioning
confidence: 94%
See 1 more Smart Citation
“…Therefore, we establish a hyperedge containing the users who commonly follow a target person. The weight of a user hyperedge is defined as the average similarity over all pairs of vertices linked with the hyperedge, which is in line with the intuition that a high weight should be assigned to a hyperedge if the users within it are close to each other [Fang et al 2014]. Similar to previous work [Cui et al 2014], for two users u ∈ I and v ∈ I, we estimate their similarity by measuring how many groups and persons are co-joined or co-followed by u and v:…”
Section: Bi-relational Hypergraph Representationmentioning
confidence: 94%
“…For the adjustment parameter η in Equation (8), we treated the grouping factor and the following factor equally and set η = 0.5. For the number of nearest neighbors k considered when constructing the POI hypergraph, empirical studies [Fang et al 2014; have showed that a relatively small number of k is sufficient to make the graph connected. We thus set k = 5 to make the POI hypergraph sparse for computational efficiency.…”
Section: Parameter Settingsmentioning
confidence: 99%
“…In any case, refreshing and appropriation of the street delineate is an unpredictable and high cost handle. Inquire about [10] proposed outline work for Topic-Sensitive Influencer Mining (TSIM).In which, impact estimation of clients and pictures is resolved with hypergraph learning approach. It uses visual-textual content relations to develop homogeneous hyper edges for the point appropriation learning and social connection relations to develop heterogeneous hyper edges for impact positioning in the system.…”
Section: Literature Surveymentioning
confidence: 99%
“…Domestic and foreign researchers design qualitative or quantitative measurements before studying on user influence [1][2][3][4][5][6][7], and information propagation [8][9][10][11][12]. Me young et al [13] present an in-depth comparison of three measures of influence: in degree, retweets, and mention.…”
Section: Related Workmentioning
confidence: 99%