{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T05:51:14Z","timestamp":1745387474117,"version":"3.37.3"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s10618-020-00709-5","type":"journal-article","created":{"date-parts":[[2020,9,10]],"date-time":"2020-09-10T06:32:44Z","timestamp":1599719564000},"page":"1589-1620","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["CrawlSN: community-aware data acquisition with maximum willingness in online social networks"],"prefix":"10.1007","volume":"34","author":[{"given":"Bay-Yuan","family":"Hsu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chia-Lin","family":"Tu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming-Yi","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0377-7945","authenticated-orcid":false,"given":"Chih-Ya","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,8]]},"reference":[{"issue":"10","key":"709_CR1","doi-asserted-by":"publisher","first-page":"2439","DOI":"10.1109\/TKDE.2013.2297918","volume":"26","author":"H Aksu","year":"2014","unstructured":"Aksu H, Canim M, Chang Y, Korpeoglu I, Ulusoy O (2014) Distributed $$k$$ -core view materialization and maintenance for large dynamic graphs. IEEE Trans Knowl Data Eng 26(10):2439\u20132452","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"709_CR2","unstructured":"Alvarez-Hamelin J, Dall\u2019Asta L, Barrat A, Vespignani A (2005) K-core decomposition of internet graphs: hierarchies, self-similarity and measurement biases. Networks and Heterogeneous Media 3, Dec"},{"key":"709_CR3","doi-asserted-by":"crossref","unstructured":"Aridhi S, Brugnara M, Montresor A, Velegrakis Y (2016) Distributed k-core decomposition and maintenance in large dynamic graphs. In: Proceedings of the 10th ACM international conference on distributed and event-based systems, pp 161\u2013168","DOI":"10.1145\/2933267.2933299"},{"issue":"1","key":"709_CR4","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1287\/opre.1100.0851","volume":"59","author":"B Balasundaram","year":"2011","unstructured":"Balasundaram B, Butenko S, Hicks IV (2011) Clique relaxations in social network analysis: the maximum k-plex problem. Oper Res 59(1):133\u2013142","journal-title":"Oper Res"},{"key":"709_CR5","doi-asserted-by":"crossref","unstructured":"Blenn N, Doerr C, Van\u00a0Kester B, Van\u00a0Mieghem P (2012) Crawling and detecting community structure in online social networks using local information. In Bestak R, Kencl L, Li LE, Widmer J, Yin H (eds) Networking 2012, pp 56\u201367","DOI":"10.1007\/978-3-642-30045-5_5"},{"issue":"10","key":"709_CR6","doi-asserted-by":"publisher","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"VD Blondel","year":"2008","unstructured":"Blondel VD, Guillaume J-L, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech Theory Exp 2008(10):P10008","journal-title":"J Stat Mech Theory Exp"},{"issue":"7415","key":"709_CR7","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1038\/nature11421","volume":"489","author":"RM Bond","year":"2012","unstructured":"Bond RM, Fariss CJ, Jones JJ, Kramer AD, Marlow C, Settle JE, Fowler JH (2012) A 61-million-person experiment in social influence and political mobilization. Nature 489(7415):295","journal-title":"Nature"},{"key":"709_CR8","doi-asserted-by":"crossref","unstructured":"Candogan O (2019) Persuasion in networks: public signals and k-cores. In Proceedings of the 2019 ACM conference on economics and computation, EC \u201919, pp 133\u2013134. Association for Computing Machinery","DOI":"10.1145\/3328526.3329618"},{"issue":"5996","key":"709_CR9","doi-asserted-by":"publisher","first-page":"1194","DOI":"10.1126\/science.1185231","volume":"329","author":"D Centola","year":"2010","unstructured":"Centola D (2010) The spread of behavior in an online social network experiment. Science 329(5996):1194\u20131197","journal-title":"Science"},{"key":"709_CR10","doi-asserted-by":"crossref","unstructured":"Chen W, Wang Y, Yang S (2009) Efficient influence maximization in social networks. In Proceedings of the 15th ACM SIGKDD international conference on knowledge discovery and data mining, pp 199\u2013208","DOI":"10.1145\/1557019.1557047"},{"issue":"6","key":"709_CR11","doi-asserted-by":"publisher","first-page":"666","DOI":"10.14778\/2735703.2735706","volume":"8","author":"S Chen","year":"2015","unstructured":"Chen S, Fan J, Li G, Feng J, Tan K-L, Tang J (2015) Online topic-aware influence maximization. Proc VLDB Endow 8(6):666\u2013677","journal-title":"Proc VLDB Endow"},{"key":"709_CR12","doi-asserted-by":"crossref","unstructured":"Cheng J, Ke Y, Fu AW-C, Yu JX, Zhu L (2010) Finding maximal cliques in massive networks by h*-graph. In: Proceedings of the 2010 ACM SIGMOD international conference on management of data, pp 447\u2013458","DOI":"10.1145\/1807167.1807217"},{"key":"709_CR13","doi-asserted-by":"crossref","unstructured":"Cui W, Xiao Y, Wang H, Wang W (2014) Local search of communities in large graphs. In: Proceedings of the 2014 ACM SIGMOD international conference on management of data, SIGMOD \u201914, pp 991\u20131002","DOI":"10.1145\/2588555.2612179"},{"issue":"3","key":"709_CR14","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1037\/h0046408","volume":"51","author":"M Deutsch","year":"1955","unstructured":"Deutsch M, Gerard HB (1955) A study of normative and informational social influences upon individual judgment. J Abnormal Soc Psychol 51(3):629","journal-title":"J Abnormal Soc Psychol"},{"issue":"12","key":"709_CR15","doi-asserted-by":"publisher","first-page":"1233","DOI":"10.14778\/2994509.2994538","volume":"9","author":"Y Fang","year":"2016","unstructured":"Fang Y, Cheng R, Luo S, Hu J (2016) Effective community search for large attributed graphs. Proceedings of the VLDB Endowment 9(12):1233\u20131244","journal-title":"Proceedings of the VLDB Endowment"},{"key":"709_CR16","doi-asserted-by":"crossref","unstructured":"Giatsidis C, Thilikos DM, Vazirgiannis M (2011) Evaluating cooperation in communities with the k-core structure. In: 2011 international conference on advances in social networks analysis and mining, pp 87\u201393","DOI":"10.1109\/ASONAM.2011.65"},{"issue":"9","key":"709_CR17","doi-asserted-by":"publisher","first-page":"1872","DOI":"10.1109\/JSAC.2011.111011","volume":"29","author":"M Gjoka","year":"2011","unstructured":"Gjoka M, Kurant M, Butts CT, Markopoulou A (2011) Practical recommendations on crawling online social networks. IEEE J Sel Areas Commun 29(9):1872\u20131892","journal-title":"IEEE J Sel Areas Commun"},{"key":"709_CR18","doi-asserted-by":"crossref","unstructured":"Gomez-Rodriguez M, Leskovec J, Krause A (2012) Inferring networks of diffusion and influence. ACM Trans Knowl Discov from Data 5(4)","DOI":"10.1145\/2086737.2086741"},{"key":"709_CR19","volume-title":"Deep learning","author":"I Goodfellow","year":"2016","unstructured":"Goodfellow I, Bengio Y, Courville A (2016) Deep learning. The MIT Press, Cambridge"},{"key":"709_CR20","doi-asserted-by":"crossref","unstructured":"Goyal A, Bonchi F, Lakshmanan LV (2010) Learning influence probabilities in social networks. In: Proceedings of the third ACM international conference on web search and data mining, WSDM \u201910, pp 241\u2013250","DOI":"10.1145\/1718487.1718518"},{"key":"709_CR21","doi-asserted-by":"crossref","unstructured":"Hsu B, Shen C, Yan X (2019a) Network intervention for mental disorders with minimum small dense subgroups. IEEE Trans Knowl Data Eng. 1\u20131","DOI":"10.1109\/TKDE.2019.2949294"},{"key":"709_CR22","doi-asserted-by":"crossref","unstructured":"Hsu B-Y, Tu C-L, Chang M-Y, Shen C-Y (2019b) On crawling community-aware online social network data. In: Proceedings of the 30th ACM conference on hypertext and social media, pp 265\u2013266","DOI":"10.1145\/3342220.3344937"},{"key":"709_CR23","doi-asserted-by":"crossref","unstructured":"Huang X, Cheng H, Qin L, Tian W, Yu JX (2014) Querying k-truss community in large and dynamic graphs. In: Proceedings of the 2014 ACM SIGMOD international conference on management of data, pp 1311\u20131322","DOI":"10.1145\/2588555.2610495"},{"issue":"4","key":"709_CR24","doi-asserted-by":"publisher","first-page":"276","DOI":"10.14778\/2856318.2856323","volume":"9","author":"X Huang","year":"2015","unstructured":"Huang X, Lakshmanan LV, Yu JX, Cheng H (2015) Approximate closest community search in networks. Proc VLDB Endow 9(4):276\u2013287","journal-title":"Proc VLDB Endow"},{"key":"709_CR25","doi-asserted-by":"crossref","unstructured":"Hung H-J, Lee W-C, Yang D-N, Shen C-Y, Lei Z, Chow S-M (2020) Efficient algorithms towards network intervention. In: Proceedings of the web conference 2020","DOI":"10.1145\/3366423.3380269"},{"key":"709_CR26","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos E (2003) Maximizing the spread of influence through a social network. In Proceedings of the ninth ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201903, pp 137\u2013146","DOI":"10.1145\/956750.956769"},{"key":"709_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-20010-1","volume-title":"An introduction to machine learning","author":"M Kubat","year":"2015","unstructured":"Kubat M (2015) An introduction to machine learning, 1st edn. Springer, Berlin","edition":"1"},{"key":"709_CR28","doi-asserted-by":"crossref","unstructured":"Laishram R, Wendt J, Soundarajan S (2019) Crawling the community structure of multiplex networks. In: Proceedings of the AAAI conference on artificial intelligence, vol 33, pp 168\u2013175","DOI":"10.1609\/aaai.v33i01.3301168"},{"key":"709_CR29","unstructured":"Leskovec J, Mcauley JJ (2012) Learning to discover social circles in ego networks. In: Advances in neural information processing systems, pp 539\u2013547"},{"issue":"1","key":"709_CR30","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1080\/15427951.2009.10129177","volume":"6","author":"J Leskovec","year":"2009","unstructured":"Leskovec J, Lang KJ, Dasgupta A, Mahoney MW (2009) Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. Internet Math 6(1):29\u2013123","journal-title":"Internet Math"},{"key":"709_CR31","doi-asserted-by":"crossref","unstructured":"Li G, Chen S, Feng J, Tan K-l, Li W-s (2014) Efficient location-aware influence maximization. In: Proceedings of the 2014 ACM SIGMOD international conference on management of data, pp 87\u201398","DOI":"10.1145\/2588555.2588561"},{"issue":"5","key":"709_CR32","doi-asserted-by":"publisher","first-page":"509","DOI":"10.14778\/2735479.2735484","volume":"8","author":"R-H Li","year":"2015","unstructured":"Li R-H, Qin L, Yu JX, Mao R (2015) Influential community search in large networks. Proc VLDB Endow 8(5):509\u2013520","journal-title":"Proc VLDB Endow"},{"issue":"10","key":"709_CR33","doi-asserted-by":"publisher","first-page":"1070","DOI":"10.14778\/2794367.2794376","volume":"8","author":"Y Li","year":"2015","unstructured":"Li Y, Zhang D, Tan K-L (2015) Real-time targeted influence maximization for online advertisements. Proc VLDB Endow 8(10):1070\u20131081","journal-title":"Proc VLDB Endow"},{"key":"709_CR34","doi-asserted-by":"crossref","unstructured":"Li J, Wang X, Deng K, Yang X, Sellis T, Yu JX (2017) Most influential community search over large social networks. In: 2017 IEEE 33rd international conference on data engineering, pp 871\u2013882","DOI":"10.1109\/ICDE.2017.136"},{"key":"709_CR35","doi-asserted-by":"crossref","unstructured":"Lu W, Bonchi F, Goyal A, Lakshmanan LV (2013) The bang for the buck: fair competitive viral marketing from the host perspective. In: Proceedings of the 19th ACM SIGKDD international conference on knowledge discovery and data mining, pp 928\u2013936","DOI":"10.1145\/2487575.2487649"},{"issue":"2","key":"709_CR36","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00139635","volume":"13","author":"RJ Mokken","year":"1979","unstructured":"Mokken RJ (1979) Cliques, clubs and clans. Quality & Quantity 13(2):161\u2013173","journal-title":"Quality & Quantity"},{"issue":"5980","key":"709_CR37","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1126\/science.1184819","volume":"328","author":"PJ Mucha","year":"2010","unstructured":"Mucha PJ, Richardson T, Macon K, Porter MA, Onnela J-P (2010) Community structure in time-dependent, multiscale, and multiplex networks. Science 328(5980):876\u2013878","journal-title":"Science"},{"key":"709_CR38","unstructured":"Reproducibility materials. http:\/\/www.cs.nthu.edu.tw\/~chihya\/CIW_download\/, 2020"},{"issue":"3","key":"709_CR39","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0378-8733(83)90028-X","volume":"5","author":"SB Seidman","year":"1983","unstructured":"Seidman SB (1983) Network structure and minimum degree. Soc Netw 5(3):269\u2013287","journal-title":"Soc Netw"},{"issue":"1","key":"709_CR40","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1109\/TKDE.2015.2468726","volume":"28","author":"C-Y Shen","year":"2016","unstructured":"Shen C-Y, Yang D-N, Huang L-H, Lee W-C, Chen M-S (2016) Socio-spatial group queries for impromptu activity planning. IEEE Trans Knowl Data Eng 28(1):196\u2013210","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"709_CR41","doi-asserted-by":"crossref","unstructured":"Shen C-Y, Huang L-H, Yang D-N, Shuai H-H, Lee W-C, Chen M-S (2017) On finding socially tenuous groups for online social networks. In: Proceedings of the 23rd ACM SIGKDD international conference on knowledge discovery and data mining, pp 415\u2013424","DOI":"10.1145\/3097983.3097995"},{"key":"709_CR42","doi-asserted-by":"crossref","unstructured":"Shen C-Y, Fotsing CPK, Yang D-N, Chen Y-S, Lee W-C (2018) On organizing online soirees with live multi-streaming. In: AAAI conference on artificial intelligence","DOI":"10.1609\/aaai.v32i1.11310"},{"key":"709_CR43","doi-asserted-by":"crossref","unstructured":"Shin K, Eliassi-Rad T, Faloutsos C (2016) Corescope: Graph mining using k-core analysis\u2014patterns, anomalies and algorithms. In: 2016 IEEE 16th international conference on data mining, pp 469\u2013478","DOI":"10.1109\/ICDM.2016.0058"},{"issue":"4","key":"709_CR44","doi-asserted-by":"publisher","first-page":"253","DOI":"10.14778\/2732240.2732244","volume":"7","author":"H-H Shuai","year":"2013","unstructured":"Shuai H-H, Yang D-N, Yu PS, Chen M-S (2013) Willingness optimization for social group activity. Proc VLDB Endow 7(4):253\u2013264","journal-title":"Proc VLDB Endow"},{"key":"709_CR45","doi-asserted-by":"crossref","unstructured":"Song C, Hsu W, Lee ML (2017) Temporal influence blocking: Minimizing the effect of misinformation in social networks. In: 2017 IEEE 33rd international conference on data engineering, pp 847\u2013858","DOI":"10.1109\/ICDE.2017.134"},{"key":"709_CR46","doi-asserted-by":"crossref","unstructured":"Wang K, Cao X, Lin X, Zhang W, Qin L (2018) Efficient computing of radius-bounded k-cores. In: 2018 IEEE 34th international conference on data engineering (ICDE), pp 233\u2013244","DOI":"10.1109\/ICDE.2018.00030"},{"issue":"1","key":"709_CR47","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10115-013-0693-z","volume":"42","author":"J Yang","year":"2015","unstructured":"Yang J, Leskovec J (2015) Defining and evaluating network communities based on ground-truth. Knowl Inf Syst 42(1):181\u2013213","journal-title":"Knowl Inf Syst"},{"key":"709_CR48","doi-asserted-by":"crossref","unstructured":"Yang D-N, Shen C-Y, Lee W-C, Chen M-S (2012) On socio-spatial group query for location-based social networks. In: Proceedings of the 18th ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201912, pp 949\u2013957","DOI":"10.1145\/2339530.2339679"},{"key":"709_CR49","doi-asserted-by":"crossref","unstructured":"Yang D-N, Hung H-J, Lee W-C, Chen W (2013) Maximizing acceptance probability for active friending in online social networks. In: Proceedings of the 19th ACM SIGKDD international conference on knowledge discovery and data mining, pp 713\u2013721","DOI":"10.1145\/2487575.2487599"},{"key":"709_CR50","doi-asserted-by":"crossref","unstructured":"Yang Y, Mao X, Pei J, He X (2016) Continuous influence maximization: What discounts should we offer to social network users? In: Proceedings of the 2016 international conference on management of data, pp 727\u2013741","DOI":"10.1145\/2882903.2882961"},{"key":"709_CR51","doi-asserted-by":"crossref","unstructured":"Ye S, Lang J, Wu F (2010) Crawling online social graphs. In: 2010 12th international Asia-Pacific web conference, pp 236\u2013242","DOI":"10.1109\/APWeb.2010.10"},{"key":"709_CR52","doi-asserted-by":"crossref","unstructured":"Zhang Y, Parthasarathy S (2012) Extracting analyzing and visualizing triangle k-core motifs within networks. In: 2012 IEEE 28th international conference on data engineering, pp 1049\u20131060","DOI":"10.1109\/ICDE.2012.35"},{"issue":"6","key":"709_CR53","doi-asserted-by":"publisher","first-page":"649","DOI":"10.14778\/3055330.3055332","volume":"10","author":"F Zhang","year":"2017","unstructured":"Zhang F, Zhang W, Zhang Y, Qin L, Lin X (2017) Olak: an efficient algorithm to prevent unraveling in social networks. Proc VLDB Endow 10(6):649\u2013660","journal-title":"Proc VLDB Endow"},{"issue":"10","key":"709_CR54","doi-asserted-by":"publisher","first-page":"998","DOI":"10.14778\/3115404.3115406","volume":"10","author":"F Zhang","year":"2017","unstructured":"Zhang F, Zhang Y, Qin L, Zhang W, Lin X (2017) When engagement meets similarity: efficient (k, r)-core computation on social networks. Proc VLDB Endow 10(10):998\u20131009","journal-title":"Proc VLDB Endow"},{"issue":"5","key":"709_CR55","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1007\/s00778-017-0473-6","volume":"26","author":"Q Zhu","year":"2017","unstructured":"Zhu Q, Hu H, Xu C, Xu J, Lee W-C (2017) Geo-social group queries with minimum acquaintance constraints. VLDB J 26(5):709\u2013727","journal-title":"VLDB J"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-020-00709-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10618-020-00709-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-020-00709-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,17]],"date-time":"2022-11-17T16:38:07Z","timestamp":1668703087000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10618-020-00709-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9]]},"references-count":55,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["709"],"URL":"https:\/\/doi.org\/10.1007\/s10618-020-00709-5","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"type":"print","value":"1384-5810"},{"type":"electronic","value":"1573-756X"}],"subject":[],"published":{"date-parts":[[2020,9]]},"assertion":[{"value":"10 January 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 July 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 September 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}