{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,22]],"date-time":"2026-03-22T15:54:18Z","timestamp":1774194858851,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,8,4]],"date-time":"2017-08-04T00:00:00Z","timestamp":1501804800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Ministry of Science and Technology (MOST) Taiwan","award":["MOST 105-2218-E-002 -035 -"],"award-info":[{"award-number":["MOST 105-2218-E-002 -035 -"]}]},{"name":"Ministry of Science and Technology (MOST) Taiwan","award":["MOST 105-2218-E-007 -032 -MY2"],"award-info":[{"award-number":["MOST 105-2218-E-007 -032 -MY2"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,8,4]]},"DOI":"10.1145\/3097983.3097995","type":"proceedings-article","created":{"date-parts":[[2017,8,4]],"date-time":"2017-08-04T18:35:54Z","timestamp":1501871754000},"page":"415-424","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":23,"title":["On Finding Socially Tenuous Groups for Online Social Networks"],"prefix":"10.1145","author":[{"given":"Chih-Ya","family":"Shen","sequence":"first","affiliation":[{"name":"National Tsing Hua University, Hsinchu, Taiwan Roc"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liang-Hao","family":"Huang","sequence":"additional","affiliation":[{"name":"Academia Sinica, Taipei, Taiwan Roc"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"De-Nian","family":"Yang","sequence":"additional","affiliation":[{"name":"Academia Sinica, Taipei, Taiwan Roc"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong-Han","family":"Shuai","sequence":"additional","affiliation":[{"name":"National Chiao Tung University, Hsinchu, Taiwan Roc"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wang-Chien","family":"Lee","sequence":"additional","affiliation":[{"name":"Pennsylvania State University, State College, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming-Syan","family":"Chen","sequence":"additional","affiliation":[{"name":"National Taiwan University, Taipei, Taiwan Roc"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,8,4]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(83)90028-X"},{"key":"e_1_3_2_2_2_1","volume-title":"Trusses: cohesive subgraphs for social network analysis","author":"Cohen J.","year":"2008","unstructured":"J. Cohen . Trusses: cohesive subgraphs for social network analysis , 2008 . J. Cohen. Trusses: cohesive subgraphs for social network analysis, 2008."},{"key":"e_1_3_2_2_3_1","volume-title":"Generalized cores. arXiv:cs\/0202039","author":"Batagelj V.","year":"2002","unstructured":"V. Batagelj and M. Zaversnik . Generalized cores. arXiv:cs\/0202039 , 2002 . V. Batagelj and M. Zaversnik. Generalized cores. arXiv:cs\/0202039, 2002."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2746478"},{"key":"e_1_3_2_2_6_1","volume-title":"Social work with groups","author":"Reid K.","year":"1997","unstructured":"K. Reid . Social work with groups , 1997 . K. Reid. Social work with groups, 1997."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2009.86"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511815478"},{"key":"e_1_3_2_2_9_1","series-title":"Treatment improvement protocol (TIP) series 41","volume-title":"Substance abuse treatment: group therapy","author":"Center for substance abuse treatment.","year":"2005","unstructured":"Center for substance abuse treatment. Substance abuse treatment: group therapy . Treatment improvement protocol (TIP) series 41 , 2005 . Center for substance abuse treatment. Substance abuse treatment: group therapy. Treatment improvement protocol (TIP) series 41, 2005."},{"key":"e_1_3_2_2_10_1","unstructured":"On finding socially tenuous groups for online social networks (online full version). http:\/\/www.cs.nthu.edu.tw\/~chihya\/KDD2017\/paper.pdf.  On finding socially tenuous groups for online social networks (online full version). http:\/\/www.cs.nthu.edu.tw\/~chihya\/KDD2017\/paper.pdf."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004530010050"},{"key":"e_1_3_2_2_12_1","volume-title":"Quality and Quantity: International Journal of Methodology","author":"Mokken R.","year":"1979","unstructured":"R. Mokken . Cliques, clubs and clans . Quality and Quantity: International Journal of Methodology , 1979 . R. Mokken. Cliques, clubs and clans. Quality and Quantity: International Journal of Methodology, 1979."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2433396.2433471"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2501654.2501657"},{"key":"e_1_3_2_2_15_1","unstructured":"Q. Zhu H. Hu J. Xu and W.-C. Lee. Geo-social group queries with minimum acquaintance constraint. Xiv:1406.7367v1 2014.  Q. Zhu H. Hu J. Xu and W.-C. Lee. Geo-social group queries with minimum acquaintance constraint. Xiv:1406.7367v1 2014."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2468726"},{"key":"e_1_3_2_2_17_1","volume-title":"VLDB","author":"Shuai H.-H.","year":"2014","unstructured":"H.-H. Shuai , D.-N. Yang , P. S. Yu , and M.-S. Chen . Willingness optimization for social group activity . VLDB , 2014 . H.-H. Shuai, D.-N. Yang, P. S. Yu, and M.-S. Chen.Willingness optimization for social group activity. VLDB, 2014."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2015.91"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989399"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020492"},{"key":"e_1_3_2_2_21_1","volume-title":"ICDM","author":"Ruan M.","year":"2011","unstructured":"M. Ruan , R. Jin , and Y. Huang . Distance preserving graphs implification . ICDM , 2011 . M. Ruan, R. Jin, and Y. Huang. Distance preserving graphs implification. ICDM, 2011."},{"key":"e_1_3_2_2_22_1","volume-title":"FSTTCS","author":"Berman P.","year":"2010","unstructured":"P. Berman , S. Raskhodnikova , and G. Ruan . Finding sparser directed spanners . FSTTCS , 2010 . P. Berman, S. Raskhodnikova, and G. Ruan. Finding sparser directed spanners. FSTTCS, 2010."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/0406022"},{"key":"e_1_3_2_2_24_1","author":"Hatami H.","year":"2013","unstructured":"H. Hatami , J. Hladky , D. Kral , S. Norine , and A. Razborov . On the number of pentagons in triangle-free graphs. Journal of Combinatorial Theory , 2013 . H. Hatami, J. Hladky, D. Kral, S. Norine, and A. Razborov. On the number of pentagons in triangle-free graphs. Journal of Combinatorial Theory, 2013.","journal-title":"Journal of Combinatorial Theory"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2012.04.001"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2009.02.008"},{"key":"e_1_3_2_2_27_1","volume-title":"SOFSEM","author":"Bougeret M.","year":"2014","unstructured":"M. Bougeret , N. Bousquet , R. Giroudeau , R. Watrigant . Parameterized complexity of the sparsest k-subgraph problem in chordalgraphs . SOFSEM , 2014 . M. Bougeret, N. Bousquet, R. Giroudeau, R. Watrigant. Parameterized complexity of the sparsest k-subgraph problem in chordalgraphs. SOFSEM, 2014."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.46298\/dmtcs.3394"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350247"},{"key":"e_1_3_2_2_31_1","volume-title":"Threshold graphs and related topics","author":"Mahadev N.","year":"1995","unstructured":"N. Mahadev and U. Peled . Threshold graphs and related topics , New York, NY, USA : Elsevier , 1995 . N. Mahadev and U. Peled. Threshold graphs and related topics, New York, NY, USA: Elsevier, 1995."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.89.042812"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592665.1592675"},{"key":"e_1_3_2_2_34_1","volume-title":"Online popularity and topical interests through the lens of Instagram. HT","author":"Ferrara E.","year":"2014","unstructured":"E. Ferrara , R. Interdonato , and A. Tagarelli . Online popularity and topical interests through the lens of Instagram. HT , 2014 . E. Ferrara, R. Interdonato, and A. Tagarelli. Online popularity and topical interests through the lens of Instagram. HT, 2014."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1137\/S089548010240415X"},{"key":"e_1_3_2_2_36_1","author":"Liben-Nowell D.","year":"2007","unstructured":"D. Liben-Nowell and J. Kleinberg . The link prediction problem for social networks. Journal of the American Soceity for Information Science and Technology , 2007 . D. Liben-Nowell and J. Kleinberg. The link prediction problem for social networks. Journal of the American Soceity for Information Science and Technology, 2007.","journal-title":"Journal of the American Soceity for Information Science and Technology"},{"key":"e_1_3_2_2_37_1","volume-title":"Nature","author":"Clause A.","year":"2008","unstructured":"A. Clause , C. Moore , and M. Newman . Hierarchical structure and the prediction of missing links in network . Nature , 2008 . A. Clause, C. Moore, and M. Newman. Hierarchical structure and the prediction of missing links in network. Nature, 2008."},{"key":"e_1_3_2_2_38_1","volume-title":"WWW","author":"Rossi R. A.","year":"2014","unstructured":"R. A. Rossi , D. F. Gleich , A. H. Gebremedhin , and Md. M. A. Patwary . Fast maximum clique algorithms for large graphs . WWW , 2014 . R. A. Rossi, D. F. Gleich, A. H. Gebremedhin, and Md. M. A. Patwary. Fast maximum clique algorithms for large graphs. WWW, 2014."},{"key":"e_1_3_2_2_39_1","volume-title":"ICDE","author":"Xiang J.","year":"2013","unstructured":"J. Xiang , C. Guo , and A. Aboulnaga . Scalable maximum clique computation using mapreduce . ICDE , 2013 . J. Xiang, C. Guo, and A. Aboulnaga. Scalable maximum clique computation using mapreduce. ICDE, 2013."}],"event":{"name":"KDD '17: The 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"Halifax NS Canada","acronym":"KDD '17","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3097983.3097995","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3097983.3097995","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:03:42Z","timestamp":1750273422000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3097983.3097995"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,4]]},"references-count":37,"alternative-id":["10.1145\/3097983.3097995","10.1145\/3097983"],"URL":"https:\/\/doi.org\/10.1145\/3097983.3097995","relation":{},"subject":[],"published":{"date-parts":[[2017,8,4]]},"assertion":[{"value":"2017-08-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}