{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T00:08:55Z","timestamp":1720310935098},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,4,25]],"date-time":"2018-04-25T00:00:00Z","timestamp":1524614400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2019,1]]},"DOI":"10.1007\/s11280-018-0569-y","type":"journal-article","created":{"date-parts":[[2018,4,25]],"date-time":"2018-04-25T19:28:31Z","timestamp":1524684511000},"page":"347-373","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Worship prediction: identify followers in celebrity-dived networks"],"prefix":"10.1007","volume":"22","author":[{"given":"Shan-Yun","family":"Teng","sequence":"first","affiliation":[]},{"given":"Lo-Pang-Yun","family":"Ting","sequence":"additional","affiliation":[]},{"given":"Mi-Yen","family":"Yeh","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-3914-8550","authenticated-orcid":false,"given":"Kun-Ta","family":"Chuang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,4,25]]},"reference":[{"key":"569_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: VLDB\u201994, Proceedings of 20th international conference on very large data bases, September 12-15, 1994, Santiago de Chile (1994)"},{"key":"569_CR2","doi-asserted-by":"crossref","unstructured":"Barbieri, N., Bonchi, F., Manco, G.: Who to follow and why: link prediction with explanations. In: KDD (2014)","DOI":"10.1145\/2623330.2623733"},{"key":"569_CR3","doi-asserted-by":"crossref","unstructured":"Benchettara, N., Kanawati, R., Rouveirol, C.: A supervised machine learning link prediction approach for academic collaboration recommendation. In: RecSys (2010)","DOI":"10.1145\/1864708.1864760"},{"key":"569_CR4","doi-asserted-by":"crossref","unstructured":"Blei, D. M., Ng, A. Y., Jordan, M. I.: Latent dirichlet allocation. Journal of machine Learning research (2003)","DOI":"10.7551\/mitpress\/1120.003.0082"},{"key":"569_CR5","doi-asserted-by":"crossref","unstructured":"Davis, J., Goadrich, M.: The relationship between precision-recall and roc curves. In: ICML (2006)","DOI":"10.1145\/1143844.1143874"},{"key":"569_CR6","doi-asserted-by":"crossref","unstructured":"Dempster, A.P., Laird, N.M., Rubin, D.B. : Maximum likelihood from incomplete data via the em algorithm. Journal of the royal statistical society. Series B (methodological) (1977)","DOI":"10.1111\/j.2517-6161.1977.tb01600.x"},{"key":"569_CR7","unstructured":"Ding, X., Jin, X., Li, Y., Li, L.: Celebrity recommendation with collaborative social topic regression. In: IJCAI (2013)"},{"key":"569_CR8","doi-asserted-by":"crossref","unstructured":"Dong, Y., Zhang, J., Tang, J., Chawla, N.V., Wang, B.: Coupledlp: Link prediction in coupled networks. In: KDD (2015)","DOI":"10.1145\/2783258.2783329"},{"key":"569_CR9","unstructured":"Edwards, A.W.F.: Likelihood CUP archive (1984)"},{"key":"569_CR10","doi-asserted-by":"crossref","unstructured":"Freeman, L.C.: A set of measures of centrality based on betweenness. Sociometry (1977)","DOI":"10.2307\/3033543"},{"key":"569_CR11","unstructured":"Galuba, W., Aberer, K., Chakraborty, D., Despotovic, Z., Kellerer, W.: Outtweeting the twitterers - predicting information cascades in microblogs. In: Workshop on WOSN (2010)"},{"key":"569_CR12","unstructured":"Hammersley, J. M.: P Clifford Markov fields on finite graphs and lattices (1971)"},{"key":"569_CR13","doi-asserted-by":"crossref","unstructured":"Hopcroft, J., Lou, T., Tang, J.: Who will follow you back?: reciprocal relationship prediction. In: CIKM (2011)","DOI":"10.1145\/2063576.2063740"},{"key":"569_CR14","doi-asserted-by":"crossref","unstructured":"Hyndman, R.J., Koehler, A.B.: Another look at measures of forecast accuracy. International journal of forecasting (2006)","DOI":"10.1016\/j.ijforecast.2006.03.001"},{"key":"569_CR15","doi-asserted-by":"crossref","unstructured":"Kschischang, F.R., Frey, B.J., Loeliger, H.: Factor graphs and the sum-product algorithm. IEEE Trans. Information Theory, (2) (2001)","DOI":"10.1109\/18.910572"},{"key":"569_CR16","doi-asserted-by":"crossref","unstructured":"Kschischang, F.R., Frey, B.J., Loeliger, H.-A.: Factor graphs and the sum-product algorithm. IEEE Transactions on information theory (2001)","DOI":"10.1109\/18.910572"},{"key":"569_CR17","doi-asserted-by":"crossref","unstructured":"Kuo, T. , Yan, R. , Huang, Y., Kung, P., Lin, S.: Unsupervised link prediction using aggregative statistics on heterogeneous social networks. In: KDD (2013)","DOI":"10.1145\/2487575.2487614"},{"key":"569_CR18","doi-asserted-by":"crossref","unstructured":"Lei, S., Maniu, S., Mo, L., Cheng, R., Senellart, P.: Online influence maximization. In: KDD (2015)","DOI":"10.1145\/2783258.2783271"},{"key":"569_CR19","doi-asserted-by":"crossref","unstructured":"Li, J., Zhang, L., Meng, F., Li, F.: Recommendation algorithm based on link prediction and domain knowledge in retail transactions. Procedia Computer Science (2014)","DOI":"10.1016\/j.procs.2014.05.339"},{"key":"569_CR20","doi-asserted-by":"crossref","unstructured":"Liben-Nowell, D., Kleinberg, J.: The link-prediction problem for social networks. Journal of the Association for Information Science and Technology (2007)","DOI":"10.1002\/asi.20591"},{"key":"569_CR21","doi-asserted-by":"crossref","unstructured":"McPherson, M., Smith-Lovin, L., Cook, J.M.: Birds of a feather: Homophily in social networks. Annual review of sociology (2001)","DOI":"10.1146\/annurev.soc.27.1.415"},{"key":"569_CR22","unstructured":"Miller, K. , Jordan, M.I., Griffiths, T.L.: Nonparametric latent feature models for link prediction. In: Advances in neural information processing systems (2009)"},{"key":"569_CR23","doi-asserted-by":"crossref","unstructured":"Miyauchi A., Kawase, Y.: What is a network community?: A novel quality function and detection algorithms. In: CIKM (2015)","DOI":"10.1145\/2806416.2806555"},{"key":"569_CR24","doi-asserted-by":"crossref","unstructured":"Myers, S.A., Sharma, A. , Gupta, P., Lin, J.: Information network or social network?: the structure of the twitter follow graph. In: Proc. of WWW (2014)","DOI":"10.1145\/2567948.2576939"},{"key":"569_CR25","doi-asserted-by":"crossref","unstructured":"Newman, M.E.: Clustering and preferential attachment in growing networks. Physical Review E (2001)","DOI":"10.1103\/PhysRevE.64.025102"},{"key":"569_CR26","doi-asserted-by":"crossref","unstructured":"Peng, R., Sun, D., Tsai, W.-T.: Success factors in mobile social networking application development: case study of instagram. In: Proc. of SAC (2014)","DOI":"10.1145\/2554850.2554902"},{"key":"569_CR27","doi-asserted-by":"crossref","unstructured":"Pujari M., Kanawati, R.: Supervised rank aggregation approach for link prediction in complex networks. In: WWW (2012)","DOI":"10.1145\/2187980.2188260"},{"key":"569_CR28","doi-asserted-by":"crossref","unstructured":"Rubens, N., Elahi, M., Sugiyama, M., Kaplan, D. : Active learning in recommender systems. In: Recommender systems handbook (2015)","DOI":"10.1007\/978-1-4899-7637-6_24"},{"key":"569_CR29","unstructured":"Saito, K., Nakano, R., Kimura, M.: Prediction of link attachments by estimating probabilities of information propagation. In: KES (2007)"},{"key":"569_CR30","volume-title":"Active learning literature survey","author":"B Settles","year":"2010","unstructured":"Settles, B.: Active learning literature survey. University of Wisconsin, Madison (2010)"},{"key":"569_CR31","doi-asserted-by":"crossref","unstructured":"Tang, J., Zhang, J., Yao, L., Li, J., Zhang, L., Su, Z.: Arnetminer: extraction and mining of academic social networks. In: KDD (2008)","DOI":"10.1145\/1401890.1402008"},{"key":"569_CR32","doi-asserted-by":"crossref","unstructured":"Tang, J., Lou, T., Kleinberg, J.: Inferring social ties across heterogenous networks. In: WSDM (2012)","DOI":"10.1145\/2124295.2124382"},{"key":"569_CR33","doi-asserted-by":"crossref","unstructured":"Tasn\u00e1di, E., Berend, G.: Supervised prediction of social network links using implicit sources of information. In: WWW (2015)","DOI":"10.1145\/2740908.2743037"},{"key":"569_CR34","doi-asserted-by":"crossref","unstructured":"Wang, C., Han, J., Jia, Y., Tang, J., Zhang, D., Yu, Y., Guo, J.: Mining advisor-advisee relationships from research publication networks. In: KDD (2010)","DOI":"10.1145\/1835804.1835833"},{"key":"569_CR35","unstructured":"Wang, P., Xu, B., Wu, Y., Zhou, X.: Link prediction in social networks: the state-of-the-art. Science China Information Sciences (2015)"},{"key":"569_CR36","doi-asserted-by":"crossref","unstructured":"Zhao, T., Zhao, H.V., King, I.: Exploiting game theoretic analysis for link recommendation in social networks. In: CIKM (2015)","DOI":"10.1145\/2806416.2806510"},{"key":"569_CR37","doi-asserted-by":"crossref","unstructured":"Zheleva, E., Getoor, L., Golbeck, J., Kuter, U.: Using friendship ties and family circles for link prediction. In: Advances in social network mining and analysis. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-14929-0_6"},{"key":"569_CR38","unstructured":"Zimmerman, J., Parameswaran, L., Kurapati, K.: Celebrity recommender. Carnegie Mellon University Research Showcase (2002)"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11280-018-0569-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-018-0569-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-018-0569-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,6]],"date-time":"2024-07-06T09:11:06Z","timestamp":1720257066000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11280-018-0569-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,25]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["569"],"URL":"https:\/\/doi.org\/10.1007\/s11280-018-0569-y","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"value":"1386-145X","type":"print"},{"value":"1573-1413","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,4,25]]},"assertion":[{"value":"18 May 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 September 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 April 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 April 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}