{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T16:42:42Z","timestamp":1725986562999},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319903118"},{"type":"electronic","value":"9783319903125"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-90312-5_8","type":"book-chapter","created":{"date-parts":[[2018,7,31]],"date-time":"2018-07-31T03:45:53Z","timestamp":1533008753000},"page":"119-132","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Extended Feature-Driven Graph Model for Social Media Networks"],"prefix":"10.1007","author":[{"given":"Ziyaad","family":"Qasem","sequence":"first","affiliation":[]},{"given":"Tobias","family":"Hecking","sequence":"additional","affiliation":[]},{"given":"Benjamin","family":"Cabrera","sequence":"additional","affiliation":[]},{"given":"Marc","family":"Jansen","sequence":"additional","affiliation":[]},{"given":"H. Ulrich","family":"Hoppe","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,1]]},"reference":[{"issue":"5439","key":"8_CR1","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barabsi","year":"1999","unstructured":"Barabsi, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509\u2013512 (1999)","journal-title":"Science"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Barrett, C.L., Beckman, R.J., Khan, M.K., Kumar, V.S.A., Marathe, M.V., Stretz, P.E., Dutta, T., Lewis, B.: Generation and analysis of large synthetic social contact networks. In: Proceedings of the Winter Simulation Conference (WSC), pp. 1003\u20131014. IEEE, New York (2009)","DOI":"10.1109\/WSC.2009.5429425"},{"issue":"4","key":"8_CR3","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1137\/070710111","volume":"51","author":"A Clauset","year":"2009","unstructured":"Clauset, A., Shalizi, C.R., Newman, M.E.J.: Power-law distributions in empirical data. SIAM Rev. 51(4), 661\u2013703 (2009)","journal-title":"SIAM Rev."},{"key":"8_CR4","unstructured":"Erdos, P., R\u00e9nyi, A.: On random graphs, I. Publ. Math. (Debrecen) 6, 290\u2013297 (1959)"},{"issue":"6","key":"8_CR5","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1016\/S0167-8655(01)00017-4","volume":"22","author":"ML Fern\u00e1ndez","year":"2001","unstructured":"Fern\u00e1ndez, M.L., Valiente, G.: A graph distance metric combining maximum common subgraph and minimum common supergraph. Pattern Recogn. Lett. 22(6), 753\u2013758 (2001)","journal-title":"Pattern Recogn. Lett."},{"issue":"4","key":"8_CR6","doi-asserted-by":"publisher","first-page":"1141","DOI":"10.1214\/aoms\/1177706098","volume":"30","author":"EN Gilbert","year":"1959","unstructured":"Gilbert, E.N.: Random graphs. Ann. Math. Stat. 30(4), 1141\u20131144 (1959)","journal-title":"Ann. Math. Stat."},{"issue":"2","key":"8_CR7","doi-asserted-by":"publisher","first-page":"026120","DOI":"10.1103\/PhysRevE.73.026120","volume":"73","author":"EA Leicht","year":"2006","unstructured":"Leicht, E.A., Holme, P., Newman, M.E.J.: Vertex similarity in networks. Phys. Rev. E 73(2), 026120 (2006)","journal-title":"Phys. Rev. E"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Faloutsos, C.: Scalable modeling of real graphs using Kronecker multiplication. In: Proceedings of the 24th International Conference on Machine Learning, pp. 497\u2013504. ACM, New York (2007)","DOI":"10.1145\/1273496.1273559"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Kleinberg, J., Faloutsos, C.: Graphs over time: densification laws, shrinking diameters and possible explanations. In: Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining, pp. 177\u2013187. ACM, New York (2005)","DOI":"10.1145\/1081870.1081893"},{"issue":"4","key":"8_CR10","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1145\/1151659.1159930","volume":"36","author":"P Mahadevan","year":"2006","unstructured":"Mahadevan, P., Krioukov, D., Fall, K., Vahdat, A.: Systematic topology analysis and generation using degree correlations. ACM SIGCOMM Comput. Commun. Rev. 36(4), 135\u2013146 (2006)","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"issue":"1","key":"8_CR11","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/1111322.1111328","volume":"36","author":"P Mahadevan","year":"2006","unstructured":"Mahadevan, P., Krioukov, D., Fomenkov, M.F., Dimitropoulos, X., Vahdat, A.: The internet as-level topology: three data sources and one definitive metric. ACM SIGCOMM Comput. Commun. Rev. 36(1), 17\u201326 (2006)","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"issue":"5","key":"8_CR12","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1109\/34.682179","volume":"20","author":"BT Messmer","year":"1998","unstructured":"Messmer, B.T., Bunke, H.: A new algorithm for error-tolerant subgraph isomorphism detection. IEEE Trans. Pattern Anal. Mach. Intell. 20(5), 493\u2013504 (1998)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"2","key":"8_CR13","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1080\/15427951.2004.10129088","volume":"1","author":"M Mitzenmacher","year":"2004","unstructured":"Mitzenmacher, M.: A brief history of generative models for power law and lognormal distributions. Internet Math. 1(2), 226\u2013251 (2004)","journal-title":"Internet Math."},{"issue":"20","key":"8_CR14","doi-asserted-by":"publisher","first-page":"208701","DOI":"10.1103\/PhysRevLett.89.208701","volume":"89","author":"MEJ Newman","year":"2002","unstructured":"Newman, M.E.J.: Assortative mixing in networks. Phys. Rev. Lett. 89(20), 208701 (2002)","journal-title":"Phys. Rev. Lett."},{"issue":"2","key":"8_CR15","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"ME Newman","year":"2003","unstructured":"Newman, M.E.: The structure and function of complex networks. SIAM Rev. 45(2), 167\u2013256 (2003)","journal-title":"SIAM Rev."},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Newman, M.: Networks: An Introduction, pp.1\u20132. Oxford University Press, New York (2010)","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Park, K., Han, Y., Lee, Y.K.: An efficient method for computing similarity between frequent subgraphs. In: Third International Conference Cloud and Green Computing (CGC), pp. 566\u2013567. IEEE, New York (2013)","DOI":"10.1109\/CGC.2013.97"},{"issue":"1","key":"8_CR18","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1186\/s40649-016-0036-9","volume":"3","author":"Z Qasem","year":"2016","unstructured":"Qasem, Z., Jansen, M., Hecking, T., Hoppe, H.U.: Detection of strong attractors in social media networks. Comput. Soc. Netw. 3(1), 11 (2016)","journal-title":"Comput. Soc. Netw."},{"key":"8_CR19","first-page":"123","volume-title":"Studies in Computational Intelligence","author":"Ziyaad Qasem","year":"2016","unstructured":"Qasem, Z., Jansen, M., Hecking, T., Hoppe, H.U.: Influential actors detection using attractiveness model in social media networks. In: International Workshop on Complex Networks and their Applications, pp. 123\u2013134. Springer, Berlin (2016)"},{"issue":"1","key":"8_CR20","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1186\/s40649-017-0040-8","volume":"4","author":"Z Qasem","year":"2017","unstructured":"Qasem, Z., Jansen, M., Hecking, T., Hoppe, H.U.: Using attractiveness model for actors ranking in social media networks. Comput. Soc. Netw. 4(1), 3 (2017)","journal-title":"Comput. Soc. Netw."},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Sala, A., Cao, L., Wilson, C., Zablit, R., Zheng, H., Zhao, B.Y.: Measurement-calibrated graph models for social network experiments. In: Proceedings of the 19th International Conference on World Wide Web, pp. 861\u2013870. ACM, New York (2010)","DOI":"10.1145\/1772690.1772778"},{"issue":"2","key":"8_CR22","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1214\/aoms\/1177730256","volume":"19","author":"N Smirnov","year":"1948","unstructured":"Smirnov, N.: Table for estimating the goodness of fit of empirical distributions. Ann. Math. Stat. 19(2), 279\u2013281 (1948)","journal-title":"Ann. Math. Stat."},{"issue":"2","key":"8_CR23","first-page":"107","volume":"13","author":"R Solomonoff","year":"1951","unstructured":"Solomonoff, R., Rapoport, A.: Connectivity of random nets. Bull. Math. Biol. 13(2), 107\u2013117 (1951)","journal-title":"Bull. Math. Biol."},{"issue":"7024","key":"8_CR24","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1038\/nature03248","volume":"433","author":"C Song","year":"2005","unstructured":"Song, C., Havlin, S., Makse, H.A.: Self-similarity of complex networks. Nature 433(7024), 392\u2013395 (2005)","journal-title":"Nature"},{"issue":"11","key":"8_CR25","doi-asserted-by":"publisher","first-page":"5481","DOI":"10.1109\/TSP.2010.2059019","volume":"58","author":"VYF Tan","year":"2010","unstructured":"Tan, V.Y.F., Sanghavi, S., Fisher, J.W., Willsky, A.S.: Learning graphical models for hypothesis testing and classification. IEEE Trans. Signal Process. 58(11), 5481\u20135495 (2010)","journal-title":"IEEE Trans. Signal Process."},{"key":"8_CR26","first-page":"1","volume":"94","author":"A Topirceanu","year":"2016","unstructured":"Topirceanu, A., Udrescu, M.: Statistical fidelity: a tool to quantify the similarity between multi-variable entities with application in complex networks. Int. J. Comput. Math. 94, 1\u201319 (2016)","journal-title":"Int. J. Comput. Math."},{"issue":"5","key":"8_CR27","doi-asserted-by":"publisher","first-page":"056104","DOI":"10.1103\/PhysRevE.67.056104","volume":"67","author":"A Vazquez","year":"2003","unstructured":"Vazquez, A.: Growing network with local rules: preferential attachment, clustering hierarchy, and degree correlations. Phys. Rev. E 67(5), 056104 (2003)","journal-title":"Phys. Rev. E"},{"key":"8_CR28","first-page":"18","volume":"8","author":"J Wang","year":"2003","unstructured":"Wang, J., Tsang, W.W., Marsaglia, G.: Evaluating Kolmogorov\u2019s distribution. J. Stat. Softw. 8, 18 (2003)","journal-title":"J. Stat. Softw."},{"issue":"6684","key":"8_CR29","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of small-world networks. Nature 393(6684), 440\u2013442 (1998)","journal-title":"Nature"},{"key":"8_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-0741-6","volume-title":"Network Analysis Literacy: A Practical Approach to the Analysis of Networks","author":"KA Zweig","year":"2016","unstructured":"Zweig, K.A.: Network Analysis Literacy: A Practical Approach to the Analysis of Networks. Springer, Berlin (2016)"}],"container-title":["Lecture Notes in Social Networks","Network Intelligence Meets User Centered Social Media Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-90312-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,7,31]],"date-time":"2018-07-31T03:48:01Z","timestamp":1533008881000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-90312-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319903118","9783319903125"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-90312-5_8","relation":{},"ISSN":["2190-5428","2190-5436"],"issn-type":[{"type":"print","value":"2190-5428"},{"type":"electronic","value":"2190-5436"}],"subject":[],"published":{"date-parts":[[2018]]}}}