{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,7]],"date-time":"2025-08-07T21:01:09Z","timestamp":1754600469605},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2016,9,16]],"date-time":"2016-09-16T00:00:00Z","timestamp":1473984000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Data Sci Anal"],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1007\/s41060-016-0022-1","type":"journal-article","created":{"date-parts":[[2016,9,16]],"date-time":"2016-09-16T09:36:25Z","timestamp":1474018585000},"page":"145-158","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A fast and complete algorithm for enumerating pseudo-cliques in large graphs"],"prefix":"10.1007","volume":"2","author":[{"given":"Hongjie","family":"Zhai","sequence":"first","affiliation":[]},{"given":"Makoto","family":"Haraguchi","sequence":"additional","affiliation":[]},{"given":"Yoshiaki","family":"Okubo","sequence":"additional","affiliation":[]},{"given":"Etsuji","family":"Tomita","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,16]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Abello, J., Resende, M.G.C., Sudarsky, S.: Massive quasi-clique detection. In: Proceedings of the LATIN 2002, LNCS-2286, pp. 598\u2013612 (2002)","DOI":"10.1007\/3-540-45995-2_51"},{"issue":"1","key":"22_CR2","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1080\/0022250X.1973.9989826","volume":"3","author":"RD Alba","year":"1973","unstructured":"Alba, R.D.: A graph-theoretic definition of a sociometric clique. J. Math. Sociol. 3(1), 113\u2013126 (1973)","journal-title":"J. Math. Sociol."},{"issue":"5439","key":"22_CR3","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A-L Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.-L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509\u2013512 (1999). (AAAS)","journal-title":"Science"},{"key":"22_CR4","unstructured":"Batagelj, V., Mrvar, A.: Pajek datasets. http:\/\/vlado.fmf.uni-lj.si\/pub\/networks\/data\/ (2006)"},{"key":"22_CR5","unstructured":"Batagelj, V., Zaversnik, M.: An $$O(m)$$ O ( m ) Algorithm for Cores Decomposition of Networks, CoRR (2003). cs.DS\/0310049 OpenURL"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Berlowitz, D., Cohen, S., Kimelfeld, B.: Efficient enumeration of maximal $$k$$ k -plexes. In: Proceedings of the 2015 ACM SIGMOD Conference, pp. 431\u2013444 (2015)","DOI":"10.1145\/2723372.2746478"},{"issue":"2","key":"22_CR7","first-page":"157","volume":"28","author":"SR Corman","year":"2002","unstructured":"Corman, S.R., Kuhn, T., Mcphee, R.D., Dooley, K.J.: Studying complex discursive systems: centering resonance analysis of communication. Hum. Commun. Res. 28(2), 157\u2013206 (2002)","journal-title":"Hum. Commun. Res."},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Eppstein, D., Strash, D.: Listing all maximal cliques in large sparse real-world graphs. In: Proceedings of the 10th Int\u2019l Symposium on Experimental Algorithms\u2014SEA\u201911, LNCS-6630, pp. 364\u2013375 (2011)","DOI":"10.1007\/978-3-642-20662-7_31"},{"key":"22_CR9","doi-asserted-by":"crossref","DOI":"10.1002\/9780470253489","volume-title":"Analysis of Biological Networks","author":"BH Junker","year":"2008","unstructured":"Junker, B.H., Schreiber, F.: Analysis of Biological Networks. Wiley, New York (2008)"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Kleinberg, J. and Faloutsos, C.: Graph evolution: densification and shrinking diameters. ACM Trans. Knowl. Discov. Data 1(1), Article No. 2 (2007)","DOI":"10.1145\/1217299.1217301"},{"key":"22_CR11","unstructured":"Leskovec, J. and Krevl, A.: SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data (2014)"},{"issue":"1","key":"22_CR12","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1080\/15427951.2009.10129177","volume":"6","author":"J Leskovec","year":"2009","unstructured":"Leskovec, J., Lang, K., Dasgupta, A., Mahoney, M.: Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters. Internet Math. 6(1), 29\u2013123 (2009)","journal-title":"Internet Math."},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Luce, D.R.: Connectivity and generalized cliques in sociometric group structure. Psychometrika 15(2), 169\u2013190 (1950)","DOI":"10.1007\/BF02289199"},{"issue":"4","key":"22_CR14","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","volume":"17","author":"U Luxburg","year":"2007","unstructured":"Luxburg, U.: A tutorial on spectral clustering. Stat. Comput. 17(4), 395\u2013416 (2007)","journal-title":"Stat. Comput."},{"issue":"2","key":"22_CR15","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF00139635","volume":"13","author":"R Mokken","year":"1979","unstructured":"Mokken, R.: Cliques, clubs and clans. Qual. Quant. Int. J. Methodol. 13(2), 161\u2013173 (1979)","journal-title":"Qual. Quant. Int. J. Methodol."},{"key":"22_CR16","series-title":"New Dimensions in Networks Series","volume-title":"Innovations in Financial and Economic Networks","year":"2004","unstructured":"Nagurney, A. (ed.): Innovations in Financial and Economic Networks. New Dimensions in Networks Series. Edward Elgar Publishing, Cheltenham (2004)"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Newman, M.E.J.: Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E 74(3), 036104 (2006)","DOI":"10.1103\/PhysRevE.74.036104"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Okubo, Y., Haraguchi, M., Tomita, E.: Structural change pattern mining based on constrained maximal $$k$$ k -plex search. In: Proceedings of the 15th Int\u2019l Conference on Discovery Science\u2014DS\u201912, LNAI-7569, pp. 284\u2013298 (2012)","DOI":"10.1007\/978-3-642-33492-4_23"},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"Okubo, Y., Haraguchi, M., Tomita, E.: Enumerating maximal isolated cliques based on vertex-dependent connection lower bound. In: Proceedings of the 12th Int\u2019l Conference on Machine Learning and Data Mining\u2014MLDM 2016, LNAI-9729, pp. 569\u2013583 (2016)","DOI":"10.1007\/978-3-319-41920-6_45"},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"Pattillo, J., Youssef, N., Butenko, S.: Clique relaxation models in social network analysis. In: Thai, My T., Pardalos, P.M. (eds.) Handbook of Optimization in Complex Networks: Communication and Social Networks. Springer Optimization and its Applications, vol. 58, pp. 143\u2013162. Springer, New York (2012)","DOI":"10.1007\/978-1-4614-0857-4_5"},{"key":"22_CR21","unstructured":"Rymon, R.: Search through systematic set enumeration. In: Proceedings of Int\u2019l Conference on Principles of Knowledge Representation Reasoning\u2014KR\u201992, pp. 539\u2013550 (1992)"},{"key":"22_CR22","unstructured":"Scott, J.P., Carrington, P.J. (eds.) The SAGE Handbook of Social Network Analysis. SAGE Publications Ltd, London (2011)"},{"issue":"3","key":"22_CR23","doi-asserted-by":"crossref","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."},{"issue":"1","key":"22_CR24","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1080\/0022250X.1978.9989883","volume":"6","author":"SB Seidman","year":"1978","unstructured":"Seidman, S.B., Foster, B.L.: A graph-theoretic generalization of the clique concept. J. Math. Sociol. 6(1), 139\u2013154 (1978)","journal-title":"J. Math. Sociol."},{"issue":"3","key":"22_CR25","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1017\/nws.2014.22","volume":"2","author":"N Slater","year":"2014","unstructured":"Slater, N., Itzchack, R., Louzoun, Y.: Mid size cliques are more common in real world networks than triangles. Netw. Sci. 2(3), 387\u2013402 (2014)","journal-title":"Netw. Sci."},{"issue":"1","key":"22_CR26","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.tcs.2006.06.015","volume":"363","author":"E Tomita","year":"2006","unstructured":"Tomita, E., Tanaka, A., Takahashi, H.: The worst-case time complexity for generating all maximal cliques and computational experiments. Theor. Comput. Sci. 363(1), 28\u201342 (2006)","journal-title":"Theor. Comput. Sci."},{"issue":"6684","key":"22_CR27","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of small-world networks. Nature 393(6684), 440\u2013442 (1998)","journal-title":"Nature"},{"key":"22_CR28","doi-asserted-by":"crossref","unstructured":"Wu, B., Pei, X.: A parallel algorithm for enumerating all the maximal $$k$$ k -plexes. In: Proceedings of the PAKDD 2007 Workshops, LNAI-4819, pp. 476\u2013483 (2007)","DOI":"10.1007\/978-3-540-77018-3_47"},{"key":"22_CR29","doi-asserted-by":"crossref","unstructured":"Yang, J., Leskovec, J.: Defining and evaluating network communities based on ground-truth. In: Proceedings of the 12th IEEE Int\u2019l Conference on Data Mining\u2014ICDM\u201912, pp. 745\u2013754 (2012)","DOI":"10.1109\/ICDM.2012.138"},{"key":"22_CR30","doi-asserted-by":"crossref","unstructured":"Zhai, H., Haraguchi, M., Okubo, Y., Tomita, E.: A fast and complete enumeration of pseudo-cliques for large graphs. In: Proceedings of the 20th Pacific Asia Conference on Knowledge Discovery and Data Mining\u2014PAKDD 2016 (Part I), LNAI-9651, pp. 423\u2013435 (2016)","DOI":"10.1007\/978-3-319-31753-3_34"}],"container-title":["International Journal of Data Science and Analytics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-016-0022-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s41060-016-0022-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-016-0022-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T12:40:37Z","timestamp":1568378437000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s41060-016-0022-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,16]]},"references-count":30,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2016,12]]}},"alternative-id":["22"],"URL":"https:\/\/doi.org\/10.1007\/s41060-016-0022-1","relation":{},"ISSN":["2364-415X","2364-4168"],"issn-type":[{"value":"2364-415X","type":"print"},{"value":"2364-4168","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,9,16]]}}}