{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,4]],"date-time":"2025-04-04T04:48:26Z","timestamp":1743742106044},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387081"},{"type":"electronic","value":"9783642387098"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40988-2_42","type":"book-chapter","created":{"date-parts":[[2013,8,28]],"date-time":"2013-08-28T06:56:40Z","timestamp":1377673000000},"page":"654-669","source":"Crossref","is-referenced-by-count":18,"title":["Trend Mining in Dynamic Attributed Graphs"],"prefix":"10.1007","author":[{"given":"Elise","family":"Desmier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Plantevit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C\u00e9line","family":"Robardet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Fran\u00e7ois","family":"Boulicaut","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"42_CR1","doi-asserted-by":"crossref","unstructured":"Ahmed, R., Karypis, G.: Algorithms for Mining the Evolution of Conserved Relational States in Dynamic Networks. In: ICDM, pp. 1\u201310. IEEE (2011)","DOI":"10.1109\/ICDM.2011.20"},{"key":"42_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-642-04180-8_25","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"M. Berlingerio","year":"2009","unstructured":"Berlingerio, M., Bonchi, F., Bringmann, B., Gionis, A.: Mining Graph Evolution Rules. In: Buntine, W., Grobelnik, M., Mladeni\u0107, D., Shawe-Taylor, J. (eds.) ECML PKDD 2009, Part I. LNCS, vol.\u00a05781, pp. 115\u2013130. Springer, Heidelberg (2009)"},{"key":"42_CR3","doi-asserted-by":"crossref","unstructured":"Boden, B., G\u00fcnnemann, S., Seidl, T.: Tracing clusters in evolving graphs with node attributes. In: CIKM, pp. 2331\u20132334 (2012)","DOI":"10.1145\/2396761.2398633"},{"key":"42_CR4","doi-asserted-by":"crossref","unstructured":"Borgwardt, K.M., Kriegel, H.P., Wackersreuther, P.: Pattern mining in frequent dynamic subgraphs. In: ICDM, pp. 818\u2013822. IEEE (2006)","DOI":"10.1109\/ICDM.2006.124"},{"issue":"1","key":"42_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1497577.1497580","volume":"3","author":"L. Cerf","year":"2009","unstructured":"Cerf, L., Besson, J., Robardet, C., Boulicaut, J.F.: Closed patterns meet n-ary relations. TKDD\u00a03(1), 3:1\u20133:36 (2009)","journal-title":"TKDD"},{"key":"42_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-642-33492-4_11","volume-title":"Discovery Science","author":"E. Desmier","year":"2012","unstructured":"Desmier, E., Plantevit, M., Robardet, C., Boulicaut, J.-F.: Cohesive co-evolution patterns in dynamic attributed graphs. In: Ganascia, J.-G., Lenca, P., Petit, J.-M. (eds.) DS 2012. LNCS, vol.\u00a07569, pp. 110\u2013124. Springer, Heidelberg (2012)"},{"key":"42_CR7","doi-asserted-by":"crossref","unstructured":"Inokuchi, A., Washio, T.: Mining frequent graph sequence patterns induced by vertices. In: SDM, pp. 466\u2013477. SIAM (2010)","DOI":"10.1137\/1.9781611972801.41"},{"key":"42_CR8","doi-asserted-by":"crossref","unstructured":"Jin, R., McCallen, S., Almaas, E.: Trend Motif: A Graph Mining Approach for Analysis of Dynamic Complex Networks. In: ICDM, pp. 541\u2013546. IEEE (2007)","DOI":"10.1109\/ICDM.2007.92"},{"issue":"1-4","key":"42_CR9","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s10472-007-9053-6","volume":"49","author":"S.O. Kuznetsov","year":"2007","unstructured":"Kuznetsov, S.O.: On stability of a formal concept. Ann. Math. Artif. Intell.\u00a049(1-4), 101\u2013115 (2007)","journal-title":"Ann. Math. Artif. Intell."},{"key":"42_CR10","doi-asserted-by":"crossref","unstructured":"Lahiri, M., Berger-Wolf, T.Y.: Mining periodic behavior in dynamic social networks. In: ICDM, pp. 373\u2013382. IEEE (2008)","DOI":"10.1109\/ICDM.2008.104"},{"key":"42_CR11","doi-asserted-by":"crossref","unstructured":"Morishita, S., Sese, J.: Traversing itemset lattice with statistical metric pruning. In: PODS, pp. 226\u2013236 (2000)","DOI":"10.1145\/335168.335226"},{"key":"42_CR12","doi-asserted-by":"crossref","unstructured":"Moser, F., Colak, R., Rafiey, A., Ester, M.: Mining cohesive patterns from graphs with feature vectors. In: SDM, pp. 593\u2013604. SIAM (2009)","DOI":"10.1137\/1.9781611972795.51"},{"issue":"1","key":"42_CR13","doi-asserted-by":"crossref","first-page":"49","DOI":"10.3233\/IDA-120567","volume":"17","author":"K.N. Nguyen","year":"2013","unstructured":"Nguyen, K.N., Cerf, L., Plantevit, M., Boulicaut, J.F.: Discovering descriptive rules in relational dynamic graphs. Intell. Data Anal.\u00a017(1), 49\u201369 (2013)","journal-title":"Intell. Data Anal."},{"key":"42_CR14","unstructured":"Prado, A., Plantevit, M., Robardet, C., Boulicaut, J.F.: Mining graph topological patterns. In: IEEE TKDE, pp. 1\u201314 (2013)"},{"key":"42_CR15","doi-asserted-by":"crossref","unstructured":"Robardet, C.: Constraint-Based Pattern Mining in Dynamic Graphs. In: ICDM, pp. 950\u2013955. IEEE (2009)","DOI":"10.1109\/ICDM.2009.99"},{"issue":"5","key":"42_CR16","first-page":"466","volume":"5","author":"A. Silva","year":"2012","unstructured":"Silva, A., Meira Jr., W., Zaki, M.J.: Mining attribute-structure correlated patterns in large attributed graphs. PVLDB\u00a05(5), 466\u2013477 (2012)","journal-title":"PVLDB"},{"issue":"1","key":"42_CR17","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\u00a056(1), 3\u201316 (2010)","journal-title":"Algorithmica"},{"key":"42_CR18","doi-asserted-by":"crossref","unstructured":"You, C.H., Holder, L.B., Cook, D.J.: Learning Patterns in the Dynamics of Biological Networks. In: KDD, pp. 977\u2013985. ACM (2009)","DOI":"10.1145\/1557019.1557125"}],"container-title":["Lecture Notes in Computer Science","Advanced Information Systems Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40988-2_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T19:25:51Z","timestamp":1558034751000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40988-2_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387081","9783642387098"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40988-2_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}