{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:38:30Z","timestamp":1725518310779},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,8,8]],"date-time":"2022-08-08T00:00:00Z","timestamp":1659916800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,8,8]],"date-time":"2022-08-08T00:00:00Z","timestamp":1659916800000},"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":["Front. Comput. Sci."],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s11704-022-1462-5","type":"journal-article","created":{"date-parts":[[2022,8,8]],"date-time":"2022-08-08T14:03:06Z","timestamp":1659967386000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The most tenuous group query"],"prefix":"10.1007","volume":"17","author":[{"given":"Na","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huaijie","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenhao","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ningning","family":"Cui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Yin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianliang","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wang-Chien","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,8]]},"reference":[{"key":"1462_CR1","doi-asserted-by":"crossref","unstructured":"Cui W, Xiao Y, Wang H, Wang W. Local search of communities in large graphs. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data. 2014, 991\u20131002","DOI":"10.1145\/2588555.2612179"},{"issue":"5","key":"1462_CR2","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 J X, Mao R. Influential community search in large networks. Proceedings of the VLDB Endowment, 2015, 8(5): 509\u2013520","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"3","key":"1462_CR3","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0378-8733(83)90028-X","volume":"5","author":"S B Seidman","year":"1983","unstructured":"Seidman S B. Network structure and minimum degree. Social Networks, 1983, 5(3): 269\u2013287","journal-title":"Social Networks"},{"key":"1462_CR4","doi-asserted-by":"crossref","unstructured":"Sozio M, Gionis A. The community-search problem and how to plan a successful cocktail party. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 2010, 939\u2013948","DOI":"10.1145\/1835804.1835923"},{"key":"1462_CR5","doi-asserted-by":"crossref","unstructured":"Zheng D, Liu J, Li R H, Aslay C, Chen Y C, Huang X. Querying intimate-core groups in weighted graphs. In: Proceedings of the 11th IEEE International Conference on Semantic Computing (ICSC). 2017, 156\u2013163","DOI":"10.1109\/ICSC.2017.80"},{"key":"1462_CR6","doi-asserted-by":"crossref","unstructured":"Ebadian S, Huang X. Fast algorithm for K-truss discovery on public-private graphs. In: Proceedings of the 28th International Joint Conference on Artificial Intelligence. 2019, 2258\u20132264","DOI":"10.24963\/ijcai.2019\/313"},{"key":"1462_CR7","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: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data. 2014, 1311\u20131322","DOI":"10.1145\/2588555.2610495"},{"issue":"4","key":"1462_CR8","doi-asserted-by":"publisher","first-page":"276","DOI":"10.14778\/2856318.2856323","volume":"9","author":"X Huang","year":"2015","unstructured":"Huang X, Lakshmanan L V S, Yu J X, Cheng H. Approximate closest community search in networks. Proceedings of the VLDB Endowment, 2015, 9(4): 276\u2013287","journal-title":"Proceedings of the VLDB Endowment"},{"key":"1462_CR9","doi-asserted-by":"crossref","unstructured":"Hu J, Cheng R, Chang K C C, Sankar A, Fang Y, Lam B Y H. Discovering maximal motif cliques in large heterogeneous information networks. In: Proceedings of the 35th IEEE International Conference on Data Engineering (ICDE). 2019, 746\u2013757","DOI":"10.1109\/ICDE.2019.00072"},{"issue":"2","key":"1462_CR10","doi-asserted-by":"publisher","first-page":"155","DOI":"10.14778\/3364324.3364330","volume":"13","author":"C Ma","year":"2019","unstructured":"Ma C, Cheng R, Lakshmanan L V S, Grubenmann T, Fang Y, Li X. LINC: a motif counting algorithm for uncertain graphs. Proceedings of the VLDB Endowment, 2019, 13(2): 155\u2013168","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"4","key":"1462_CR11","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s41019-017-0033-5","volume":"1","author":"B Hou","year":"2016","unstructured":"Hou B, Wang Z, Chen Q, Suo B, Fang C, Li Z, Ives Z G. Efficient maximal clique enumeration over graph data. Data Science and Engineering, 2016, 1(4): 219\u2013230","journal-title":"Data Science and Engineering"},{"key":"1462_CR12","doi-asserted-by":"crossref","unstructured":"Li W. Finding tenuous groups in social networks. In: Proceedings of the 2018 IEEE International Conference on Data Mining Workshops (ICDMW). 2018, 284\u2013291","DOI":"10.1109\/ICDMW.2018.00048"},{"key":"1462_CR13","doi-asserted-by":"crossref","unstructured":"Li Y, Sun H, He L, Huang J, Chen J, He H, Jia X. Querying tenuous group in attributed networks. The Computer Journal, 2020: bxaa115","DOI":"10.1093\/comjnl\/bxaa115"},{"key":"1462_CR14","doi-asserted-by":"crossref","unstructured":"Shen C Y, Huang L H, Yang D N, Shuai H H, Lee W C, Chen M S. On finding socially tenuous groups for online social networks. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 2017, 415\u2013424","DOI":"10.1145\/3097983.3097995"},{"key":"1462_CR15","doi-asserted-by":"publisher","unstructured":"Shen C Y, Shuai H H, Yang D N, Lee G S, Huang L H, Lee W C, Chen M S. On extracting socially tenuous groups for online social networks with k-triangles. IEEE Transactions on Knowledge and Data Engineering, 2020, doi: https:\/\/doi.org\/10.1109\/TKDE.2020.3025911","DOI":"10.1109\/TKDE.2020.3025911"},{"key":"1462_CR16","unstructured":"Center for Substance Abuse Treatment. Substance abuse treatment: Group therapy. 2005"},{"key":"1462_CR17","volume-title":"Finding a Maximum Density Subgraph","author":"A V Goldberg","year":"1984","unstructured":"Goldberg A V. Finding a Maximum Density Subgraph. Berkeley: University of California, 1984"},{"key":"1462_CR18","doi-asserted-by":"crossref","unstructured":"Tsourakakis C. The k-clique densest subgraph problem. In: Proceedings of the 24th International Conference on World Wide Web. 2015, 1122\u20131132","DOI":"10.1145\/2736277.2741098"},{"key":"1462_CR19","doi-asserted-by":"crossref","unstructured":"Mitzenmacher M, Pachocki J, Peng R, Tsourakakis C, Xu S C. Scalable large near-clique detection in large-scale networks via sampling. In: Proceedings of the 21st ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 2015, 815\u2013824","DOI":"10.1145\/2783258.2783385"},{"issue":"11","key":"1462_CR20","doi-asserted-by":"publisher","first-page":"1719","DOI":"10.14778\/3342263.3342645","volume":"12","author":"Y Fang","year":"2019","unstructured":"Fang Y, Yu K, Cheng R, Lakshmanan L V S, Lin X. Efficient algorithms for densest subgraph discovery. Proceedings of the VLDB Endowment, 2019, 12(11): 1719\u20131732","journal-title":"Proceedings of the VLDB Endowment"},{"key":"1462_CR21","doi-asserted-by":"crossref","unstructured":"Charikar M. Greedy approximation algorithms for finding dense components in a graph. In: Proceedings of the 3rd International Workshop on Approximation Algorithms for Combinatorial Optimization. 2000, 84\u201395","DOI":"10.1007\/3-540-44436-X_10"},{"issue":"5","key":"1462_CR22","doi-asserted-by":"publisher","first-page":"454","DOI":"10.14778\/2140436.2140442","volume":"5","author":"B Bahmani","year":"2012","unstructured":"Bahmani B, Kumar R, Vassilvitskii S. Densest subgraph in streaming and MapReduce. Proceedings of the VLDB Endowment, 2012, 5(5): 454\u2013465","journal-title":"Proceedings of the VLDB Endowment"},{"key":"1462_CR23","doi-asserted-by":"crossref","unstructured":"Bhaskara A, Charikar M, Chlamtac E, Feige U, Vijayaraghavan A. Detecting high log-densities: an O(n1\/4) approximation for densest k-subgraph. In: Proceedings of the 42nd ACM Symposium on Theory of Computing. 2010, 201\u2013210","DOI":"10.1145\/1806689.1806719"},{"key":"1462_CR24","doi-asserted-by":"crossref","unstructured":"Qin L, Li R H, Chang L, Zhang C. Locally densest subgraph discovery. In: Proceedings of the 21st ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 2015, 965\u2013974","DOI":"10.1145\/2783258.2783299"},{"key":"1462_CR25","unstructured":"Kannan R, Vinay V. Analyzing the Structure of Large Graphs. Forschungsinst. f\u00fcr Diskrete Mathematik, 1999"},{"key":"1462_CR26","doi-asserted-by":"crossref","unstructured":"Khuller S, Saha B. On finding dense subgraphs. In: Proceedings of the 36th International Colloquium on Automata, Languages, and Programming. 2009, 597\u2013608","DOI":"10.1007\/978-3-642-02927-1_50"}],"container-title":["Frontiers of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-022-1462-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11704-022-1462-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-022-1462-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,19]],"date-time":"2024-05-19T20:35:56Z","timestamp":1716150956000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11704-022-1462-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,8]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["1462"],"URL":"https:\/\/doi.org\/10.1007\/s11704-022-1462-5","relation":{},"ISSN":["2095-2228","2095-2236"],"issn-type":[{"value":"2095-2228","type":"print"},{"value":"2095-2236","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,8]]},"assertion":[{"value":"21 August 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 January 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 August 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"172605"}}