{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T01:13:14Z","timestamp":1773537194691,"version":"3.50.1"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,5,1]],"date-time":"2008-05-01T00:00:00Z","timestamp":1209600000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["New Gener. Comput."],"published-print":{"date-parts":[[2008,5]]},"DOI":"10.1007\/s00354-008-0043-y","type":"journal-article","created":{"date-parts":[[2008,6,3]],"date-time":"2008-06-03T13:36:54Z","timestamp":1212500214000},"page":"245-257","source":"Crossref","is-referenced-by-count":47,"title":["Link Prediction based on Structural Properties of Online Social Networks"],"prefix":"10.1007","volume":"26","author":[{"given":"Tsuyoshi","family":"Murata","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sakiko","family":"Moriyasu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,6,4]]},"reference":[{"issue":"3","key":"43_CR1","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0378-8733(03)00009-1","volume":"25","author":"L.A. Adamic","year":"2003","unstructured":"Adamic, L. A., Adar, E., \u201cFriends and Neighbors on the Web,\u201d Social Networks, 25(3),pp.211-230, 2003.","journal-title":"Social Networks"},{"key":"43_CR2","unstructured":"Barabasi, A. L., Linked - The New Science of Networks, Perseus, 2002."},{"issue":"2","key":"43_CR3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/1117454.1117456","volume":"7","author":"L. Getoor","year":"2005","unstructured":"Getoor, L., Diehl, C. P., \u201cLink Mining: A Survey,\u201d SIGKDD Explorations, 7(2), pp.3-12, 2005.","journal-title":"SIGKDD Explorations"},{"key":"43_CR4","unstructured":"Hasan, M. A., Chaoji, V., Salem, S., Zaki, M., \u201cLink Prediction using Supervised Learning,\u201d in Workshop on Link Discovery; Issues, Approaches and Applications (LinkKDD-2005), 2005."},{"key":"43_CR5","unstructured":"Huang, Z., \u201cLink Prediction Based on Graph Topology: The Predictive Value of the Generalized Clustering Coefficient,\u201d in Workshop on Link Analysis; Dynamics and Static of Large Networks, (LinkKDD-2006), 2006."},{"key":"43_CR6","doi-asserted-by":"crossref","unstructured":"Kashima, H., Abe, N., \u201cA Parameterized Probabilistic Model of Network Evolution for Supervised Link Prediction,\u201d in Proc. of the Sixth IEEE Int. Conf. on Data Mining(ICDM\u201906), 2006.","DOI":"10.1109\/ICDM.2006.8"},{"issue":"2","key":"43_CR7","first-page":"27","volume":"18","author":"H. Kautz","year":"1997","unstructured":"Kautz, H., Selman, B., Shah, M., \u201cThe Hidden Web,\u201d AI Magazine, 18(2), pp. 27-36, 1997.","journal-title":"AI Magazine"},{"key":"43_CR8","doi-asserted-by":"crossref","unstructured":"Liben-Nowell, D., Kleinberg, J., \u201cThe Link Prediction Problem for Social Networks,\u201d in Proc. of the Twelfth Int. Conf. on Information and Knowledge Management (CIKM), pp.556-559, 2003.","DOI":"10.1145\/956863.956972"},{"key":"43_CR9","doi-asserted-by":"crossref","unstructured":"Newman, M. E., \u201cClustering and Preferential Attachment in Growing Networks,\u201d Physical Review Letters E, 64 (025102), 2001.","DOI":"10.1103\/PhysRevE.64.025102"},{"issue":"2","key":"43_CR10","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/1117454.1117458","volume":"7","author":"J. O\u2019Madadhaim","year":"2005","unstructured":"O\u2019Madadhaim, J., Hutchins, J., Smyth, P., \u201cPrediction and ranking algorithms for event-based network data,\u201d SIGKDD Explorations, 7(2), pp.23-30, 2005","journal-title":"SIGKDD Explorations"},{"key":"43_CR11","unstructured":"Popescul, A., Ungar, L. H., \u201cStatistical relational learning for link prediction,\u201d in IJCAI Workshop on Learning Statistical Models from Relational Data, 2003."},{"key":"43_CR12","doi-asserted-by":"crossref","unstructured":"Sarukkai, R. R., \u201cLink Prediction and Path Analysis Using Markov Chains,\u201d in Proc. of the Ninth Int. World Wide Web Conf. (WWW9), 2000.","DOI":"10.1016\/S1389-1286(00)00044-X"},{"key":"43_CR13","unstructured":"Taskar, B., Wong, M.-F., Abbeel, P., Koller, D., \u201cLink Prediction in Relational Data,\u201d in Proc. of Neural Information Processing Systems Conf. (NIPS), 2003."}],"container-title":["New Generation Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00354-008-0043-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00354-008-0043-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00354-008-0043-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:27:49Z","timestamp":1559039269000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00354-008-0043-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,5]]}},"alternative-id":["43"],"URL":"https:\/\/doi.org\/10.1007\/s00354-008-0043-y","relation":{},"ISSN":["0288-3635","1882-7055"],"issn-type":[{"value":"0288-3635","type":"print"},{"value":"1882-7055","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,5]]}}}