{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,2]],"date-time":"2025-09-02T10:51:08Z","timestamp":1756810268511,"version":"3.40.3"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319721491"},{"type":"electronic","value":"9783319721507"}],"license":[{"start":{"date-parts":[[2017,11,27]],"date-time":"2017-11-27T00:00:00Z","timestamp":1511740800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-72150-7_42","type":"book-chapter","created":{"date-parts":[[2017,11,26]],"date-time":"2017-11-26T08:21:29Z","timestamp":1511684489000},"page":"516-527","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On Mining Temporal Patterns in Dynamic Graphs, and Other Unrelated Problems"],"prefix":"10.1007","author":[{"given":"Orestis","family":"Kostakis","sequence":"first","affiliation":[]},{"given":"Aristides","family":"Gionis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,11,27]]},"reference":[{"unstructured":"Agrawal, R., Srikant, R., et\u00a0al.: Fast algorithms for mining association rules. In: Proceedings 20th VLDB, vol. 1215, pp. 487\u2013499 (1994)","key":"42_CR1"},{"issue":"11","key":"42_CR2","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1145\/182.358434","volume":"26","author":"JF Allen","year":"1983","unstructured":"Allen, J.F.: Maintaining knowledge about temporal intervals. Commun. ACM 26(11), 832\u2013843 (1983)","journal-title":"Commun. ACM"},{"doi-asserted-by":"crossref","unstructured":"Araujo, M., Papadimitriou, S., G\u00fcnnemann, S., Faloutsos, C., Basu, P., Swami, A., Papalexakis, E.E., Koutra, D.: Com2: fast automatic discovery of temporal (comet) communities. In: Pacific-Asia Conference on Knowledge Discovery and Data Mining, pp. 271\u2013283. Springer (2014)","key":"42_CR3","DOI":"10.1007\/978-3-319-06605-9_23"},{"doi-asserted-by":"crossref","unstructured":"Berlingerio, M., Bonchi, F., Bringmann, B., Gionis, A.: Mining graph evolution rules. In: ECML PKDD, pp. 115\u2013130 (2009)","key":"42_CR4","DOI":"10.1007\/978-3-642-04180-8_25"},{"doi-asserted-by":"crossref","unstructured":"Borgwardt, K.M., Kriegel, H.P., Wackersreuther, P.: Pattern mining in frequent dynamic subgraphs. In: Proceedings of ICDM, pp. 818\u2013822. IEEE (2006)","key":"42_CR5","DOI":"10.1109\/ICDM.2006.124"},{"doi-asserted-by":"crossref","unstructured":"Chen, X., Petrounias, I.: Mining temporal features in association rules. In: Proceedings of the 3rd European Conference on Principles and Practice of Knowledge Discovery in Databases, pp. 295\u2013300. Springer-Verlag (1999)","key":"42_CR6","DOI":"10.1007\/978-3-540-48247-5_33"},{"doi-asserted-by":"crossref","unstructured":"Chen, Y.C., Weng, J.T.Y., Hui, L.: A novel algorithm for mining closed temporal patterns from interval-based data. Knowl. Inf. Syst. 1\u201333 (2015)","key":"42_CR7","DOI":"10.1007\/s10115-014-0815-2"},{"issue":"1","key":"42_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s13278-016-0325-1","volume":"6","author":"M Cordeiro","year":"2016","unstructured":"Cordeiro, M., Sarmento, R.P., Gama, J.: Dynamic community detection in evolving networks using locality modularity optimization. Soc. Netw. Anal. Min. 6(1), 1\u201320 (2016)","journal-title":"Soc. Netw. Anal. Min."},{"doi-asserted-by":"crossref","unstructured":"Crouch, M., McGregor, A., Stubbs, D.: Dynamic graphs in the sliding-window model. In: ESA, pp. 337\u2013348 (2013)","key":"42_CR9","DOI":"10.1007\/978-3-642-40450-4_29"},{"doi-asserted-by":"crossref","unstructured":"Ding, B., Yu, J.X., Qin, L.: Finding time-dependent shortest paths over large graphs. In: Proceedings of the 11th International Conference on Extending Database Technology: Advances in Database Technology, pp. 205\u2013216. ACM (2008)","key":"42_CR10","DOI":"10.1145\/1353343.1353371"},{"issue":"4","key":"42_CR11","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s00779-005-0046-3","volume":"10","author":"N Eagle","year":"2006","unstructured":"Eagle, N., Pentland, A.: Reality mining: sensing complex social systems. Pers. Ubiquitous Comput. 10(4), 255\u2013268 (2006)","journal-title":"Pers. Ubiquitous Comput."},{"doi-asserted-by":"crossref","unstructured":"Henzinger, M., King, V.: Maintaining minimum spanning trees in dynamic graphs. In: Automata, Languages and Programming, pp. 594\u2013604 (1997)","key":"42_CR12","DOI":"10.1007\/3-540-63165-8_214"},{"issue":"4","key":"42_CR13","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1145\/502090.502095","volume":"48","author":"J Holm","year":"2001","unstructured":"Holm, J., De Lichtenberg, K., Thorup, M.: Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. J. ACM (JACM) 48(4), 723\u2013760 (2001)","journal-title":"J. ACM (JACM)"},{"issue":"3","key":"42_CR14","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.physrep.2012.03.001","volume":"519","author":"P Holme","year":"2012","unstructured":"Holme, P., Saram\u00e4ki, J.: Temporal networks. Phys. Rep. 519(3), 97\u2013125 (2012)","journal-title":"Phys. Rep."},{"doi-asserted-by":"crossref","unstructured":"Kostakis, O., Papapetrou, P.: Finding the longest common sub-pattern in sequences of temporal intervals. Data Min. Knowl. Discov. 1\u201333 (2015)","key":"42_CR15","DOI":"10.1007\/s10618-015-0404-3"},{"issue":"3","key":"42_CR16","doi-asserted-by":"crossref","first-page":"809","DOI":"10.1007\/s10618-016-0489-3","volume":"31","author":"O Kostakis","year":"2017","unstructured":"Kostakis, O., Papapetrou, P.: On searching and indexing sequences of temporal intervals. Data Min. Knowl. Discov. 31(3), 809\u2013850 (2017)","journal-title":"Data Min. Knowl. Discov."},{"doi-asserted-by":"crossref","unstructured":"Kostakis, O.K., Gionis, A.G.: Subsequence search in event-interval sequences. In: In Proceedings of ACM SIGIR, pp. 851\u2013854. ACM (2015)","key":"42_CR17","DOI":"10.1145\/2766462.2767778"},{"issue":"suppl 1","key":"42_CR18","doi-asserted-by":"crossref","first-page":"i200","DOI":"10.1093\/bioinformatics\/bth919","volume":"20","author":"M Koyut\u00fcrk","year":"2004","unstructured":"Koyut\u00fcrk, M., Grama, A., Szpankowski, W.: An efficient algorithm for detecting frequent subgraphs in biological networks. Bioinformatics 20(suppl 1), i200\u2013i207 (2004)","journal-title":"Bioinformatics"},{"doi-asserted-by":"crossref","unstructured":"Lahiri, M., Berger-Wolf, T.Y.: Mining periodic behavior in dynamic social networks. In: Proceedings of ICDM, pp. 373\u2013382. IEEE (2008)","key":"42_CR19","DOI":"10.1109\/ICDM.2008.104"},{"issue":"9","key":"42_CR20","first-page":"1188","volume":"19","author":"S Laxman","year":"2007","unstructured":"Laxman, S., Sastry, P., Unnikrishnan, K.: Discovering frequent generalized episodes when events persist for different durations. IEEE TKDE 19(9), 1188\u20131201 (2007)","journal-title":"IEEE TKDE"},{"doi-asserted-by":"crossref","unstructured":"Mathioudakis, M., Bonchi, F., Castillo, C., Gionis, A., Ukkonen, A.: Sparsification of influence networks. In: Proceedings of ACM SIGKDD, pp. 529\u2013537. ACM (2011)","key":"42_CR21","DOI":"10.1145\/2020408.2020492"},{"issue":"01","key":"42_CR22","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1017\/S0269888905000408","volume":"20","author":"K McGarry","year":"2005","unstructured":"McGarry, K.: A survey of interestingness measures for knowledge discovery. Knowl. Eng. Rev. 20(01), 39\u201361 (2005)","journal-title":"Knowl. Eng. Rev."},{"doi-asserted-by":"crossref","unstructured":"Meisen, P., Keng, D., Meisen, T., Recchioni, M., Jeschke, S.: Similarity search of bounded tidasets within large time interval databases. In: Computational Science and Computational Intelligence (CSCI), pp. 24\u201329. IEEE (2015)","key":"42_CR23","DOI":"10.1109\/CSCI.2015.36"},{"doi-asserted-by":"crossref","unstructured":"Moerchen, F., Fradkin, D.: Robust mining of time intervals with semi-interval partial order patterns. In: SDM, pp. 315\u2013326 (2010)","key":"42_CR24","DOI":"10.1137\/1.9781611972801.28"},{"doi-asserted-by":"crossref","unstructured":"Mongiovi, M., Bogdanov, P., Singh, A.K.: Mining evolving network processes. In: Data Mining (ICDM), 2013 IEEE 13th International Conference on, pp. 537\u2013546. IEEE (2013)","key":"42_CR25","DOI":"10.1109\/ICDM.2013.106"},{"issue":"12","key":"42_CR26","first-page":"2227","volume":"19","author":"M Monroe","year":"2013","unstructured":"Monroe, M., Lan, R., Lee, H., Plaisant, C., Shneiderman, B.: Temporal event sequence simplification. IEEE TVCG 19(12), 2227\u20132236 (2013)","journal-title":"IEEE TVCG"},{"doi-asserted-by":"crossref","unstructured":"Mooney, C., Roddick, J.F.: Mining relationships between interacting episodes. In: Proceedings of the 4th SIAM International Conference on Data Mining (2004)","key":"42_CR27","DOI":"10.1137\/1.9781611972740.1"},{"doi-asserted-by":"crossref","unstructured":"M\u00f6rchen, F., Ultsch, A.: Optimizing time series discretization for knowledge discovery. In: Proceedings of ACM SIGKDD, pp. 660\u2013665. ACM (2005)","key":"42_CR28","DOI":"10.1145\/1081870.1081953"},{"issue":"3","key":"42_CR29","first-page":"555","volume":"14","author":"R Moskovitch","year":"2017","unstructured":"Moskovitch, R., Choi, H., Hripcsak, G., Tatonetti, N.P.: Prognosis of clinical outcomes with temporal patterns and experiences with one class feature selection. IEEE\/ACM TCBB 14(3), 555\u2013563 (2017)","journal-title":"IEEE\/ACM TCBB"},{"issue":"4","key":"42_CR30","doi-asserted-by":"crossref","first-page":"871","DOI":"10.1007\/s10618-014-0380-z","volume":"29","author":"R Moskovitch","year":"2015","unstructured":"Moskovitch, R., Shahar, Y.: Classification-driven temporal discretization of multivariate time series. Data Min. Knowl. Discov. 29(4), 871\u2013913 (2015)","journal-title":"Data Min. Knowl. Discov."},{"issue":"1","key":"42_CR31","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s10115-013-0707-x","volume":"42","author":"R Moskovitch","year":"2015","unstructured":"Moskovitch, R., Shahar, Y.: Fast time intervals mining using the transitivity of temporal relations. Knowl. Inf. Syst. 42(1), 21\u201348 (2015)","journal-title":"Knowl. Inf. Syst."},{"issue":"2","key":"42_CR32","first-page":"133","volume":"21","author":"P Papapetrou","year":"2009","unstructured":"Papapetrou, P., Kollios, G., Sclaroff, S., Gunopulos, D.: Mining frequent arrangements of temporal intervals. KAIS 21(2), 133\u2013171 (2009)","journal-title":"KAIS"},{"doi-asserted-by":"crossref","unstructured":"Patel, D., Hsu, W., Lee, M.L.: Mining relationships among interval-based events for classification. In: Proceedings of ACM SIGMOD, pp. 393\u2013404 (2008)","key":"42_CR33","DOI":"10.1145\/1376616.1376658"},{"unstructured":"Pei, J., Han, J., Mao, R., et al.: Closet: An efficient algorithm for mining frequent closed itemsets. In: ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery 4, 21\u201330 (2000)","key":"42_CR34"},{"doi-asserted-by":"crossref","unstructured":"Robardet, C.: Constraint-based pattern mining in dynamic graphs. In: Proceedings of ICDM, pp. 950\u2013955. IEEE (2009)","key":"42_CR35","DOI":"10.1109\/ICDM.2009.99"},{"doi-asserted-by":"crossref","unstructured":"Rozenshtein, P., Tatti, N., Gionis, A.: Discovering dynamic communities in interaction networks. In: ECML PKDD, pp. 678\u2013693. Springer (2014)","key":"42_CR36","DOI":"10.1007\/978-3-662-44851-9_43"},{"doi-asserted-by":"crossref","unstructured":"Shah, N., Koutra, D., Zou, T., Gallagher, B., Faloutsos, C.: Timecrunch: Interpretable dynamic graph summarization. In: Proceedings of ACM SIGKDD, pp. 1055\u20131064 (2015)","key":"42_CR37","DOI":"10.1145\/2783258.2783321"},{"doi-asserted-by":"crossref","unstructured":"Spielman, D.A., Teng, S.H.: Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In: Proceedings of ACM STOC, pp. 81\u201390. ACM (2004)","key":"42_CR38","DOI":"10.1145\/1007352.1007372"},{"issue":"2","key":"42_CR39","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1023\/B:COAP.0000008651.28952.b6","volume":"27","author":"V Stix","year":"2004","unstructured":"Stix, V.: Finding all maximal cliques in dynamic graphs. Comput. Optim. Appl. 27(2), 173\u2013186 (2004)","journal-title":"Comput. Optim. Appl."},{"key":"42_CR40","first-page":"3389","volume":"15","author":"PF Viger","year":"2014","unstructured":"Viger, P.F., Gomariz, A., Gueniche, T., Soltani, A., Wu, C.W., Tseng, V.S.: Spmf: A java open-source pattern mining library. JMLR 15, 3389\u20133393 (2014)","journal-title":"JMLR"}],"container-title":["Studies in Computational Intelligence","Complex Networks & Their Applications VI"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-72150-7_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,6]],"date-time":"2019-10-06T17:00:52Z","timestamp":1570381252000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-72150-7_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,27]]},"ISBN":["9783319721491","9783319721507"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-72150-7_42","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2017,11,27]]}}}