{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,8]],"date-time":"2025-11-08T17:37:07Z","timestamp":1762623427180,"version":"3.40.3"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,9,6]],"date-time":"2012-09-06T00:00:00Z","timestamp":1346889600000},"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":[[2012,12]]},"DOI":"10.1007\/s10115-012-0537-2","type":"journal-article","created":{"date-parts":[[2012,9,5]],"date-time":"2012-09-05T09:36:31Z","timestamp":1346837791000},"page":"603-630","source":"Crossref","is-referenced-by-count":29,"title":["Algorithms for mining the evolution of conserved relational states in dynamic networks"],"prefix":"10.1007","volume":"33","author":[{"given":"Rezwan","family":"Ahmed","sequence":"first","affiliation":[]},{"given":"George","family":"Karypis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,9,6]]},"reference":[{"key":"537_CR1","doi-asserted-by":"crossref","unstructured":"Asai T, Abe K, Kawasoe S, Arimura H, Sakamoto H, Arikawa S (2002) Efficient substructure discovery from large semi-structured data. In: Proceedings of the 2nd SIAM symposium on data mining, pp 158\u2013174","DOI":"10.1137\/1.9781611972726.10"},{"key":"537_CR2","doi-asserted-by":"crossref","unstructured":"Berger-Wolf T, Saia J (2006) A framework for analysis of dynamic social networks. In: ACM KDD, pp 523\u2013528","DOI":"10.1145\/1150402.1150462"},{"key":"537_CR3","doi-asserted-by":"crossref","unstructured":"Berlingerio M, Bonchi F, Bringmann B, Gionis A (2009) Mining graph evolution rules. Mach Learn Knowl Discov Databases 115\u2013130","DOI":"10.1007\/978-3-642-04180-8_25"},{"key":"537_CR4","doi-asserted-by":"crossref","unstructured":"Borgwardt KM, Kriegel HP, Wackersreuther P (2006) Pattern mining in frequent dynamic subgraphs. In: IEEE ICDM, pp 818\u2013822","DOI":"10.1109\/ICDM.2006.124"},{"issue":"1\u20137","key":"537_CR5","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","volume":"30","author":"S Brin","year":"1998","unstructured":"Brin S, Page L (1998) The anatomy of a large-scale hypertextual web search engine. Comput Netw ISDN Syst 30(1\u20137):107\u2013117","journal-title":"Comput Netw ISDN Syst"},{"key":"537_CR6","doi-asserted-by":"crossref","unstructured":"Cerf L, Nguyen T, Boulicaut J (2009) Discovering relevant cross-graph cliques in dynamic networks. Found Intell Syst 513\u2013522","DOI":"10.1007\/978-3-642-04125-9_54"},{"key":"537_CR7","doi-asserted-by":"crossref","unstructured":"Chakrabarti D, Kumar R, Tomkins A (2006) Evolutionary clustering. In: ACM KDD, pp 554\u2013560","DOI":"10.1145\/1150402.1150467"},{"key":"537_CR8","unstructured":"Cohen WW (2005) Enron email dataset. http:\/\/www.cs.cmu.edu\/enron\/"},{"issue":"8","key":"537_CR9","doi-asserted-by":"crossref","first-page":"1036","DOI":"10.1109\/TKDE.2005.127","volume":"17","author":"M Deshpande","year":"2005","unstructured":"Deshpande M, Kuramochi M, Wale N, Karypis G (2005) Frequent substructure-based approaches for classifying chemical compounds. IEEE Trans Knowl Data Eng 17(8):1036\u20131050","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"537_CR10","unstructured":"Desikan P, Srivastava J (2004) Mining temporally evolving graphs. In: WEBKDD Workshop, vol 22, Citeseer"},{"key":"537_CR11","doi-asserted-by":"crossref","unstructured":"Duan D, Li Y, Jin Y, Lu Z (2009) Community mining on dynamic weighted directed graphs. In: Proceeding of the 1st ACM international workshop on Complex networks meet information and knowledge management. ACM, pp 11\u201318","DOI":"10.1145\/1651274.1651278"},{"issue":"5","key":"537_CR12","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1177\/0022002702046005006","volume":"46","author":"KS Gleditsch","year":"2002","unstructured":"Gleditsch KS (2002) Expanded trade and GDP data. J Confl Resolut 46(5):712\u2013724","journal-title":"J Confl Resolut"},{"key":"537_CR13","volume-title":"Spatial clustering methods in data mining: a survey","author":"J Han","year":"2001","unstructured":"Han J, Kamber M, Tung AKH (2001) Spatial clustering methods in data mining: a survey. Taylor and Francis, London"},{"key":"537_CR14","doi-asserted-by":"crossref","unstructured":"Hu H, Yan X, Yu H, Han J, Zhou X (2005) Mining coherent dense subgraphs across massive biological networks for functional discovery. In: ISMB, Ann Arbor, MI, pp 213\u2013221","DOI":"10.1093\/bioinformatics\/bti1049"},{"key":"537_CR15","unstructured":"Huan J, Wang W, Prins J (2003a) Efficient mining of frequent subgraph in the presence of isomorphism, In: IEEE ICDM"},{"key":"537_CR16","doi-asserted-by":"crossref","unstructured":"Huan J, Wang W, Prins J (2003b) Efficient mining of frequent subgraph in the presence of isomorphism. In: IEEE ICDM, pp 549\u2013552","DOI":"10.1109\/ICDM.2003.1250974"},{"key":"537_CR17","doi-asserted-by":"crossref","unstructured":"Inokuchi A, Washio T (2008) A fast method to mine frequent subsequences from graph sequence data. In: IEEE ICDM, pp 303\u2013312","DOI":"10.1109\/ICDM.2008.106"},{"key":"537_CR18","doi-asserted-by":"crossref","unstructured":"Inokuchi A, Washio T (2010) Mining frequent graph sequence patterns induced by vertices. In: Proceedings of 10th SIAM international conference on data mining, pp 466\u2013477","DOI":"10.1137\/1.9781611972801.41"},{"key":"537_CR19","doi-asserted-by":"crossref","unstructured":"Inokuchi A, Washio T, Motoda H (2000) An apriori-based algorithm for mining frequent substructures from graph data. In: Proceedings of the 4th European conference on principles of data mining and knowledge discovery. Springer, Berlin, pp 13\u201323","DOI":"10.1007\/3-540-45372-5_2"},{"key":"537_CR20","doi-asserted-by":"crossref","unstructured":"Jin R, McCallen S, Almaas E (2007) Trend motif: a graph mining approach for analysis of dynamic complex networks. In: IEEE ICDM, pp 541\u2013546","DOI":"10.1109\/ICDM.2007.92"},{"issue":"7","key":"537_CR21","doi-asserted-by":"crossref","first-page":"1299","DOI":"10.1089\/cmb.2006.13.1299","volume":"13","author":"M Koyut\u00fcrk","year":"2006","unstructured":"Koyut\u00fcrk M, Kim Y, Subramaniam S, Szpankowski W, Grama A (2006) Detecting conserved interaction patterns in biological networks. J Comput Biol 13(7):1299\u20131322","journal-title":"J Comput Biol"},{"key":"537_CR22","doi-asserted-by":"crossref","unstructured":"Kramer S, De Raedt L, Helma C (2001) Molecular feature mining in hiv data. In: ACM KDD","DOI":"10.1145\/502512.502533"},{"issue":"9","key":"537_CR23","first-page":"1038","volume":"16","author":"M Kuramochi","year":"2004","unstructured":"Kuramochi M, Karypis G (2004) An efficient algorithm for discovering frequent subgraphs. IEEE TKDE 16(9):1038\u20131051","journal-title":"IEEE TKDE"},{"issue":"3","key":"537_CR24","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 Min Knowl Discov 11(3):243\u2013271","journal-title":"Data Min Knowl Discov"},{"key":"537_CR25","doi-asserted-by":"crossref","unstructured":"Lahiri M, Berger-Wolf T (2008) Mining periodic behavior in dynamic social networks. In: IEEE ICDM, pp 373\u2013382","DOI":"10.1109\/ICDM.2008.104"},{"key":"537_CR26","unstructured":"Ley M (2008) Dblp, computer science bibliography. http:\/\/www.informatik.uni-trier.de\/~ley\/"},{"key":"537_CR27","doi-asserted-by":"crossref","unstructured":"Liu Z, Yu J, Ke Y, Lin X, Chen L (2008) Spotting significant changing subgraphs in evolving graphs. In: 2008 Eighth IEEE international conference on data mining. IEEE, pp 917\u2013922","DOI":"10.1109\/ICDM.2008.112"},{"key":"537_CR28","unstructured":"Pei J, Han J, Mortazavi-Asl B, Pinto H, Chen Q, Dayal U, Hsu M (2001) Prefixspan: mining sequential patterns by prefix-projected growth. In: ICDE, pp 215\u2013224"},{"key":"537_CR29","doi-asserted-by":"crossref","unstructured":"Pei J, Jiang D, Zhang A (2005) On mining cross-graph quasi-cliques. In: ACM KDD, pp 228\u2013238","DOI":"10.1145\/1081870.1081898"},{"key":"537_CR30","doi-asserted-by":"crossref","unstructured":"Robardet C (2009) Constraint-based pattern mining in dynamic graphs. In: IEEE ICDM, pp 950\u2013955","DOI":"10.1109\/ICDM.2009.99"},{"key":"537_CR31","volume-title":"Introduction to modern information retrieval","author":"G Salton","year":"1983","unstructured":"Salton G, McGill MJ (1983) Introduction to modern information retrieval. McGraw-Hill, New York"},{"key":"537_CR32","doi-asserted-by":"crossref","unstructured":"Sun J, Faloutsos C, Papadimitriou S, Yu P (2007) Graphscope: parameter-free mining of large time-evolving graphs. In: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, pp 687\u2013696","DOI":"10.1145\/1281192.1281266"},{"key":"537_CR33","doi-asserted-by":"crossref","unstructured":"Tang L, Liu H, Zhang J, Nazeri Z (2008) Community evolution in dynamic multi-mode networks. In: ACM KDD, pp 677\u2013685","DOI":"10.1145\/1401890.1401972"},{"key":"537_CR34","doi-asserted-by":"crossref","unstructured":"Wackersreuther B, Wackersreuther P, Oswald A, B\u00f6hm C, Borgwardt K (2010) Frequent subgraph discovery in dynamic networks. In: Proceedings of the 8th workshop on mining and learning with graphs. ACM, pp 155\u2013162","DOI":"10.1145\/1830252.1830272"},{"issue":"3","key":"537_CR35","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s10115-007-0103-5","volume":"14","author":"N Wale","year":"2008","unstructured":"Wale N, Watson IA, Karypis G (2008) Comparison of descriptor spaces for chemical compound retrieval and classification. Knowl Inf Syst 14(3):347\u2013375","journal-title":"Knowl Inf Syst"},{"key":"537_CR36","volume-title":"Introduction to graph theory","author":"DB West","year":"2001","unstructured":"West DB (2001) Introduction to graph theory. Prentice Hall, Englewood Cliffs"},{"key":"537_CR37","doi-asserted-by":"crossref","unstructured":"Yan X, Zhou XJ, Han J (2005) Mining closed relational graphs with connectivity constraints. In: ACM KDD, pp 324\u2013333","DOI":"10.1145\/1081870.1081908"},{"key":"537_CR38","doi-asserted-by":"crossref","unstructured":"You C, Holder L, Cook D (2009) Learning patterns in the dynamics of biological networks","DOI":"10.1145\/1557019.1557125"},{"key":"537_CR39","doi-asserted-by":"crossref","unstructured":"Zaki MJ (2002) Efficiently mining frequent trees in a forest. In: ACM KDD, pp 71\u201380","DOI":"10.1145\/775047.775058"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-012-0537-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-012-0537-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-012-0537-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T22:06:24Z","timestamp":1744063584000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-012-0537-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,6]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["537"],"URL":"https:\/\/doi.org\/10.1007\/s10115-012-0537-2","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"type":"print","value":"0219-1377"},{"type":"electronic","value":"0219-3116"}],"subject":[],"published":{"date-parts":[[2012,9,6]]}}}