10 S. Li, X. Song and H. Lu et al. / Expert Systems With Applications 139 (2020) 112839
which means the mechanism to select the appropriate AAIs based
on network characteristics is effective.
Finally, paired samples of any two algorithms’ AUC in 100 ex-
periments were collected and Student t -test was adopted to de-
termine whether the means of the two samples were statistically
equal. Consequently, all the determined P -Values are less than the
significant level 5%, which shows that there are significant differ-
ences among algorithms. These results show that IAALPA can pro-
vide reliable and accurate prediction of friendships between users
in various product circles in the brand community, and at the same
time, it also offers a promising method to recommend friends for
cross-marketing in online brand community.
5.3. Analysis of IAALPA performance under various networks
In order to further analyze the accuracy of friend group rec-
ommendation of IAALPA in different circle densities, in this study,
networks with the number of product circles ranging from a much
smaller value at 2 to a larger value at 12 in the Twitter and fluc-
tuating from a much smaller value at 2 to a larger value at 6 in
Google + data set were selected. In addition to IAALPAa, we sep-
arately selected AAIs with better performance in Tables 5 and 6 ,
namely S7 and S12, to analyze their performance under various
network densities. Tables 7 , 8 , Figs. 8 and 9 give the prediction
accuracy of IAALPA, S7, and S12 in different networks.
It can be seen from Tables 7 and 8 that IAALPA has high rec-
ommendation accuracy in both networks with more product cir-
cles and networks with fewer circles and acquires the best average
AUC 0.8664 in the Twitter experiments and 0.9071 in the Google +
experiments. It can be seen from Figs. 8 and 9 that IAALPAa pro-
duces the superior performance in both circles with large num-
ber of nodes (i.e. node density) and circles with small number of
nodes (i.e. node sparseness). However, S12 achieves the worst per-
formance when the node density is intermediate in Twitter, and
S7 obtains the worst performance when the node density is small
in Google + . These indicate that IAALPA is good at recommending
friend group in both dense and sparse networks.
6. Conclusion
The group of friends has a great influence on the attitudes, be-
haviors and even feelings of individuals. In this study, the users in
one product circle who are likely to be friends with the target cus-
tomer in another product circle are identified and recommended
by IAALPA. By friend group’s influence, cross-marketing of prod-
ucts can be achieved successfully, that is, new target customer will
purchase products preferred by friend group.
To overcome the problem of network sparsity being faced when
predicting the friendships between users in different circles, based
on the principle of attention allocation of common friends in
the triadic closure structure, IAALPA extracts the AAIs based on
not only the microscopic network structure, but also macroscopic
network structure. Consequently, IAALPA can comprehensively de-
scribe the possibility of links between node pairs. Furthermore, in-
stead of using fixed AAI to predict links in various networks, DT
model is developed to select the suitable AAI for the given net-
work based on the network characteristics of the common friend
density and the dispersion level of common friends’ attention. Sub-
sequently, based on the value, direction, and ranking similarities of
AAIs, SVM is designed to identify AAIs which are complementary
to the optimal AAI selected by DT and the ideal composite AAI by
integrating these mutually complementary AAIs is constructed. As
a result, the problems of performance degradation in combination
prediction model, which is caused by randomly integrating SLPAs,
are overcome once and for all.
Experimental results on 971 online communities in the Twit-
ter network and 132 online communities in the Google + network
show that the IAALPA proposed in this study achieves more ac-
curate and reliable link prediction performance. And AAIs con-
structed based on the idea of attention allocation of common
friends in both microscopic and macroscopic network structure are
superior in the harsh scenario where network sparsity is faced
when predicting friendships between users in different circles.
Therefore, IAALPA provides strong support for marketers to use on-
line brand communities to achieve profitable cross-marketing.
In the future, we will propose more link prediction algorithms
and integrate them into the proposed prediction framework to fur-
ther improve prediction accuracy. Furthermore, we will explore the
performance of the framework in different types of network struc-
tures, such as the dynamic network and the network integrating
different social networks.
Declaration of Competing Interest
The authors declare that we have no conflicts of interest to this
work.
Credit authorship contribution statement
Shugang Li: Conceptualization, Formal analysis, Funding acqui-
sition, Methodology. Xuewei Song: Validation. Hanyu Lu: Writing
- original draft. Linyi Zeng: Data curation, Investigation. Miaojing
Shi: Writing - review & editing. Fang Liu: Writing - review & edit-
ing.
Acknowlgedgments
This work was supported by the Chinese National Natural Sci-
ence Foundation (no. 71871135 ).
References
Adamic, L. A., & Adar, E. (2003). Friends and neighbors on the web. Social Networks,
25 (3), 211–230. doi: 10.1016/S0378-8733(03)0 0 0 09-1 .
Aral, S. (2013). What would Ashton do–and does it matter? New research reveals
the power and limits of “influencers”. (Idea Watch). Harvard Business Review,
91 (5), 25–27
.
Backstrom, L., Bakshy, E., Kleinberg, J., Lento, T. M., & Rosenn, I. (2011). Center of at-
tention: How Facebook users allocate attention across friends. In In Proceedings
of the fifth international AAAAI conference on weblogs and social media (pp. 34–
41). AAAI. doi: 10.1016/S0378-4371(02)00736-7 .
Barabâsi, A. L., Jeong, H., Néda, Z., Ravasz, E., Schubert, A., & Vicsek, T. (2002). Evo-
lution of the social network of scientific collaborations. Physica A: Statistical
Mechanics and its Applications, 311 (3–4), 590–614. doi: 10.1016/S0378- 4371(02)
00736-7 .
Brogi, S. (2014). Online brand communities: A literature review. Procedia-Social and
Behavioral Sciences, 109 , 385–389.
doi: 10.1016/j.sbspro.2013.12.477 .
Fan, C., Liu, Z., Lu, X., Xiu, B., & Chen, Q. (2017). An efficient link prediction index
for complex military organization. Physica A: Statistical Mechanics and its Appli-
cations, 469 , 572–587. doi: 10.1016/j.physa.2016.11.097 .
Gomes, H. M., Barddal, J. P., Enembreck, F., & Bifet, A. (2017). A
survey on ensem-
ble learning for data stream classification. ACM Computing Surveys, 50 (2), 23:1–
23:36. doi: 10.1145/3054925 .
He, C., Li, H., Fei, X., Yang, A., Tang, Y., & Zhu, J. (2017). A topic community-based
method for friend recommendation in large-scale online social networks. Con-
currency and Computation: Practice and
Experience, 29 (6), 1–20. doi: 10.1002/cpe.
3924 .
Huang, Z. (2006). Link prediction based on graph topology: The predictive value of gen-
eralized clustering coefficient .
John, L. K. , Mochon, D. , Emrich, O. , & Schwartz, J. (2017). What’s the value of a
like? Social media endorsements don’t
work the way you might think. Harvard
Business Review, 95 (2), 108–115 .
Kaya, B., & Poyraz, M. (2016). Unsupervised link prediction in evolving abnormal
medical parameter networks. International Journal of Machine Learning and Cy-
bernetics, 7 (1), 145–155. doi: 10.1007/s13042- 015- 0405- y .
Lei, J., & Rinaldo, A. (2015).
Consistency of spectral clustering in stochastic block
models. The Annals of Statistics, 43 (1), 215–237. doi: 10.1214/14- AOS1274 .
Li, Y. M., Chou, C. L., & Lin, L. F. (2014). A social recommender mechanism for
location-based group commerce. Information Sciences, 274 , 125–142. doi: 10.
1016/j.ins.2014.02.079 .