{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T14:09:56Z","timestamp":1766066996466,"version":"3.41.2"},"reference-count":28,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T00:00:00Z","timestamp":1555372800000},"content-version":"vor","delay-in-days":105,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61332006","61332014","61328202","U1401256","61572119","61622202","61572121","61702086"],"award-info":[{"award-number":["61332006","61332014","61328202","U1401256","61572119","61622202","61572121","61702086"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005047","name":"Natural Science Foundation of Liaoning Province","doi-asserted-by":"publisher","award":["20170520164"],"award-info":[{"award-number":["20170520164"]}],"id":[{"id":"10.13039\/501100005047","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2018M631806"],"award-info":[{"award-number":["2018M631806"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2019,1]]},"abstract":"<jats:p>In recent years, Event Based Social Networks (EBSNs) appear in people\u2019s daily life and are becoming increasing popular. In EBSNs, one typical task is to make personalized plans for users. Existing studies only consider the preference of users. They make plans by selecting interesting events for users. However, for organizers of events, they also would like more high\u2010quality users to participate in their events, which may make the events more exciting. Existing studies are user\u2010centered and ignore the requirement of organizers. What is more, organizers are allowed to modify their events dynamically before they are held. The platforms should be able to dynamically adjust the schedules of users. Therefore, we identify a new Incremental Bilateral Preference Stable Planning (IBPSP) problem over EBSNs and propose several solutions to deal with different situations. We conduct extensive experiments to verify the efficiency and effectiveness of the proposed algorithms.<\/jats:p>","DOI":"10.1155\/2019\/1532013","type":"journal-article","created":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T23:35:04Z","timestamp":1555457704000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Incremental Bilateral Preference Stable Planning over Event Based Social Networks"],"prefix":"10.1155","volume":"2019","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8457-6650","authenticated-orcid":false,"given":"Boyang","family":"Li","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8696-9685","authenticated-orcid":false,"given":"Yurong","family":"Cheng","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0181-8379","authenticated-orcid":false,"given":"Guoren","family":"Wang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3373-0723","authenticated-orcid":false,"given":"Yongjiao","family":"Sun","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2019,4,16]]},"reference":[{"key":"e_1_2_10_1_2","doi-asserted-by":"crossref","unstructured":"LiuX. HeQ. TianY. LeeW. McPhersonJ. andHanJ. Event-based social networks: linking the online and offline social worlds Proceedings of the 18th ACM SIGKDD International Conference August 2012 Beijing China 1032\u20131040 https:\/\/doi.org\/10.1145\/2339530.2339693.","DOI":"10.1145\/2339530.2339693"},{"key":"e_1_2_10_2_2","doi-asserted-by":"crossref","unstructured":"ChengY. YuanY. ChenL. Giraud-CarrierC. andWangG. Complex event-participant planning & its incremental variant Proceedings of the 33rd IEEE International Conference on Data Engineering ICDE 2017 April 2017 859\u2013870 2-s2.0-85021213097.","DOI":"10.1109\/ICDE.2017.135"},{"key":"e_1_2_10_3_2","doi-asserted-by":"crossref","unstructured":"SheJ. TongY. ChenL. andCaoC. C. Conflict-aware event-participant arrangement Proceedings of the 2015 IEEE 31st International Conference on Data Engineering (ICDE) April 2015 Seoul South Korea 735\u2013746 https:\/\/doi.org\/10.1109\/ICDE.2015.7113329.","DOI":"10.1109\/ICDE.2015.7113329"},{"key":"e_1_2_10_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2565468"},{"key":"e_1_2_10_5_2","doi-asserted-by":"crossref","unstructured":"LiK. LuW. BhagatS. LakshmananL. V. andYuC. On social event organization Proceedings of the 20th ACM SIGKDD international conference August 2014 1206\u20131215 https:\/\/doi.org\/10.1145\/2623330.2623724.","DOI":"10.1145\/2623330.2623724"},{"key":"e_1_2_10_6_2","doi-asserted-by":"crossref","unstructured":"SheJ. TongY. andChenL. Utility-aware social event-participant planning Proceedings of the ACM SIGMOD International Conference on Management of Data SIGMOD 2015 June 2015 1629\u20131643 https:\/\/doi.org\/10.1145\/2723372.2749446 2-s2.0-84957553695.","DOI":"10.1145\/2723372.2749446"},{"key":"e_1_2_10_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2017.11.006"},{"key":"e_1_2_10_8_2","doi-asserted-by":"crossref","unstructured":"FengK. CongG. BhowmickS. S. andMaS. In search of influential event organizers in online social networks Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data SIGMOD 2014 June 2014 USA 63\u201374 2-s2.0-84904331648.","DOI":"10.1145\/2588555.2612173"},{"key":"e_1_2_10_9_2","doi-asserted-by":"crossref","unstructured":"ZhangX. ZhaoJ. andCaoG. Who will attend? - predicting event attendance in event-based social network Proceedings of the 16th IEEE International Conference on Mobile Data Management MDM 2015 June 2015 USA 74\u201383 2-s2.0-84958161388.","DOI":"10.1109\/MDM.2015.23"},{"key":"e_1_2_10_10_2","doi-asserted-by":"crossref","unstructured":"ZhangW. WangJ. andFengW. Combining latent factor model with location features for event-based group recommendation Proceedings of the 19th ACM SIGKDD International Conference August 2013 https:\/\/doi.org\/10.1145\/2487575.2487646.","DOI":"10.1145\/2487575.2487646"},{"key":"e_1_2_10_11_2","doi-asserted-by":"crossref","unstructured":"DuR. YuZ. MeiT. WangZ. WangZ. andGuoB. Predicting activity attendance in event-based social networks: Content context and social influence Proceedings of the 2014 ACM International Joint Conference on Pervasive and Ubiquitous Computing UbiComp 2014 2014 425\u2013434 2-s2.0-84908605764.","DOI":"10.1145\/2632048.2632063"},{"key":"e_1_2_10_12_2","doi-asserted-by":"crossref","unstructured":"PhamT.-A. N. LiX. CongG. andZhangZ. A general graph-based model for recommendation in event-based social networks Proceedings of the 2015 IEEE 31st International Conference on Data Engineering 2015 567\u2013578.","DOI":"10.1109\/ICDE.2015.7113315"},{"key":"e_1_2_10_13_2","doi-asserted-by":"publisher","DOI":"10.1155\/2017\/5857372"},{"key":"e_1_2_10_14_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2017.06.003"},{"key":"e_1_2_10_15_2","doi-asserted-by":"crossref","unstructured":"SheJ. TongY. ChenL. andSongT. Feedback-Aware social event-participant arrangement Proceedings of the 2017 ACM SIGMOD International Conference on Management of Data SIGMOD 2017 May 2017 851\u2013865 2-s2.0-85021223218.","DOI":"10.1145\/3035918.3064020"},{"key":"e_1_2_10_16_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-015-0377-6"},{"key":"e_1_2_10_17_2","doi-asserted-by":"crossref","unstructured":"LiG. LiuY. RibeiroB. andDingH. On group popularity prediction in event-based social networks Proceedings of the 12th International AAAI Conference on Web and Social Media June 2018 644\u2013647 2-s2.0-85050630246.","DOI":"10.1609\/icwsm.v12i1.15067"},{"key":"e_1_2_10_18_2","doi-asserted-by":"publisher","DOI":"10.2991\/ijcis.11.1.48"},{"key":"e_1_2_10_19_2","doi-asserted-by":"crossref","unstructured":"WangZ. HeP. ShouL. ChenK. WuS. andChenG. Toward the new item problem: context-enhanced event recommendation in event-based social networks 9022 Proceedings of the European Conference on Information Retrieval 2015 Springer International Publishing 333\u2013338 Lecture Notes in Computer Science https:\/\/doi.org\/10.1007\/978-3-319-16354-3_36.","DOI":"10.1007\/978-3-319-16354-3_36"},{"key":"e_1_2_10_20_2","first-page":"573","article-title":"Bilateral preference stable planning over event based social networks","volume":"30","author":"Cheng Y.","year":"2019","journal-title":"Journal of Software"},{"key":"e_1_2_10_21_2","doi-asserted-by":"publisher","DOI":"10.2307\/2312726"},{"key":"e_1_2_10_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00182-008-0117-6"},{"key":"e_1_2_10_23_2","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(85)90074-5"},{"key":"e_1_2_10_24_2","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(92)00179-P"},{"key":"e_1_2_10_25_2","doi-asserted-by":"crossref","unstructured":"IwamaK. MiyazakiS. andOkamotoK. A (2-clog N\/N)-approximation algorithm for the stable marriage problem 3111 Proceedings of the 2004 Scandinavian Workshop on Algorithm Theory 2004 Berlin Springer 349\u2013361 Lecture Notes in Computer Science https:\/\/doi.org\/10.1007\/978-3-540-27810-8_30 MR2160024.","DOI":"10.1007\/978-3-540-27810-8_30"},{"key":"e_1_2_10_26_2","doi-asserted-by":"crossref","unstructured":"IwamaK. MiyazakiS. andYamauchiN. A 2-c(1\/\u221an))-approximation algorithm for the stable marriage problem 3827 Proceedings of the 2005 International Symposium on Algorithms and Computation 2005 Berlin Springer 902\u2013914 Lecture Notes in Computer Science https:\/\/doi.org\/10.1007\/11602613_90 MR2258170.","DOI":"10.1007\/11602613_90"},{"key":"e_1_2_10_27_2","unstructured":"IwamaK. MiyazakiS. andYamauchiN. A 1.875-approximation algorithm for the stable marriage problem Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms SODA 2007 New Orleans La USA ACM 288\u2013297 MR2482854."},{"key":"e_1_2_10_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/1077464.1077475"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2019\/1532013.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2019\/1532013.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2019\/1532013","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T14:17:15Z","timestamp":1723040235000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2019\/1532013"}},"subtitle":[],"editor":[{"given":"Jiajie","family":"Xu","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2019,1]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["10.1155\/2019\/1532013"],"URL":"https:\/\/doi.org\/10.1155\/2019\/1532013","archive":["Portico"],"relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"type":"print","value":"1076-2787"},{"type":"electronic","value":"1099-0526"}],"subject":[],"published":{"date-parts":[[2019,1]]},"assertion":[{"value":"2019-01-24","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-04-02","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-04-16","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"1532013"}}