{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T05:04:46Z","timestamp":1747890286137,"version":"3.41.0"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319181226"},{"type":"electronic","value":"9783319181233"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-18123-3_24","type":"book-chapter","created":{"date-parts":[[2015,4,8]],"date-time":"2015-04-08T07:51:48Z","timestamp":1428479508000},"page":"399-417","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["An Efficient Method to Find the Optimal Social Trust Path in Contextual Social Graphs"],"prefix":"10.1007","author":[{"given":"Guanfeng","family":"Liu","sequence":"first","affiliation":[]},{"given":"Lei","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Kai","family":"Zheng","sequence":"additional","affiliation":[]},{"given":"An","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Jiajie","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Zhixu","family":"Li","sequence":"additional","affiliation":[]},{"given":"Athman","family":"Bouguettaya","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,9]]},"reference":[{"key":"24_CR1","unstructured":"Hang, C., Wang, Y., Singh, M.: Operators for propagating trust and their evaluation in social networks. In: AAMAS 2009, pp. 1025\u20131032 (2009)"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Liu, G., Wang, Y., Orgun, M.A.: Optimal social trust path selection in complex social networks. In: AAAI 2010, pp. 1397\u20131398 (2010)","DOI":"10.1609\/aaai.v24i1.7509"},{"issue":"12","key":"24_CR3","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1287\/orsc.12.2.215.10117","volume":"12","author":"PS Adler","year":"2001","unstructured":"Adler, P.S.: Market, hierarchy, and trust: The knowledge economy and the future of capitalism. Organization Science 12(12), 215\u2013234 (2001)","journal-title":"Organization Science"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Ashri, R., Ramchurn, S., Sabater, J., Luck, M., Jennings, N.: Trust evaluation through relationship analysis. In: AAMAS 2005, pp. 1005\u20131011","DOI":"10.1145\/1082473.1082625"},{"key":"24_CR5","unstructured":"Brass, D.J.: A Socal Network Prespective On Industral\/organizational psychology. Industrial\/Organizational Handbook (2009)"},{"key":"24_CR6","volume-title":"Men Who Manage","author":"M Dalton","year":"1959","unstructured":"Dalton, M.: Men Who Manage. Wiley, New York (1959)"},{"issue":"4","key":"24_CR7","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1145\/1183463.1183470","volume":"6","author":"J Golbeck","year":"2006","unstructured":"Golbeck, J., Hendler, J.: Inferring trust relationships in web-based social networks. ACM Transactions on Internet Technology 6(4), 497\u2013529 (2006)","journal-title":"ACM Transactions on Internet Technology"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Kunegis, J., Lommatzsch, A., Bauckhang, C.: The slashdot zoo: Mining a social network with negative edges. In: WWW 2009, pp. 741\u2013750","DOI":"10.1145\/1526709.1526809"},{"key":"24_CR9","unstructured":"Baase, S., Gelder, A.: Computer Algorithms Introduction to Design and Analysis. Addision Wesley"},{"key":"24_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/3-540-62494-5_16","volume-title":"Security Protocols","author":"B Christianson","year":"1997","unstructured":"Christianson, B., Harbison, W.S.: Why isn\u2019t trust transitivie? In: Lomas, M. (ed.) Security Protocols 1996. LNCS, vol. 1189, pp. 171\u2013176. Springer, Heidelberg (1997)"},{"key":"24_CR11","unstructured":"Mansell, R., Collins, B.: Trust and Crime in Information Societies. Edward Elgar Publishing (2005)"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Lin, C., Cao, N., Liu, S., Papadimitriou, S., Sun, J., Yan, X.: Smallblue: Social network analysis for expertise search and collective intelligence. In: ICDE 2009, pp. 1483\u20131486 (2009)","DOI":"10.1109\/ICDE.2009.140"},{"key":"24_CR13","unstructured":"Miller, R., Perlman, D., Brehm, S.: Intimate Relationships, 4th edn. McGraw-Hill College (2007)"},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"Liu, G., Wang, Y., Orgun, M., Lim, E.P.: A heuristic algorithm for trust-oriented service provider selection in complex social networks. In: SCC, pp. 130\u2013137 (2010)","DOI":"10.1109\/SCC.2010.47"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"Liu, G., Wang, Y., Orgun, M.A.: Finding k optimal social trust paths for the selection of trustworthy service providers in complex social networks. In: ICWS 2011, pp. 41\u201348","DOI":"10.1109\/ICWS.2011.81"},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"Liu, G., Wang, Y., Orgun, M.A., Lim, E.P.: Finding the optimal social trust path for the selection of trustworthy service providers in complex social networks. IEEE Transactions on Services Computing (TSC) (2011)","DOI":"10.1109\/ICWS.2011.81"},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"Liu, G., Wang, Y., Wong, D.: Multiple qot constrained social trust path selection in complex social networks. In: TrustCom 2012","DOI":"10.1109\/TrustCom.2012.210"},{"issue":"4","key":"24_CR18","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1109\/TKDE.2012.29","volume":"25","author":"T Sakaki","year":"2013","unstructured":"Sakaki, T., Okazaki, M., Matsuo, Y.: Tweet analysis for real-time event detection and earthquake reporting system development. IEEE Transactions on Knowledge and Data Engineering 25(4), 919\u2013931 (2013)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"12","key":"24_CR19","doi-asserted-by":"publisher","first-page":"2203","DOI":"10.1109\/TKDE.2011.144","volume":"24","author":"Y Shin","year":"2012","unstructured":"Shin, Y., Lim, J., Park, J.: Joint optimization of index freshness and coverage in real-time search engines. IEEE Transactions on Knowledge and Data Engineering 24(12), 2203\u20132217 (2012)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"24_CR20","unstructured":"Gentle, J., Hardle, W., Mori, Y.: Handbook of Computational Statistics. Springer (2004)"},{"key":"24_CR21","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1016\/j.future.2010.04.015","volume":"17","author":"G Wang","year":"2011","unstructured":"Wang, G., Wu, J.: Multi-dimensional evidence-based trust management with multi-trusted paths. Future Generation Computer Systems 17, 529\u2013538 (2011)","journal-title":"Future Generation Computer Systems"},{"key":"24_CR22","doi-asserted-by":"crossref","unstructured":"Liu, G., Wang, Y., Orgun, M.A.: Trust transitivity in complex social networks. In: AAAI 2011, pp. 1222\u20131229","DOI":"10.1609\/aaai.v25i1.8087"},{"issue":"1","key":"24_CR23","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1613\/jair.2229","volume":"30","author":"A Mccallum","year":"2007","unstructured":"Mccallum, A., Wang, X., Corrada-Emmanuel, A.: Topic and role discovery in social networks with experiments on Enron and academic email. Journal of Artificial Intelligence Research 30(1), 249\u2013272 (2007)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"24_CR24","doi-asserted-by":"crossref","unstructured":"Tang, J., Zhang, J., Yan, L., Li, J., Zhang, L., Su, Z.: Arnetminer: Extraction and mining of academic social networks. In: KDD 2008, pp. 990\u2013998 (2008)","DOI":"10.1145\/1401890.1402008"},{"key":"24_CR25","unstructured":"Berger, P., Luckmann, T.: The Social Construction of Reality: A Treatise in the Sociology of Knowledge. Anchor Books (1966)"},{"key":"24_CR26","doi-asserted-by":"crossref","unstructured":"Korkmaz, T., Krunz, M.: Multi-constrained optimal path selection. In: INFOCOM 2001, pp. 834\u2013843","DOI":"10.1109\/INFCOM.2001.916274"},{"key":"24_CR27","doi-asserted-by":"crossref","unstructured":"Morton, D., Popova, E.: Monte-carlo simulation for stochastic optimization. Encyclopedia of Optimization, pp. 2337\u20132345 (2009)","DOI":"10.1007\/978-0-387-74759-0_404"},{"key":"24_CR28","doi-asserted-by":"crossref","unstructured":"Mislove, A., Marcon, M., Gummadi, K., Druschel, P., Bhattacharjee, B.: Measurement and analysis of online social networks. In: ACM IMC 2007, pp. 29\u201342 (2007)","DOI":"10.1145\/1298306.1298311"},{"key":"24_CR29","doi-asserted-by":"publisher","first-page":"332","DOI":"10.2197\/ipsjjip.19.332","volume":"19","author":"P Chia","year":"2011","unstructured":"Chia, P., Pitsilis, G.: Exploring the use of explicit trust link for filtering recommenders: A study on epinions.com. Journal of Information Processing 19, 332\u2013344 (2011)","journal-title":"Journal of Information Processing"},{"key":"24_CR30","doi-asserted-by":"crossref","unstructured":"Chua, F., Lim, E.P.: Trust network inference for online rating data using generative models. In: KDD 2010, pp. 889\u2013898","DOI":"10.1145\/1835804.1835917"},{"key":"24_CR31","doi-asserted-by":"crossref","unstructured":"Lo, D., Surian, D., Zhang, K., Lim, E.P.: Mining direct antagonistic communities in explicit trust networks. In: CIKM 2011, pp. 1013\u20131018","DOI":"10.1145\/2063576.2063722"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18123-3_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T00:10:10Z","timestamp":1747872610000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-18123-3_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319181226","9783319181233"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18123-3_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"9 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}