{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T21:52:07Z","timestamp":1672609927546},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,12,19]],"date-time":"2019-12-19T00:00:00Z","timestamp":1576713600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,12,19]],"date-time":"2019-12-19T00:00:00Z","timestamp":1576713600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Front. Comput. Sci."],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s11704-019-7235-0","type":"journal-article","created":{"date-parts":[[2019,12,20]],"date-time":"2019-12-20T08:04:30Z","timestamp":1576829070000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Most similar maximal clique query on large graphs"],"prefix":"10.1007","volume":"14","author":[{"given":"Yun","family":"Peng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yitong","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huawei","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhizheng","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huimin","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,12,19]]},"reference":[{"issue":"3","key":"7235_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3390\/a10030090","volume":"10","author":"M Hamann","year":"2017","unstructured":"Hamann M, R\u00f6hrs E, Wagner D. Local community detection based on small cliques. Algorithms, 2017, 10(3): 1\u201322","journal-title":"Algorithms"},{"key":"7235_CR2","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":"1","key":"7235_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00453-008-9238-3","volume":"56","author":"T Uno","year":"2010","unstructured":"Uno T. An efficient algorithm for solving pseudo clique enumeration problem. Algorithmica, 2010, 56(1): 3\u201316","journal-title":"Algorithmica"},{"issue":"7","key":"7235_CR4","doi-asserted-by":"publisher","first-page":"798","DOI":"10.14778\/2752939.2752948","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. Proceedings of the VLDB Endowment, 2015, 8(7): 798\u2013809","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"10","key":"7235_CR5","doi-asserted-by":"publisher","first-page":"998","DOI":"10.14778\/2794367.2794370","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. Proceedings of the VLDB Endowment, 2015, 8(10): 998\u20131009","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"7","key":"7235_CR6","doi-asserted-by":"publisher","first-page":"817","DOI":"10.14778\/3067421.3067430","volume":"10","author":"H Cai","year":"2017","unstructured":"Cai H, Zheng V W, Zhu F, Chang K C C, Huang Z. From community detection to community profiling. Proceedings of the VLDB Endowment, 2017, 10(7): 817\u2013828","journal-title":"Proceedings of the VLDB Endowment"},{"key":"7235_CR7","doi-asserted-by":"crossref","unstructured":"Palsetia D, Patwary M M A, Hendrix W, Agrawal A, Choudhary A. Clique guided community detection. In: Proceedings of the 2014 IEEE International Conference on Big Data. 2014, 500\u2013509","DOI":"10.1109\/BigData.2014.7004267"},{"issue":"11","key":"7235_CR8","doi-asserted-by":"publisher","first-page":"3171","DOI":"10.1016\/j.cor.2005.01.027","volume":"33","author":"V Boginski","year":"2006","unstructured":"Boginski V, Butenko S, Pardalos P M. Mining market data: a network approach. Computers & Operations Research, 2006, 33(11): 3171\u20133184","journal-title":"Computers & Operations Research"},{"key":"7235_CR9","unstructured":"Berry N, Ko T, Moy T, Smrcka J, Turnley J, Wu B. Emergent clique formation in terrorist recruitment. In: Proceedings of the Workshop on Agent Organizations: Theory and Practice of AAAI\u2019 04. 2004, 1\u20138"},{"key":"7235_CR10","doi-asserted-by":"publisher","first-page":"1198","DOI":"10.1093\/bioinformatics\/17.12.1198","volume":"17","author":"F Kose","year":"2001","unstructured":"Kose F, Weckwerth W, Linke T, Fiehn O. Visualizing plant metabolomic correlation network using clique-metabolite matrices. Bioinformatics, 2001, 17: 1198\u20131208","journal-title":"Bioinformatics"},{"key":"7235_CR11","doi-asserted-by":"crossref","unstructured":"Cheng J, Zhu L, Ke Y, Chu S. Fast algorithms for maximal clique enumeration with limited memory. In: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 2012, 1240\u20131248","DOI":"10.1145\/2339530.2339724"},{"key":"7235_CR12","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-540-27810-8_23","volume-title":"Algorithm Theory - SWAT 2004","author":"Kazuhisa Makino","year":"2004","unstructured":"Makino K, Uno T. New algorithms for enumerating all maximal cliques. In: Proceedings of Scandinavian Workshop on Algorithm Theory. 2004, 260\u2013272"},{"issue":"1\u20133","key":"7235_CR13","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0166-218X(01)00290-6","volume":"120","author":"P R \u00d6sterg\u00e5rd","year":"2002","unstructured":"\u00d6sterg\u00e5rd P R. A fast algorithm for the maximum clique problem. Discrete Applied Mathematics, 2002, 120(1\u20133): 197\u2013207","journal-title":"Discrete Applied Mathematics"},{"key":"7235_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-8857-6","volume-title":"Security and Privacy in Mobile Social Networks","author":"X Liang","year":"2013","unstructured":"Liang X, Lu R, Lin X, Shen X. Security and Privacy in Mobile Social Networks. Springer-Verlag New York, 2013"},{"key":"7235_CR15","doi-asserted-by":"crossref","unstructured":"Sarvari H, Abozinadah E, Mbaziira A, Mccoy D. Constructing and analyzing criminal networks. In: Proceedings of the 2014 IEEE Security and Privacy Workshops. 2014, 84\u201391","DOI":"10.1109\/SPW.2014.22"},{"key":"7235_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-5956-9","volume-title":"Service-Oriented Crowdsourcing","author":"D Schall","year":"2012","unstructured":"Schall D. Service-Oriented Crowdsourcing. Springer-Verlag New York, 2012"},{"key":"7235_CR17","first-page":"293","volume-title":"ECSCW 2011: Proceedings of the 12th European Conference on Computer Supported Cooperative Work, 24-28 September 2011, Aarhus Denmark","author":"Kelli Bacon","year":"2011","unstructured":"Bacon K, Dewan P. Mixed-initiative friend-list creation. In: Proceedings of the 12th European Conference on Computer Supported Cooperative Work. 2011, 293\u2013312"},{"key":"7235_CR18","doi-asserted-by":"crossref","unstructured":"Cui W, Xiao Y, Wang H, Lu Y, Wang W. Online search of overlapping communities. In: Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data. 2013, 277\u2013288","DOI":"10.1145\/2463676.2463722"},{"issue":"1","key":"7235_CR19","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1186\/1471-2105-10-205","volume":"10","author":"T Matsunaga","year":"2009","unstructured":"Matsunaga T, Yonemori C, Tomita E, Muramatsu M. Clique-based data mining for related genes in a biomedical database. BMC Bioinformatics, 2009, 10(1): 205","journal-title":"BMC Bioinformatics"},{"key":"7235_CR20","doi-asserted-by":"crossref","unstructured":"Sarawagi S, Kirpal A. Efficient set joins on similarity predicates. In: Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data. 2004, 743\u2013754","DOI":"10.1145\/1007568.1007652"},{"key":"7235_CR21","doi-asserted-by":"crossref","unstructured":"Hadjieleftheriou M, Chandel A, Koudas N, Srivastava D. Fast indexes and algorithms for set similarity selection queries. In: Proceedings of the 24th IEEE International Conference on Data Engineering. 2008, 267\u2013276","DOI":"10.1109\/ICDE.2008.4497435"},{"issue":"1","key":"7235_CR22","first-page":"25","volume":"33","author":"M Hadjieleftheriou","year":"2010","unstructured":"Hadjieleftheriou M, Srivastava D. Weighted set-based string similarity. IEEE Data Engineering Bulletin, 2010, 33(1): 25\u201336","journal-title":"IEEE Data Engineering Bulletin"},{"issue":"1","key":"7235_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1877766.1877767","volume":"29","author":"J S Culpepper","year":"2010","unstructured":"Culpepper J S, Moffat A. Efficient set intersection for inverted indexing. ACM Transactions on Information System, 2010, 29(1): 1\u201324","journal-title":"ACM Transactions on Information System"},{"issue":"1","key":"7235_CR24","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1109\/TST.2013.6449411","volume":"18","author":"H Wu","year":"2013","unstructured":"Wu H, Li G, Zhou L. Ginix: generalized inverted index for keyword search. Tsinghua Science and Technology, 2013, 18(1): 77\u201387","journal-title":"Tsinghua Science and Technology"},{"issue":"4","key":"7235_CR25","doi-asserted-by":"publisher","first-page":"360","DOI":"10.14778\/2856318.2856330","volume":"9","author":"D Deng","year":"2015","unstructured":"Deng D, Li G, Wen H, Feng J. An efficient partition based method for exact set similarity joins. Proceedings of the VLDB Endowment, 2015, 9(4): 360\u2013371","journal-title":"Proceedings of the VLDB Endowment"},{"key":"7235_CR26","doi-asserted-by":"crossref","unstructured":"Yuan L, Qin L, Lin X, Chang L, Zhang W. Diversified top-k clique search. In: Proceedings of the 31st IEEE International Conference on Data Engineering. 2015, 387\u2013398","DOI":"10.1109\/ICDE.2015.7113300"},{"key":"7235_CR27","doi-asserted-by":"crossref","unstructured":"Wang J, Cheng J, Fu A W C. Redundancy-aware maximal cliques. In: Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 2013, 122\u2013130","DOI":"10.1145\/2487575.2487689"},{"key":"7235_CR28","doi-asserted-by":"crossref","unstructured":"Li C, Lu J, Lu Y. Efficient merging and filtering algorithms for approximate string searches. In: Proceedings of the 24th IEEE International Conference on Data Engineering. 2008, 257\u2013266","DOI":"10.1109\/ICDE.2008.4497434"},{"key":"7235_CR29","doi-asserted-by":"crossref","unstructured":"Bayardo R J, Ma Y, Srikant R. Scaling up all pairs similarity search. In: Proceedings of the 16th International World Wide Web Conference. 2007, 131\u2013140","DOI":"10.1145\/1242572.1242591"},{"key":"7235_CR30","doi-asserted-by":"crossref","unstructured":"Xiao C, Wang W, Lin X, Yu J X. Efficient similarity joins for near duplicate detection. In: Proceedings of the 17th International World Wide Web Conference. 2008, 131\u2013140","DOI":"10.1145\/1367497.1367516"},{"key":"7235_CR31","doi-asserted-by":"crossref","unstructured":"Wang J, Li G, Feng J. Can we beat the prefix filtering?: An adaptive framework for similarity join and search. In: Proceedings of the 2012 ACM International Conference on Management of Data. 2012, 85\u201396","DOI":"10.1145\/2213836.2213847"},{"key":"7235_CR32","doi-asserted-by":"crossref","unstructured":"Xiao C, Wang W, Lin X, Shang H. Top-k set similarity joins. In: Proceedings of the 25th IEEE International Conference on Data Engineering. 2009, 916\u2013927","DOI":"10.1109\/ICDE.2009.111"},{"key":"7235_CR33","doi-asserted-by":"crossref","unstructured":"Deng D, Li G, Feng J. A pivotal prefix based filtering algorithm for string similarity search. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data. 2014, 673\u2013684","DOI":"10.1145\/2588555.2593675"},{"issue":"8","key":"7235_CR34","doi-asserted-by":"publisher","first-page":"470","DOI":"10.14778\/2002974.2002975","volume":"4","author":"N Ao","year":"2011","unstructured":"Ao N, Zhang F, Wu D, Stones D S, Wang G, Liu X, Liu J, Lin S. Efficient parallel lists intersection and index compression algorithms using graphics processing units. Proceedings of the VLDB Endowment, 2011, 4(8): 470\u2013481","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"3","key":"7235_CR35","doi-asserted-by":"publisher","first-page":"293","DOI":"10.14778\/2735508.2735518","volume":"8","author":"H Inoue","year":"2014","unstructured":"Inoue H, Ohara M, Taura K. Faster set intersection with simd instructions by reducing branch mispredictions. Proceedings of the VLDB Endowment, 2014, 8(3): 293\u2013304","journal-title":"Proceedings of the VLDB Endowment"},{"key":"7235_CR36","doi-asserted-by":"crossref","unstructured":"Vernica R, Carey M J, Li C. Efficient parallel set-similarity joins using mapreduce. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data. 2010, 495\u2013506","DOI":"10.1145\/1807167.1807222"},{"issue":"4","key":"7235_CR37","doi-asserted-by":"publisher","first-page":"255","DOI":"10.14778\/1938545.1938550","volume":"4","author":"Bolin Ding","year":"2011","unstructured":"Bolin Ding A C K. Fast set intersection in memory. In: Proceedings of the 37th International Conference on Very Large Databases. 2011, 255\u2013266","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"4","key":"7235_CR38","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1109\/TSC.2013.42","volume":"7","author":"Z Fan","year":"2014","unstructured":"Fan Z, Peng Y, Choi B, Xu J, Bhowmick S S. Towards efficient authenticated subgraph query service in outsourced graph databases. IEEE Transactions on Services Computing, 2014, 7(4): 696\u2013713","journal-title":"IEEE Transactions on Services Computing"},{"issue":"3","key":"7235_CR39","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V Chvatal","year":"1979","unstructured":"Chvatal V. A greedy heuristic for the set-covering problem. Mathematics of Operations Research, 1979, 4(3): 233\u2013235","journal-title":"Mathematics of Operations Research"},{"key":"7235_CR40","doi-asserted-by":"crossref","unstructured":"Eppstein D, L\u00f6ffler M, Strash D. Listing all maximal cliques in sparse graphs in near-optimal time. Algorithms and Computation, 2010, 403\u2013414","DOI":"10.1007\/978-3-642-17517-6_36"}],"container-title":["Frontiers of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-019-7235-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11704-019-7235-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-019-7235-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,18]],"date-time":"2020-12-18T01:00:53Z","timestamp":1608253253000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11704-019-7235-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,19]]},"references-count":40,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["7235"],"URL":"https:\/\/doi.org\/10.1007\/s11704-019-7235-0","relation":{},"ISSN":["2095-2228","2095-2236"],"issn-type":[{"value":"2095-2228","type":"print"},{"value":"2095-2236","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,12,19]]},"assertion":[{"value":"4 July 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 November 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 December 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"143601"}}