{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T05:44:06Z","timestamp":1726033446512},"publisher-location":"Singapore","reference-count":16,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811385773"},{"type":"electronic","value":"9789811385780"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-981-13-8578-0_12","type":"book-chapter","created":{"date-parts":[[2019,6,24]],"date-time":"2019-06-24T23:34:19Z","timestamp":1561419259000},"page":"144-154","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Algorithm for Selecting Optimal Trust Path in Online Social Networks Using Particle Swarm Optimization"],"prefix":"10.1007","author":[{"given":"Munmun","family":"Bhattacharya","sequence":"first","affiliation":[]},{"given":"Debanjana","family":"Ghosh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,25]]},"reference":[{"key":"12_CR1","unstructured":"Lawler, E.L.: Combinatorial Optimization: Networks and Matroids, pp. 59\u2013108. Holt, Rinehart, and Winston, New York (1976)"},{"issue":"6","key":"12_CR2","doi-asserted-by":"publisher","first-page":"941","DOI":"10.1109\/72.286889","volume":"4","author":"MKM Ali","year":"1993","unstructured":"Ali, M.K.M., Kamoun, F.: Neural networks for shortest path computation and routing in computer networks. IEEE Trans. Neural Networks 4(6), 941\u2013954 (1993)","journal-title":"IEEE Trans. Neural Networks"},{"issue":"1","key":"12_CR3","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1080\/07360932.2013.781517","volume":"44","author":"S Grabner-Kr\u00e4uter","year":"2015","unstructured":"Grabner-Kr\u00e4uter, S., Bitter, S.: Trust in online social networks: a multifaceted perspective. Forum Soc. Econ. 44(1), 48\u201368 (2015)","journal-title":"Forum Soc. Econ."},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1155\/2007\/27383","volume":"2007","author":"AW Mohemmed","year":"2007","unstructured":"Mohemmed, A.W., Sahoo, N.C.: Efficient computation of shortest paths in networks using particle swarm optimization and noising metaheuristics. Discrete Dyn. Nat. Soc. 2007, 25 (2007)","journal-title":"Discrete Dyn. Nat. Soc."},{"key":"12_CR5","unstructured":"Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, IEEE Service Center, Piscataway, NJ, vol. IV, pp. 1942\u20131948 (1995)"},{"issue":"4","key":"12_CR6","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 binary trust relationships in web-based social networks. ACM Trans. Internet Technol. (TOIT) 6(4), 497\u2013529 (2006)","journal-title":"ACM Trans. Internet Technol. (TOIT)"},{"key":"12_CR7","unstructured":"Korkmaz, T., Krunz, M.: Multi-constrained optimal path selection. In: INFOCOM 2001. Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE, Vol. 2, pp. 834\u2013843. IEEE (2001)"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Liu, G., Wang, Y., Orgun, M.: Optimal social trust path selection in complex social networks. In: The Twenty-Fourth AAAI Conference on Artificial Intelligence, Atlanta, Georgia, USA, 11\u201315 July, pp. 1391\u20131398 (2010)","DOI":"10.1609\/aaai.v24i1.7509"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1109\/MCOM.2002.1106159","volume":"40","author":"F Kuipers","year":"2002","unstructured":"Kuipers, F., Van Mieghem, P., Korkmaz, T., Krunz, M.: An overview of constraint-based path selection algorithms for QoS routing. IEEE Commun. Mag. 40, 50\u201355 (2002)","journal-title":"IEEE Commun. Mag."},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Zeng, Z., Gao, Y., Chen, Z., Deng, X.: Trust path-searching algorithm based on PSO. In: The 9th International Conference for Young Computer Scientists, pp. 1975\u20131979 (2008)","DOI":"10.1109\/ICYCS.2008.214"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Xu, G., Xu, C., Tian, X., Zhang, L., Li, X., Li, W.: PSO-TPS: an optimal trust path selection algorithm based on particle swarm optimization in small world network. In: Proceedings of 2nd International Conference on Cloud Green Computing, pp. 594\u2013600, November 2012","DOI":"10.1109\/CGC.2012.81"},{"issue":"7","key":"12_CR12","doi-asserted-by":"publisher","first-page":"8","DOI":"10.5120\/ijca2016912461","volume":"156","author":"M Bhattacharya","year":"2016","unstructured":"Bhattacharya, M., Nesa, N.: An algorithm for predicting local trust based on trust propagation in online social networks. IJCA (0975\u2013 8887) 156(7), 8\u201315 (2016)","journal-title":"IJCA (0975\u2013 8887)"},{"key":"12_CR13","unstructured":"Hang, C.-W., Wang, Y., Singh, M.P.: Operators for propagating trust and their evaluation in social networks. In: Proceedings of the 8th International Conference on Autonomous Agents and Multiagent Systems. International Foundation for Autonomous Agents and Multiagent Systems, vol. 2, pp. 1025\u20131032 (2009)"},{"key":"12_CR14","unstructured":"Abdul-Rahman, A., Hailes, S.: Supporting trust in virtual communities. In: Proceedings of the 33rd Annual Hawaii International Conference on System Sciences, 2000, pp. 9\u2013pp. IEEE (2000)"},{"issue":"2","key":"12_CR15","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1109\/TEM.2009.2023455","volume":"57","author":"Z Zhang","year":"2010","unstructured":"Zhang, Z.: Feeling the sense of community in social networking usage. IEEE Trans. Eng. Manage. 57(2), 225\u2013239 (2010)","journal-title":"IEEE Trans. Eng. Manage."},{"key":"12_CR16","unstructured":"Heppner, F., Grenander, U.: A stochastic nonlinear model for coordinated bird flocks. In: The Ubiquity of Chaos, pp. 233\u2013238 (1990)"}],"container-title":["Communications in Computer and Information Science","Computational Intelligence, Communications, and Business Analytics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-13-8578-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,21]],"date-time":"2022-09-21T19:44:38Z","timestamp":1663789478000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-13-8578-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9789811385773","9789811385780"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-981-13-8578-0_12","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"25 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CICBA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Intelligence, Communications, and Business Analytics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kalyani","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 July 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cicba2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.cicba.in","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"240","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"76","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"32% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"2.74","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3.3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}