{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T10:19:11Z","timestamp":1758709151480,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319417059"},{"type":"electronic","value":"9783319417066"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-41706-6_8","type":"book-chapter","created":{"date-parts":[[2016,7,2]],"date-time":"2016-07-02T11:54:11Z","timestamp":1467460451000},"page":"168-183","source":"Crossref","is-referenced-by-count":3,"title":["Local Pattern Detection in Attributed Graphs"],"prefix":"10.1007","author":[{"given":"Jean-Fran\u00e7ois","family":"Boulicaut","sequence":"first","affiliation":[]},{"given":"Marc","family":"Plantevit","sequence":"additional","affiliation":[]},{"given":"C\u00e9line","family":"Robardet","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,3]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Akoglu, L., Tong, H., et al.: PICS: parameter-free identification of cohesive subgroups in large graphs. In: SIAM DM, pp. 439\u2013450 (2012)","key":"8_CR1","DOI":"10.1137\/1.9781611972825.38"},{"key":"8_CR2","first-page":"5234","volume":"85","author":"R Albert","year":"2000","unstructured":"Albert, R., Barab\u00e1si, A.L.: Topology of complex networks: local events and universality. Phys. Rev. 85, 5234\u20135237 (2000)","journal-title":"Phys. Rev."},{"doi-asserted-by":"crossref","unstructured":"Biemann, C.: Chinese whispers: an efficient graph clustering algorithm and its application to natural language processing problems. In: Proceedings of the First Workshop on Graph Based Methods for Natural Language Processing, pp. 73\u201380. Association for Computational Linguistics (2006)","key":"8_CR3","DOI":"10.3115\/1654758.1654774"},{"issue":"1\u20137","key":"8_CR4","first-page":"107","volume":"30","author":"S Brin","year":"1998","unstructured":"Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. Comput. Netw. 30(1\u20137), 107\u2013117 (1998)","journal-title":"Comput. Netw."},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"crossref","first-page":"858","DOI":"10.1007\/978-3-540-68125-0_84","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"B Bringmann","year":"2008","unstructured":"Bringmann, B., Nijssen, S.: What is frequent in a single graph? In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds.) PAKDD 2008. LNCS (LNAI), vol. 5012, pp. 858\u2013863. Springer, Heidelberg (2008)"},{"doi-asserted-by":"crossref","unstructured":"Calders, T., Goethals, B., Jaroszewicz, S.: Mining rank-correlated sets of numerical attributes. In: KDD, pp. 96\u2013105 (2006)","key":"8_CR6","DOI":"10.1145\/1150402.1150417"},{"doi-asserted-by":"crossref","unstructured":"Chakrabarti, D., Zhan, Y., Faloutsos, C.: R-MAT: a recursive model for graph mining. In: SIAM SDM (2004)","key":"8_CR7","DOI":"10.1137\/1.9781611972740.43"},{"issue":"2","key":"8_CR8","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1145\/1921632.1921638","volume":"5","author":"H Cheng","year":"2011","unstructured":"Cheng, H., Zhou, Y., Yu, J.X.: Clustering large attributed graphs. TKDD 5(2), 12 (2011)","journal-title":"TKDD"},{"doi-asserted-by":"crossref","unstructured":"Do, T., Laurent, A., Termier, A.: Efficient parallel mining of closed frequent gradual itemsets. In: IEEE ICDM, pp. 138\u2013147 (2010)","key":"8_CR9","DOI":"10.1109\/ICDM.2010.101"},{"doi-asserted-by":"crossref","unstructured":"Dong, G., Li, J.: Efficient mining of emerging patterns: discovering trends and differences. In: KDD, pp. 43\u201352 (1999)","key":"8_CR10","DOI":"10.1145\/312129.312191"},{"issue":"1","key":"8_CR11","doi-asserted-by":"crossref","first-page":"35","DOI":"10.2307\/3033543","volume":"40","author":"LC Freeman","year":"1977","unstructured":"Freeman, L.C.: A set of measures of centrality based on betweenness. Sociometry 40(1), 35\u201341 (1977)","journal-title":"Sociometry"},{"key":"8_CR12","first-page":"1","volume":"21","author":"J F\u00fcrnkranz","year":"2010","unstructured":"F\u00fcrnkranz, J., Knobbe, A.J.: Guest editorial: global modeling using local patterns. DMKD 21, 1\u20138 (2010)","journal-title":"DMKD"},{"issue":"2","key":"8_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, B.J., et al.: Joint cluster analysis of attribute data and relationship data. TKDD 2(2), 1\u201335 (2008)","journal-title":"TKDD"},{"doi-asserted-by":"crossref","unstructured":"G\u00fcnnemann, S., et al.: Subspace clustering meets dense subgraph mining: a synthesis of two paradigms. In: IEEE ICDM, pp. 845\u2013850 (2010)","key":"8_CR14","DOI":"10.1109\/ICDM.2010.95"},{"doi-asserted-by":"crossref","unstructured":"G\u00fcnnemann, S., et al.: A density-based approach for subspace clustering in graphs with feature vectors. In: PKDD, pp. 565\u2013580 (2011)","key":"8_CR15","DOI":"10.1007\/978-3-642-23780-5_46"},{"issue":"4","key":"8_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.: Mining frequent cross-graph quasi-cliques. ACM TKDD 2(4), 1\u201342 (2009)","journal-title":"ACM TKDD"},{"issue":"2","key":"8_CR17","first-page":"8","volume":"5","author":"U Kang","year":"2011","unstructured":"Kang, U., Tsourakakis, C.E., Appel, A.P., Faloutsos, C., Leskovec, J.: Hadi: mining radii of large graphs. ACM TKDD 5(2), 8 (2011)","journal-title":"ACM TKDD"},{"doi-asserted-by":"crossref","unstructured":"Khan, A., Yan, X., Wu, K.L.: Towards proximity pattern mining in large graphs. In: SIGMOD, pp. 867\u2013878 (2010)","key":"8_CR18","DOI":"10.1145\/1807167.1807261"},{"key":"8_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10115-011-0398-0","volume":"31","author":"ZX Liao","year":"2012","unstructured":"Liao, Z.X., Peng, W.C.: Clustering spatial data with a geographic constraint. Knowl. Inf. Syst. 31, 1\u201318 (2012)","journal-title":"Knowl. Inf. Syst."},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/978-3-540-87481-2_3","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"G Liu","year":"2008","unstructured":"Liu, G., Wong, L.: Effective pruning techniques for mining quasi-cliques. In: Daelemans, W., Goethals, B., Morik, K. (eds.) ECML PKDD 2008, Part II. LNCS (LNAI), vol. 5212, pp. 33\u201349. Springer, Heidelberg (2008)"},{"key":"8_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1007\/978-3-540-27810-8_23","volume-title":"Algorithm Theory - SWAT 2004","author":"K Makino","year":"2004","unstructured":"Makino, K., Uno, T.: New algorithms for enumerating all maximal cliques. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol. 3111, pp. 260\u2013272. Springer, Heidelberg (2004)"},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","volume-title":"Local Pattern Detection","year":"2005","unstructured":"Morik, K., Boulicaut, J.-F., Siebes, A. (eds.): Local Pattern Detection. LNCS (LNAI), vol. 3539. Springer, Heidelberg (2005)"},{"doi-asserted-by":"crossref","unstructured":"Moser, F., Colak, R., Rafiey, A., Ester, M.: Mining cohesive patterns from graphs with feature vectors. In: SIAM SDM, pp. 593\u2013604 (2009)","key":"8_CR23","DOI":"10.1137\/1.9781611972795.51"},{"doi-asserted-by":"crossref","unstructured":"Mougel, P.N., Rigotti, C., Gandrillon, O.: Finding collections of k-clique percolated components in attributed graphs. In: PAKDD (2012)","key":"8_CR24","DOI":"10.1007\/978-3-642-30220-6_16"},{"issue":"9","key":"8_CR25","doi-asserted-by":"crossref","first-page":"2090","DOI":"10.1109\/TKDE.2012.154","volume":"25","author":"A Prado","year":"2013","unstructured":"Prado, A., Plantevit, M., Robardet, C., Boulicaut, J.-F.: Mining graph topological patterns: finding covariations among vertex descriptors. IEEE Trans. Knowl. Data Eng. 25(9), 2090\u20132104 (2013)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"doi-asserted-by":"crossref","unstructured":"Sese, J., Seki, M., Fukuzaki, M.: Mining networks with shared items. In: CIKM, pp. 1681\u20131684 (2010)","key":"8_CR26","DOI":"10.1145\/1871437.1871703"},{"doi-asserted-by":"crossref","unstructured":"Silva, A., Meira, W., Zaki, M.: Structural correlation pattern mining for large graphs. In: Workshop on Mining and Learning with Graphs (2010)","key":"8_CR27","DOI":"10.1145\/1830252.1830268"},{"issue":"5","key":"8_CR28","first-page":"466","volume":"5","author":"A Silva","year":"2012","unstructured":"Silva, A., Meira, W., Zaki, M.J.: Mining attribute-structure correlated patterns in large attributed graphs. PVLDB 5(5), 466\u2013477 (2012)","journal-title":"PVLDB"},{"issue":"1","key":"8_CR29","doi-asserted-by":"crossref","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 56(1), 3\u201316 (2010)","journal-title":"Algorithmica"},{"issue":"4","key":"8_CR30","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1016\/j.socnet.2012.01.003","volume":"34","author":"DJ Wang","year":"2012","unstructured":"Wang, D.J., Shi, X., McFarland, D.A., Leskovec, J.: Measurement error in network data: a re-classification. Soc. Netw. 34(4), 396\u2013409 (2012)","journal-title":"Soc. Netw."},{"issue":"3","key":"8_CR31","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1109\/69.846291","volume":"12","author":"MJ Zaki","year":"2000","unstructured":"Zaki, M.J.: Scalable algorithms for association mining. IEEE Trans. Knowl. Data Eng. 12(3), 372\u2013390 (2000)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"8_CR32","first-page":"718","volume":"2","author":"Y Zhou","year":"2009","unstructured":"Zhou, Y., Cheng, H., Yu, J.: Graph clustering based on structural\/attribute similarities. PVLDB 2(1), 718\u2013729 (2009)","journal-title":"PVLDB"}],"container-title":["Lecture Notes in Computer Science","Solving Large Scale Learning Tasks. Challenges and Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-41706-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T13:41:35Z","timestamp":1498311695000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-41706-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319417059","9783319417066"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-41706-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}