{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,30]],"date-time":"2023-06-30T15:10:25Z","timestamp":1688137825607},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,3,27]],"date-time":"2013-03-27T00:00:00Z","timestamp":1364342400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1007\/s10115-013-0625-y","type":"journal-article","created":{"date-parts":[[2013,3,26]],"date-time":"2013-03-26T10:11:38Z","timestamp":1364292698000},"page":"579-608","source":"Crossref","is-referenced-by-count":4,"title":["Finding maximal homogeneous clique sets"],"prefix":"10.1007","volume":"39","author":[{"given":"Pierre-Nicolas","family":"Mougel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christophe","family":"Rigotti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Plantevit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olivier","family":"Gandrillon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,3,27]]},"reference":[{"key":"625_CR1","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1038\/75556","volume":"25","author":"M Ashburner","year":"2000","unstructured":"Ashburner M, Ball CA, Blake JA, Botstein D, Butler H, Cherry JM, Davis AP, Dolinski K, Dwight SS, Eppig JT, Harris MA, Hill DP, Issel-Tarver L, Kasarskis A, Lewis S, Matese JC, Richardson JE, Ringwald M, Rubin GM, Sherlock G (2000) Gene ontology: tool for the unification of biology. Nat Genet 25:25\u201329","journal-title":"Nat Genet"},{"key":"625_CR2","doi-asserted-by":"crossref","unstructured":"Becquet C, Blachon S, Jeudy B, Boulicaut JF, Gandrillon O (2002) Strong-association-rule mining for large-scale gene-expression data analysis: a case study on human SAGE data. Genome Biol 3(12):1\u201316","DOI":"10.1186\/gb-2002-3-12-research0067"},{"key":"625_CR3","doi-asserted-by":"crossref","unstructured":"Berlingerio M, Bonchi F, Bringmann B, Gionis A (2009) Mining graph evolution rules. In: European conference on machine learning and knowledge discovery in databases (ECML\/PKDD), pp 115\u2013130","DOI":"10.1007\/978-3-642-04180-8_25"},{"key":"625_CR4","unstructured":"Boden B (2012) Efficient combined clustering of graph and attribute data. In: PhD Workshop of the 38th international conference on very large data bases (VLDB), pp 13\u201318"},{"issue":"2","key":"625_CR5","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/s10115-004-0164-7","volume":"8","author":"F Bonchi","year":"2005","unstructured":"Bonchi F, Giannotti F, Mazzanti A, Pedreschi D (2005) Efficient breadth-first mining of frequent pattern with monotone constraints. Knowl Inf Syst (KAIS) 8(2):131\u2013153","journal-title":"Knowl Inf Syst (KAIS)"},{"key":"625_CR6","doi-asserted-by":"crossref","unstructured":"Bringmann B, Nijssen S (2008) What is frequent in a single graph? In: Pacific-Asia conference on knowledge discovery and data mining (PAKDD), pp 858\u2013863","DOI":"10.1007\/978-3-540-68125-0_84"},{"issue":"1","key":"625_CR7","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s10115-008-0136-4","volume":"18","author":"B Bringmann","year":"2009","unstructured":"Bringmann B, Zimmermann A (2009) One in a million: picking the right patterns. Knowl Inf Syst (KAIS) 18(1):61\u201381","journal-title":"Knowl Inf Syst (KAIS)"},{"key":"625_CR8","doi-asserted-by":"crossref","unstructured":"Calders T, Ramon J, Dyck DV (2008) Anti-monotonic overlap-graph support measures. In: International conference on data mining (ICDM), pp 73\u201382","DOI":"10.1109\/ICDM.2008.114"},{"key":"625_CR9","doi-asserted-by":"crossref","unstructured":"Chakrabarti D, Faloutsos C (2006) Graph mining: laws, generators, and algorithms. ACM Comput Surv 38(1) 1\u201369","DOI":"10.1145\/1132952.1132954"},{"key":"625_CR10","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u00f6s","year":"1959","unstructured":"Erd\u00f6s P, R\u00e9nyi A (1959) On random graphs. Publicationes Mathematicae 6:290\u2013297","journal-title":"Publicationes Mathematicae"},{"key":"625_CR11","doi-asserted-by":"crossref","unstructured":"Fukuzaki M, Seki M, Kashima H, Sese J (2010) Finding itemset-sharing patterns in a large itemset-associated graph. In: Pacific-Asia conference on knowledge discovery and data mining (PAKDD), pp 147\u2013159","DOI":"10.1007\/978-3-642-13672-6_15"},{"key":"625_CR12","doi-asserted-by":"crossref","unstructured":"Gallo A, Miettinen P, Mannila H (2008) Finding subgroups having several descriptions: algorithms for redescription mining. In: SIAM international conference on data mining (SDM), pp 334\u2013345","DOI":"10.1137\/1.9781611972788.30"},{"issue":"2","key":"625_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1376815.1376816","volume":"2","author":"R Ge","year":"2008","unstructured":"Ge R, Ester M, Gao BJ, Hu Z, Bhattacharya B, Ben-Moshe B (2008) Joint cluster analysis of attribute data and relationship data: the connected k-center problem, algorithms and applications. ACM Trans Knowl Discov Data (TKDD) 2(2):1\u201335","journal-title":"ACM Trans Knowl Discov Data (TKDD)"},{"key":"625_CR14","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1093\/bioinformatics\/18.suppl_1.S145","volume":"18","author":"D Hanisch","year":"2002","unstructured":"Hanisch D, Zien A, Zimmer R, Lengauer T (2002) Co-clustering of biological networks and gene expression data. Bioinformatics 18:145\u2013154","journal-title":"Bioinformatics"},{"key":"625_CR15","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1093\/nar\/gkn760","volume":"37","author":"LJ Jensen","year":"2009","unstructured":"Jensen LJ, Kuhn M, Stark M, Chaffron S, Creevey C, Muller J, Doerks T, Julien P, Roth A, Simonovic M, Bork P, von Mering C (2009) STRING 8\u2014a global view on proteins and their functional interactions in 630 organisms. Nucl Acids Res 37:412\u2013416","journal-title":"Nucl Acids Res"},{"issue":"4","key":"625_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1460797.1460799","volume":"2","author":"D Jiang","year":"2009","unstructured":"Jiang D, Pei J (2009) Mining frequent cross-graph quasi-cliques. ACM Trans Knowl Discov Data (TKDD) 2(4):1\u201342","journal-title":"ACM Trans Knowl Discov Data (TKDD)"},{"issue":"2","key":"625_CR17","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s10115-010-0305-0","volume":"27","author":"U Kang","year":"2011","unstructured":"Kang U, Tsourakakis CE, Faloutsos C (2011) Pegasus: mining peta-scale graphs. Knowl Inf Syst (KAIS) 27(2):303\u2013325","journal-title":"Knowl Inf Syst (KAIS)"},{"key":"625_CR18","doi-asserted-by":"crossref","unstructured":"Khan A, Yan X, Wu KL (2010) Towards proximity pattern mining in large graphs. In: ACM SIGMOD international conference on management of data, pp 867\u2013878","DOI":"10.1145\/1807167.1807261"},{"key":"625_CR19","unstructured":"Knobbe AJ, Ho EKY (2006) Pattern teams. In: European conference on machine learning and knowledge discovery in databases (ECML\/PKDD), pp 577\u2013584"},{"issue":"3","key":"625_CR20","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/s10618-005-0003-9","volume":"11","author":"M Kuramochi","year":"2005","unstructured":"Kuramochi M, Karypis G (2005) Finding frequent patterns in a large sparse graph. Data Mining Knowl Discov (DMKD) 11(3):243\u2013271","journal-title":"Data Mining Knowl Discov (DMKD)"},{"issue":"3","key":"625_CR21","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/s10115-009-0253-8","volume":"24","author":"M Lahiri","year":"2010","unstructured":"Lahiri M, Berger-Wolf TY (2010) Periodic subgraph mining in dynamic networks. Knowl Inf Syst (KAIS) 24(3):467\u2013497","journal-title":"Knowl Inf Syst (KAIS)"},{"issue":"1","key":"625_CR22","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1186\/1471-2105-9-378","volume":"9","author":"J Leyritz","year":"2008","unstructured":"Leyritz J, Schicklin S, Blachon S, Keime C, Robardet C, Boulicaut JF, Besson J, Pensa RG, Gandrillon O (2008) Squat: a web tool to mine human, murine and avian sage data. BMC Bioinform 9(1):378","journal-title":"BMC Bioinform"},{"key":"625_CR23","doi-asserted-by":"crossref","unstructured":"Liu G, Wong L (2008) Effective pruning techniques for mining quasi-cliques. In: European conference on machine learning and knowledge discovery in databases (ECML\/PKDD), pp 33\u201349","DOI":"10.1007\/978-3-540-87481-2_3"},{"key":"625_CR24","doi-asserted-by":"crossref","unstructured":"Miyoshi Y, Ozaki T, Ohkawa T (2009) Frequent pattern discovery from a single graph with quantitative itemsets. In: International workshop on mining multiple information sources (ICDM workshop), pp 527\u2013532","DOI":"10.1109\/ICDMW.2009.11"},{"key":"625_CR25","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF02760024","volume":"3","author":"J Moon","year":"1965","unstructured":"Moon J, Moser L (1965) On cliques in graphs. Israel J Math 3:23\u201328","journal-title":"Israel J Math"},{"key":"625_CR26","doi-asserted-by":"crossref","unstructured":"Moser F, Colak R, Rafiey A, Ester M (2009) Mining cohesive patterns from graphs with feature vectors. In: SIAM international conference on data mining (SDM), pp 593\u2013604","DOI":"10.1137\/1.9781611972795.51"},{"key":"625_CR27","unstructured":"Mougel PN, Plantevit M, Rigotti C, Gandrillon O, Boulicaut JF (2010) Constraint-based mining of sets of cliques sharing vertex properties. In: International workshop on analysis of complex networks (ECML\/PKDD workshop), pp 1\u201314"},{"issue":"9","key":"625_CR28","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1186\/gb-2005-6-9-r81","volume":"6","author":"JC Newman","year":"2005","unstructured":"Newman JC, Weiner AM (2005) L2l: a simple tool for discovering the hidden significance in microarray expression data. Genome Biol 6(9):81","journal-title":"Genome Biol"},{"key":"625_CR29","doi-asserted-by":"crossref","unstructured":"Nguyen KN, Cerf L, Plantevit M, Boulicaut JF (2011) Multidimensional association rules in boolean tensors. In: SIAM international conference on data mining (SDM), pp 570\u2013581","DOI":"10.1137\/1.9781611972818.49"},{"key":"625_CR30","unstructured":"Raedt LD, Zimmermann A (2007) Constraint-based pattern set mining. In: SIAM international conference on data mining (SDM), pp 1\u201312"},{"key":"625_CR31","doi-asserted-by":"crossref","unstructured":"Silva A, Meira W, Zaki MJ (2010) Structural correlation pattern mining for large graphs. In: International workshop on mining and learning with graphs (MLG), pp 119\u2013126","DOI":"10.1145\/1830252.1830268"},{"issue":"5","key":"625_CR32","doi-asserted-by":"crossref","first-page":"466","DOI":"10.14778\/2140436.2140443","volume":"5","author":"A Silva","year":"2012","unstructured":"Silva A, Meira W, Zaki MJ (2012) Mining attribute-structure correlated patterns in large attributed graphs. Proc VLDB Endow (PVLDB) 5(5):466\u2013477","journal-title":"Proc VLDB Endow (PVLDB)"},{"key":"625_CR33","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 (2006) The worst-case time complexity for generating all maximal cliques and computational experiments. Theor Comput Sci (TCS) 363:28\u201342","journal-title":"Theor Comput Sci (TCS)"},{"key":"625_CR34","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1186\/1752-0509-1-8","volume":"1","author":"I Ulitsky","year":"2007","unstructured":"Ulitsky I, Shamir R (2007) Identification of functional modules using network topology and high-throughput data. BMC Syst Biol 1:8","journal-title":"BMC Syst Biol"},{"key":"625_CR35","doi-asserted-by":"crossref","unstructured":"Xu Z, Ke Y, Wang Y, Cheng H, Cheng J (2012) A model-based approach to attributed graph clustering. In: Proceedings of the (2012) ACM SIGMOD international conference on management of data, New York, NY, USA, pp 505\u2013516","DOI":"10.1145\/2213836.2213894"},{"key":"625_CR36","unstructured":"Yan X, Han J (2002) gSpan: graph-based substructure pattern mining. In: International conference on data mining (ICDM), pp 721\u2013724"},{"issue":"1","key":"625_CR37","doi-asserted-by":"crossref","first-page":"718","DOI":"10.14778\/1687627.1687709","volume":"2","author":"Y Zhou","year":"2009","unstructured":"Zhou Y, Cheng H, Yu JX (2009) Graph clustering based on structural\/attribute similarities. Proc VLDB Endow (PVLDB) 2(1):718\u2013729","journal-title":"Proc VLDB Endow (PVLDB)"},{"key":"625_CR38","doi-asserted-by":"crossref","unstructured":"Zhou Y, Cheng H, Yu JX (2010) Clustering large attributed graphs: an efficient incremental approach. In: International conference on data mining (ICDM), pp 689\u2013698","DOI":"10.1109\/ICDM.2010.41"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-013-0625-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-013-0625-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-013-0625-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,30]],"date-time":"2023-06-30T14:39:33Z","timestamp":1688135973000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-013-0625-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,27]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,6]]}},"alternative-id":["625"],"URL":"https:\/\/doi.org\/10.1007\/s10115-013-0625-y","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3,27]]}}}