{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,22]],"date-time":"2023-06-22T11:12:58Z","timestamp":1687432378043},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"5-6","license":[{"start":{"date-parts":[[2012,5,1]],"date-time":"2012-05-01T00:00:00Z","timestamp":1335830400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2013,11]]},"DOI":"10.1007\/s11280-012-0165-5","type":"journal-article","created":{"date-parts":[[2012,4,30]],"date-time":"2012-04-30T06:03:57Z","timestamp":1335765837000},"page":"701-727","source":"Crossref","is-referenced-by-count":4,"title":["SocialSearch \u2009+\u2009: enriching social network with web evidences"],"prefix":"10.1007","volume":"16","author":[{"given":"Gae-won","family":"You","sequence":"first","affiliation":[]},{"given":"Jin-woo","family":"Park","sequence":"additional","affiliation":[]},{"given":"Seung-won","family":"Hwang","sequence":"additional","affiliation":[]},{"given":"Zaiqing","family":"Nie","sequence":"additional","affiliation":[]},{"given":"Ji-Rong","family":"Wen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,5,1]]},"reference":[{"key":"165_CR1","doi-asserted-by":"crossref","unstructured":"Backstrom, L., Leskovec, J.: Supervised random walks: predicting and recommending links in social networks. In: Proc. WSDM, pp.\u00a0635\u2013644. ACM (2011)","DOI":"10.1145\/1935826.1935914"},{"key":"165_CR2","doi-asserted-by":"crossref","unstructured":"Bekkerman, R., McCallum, A.: Disambiguating web appearances of people in a social network. In: Proc. WWW, pp.\u00a0463\u2013470. ACM (2005)","DOI":"10.1145\/1060745.1060813"},{"issue":"1\u20137","key":"165_CR3","first-page":"107","volume":"30","author":"S Brin","year":"1998","unstructured":"Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. Comput. Netw. 30(1\u20137), 107\u2013117 (1998)","journal-title":"Comput. Netw."},{"key":"165_CR4","doi-asserted-by":"crossref","unstructured":"Chen, J., Geyer, W., Dugan, C., Muller, M., Guy, I.: Make new friends, but keep the old: recommending people on social networking sites. In: Proc. CHI, pp.\u00a0201\u2013210. ACM (2009)","DOI":"10.1145\/1518701.1518735"},{"key":"165_CR5","unstructured":"Google: Freebase data dumps. http:\/\/download.freebase.com\/datadumps\/ (2010). Accessed 18 Nov 2010"},{"key":"165_CR6","doi-asserted-by":"crossref","unstructured":"Guy, I., Zwerdling, N., Carmel, D., Ronen, I., Uziel, E., Yogev, S., Ofek-Koifman, S.: Personalized recommendation of social software items based on social relations. In: RecSys, pp.\u00a053\u201360. ACM (2009)","DOI":"10.1145\/1639714.1639725"},{"issue":"2","key":"165_CR7","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1145\/980972.981001","volume":"5","author":"S Hill","year":"2003","unstructured":"Hill, S., Provost, F.: The myth of the double-blind review?: author identification using only citations. SIGKDD Explorations Newsletter 5(2), 179\u2013184 (2003)","journal-title":"SIGKDD Explorations Newsletter"},{"issue":"3","key":"165_CR8","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/s11280-008-0042-4","volume":"11","author":"B Hu","year":"2008","unstructured":"Hu, B., Hu, B.: On capturing semantics in ontology mapping. World Wide Web 11(3), 361\u2013385 (2008)","journal-title":"World Wide Web"},{"key":"165_CR9","doi-asserted-by":"crossref","unstructured":"Java, A., Song, X., Finin, T., Tseng, B.: Why we Twitter: understanding microblogging usage and communities. In: Proc. WebKDD\/SNA-KDD, pp.\u00a056\u201365. ACM (2007)","DOI":"10.1145\/1348549.1348556"},{"key":"165_CR10","doi-asserted-by":"crossref","unstructured":"Joachims, T.: Making large-scale support vector machine learning practical. MIT Press (1999)","DOI":"10.7551\/mitpress\/1130.003.0015"},{"key":"165_CR11","doi-asserted-by":"crossref","unstructured":"Joachims, T.: Optimizing search engines using clickthrough data. In: Proc. SIGKDD, pp.\u00a0133\u2013142. ACM (2002)","DOI":"10.1145\/775066.775067"},{"key":"165_CR12","doi-asserted-by":"crossref","unstructured":"Joachims, T.: Training linear SVMs in linear time. In: Proc. SIGKDD, pp.\u00a0217\u2013226. ACM (2006)","DOI":"10.1145\/1150402.1150429"},{"key":"165_CR13","doi-asserted-by":"crossref","unstructured":"Konstas, I., Stathopoulos, V., Jose, J.M.: On social networks and collaborative recommendation. In: Proc. SIGIR, pp.\u00a0195\u2013202. ACM (2009)","DOI":"10.1145\/1571941.1571977"},{"key":"165_CR14","doi-asserted-by":"crossref","unstructured":"Lee, J., Hwang, S.-w., Nie, Z., Wen, J.-R.: Query result clustering for object-level search. In: Proc. SIGKDD, pp.\u00a01205\u20131214. ACM (2009)","DOI":"10.1145\/1557019.1557149"},{"key":"165_CR15","unstructured":"Melnik, S., Garcia-Molina, H., Rahm, E.: Similarity flooding: a versatile graph matching algorithm and its application to schema matching. In: Proc. ICDE, pp.\u00a0117\u2013128. IEEE Computer Society (2002)"},{"key":"165_CR16","doi-asserted-by":"crossref","unstructured":"Musia\u0142, K., Kazienko, P.: Social networks on the internet. World Wide Web 1\u201342 (2012, in press). doi: 10.1007\/s11280-011-0155-z","DOI":"10.1007\/s11280-011-0155-z"},{"key":"165_CR17","doi-asserted-by":"crossref","unstructured":"Narayanan, A., Shmatikov, V.: Robust de-anonymization of large sparse datasets. In: Proc. S&P, pp.\u00a0111\u2013125. IEEE Computer Society (2008)","DOI":"10.1109\/SP.2008.33"},{"key":"165_CR18","doi-asserted-by":"crossref","unstructured":"Narayanan, A., Shmatikov, V.: De-anonymizing social networks. In: Proc. S&P, pp.\u00a0173\u2013187. IEEE Computer Society (2009)","DOI":"10.1109\/SP.2009.22"},{"key":"165_CR19","unstructured":"Nie, Z., Wen, J.-R., Ma, W.-Y.: Object-level vertical search. In: Proc. CIDR, pp.\u00a0235\u2013246 (2007)"},{"key":"165_CR20","doi-asserted-by":"crossref","unstructured":"On, B.-W., Lee, D., Kang, J., Mitra, P.: Comparative study of name disambiguation problem using a scalable blocking-based framework. In: Proc. JCDL, pp.\u00a0344\u2013353. ACM (2005)","DOI":"10.1145\/1065385.1065463"},{"key":"165_CR21","doi-asserted-by":"crossref","unstructured":"Taneva, B., Kacimi, M., Weikum, G.: Gathering and ranking photos of named entities with high precision, high recall, and diversity. In: Proc. WSDM, pp. 431\u2013440. ACM (2010)","DOI":"10.1145\/1718487.1718541"},{"key":"165_CR22","doi-asserted-by":"crossref","unstructured":"Yin, Z., Gupta, M., Weninger, T., Han, J.: LINKREC: a unified framework for link recommendation with user attributes and graph structure. In: Proc. WWW, pp. 1211\u20131212. ACM (2010)","DOI":"10.1145\/1772690.1772879"},{"key":"165_CR23","doi-asserted-by":"crossref","unstructured":"You, G.-w., Hwang, S.-w., Nie, Z., Wen, J.-R.: SocialSearch: enhancing entity search with social network matching. In: Proc. EDBT, pp.\u00a0515\u2013519. ACM (2011)","DOI":"10.1145\/1951365.1951428"},{"key":"165_CR24","doi-asserted-by":"crossref","unstructured":"Zhu, J., Nie, Z., Liu, X., Zhang, B., Wen, J.-R.: StatSnowball: a statistical approach to extracting entity relationships In: Proc. WWW, pp. 101\u2013110. ACM (2009)","DOI":"10.1145\/1526709.1526724"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-012-0165-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11280-012-0165-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-012-0165-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,22]],"date-time":"2023-06-22T10:32:13Z","timestamp":1687429933000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11280-012-0165-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,1]]},"references-count":24,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2013,11]]}},"alternative-id":["165"],"URL":"https:\/\/doi.org\/10.1007\/s11280-012-0165-5","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"value":"1386-145X","type":"print"},{"value":"1573-1413","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,5,1]]}}}