{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:30:45Z","timestamp":1758267045884,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030185756"},{"type":"electronic","value":"9783030185763"}],"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-3-030-18576-3_24","type":"book-chapter","created":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T08:05:29Z","timestamp":1556006729000},"page":"398-415","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Efficient Search of the Most Cohesive Co-located Community in Attributed Networks"],"prefix":"10.1007","author":[{"given":"Jiehuan","family":"Luo","sequence":"first","affiliation":[]},{"given":"Xin","family":"Cao","sequence":"additional","affiliation":[]},{"given":"Qiang","family":"Qu","sequence":"additional","affiliation":[]},{"given":"Yaqiong","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,24]]},"reference":[{"issue":"11","key":"24_CR1","first-page":"1298","volume":"10","author":"E Akbas","year":"2017","unstructured":"Akbas, E., Zhao, P.: Truss-based community search: a truss-equivalence based indexing approach. PVLDB 10(11), 1298\u20131309 (2017)","journal-title":"PVLDB"},{"key":"24_CR2","first-page":"498","volume":"14","author":"M Altaf-Ul-Amine","year":"2003","unstructured":"Altaf-Ul-Amine, M., et al.: Prediction of protein functions based on k-cores of protein-protein interaction networks and amino acid sequences. Genome Inform. 14, 498\u2013499 (2003)","journal-title":"Genome Inform."},{"key":"24_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/3-540-61422-2_127","volume-title":"Algorithm Theory \u2014 SWAT\u201996","author":"Y Asahiro","year":"1996","unstructured":"Asahiro, Y., Iwama, K., Tamaki, H., Tokuyama, T.: Greedily finding a dense subgraph. In: Karlsson, R., Lingas, A. (eds.) SWAT 1996. LNCS, vol. 1097, pp. 136\u2013148. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61422-2_127"},{"issue":"5","key":"24_CR4","first-page":"1406","volume":"29","author":"N Barbieri","year":"2015","unstructured":"Barbieri, N., Bonchi, F., Galimberti, E., Gullo, F.: Efficient and effective community search. DMKD 29(5), 1406\u20131433 (2015)","journal-title":"DMKD"},{"key":"24_CR5","unstructured":"Batagelj, V., Zaversnik, M.: An O (m) algorithm for cores decomposition of networks. arXiv preprint arXiv:cs\/0310049 (2003)"},{"key":"24_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/3-540-44436-X_10","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"M Charikar","year":"2000","unstructured":"Charikar, M.: Greedy approximation algorithms for finding dense components in a graph. In: Jansen, K., Khuller, S. (eds.) APPROX 2000. LNCS, vol. 1913, pp. 84\u201395. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44436-X_10"},{"issue":"9","key":"24_CR7","first-page":"1233","volume":"11","author":"L Chen","year":"2018","unstructured":"Chen, L., Liu, C., Zhou, R., Li, J., Yang, X., Wang, B.: Maximum co-located community search in large scale social networks. PVLDB 11(9), 1233\u20131246 (2018)","journal-title":"PVLDB"},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1080\/09273970801891446","volume":"16","author":"J Cohen","year":"2008","unstructured":"Cohen, J.: Trusses: cohesive subgraphs for social network analysis. NSATR 16, 3 (2008)","journal-title":"NSATR"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Cui, W., Xiao, Y., Wang, H., Lu, Y., Wang, W.: Online search of overlapping communities. In: SIGMOD, pp. 277\u2013288 (2013)","DOI":"10.1145\/2463676.2463722"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Cui, W., Xiao, Y., Wang, H., Wang, W.: Local search of communities in large graphs. In: SIGMOD, pp. 991\u20131002 (2014)","DOI":"10.1145\/2588555.2612179"},{"key":"24_CR11","series-title":"LNCS","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-73521-4","volume-title":"Mobility Analytics for Spatio-Temporal and Social Data","year":"2018","unstructured":"Doulkeridis, C., Vouros, G.A., Qu, Q., Wang, S. (eds.): Mobility Analytics for Spatio-Temporal and Social Data. LNCS. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73521-4"},{"issue":"6","key":"24_CR12","first-page":"709","volume":"10","author":"Y Fang","year":"2017","unstructured":"Fang, Y., Cheng, R., Li, X., Luo, S., Hu, J.: Effective community search over large spatial graphs. PVLDB 10(6), 709\u2013720 (2017)","journal-title":"PVLDB"},{"key":"24_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00288933","volume":"4","author":"RA Finkel","year":"1974","unstructured":"Finkel, R.A., Bentley, J.L.: Quad trees: a data structure for retrieval on composite keys. Acta Inf. 4, 1\u20139 (1974)","journal-title":"Acta Inf."},{"issue":"3\u20135","key":"24_CR14","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3\u20135), 75\u2013174 (2010)","journal-title":"Phys. Rep."},{"key":"24_CR15","unstructured":"Goldberg, A.V.: Finding a maximum density subgraph. Technical report (1984)"},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"Guo, T., Cao, X., Cong, G.: Efficient algorithms for answering the m-closest keywords query. In: SIGMOD, pp. 405\u2013418 (2015)","DOI":"10.1145\/2723372.2723723"},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"Hu, J., Wu, X., Cheng, R., Luo, S., Fang, Y.: Querying minimal Steiner maximum-connected subgraphs in large graphs. In: CIKM, pp. 1241\u20131250 (2016)","DOI":"10.1145\/2983323.2983748"},{"key":"24_CR18","doi-asserted-by":"crossref","unstructured":"Huang, X., Cheng, H., Qin, L., Tian, W., Yu, J.X.: Querying k-truss community in large and dynamic graphs. In: SIGMOD, pp. 1311\u20131322 (2014)","DOI":"10.1145\/2588555.2610495"},{"issue":"9","key":"24_CR19","first-page":"949","volume":"10","author":"X Huang","year":"2017","unstructured":"Huang, X., Lakshmanan, L.V.: Attribute-driven community search. PVLDB 10(9), 949\u2013960 (2017)","journal-title":"PVLDB"},{"key":"24_CR20","doi-asserted-by":"crossref","unstructured":"Huang, X., Lakshmanan, L.V., Xu, J.: Community search over big graphs: models, algorithms, and opportunities. In: ICDE, pp. 1451\u20131454 (2017)","DOI":"10.1109\/ICDE.2017.211"},{"issue":"4","key":"24_CR21","first-page":"276","volume":"9","author":"X Huang","year":"2015","unstructured":"Huang, X., Lakshmanan, L.V., Yu, J.X., Cheng, H.: Approximate closest community search in networks. PVLDB 9(4), 276\u2013287 (2015)","journal-title":"PVLDB"},{"issue":"5","key":"24_CR22","first-page":"509","volume":"8","author":"RH Li","year":"2015","unstructured":"Li, R.H., Qin, L., Yu, J.X., Mao, R.: Influential community search in large networks. PVLDB 8(5), 509\u2013520 (2015)","journal-title":"PVLDB"},{"issue":"10","key":"24_CR23","first-page":"2729","volume":"27","author":"Y Li","year":"2015","unstructured":"Li, Y., Chen, R., Xu, J., Huang, Q., Hu, H., Choi, B.: Geo-social k-cover group queries for collaborative spatial computing. TKDE 27(10), 2729\u20132742 (2015)","journal-title":"TKDE"},{"issue":"2","key":"24_CR24","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF02289146","volume":"14","author":"RD Luce","year":"1949","unstructured":"Luce, R.D., Perry, A.D.: A method of matrix analysis of group structure. Psychometrika 14(2), 95\u2013116 (1949)","journal-title":"Psychometrika"},{"key":"24_CR25","doi-asserted-by":"crossref","unstructured":"Qu, Q., Liu, S., Yang, B., Jensen, C.S.: Efficient top-k spatial locality search for co-located spatial web objects. In: 2014 IEEE 15th International Conference on Mobile Data Management (MDM), vol. 1, pp. 269\u2013278. IEEE (2014)","DOI":"10.1109\/MDM.2014.39"},{"key":"24_CR26","doi-asserted-by":"crossref","unstructured":"Ruan, Y., Fuhry, D., Parthasarathy, S.: Efficient community detection in large networks using content and links. In: WWW, pp. 1089\u20131098 (2013)","DOI":"10.1145\/2488388.2488483"},{"key":"24_CR27","doi-asserted-by":"crossref","DOI":"10.4135\/9781529716597","volume-title":"Social Network Analysis","author":"J Scott","year":"2017","unstructured":"Scott, J.: Social Network Analysis. Sage, Thousand Oaks (2017)"},{"issue":"3","key":"24_CR28","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0378-8733(83)90028-X","volume":"5","author":"SB Seidman","year":"1983","unstructured":"Seidman, S.B.: Network structure and minimum degree. Soc. Netw. 5(3), 269\u2013287 (1983)","journal-title":"Soc. Netw."},{"key":"24_CR29","doi-asserted-by":"crossref","unstructured":"Sozio, M., Gionis, A.: The community-search problem and how to plan a successful cocktail party. In: SIGKDD, pp. 939\u2013948 (2010)","DOI":"10.1145\/1835804.1835923"},{"issue":"10","key":"24_CR30","first-page":"998","volume":"8","author":"M Wang","year":"2015","unstructured":"Wang, M., Wang, C., Yu, J.X., Zhang, J.: Community detection in social networks: an in-depth benchmarking study with a procedure-oriented framework. PVLDB 8(10), 998\u20131009 (2015)","journal-title":"PVLDB"},{"issue":"7","key":"24_CR31","first-page":"798","volume":"8","author":"Y Wu","year":"2015","unstructured":"Wu, Y., Jin, R., Li, J., Zhang, X.: Robust local community detection: on free rider effect and its elimination. PVLDB 8(7), 798\u2013809 (2015)","journal-title":"PVLDB"},{"key":"24_CR32","doi-asserted-by":"crossref","unstructured":"Wu, Y., Jin, R., Zhu, X., Zhang, X.: Finding dense and connected subgraphs in dual networks. In: ICDE, pp. 915\u2013926. IEEE (2015)","DOI":"10.1109\/ICDE.2015.7113344"},{"key":"24_CR33","doi-asserted-by":"crossref","unstructured":"Yang, D.N., Shen, C.Y., Lee, W.C., Chen, M.S.: On socio-spatial group query for location-based social networks. In: SIGKDD, pp. 949\u2013957 (2012)","DOI":"10.1145\/2339530.2339679"},{"issue":"5","key":"24_CR34","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.: Geo-social group queries with minimum acquaintance constraints. VLDB J. 26(5), 709\u2013727 (2017)","journal-title":"VLDB J."}],"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-030-18576-3_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T13:07:21Z","timestamp":1710335241000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-18576-3_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030185756","9783030185763"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-18576-3_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"24 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DASFAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database Systems for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chiang Mai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Thailand","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dasfaa2019.eng.cmu.ac.th\/","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 (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"501","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"92","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"64","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18% - 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 (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13 demo papers, 6 tutorial papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}