{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T08:32:09Z","timestamp":1759825929261,"version":"3.37.3"},"reference-count":78,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2020,6,24]],"date-time":"2020-06-24T00:00:00Z","timestamp":1592956800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,24]],"date-time":"2020-06-24T00:00:00Z","timestamp":1592956800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-2010-COSI-012-01"],"award-info":[{"award-number":["ANR-2010-COSI-012-01"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1007\/s10115-020-01478-9","type":"journal-article","created":{"date-parts":[[2020,6,24]],"date-time":"2020-06-24T22:02:31Z","timestamp":1593036151000},"page":"3931-3971","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Mining evolutions of complex spatial objects using a single-attributed Directed Acyclic Graph"],"prefix":"10.1007","volume":"62","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7288-0498","authenticated-orcid":false,"given":"Fr\u00e9d\u00e9ric","family":"Flouvat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nazha","family":"Selmaoui-Folcher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e9r\u00e9my","family":"Sanhes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chengcheng","family":"Mu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claude","family":"Pasquier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Fran\u00e7ois","family":"Boulicaut","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,6,24]]},"reference":[{"key":"1478_CR1","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules in large databases. In: Proceedings of the 20th international conference on very large data bases (VLDB). Morgan Kaufmann, pp 487\u2013499"},{"key":"1478_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal R, Srikant R (1995) Mining sequential patterns. In: Proceedings of the eleventh international conference on data engineering (ICDE). IEEE Computer Society, pp 3\u201314","DOI":"10.1109\/ICDE.1995.380415"},{"key":"1478_CR3","doi-asserted-by":"crossref","unstructured":"Alatrista-Salas H, Bringay S, Flouvat F, Selmaoui-Folcher N, Teisseire M (2012) The pattern next door: towards spatio-sequential pattern discovery. In: Advances in knowledge discovery and data mining. Springer, pp 157\u2013168","DOI":"10.1007\/978-3-642-30220-6_14"},{"key":"1478_CR4","doi-asserted-by":"crossref","unstructured":"Arimura H, Uno T (2009) Polynomial-delay and polynomial-space algorithms for mining closed sequences, graphs, and pictures in accessible set systems. In: Proceedings of the SIAM international conference on data mining (SDM). SIAM, pp 1088\u20131099","DOI":"10.1137\/1.9781611972795.93"},{"key":"1478_CR5","doi-asserted-by":"crossref","unstructured":"Aydin B, Angryk RA (2016) A graph-based approach to spatiotemporal event sequence mining. In: Proceedings of the IEEE international conference on data mining workshops (ICDMW). IEEE Computer Society, pp 1090\u20131097","DOI":"10.1109\/ICDMW.2016.0157"},{"issue":"1\u20132","key":"1478_CR6","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1080\/02757259509532298","volume":"13","author":"A Bannari","year":"1995","unstructured":"Bannari A, Morin D, Bonn F, Huete A (1995) A review of vegetation indices. Remote Sens Rev 13(1\u20132):95\u2013120","journal-title":"Remote Sens Rev"},{"key":"1478_CR7","doi-asserted-by":"crossref","unstructured":"Berthold MR, Cebron N, Dill F, Gabriel TR, K\u00f6tter T, Meinl T, Ohl P, Sieb C, Thiel K, Wiswedel B (2007) KNIME: the Konstanz information miner. In: Studies in classification, data analysis, and knowledge organization (GfKL 2007). Springer","DOI":"10.1007\/978-3-540-78246-9_38"},{"key":"1478_CR8","first-page":"433","volume":"34","author":"S Beucher","year":"1993","unstructured":"Beucher S, Meyer F (1993) The morphological approach to segmentation: the watershed transformation. Mathematical morphology in image processing. Opt Eng 34:433\u2013481","journal-title":"Opt Eng"},{"key":"1478_CR9","doi-asserted-by":"crossref","unstructured":"Bonchi F, Lucchese C (2004) On closed constrained frequent pattern mining. In: Proceedings of the IEEE international conference on data mining (ICDM). IEEE Computer Society, pp 35\u201342","DOI":"10.1109\/ICDM.2004.10093"},{"issue":"1","key":"1478_CR10","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1145\/360402.360416","volume":"2","author":"J Borges","year":"2000","unstructured":"Borges J, Levene M (2000) A fine grained heuristic to capture web navigation patterns. ACM SIGKDD Explor 2(1):40\u201350","journal-title":"ACM SIGKDD Explor"},{"issue":"1","key":"1478_CR11","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1021571501451","volume":"7","author":"JF Boulicaut","year":"2003","unstructured":"Boulicaut JF, Bykowski A, Rigotti C (2003) Free-sets: a condensed representation of boolean data for the approximation of frequency queries. Data Min Knowl Discov 7(1):5\u201322","journal-title":"Data Min Knowl Discov"},{"key":"1478_CR12","doi-asserted-by":"crossref","unstructured":"Bringmann B, Nijssen S (2008) What is frequent in a single graph? In: Proceedings of the Pacific-Asia conference on advances in knowledge discovery and data mining (PAKDD). Springer, pp 858\u2013863","DOI":"10.1007\/978-3-540-68125-0_84"},{"key":"1478_CR13","doi-asserted-by":"crossref","unstructured":"Calders T, Rigotti C, Boulicaut JF (2004) A survey on condensed representations for frequent sets. In: Constraint-based mining and inductive databases. Springer, pp 64\u201380","DOI":"10.1007\/11615576_4"},{"key":"1478_CR14","doi-asserted-by":"crossref","unstructured":"Casali A, Cicchetti R, Lakhal L (2005) Essential patterns: a perfect cover of frequent patterns. In: Proceedings of the international conference on data warehousing and knowledge discovery (DaWaK). Springer, pp 428\u2013437","DOI":"10.1007\/11546849_42"},{"issue":"10","key":"1478_CR15","doi-asserted-by":"publisher","first-page":"1322","DOI":"10.1109\/TKDE.2008.97","volume":"20","author":"M Celik","year":"2008","unstructured":"Celik M, Shekhar S, Rogers JP, Shine JA (2008) Mixed-drove spatiotemporal co-occurrence pattern mining. IEEE Trans Knowl Data Eng 20(10):1322\u20131335","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"2","key":"1478_CR16","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1109\/69.683753","volume":"10","author":"MS Chen","year":"1998","unstructured":"Chen MS, Park JS, Yu PS (1998) Efficient data mining for path traversal patterns. IEEE Trans Knowl Data Eng 10(2):209\u2013221","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1478_CR17","doi-asserted-by":"crossref","unstructured":"Chen Yl, Kao Hp, Ko Mt (2004) Mining DAG patterns from DAG databases. In: Advances in web-age information management, pp 579\u2013588","DOI":"10.1007\/978-3-540-27772-9_58"},{"key":"1478_CR18","doi-asserted-by":"crossref","unstructured":"Collin M, Flouvat F, Selmaoui-Folcher N (2016) Patsi: pattern mining of time series of satellite images in knime. In: Proceedings of the IEEE international conference on data mining workshops (ICDMW). IEEE Computer Society, pp 1292\u20131295","DOI":"10.1109\/ICDMW.2016.0187"},{"key":"1478_CR19","doi-asserted-by":"publisher","DOI":"10.1002\/0470073047","volume-title":"Mining graph data","author":"D Cook","year":"2006","unstructured":"Cook D, Holder L (2006) Mining graph data. Wiley, New York"},{"key":"1478_CR20","unstructured":"De\u00a0Raedt L, Kramer S (2001) The levelwise version space algorithm and its application to molecular fragment finding. In: Proceedings of the international joint conference on artificial intelligence (IJCAI), vol 2. Morgan Kaufmann, pp 853\u2013859"},{"key":"1478_CR21","doi-asserted-by":"crossref","unstructured":"De\u00a0Raedt L, Jaeger M, Lee SD, Mannila H (2002) A theory of inductive query answering. In: Proceedings of the IEEE international conference on data mining (ICDM). IEEE Computer Society, pp 123\u2013130","DOI":"10.1109\/ICDM.2002.1183894"},{"issue":"1","key":"1478_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10115-014-0769-4","volume":"44","author":"B Douar","year":"2015","unstructured":"Douar B, Liquiere M, Latiri C, Slimani Y (2015) Lc-mine: a framework for frequent subgraph mining with local consistency techniques. Knowl Inf Syst 44(1):1\u201325","journal-title":"Knowl Inf Syst"},{"key":"1478_CR23","doi-asserted-by":"crossref","unstructured":"Dube MP, Egenhofer MJ (2014) Surrounds in partitions. In: Proceedings of the ACM international conference on advances in geographic information systems (SIGSPATIAL). ACM, pp 233\u2013242","DOI":"10.1145\/2666310.2666380"},{"key":"1478_CR24","doi-asserted-by":"crossref","unstructured":"Dube MP, Barrett JV, Egenhofer MJ (2015) From metric to topology: determining relations in discrete space. In: International workshop on spatial information theory. Springer, pp 151\u2013171","DOI":"10.1007\/978-3-319-23374-1_8"},{"key":"1478_CR25","doi-asserted-by":"crossref","unstructured":"Fariha A, Ahmed CF, Leung CKS, Abdullah S, Cao L (2013) Mining frequent patterns from human interactions in meetings using directed acyclic graphs. In: Proceedings of the Pacific-Asia conference on advances in knowledge discovery and data mining (PAKDD). Springer, pp 38\u201349","DOI":"10.1007\/978-3-642-37453-1_4"},{"key":"1478_CR26","unstructured":"Fiedler M, Borgelt C (2007) Support computation for mining frequent subgraphs in a single graph. In: Mining and learning with graphs"},{"key":"1478_CR27","unstructured":"Flouvat F, Sanhes J, Pasquier C, Selmaoui-Folcher N, Boulicaut JF (2014) Improving pattern discovery relevancy by deriving constraints from expert models. In: Proceedings of the European conference on artificial intelligence (ECAI). IOS Press, pp 327\u2013332"},{"key":"1478_CR28","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: Proceedings of the Pacific-Asia conference on advances in knowledge discovery and data mining (PAKDD). Springer, pp 147\u2013159","DOI":"10.1007\/978-3-642-13672-6_15"},{"key":"1478_CR29","doi-asserted-by":"crossref","unstructured":"Garriga GC, Khardon R, De Raedt L (2012) Mining closed patterns in relational, graph and network data. In: Annals of mathematics and artificial intelligence, pp 1\u201328","DOI":"10.1007\/s10472-012-9324-8"},{"key":"1478_CR30","doi-asserted-by":"crossref","unstructured":"Geng R, Xu W, Dong X (2007) WTPMiner: efficient mining of weighted frequent patterns based on graph traversals. In: Proceedings of the international conference on knowledge science, engineering and management (KSEM). Springer, pp 412\u2013424","DOI":"10.1007\/978-3-540-76719-0_41"},{"volume-title":"Mobility, data mining and privacy\u2014geographic knowledge discovery","year":"2008","key":"1478_CR31","unstructured":"Giannotti F, Pedreschi D (eds) (2008) Mobility, data mining and privacy\u2014geographic knowledge discovery. Springer, Berlin"},{"issue":"11","key":"1478_CR32","doi-asserted-by":"publisher","first-page":"1441","DOI":"10.1109\/TKDE.2006.173","volume":"18","author":"E Gudes","year":"2006","unstructured":"Gudes E, Shimony SE, Vanetik N (2006) Discovering frequent graph patterns using disjoint paths. IEEE Trans Knowl Data Eng 18(11):1441\u20131456","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1478_CR33","doi-asserted-by":"crossref","unstructured":"G\u00fcnnemann S, Seidl T (2010) Subgraph mining on directed and weighted graphs. In: Proceedings of the Pacific-Asia conference on advances in knowledge discovery and data mining (PAKDD). Springer, pp 133\u2013146","DOI":"10.1007\/978-3-642-13672-6_14"},{"key":"1478_CR34","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-62222-5_47","volume-title":"Discovering all most specific sentences by randomized algorithms extended abstract","author":"D Gunopulos","year":"1997","unstructured":"Gunopulos D, Mannila H, Saluja S (1997) Discovering all most specific sentences by randomized algorithms extended abstract. Springer, Berlin"},{"issue":"18","key":"1478_CR35","doi-asserted-by":"publisher","first-page":"3643","DOI":"10.1093\/bioinformatics\/bth397","volume":"20","author":"BJ Haas","year":"2004","unstructured":"Haas BJ, Delcher AL, Wortman JR, Salzberg SL (2004) Dagchainer: a tool for mining segmental genome duplications and synteny. Bioinformatics 20(18):3643\u20133646","journal-title":"Bioinformatics"},{"issue":"12","key":"1478_CR36","doi-asserted-by":"publisher","first-page":"1472","DOI":"10.1109\/TKDE.2004.90","volume":"16","author":"Y Huang","year":"2004","unstructured":"Huang Y, Shekhar S, Xiong H (2004) Discovering colocation patterns from spatial data sets: a general approach. IEEE Trans Knowl Data Eng 16(12):1472\u20131485","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1478_CR37","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 European conference on principles of data mining and knowledge discovery (PKDD). Springer, vol 1910, pp 13\u201323","DOI":"10.1007\/3-540-45372-5_2"},{"issue":"01","key":"1478_CR38","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1017\/S0269888912000331","volume":"28","author":"C Jiang","year":"2013","unstructured":"Jiang C, Coenen F, Zito M (2013) A survey of frequent subgraph mining algorithms. Knowl Eng Rev 28(01):75\u2013105","journal-title":"Knowl Eng Rev"},{"issue":"1","key":"1478_CR39","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1080\/13658810802577247","volume":"23","author":"J Jiang","year":"2009","unstructured":"Jiang J, Worboys M (2009) Event-based topology for dynamic planar areal objects. Int J Geogr Inf Sci 23(1):33\u201360","journal-title":"Int J Geogr Inf Sci"},{"issue":"10","key":"1478_CR40","doi-asserted-by":"publisher","first-page":"1034","DOI":"10.1016\/j.datak.2009.04.008","volume":"68","author":"X Jiang","year":"2009","unstructured":"Jiang X, Xiong H, Wang C, Tan AH (2009) Mining globally distributed frequent subgraphs in a single labeled graph. Data Knowl Eng 68(10):1034\u20131058","journal-title":"Data Knowl Eng"},{"key":"1478_CR41","doi-asserted-by":"crossref","unstructured":"Khan A, Yan X, Wu KL (2010) Towards proximity pattern mining in large graphs. In: Proceedings of the ACM international conference on management of data (SIGMOD). ACM Press, pp 867\u2013878","DOI":"10.1145\/1807167.1807261"},{"key":"1478_CR42","doi-asserted-by":"crossref","unstructured":"Kuramochi M, Karypis G (2001) Frequent subgraph discovery. In: Proceedings of the IEEE international conference on data mining (ICDM). IEEE Computer Society, pp 313\u2013320","DOI":"10.1109\/ICDM.2001.989534"},{"issue":"3","key":"1478_CR43","doi-asserted-by":"publisher","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":"1478_CR44","unstructured":"Leskovec J, Krevl A (2014) SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data"},{"key":"1478_CR45","doi-asserted-by":"crossref","unstructured":"Leskovec J, Kleinberg J, Faloutsos C (2005) Graphs over time: densification laws, shrinking diameters and possible explanations. In: Proceedings of the ACM international conference on knowledge discovery in data mining (SIGKDD). ACM, pp 177\u2013187","DOI":"10.1145\/1081870.1081893"},{"key":"1478_CR46","doi-asserted-by":"crossref","unstructured":"Lewis JA, Dube MP, Egenhofer MJ (2013) The topology of spatial scenes in r2. In: International conference on spatial information theory. Springer, pp 495\u2013515","DOI":"10.1007\/978-3-319-01790-7_27"},{"key":"1478_CR47","doi-asserted-by":"crossref","unstructured":"Miyoshi Y, Ozaki T, Ohkawa T (2009) Frequent pattern discovery from a single graph with quantitative itemsets. In: Proceedings of the IEEE international conference on data mining workshops (ICDMW), pp 527\u2013532","DOI":"10.1109\/ICDMW.2009.11"},{"key":"1478_CR48","doi-asserted-by":"crossref","unstructured":"Mohan P, Shekhar S, Shine JA, Rogers JP (2010) Cascading spatio-temporal pattern discovery: a summary of results. In: Proceedings of the SIAM international conference on data mining (SDM), pp 327\u2013338","DOI":"10.21236\/ADA543073"},{"issue":"11","key":"1478_CR49","doi-asserted-by":"publisher","first-page":"1977","DOI":"10.1109\/TKDE.2011.146","volume":"24","author":"P Mohan","year":"2012","unstructured":"Mohan P, Shekhar S, Shine JA, Rogers JP (2012) Cascading spatio-temporal pattern discovery. IEEE Trans Knowl Data Eng 24(11):1977\u20131992","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1478_CR50","doi-asserted-by":"crossref","unstructured":"Moser F, Colak R, Rafiey A, Ester M (2009) Mining cohesive patterns from graphs with feature vectors. In: Proceedings of the SIAM international conference on data mining (SDM), pp 593\u2013604","DOI":"10.1137\/1.9781611972795.51"},{"issue":"3","key":"1478_CR51","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/S0169-023X(01)00008-8","volume":"37","author":"A Nanopoulos","year":"2001","unstructured":"Nanopoulos A, Manolopoulos Y (2001) Mining patterns from graph traversals. Data Knowl Eng 37(3):243\u2013266","journal-title":"Data Knowl Eng"},{"key":"1478_CR52","doi-asserted-by":"crossref","unstructured":"Nguyen TT, Nguyen HA, Pham NH, Al-Kofahi JM, Nguyen TN (2009) Graph-based mining of multiple object usage patterns. In: Proceedings of the the joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on the foundations of software engineering. ACM Press, pp 383\u2013392","DOI":"10.1145\/1595696.1595767"},{"key":"1478_CR53","doi-asserted-by":"crossref","unstructured":"Nijssen S, Kok JN (2004) A quickstart in frequent structure mining can make a difference. In: Proceedings of the ACM international conference on knowledge discovery and data mining (SIGKDD). ACM, pp 647\u2013652","DOI":"10.1145\/1014052.1014134"},{"issue":"2","key":"1478_CR54","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1007\/s10115-016-0953-9","volume":"50","author":"C Pasquier","year":"2017","unstructured":"Pasquier C, Flouvat F, Sanhes J, Selmaoui-Folcher N (2017) Attributed graph mining in the presence of automorphism. Knowl Inf Syst 50(2):569\u2013584","journal-title":"Knowl Inf Syst"},{"key":"1478_CR55","doi-asserted-by":"crossref","unstructured":"Pasquier N, Bastide Y, Taouil R, Lakhal L (1999) Discovering frequent closed itemsets for association rules. In: Proceedings of the international conference on database theory (ICDT). Springer, pp 398\u2013416","DOI":"10.1007\/3-540-49257-7_25"},{"issue":"11","key":"1478_CR56","doi-asserted-by":"publisher","first-page":"1424","DOI":"10.1109\/TKDE.2004.77","volume":"16","author":"J Pei","year":"2004","unstructured":"Pei J, Han J, Mortazavi-Asl B, Wang J, Pinto H, Chen Q, Dayal U, Hsu M (2004) Mining sequential patterns by pattern-growth: the prefixspan approach. IEEE Trans Knowl Data Eng 16(11):1424\u20131440","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1478_CR57","doi-asserted-by":"crossref","unstructured":"Qian F, He Q, He J (2009) Mining spread patterns of spatio-temporal co-occurrences over zones. In: Proceedings of the international conference on computational science and its applications (ICCSA). Springer, vol 5593, pp 677\u2013692","DOI":"10.1007\/978-3-642-02457-3_57"},{"key":"1478_CR58","unstructured":"Sanhes J, Flouvat F, Pasquier C, Selmaoui-Folcher N, Boulicaut J (2013) Weighted path as a condensed pattern in a single attributed DAG. In: Proceedings of the international joint conference on artificial intelligence (IJCAI)"},{"key":"1478_CR59","volume-title":"Algorithms","author":"R Sedgewick","year":"2011","unstructured":"Sedgewick R, Wayne K (2011) Algorithms, 4th edn. Addison-Wesley, Reading","edition":"4"},{"key":"1478_CR60","doi-asserted-by":"crossref","unstructured":"Selmaoui-Folcher N, Flouvat F (2011) How to use classical tree mining algorithms to find complex spatio-temporal patterns? In: Proceedings of the international conference on database and expert systems applications (DEXA). Springer, pp 107\u2013117","DOI":"10.1007\/978-3-642-23091-2_10"},{"issue":"5","key":"1478_CR61","doi-asserted-by":"publisher","first-page":"466","DOI":"10.14778\/2140436.2140443","volume":"5","author":"A Silva","year":"2012","unstructured":"Silva A, Meira W Jr, Zaki MJ (2012) Mining attribute-structure correlated patterns in large attributed graphs. Proceedings of the VLDB Endowment 5(5):466\u2013477","journal-title":"Proceedings of the VLDB Endowment"},{"key":"1478_CR62","unstructured":"Sindoni G, Stell JG (2017) The logic of discrete qualitative relations. In: Proceedings of the international conference on spatial information theory (COSIT). Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, vol\u00a086, pp 1\u201315"},{"key":"1478_CR63","unstructured":"Termier A, Tamada Y, Numata K, Imoto S, Washio T, Higushi T, Higuchi T (2007) DigDag, a first algorithm to mine closed frequent embedded sub-DAGs. In: Proceedings of mining and learning with graphs (MLG), pp 1\u20135"},{"key":"1478_CR64","doi-asserted-by":"crossref","unstructured":"Tsoukatos I, Gunopulos D (2001) Efficient mining of spatiotemporal patterns. In: Proceedings of the international symposium on spatial and temporal databases (SSTD). Springer, vol 2121, pp 425\u2013442","DOI":"10.1007\/3-540-47724-1_22"},{"key":"1478_CR65","unstructured":"Uno T, Asai T, Uchida Y, Arimura H (2003) LCM: an efficient algorithm for enumerating frequent closed item sets. In: Proceedings of the IEEE international conference on data mining workshop on frequent itemset mining implementations (FIMI). CEUR-WS.org, vol\u00a090"},{"key":"1478_CR66","doi-asserted-by":"crossref","unstructured":"Uno T, Asai T, Uchida Y, Arimura H (2004) An efficient algorithm for enumerating closed patterns in transaction databases. In: Proceedings of the international conference on discovery science (DS). Springer, pp 16\u201331","DOI":"10.1007\/978-3-540-30214-8_2"},{"key":"1478_CR67","doi-asserted-by":"crossref","unstructured":"Wang J, Hsu W, Lee ML, Wang JTL (2004) FlowMiner: finding flow patterns in spatio-temporal databases. In: Proceedings of the IEEE international conference on tools with artificial intelligence (ICTAI). IEEE Computer Society, pp 14\u201321","DOI":"10.1109\/ICTAI.2004.63"},{"key":"1478_CR68","unstructured":"Wang J, Hsu W, Lee ML, Sheng C (2006) A partition-based approach to graph mining. In: Proceedings of the IEEE international conference on data engineering (ICDE). IEEE Computer Society, pp 74\u2014-74"},{"issue":"1","key":"1478_CR69","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1145\/959242.959249","volume":"5","author":"T Washio","year":"2003","unstructured":"Washio T, Motoda H (2003) State of the art of graph-based data mining. SIGKDD Explora Newsl 5(1):59\u201368","journal-title":"SIGKDD Explora Newsl"},{"key":"1478_CR70","doi-asserted-by":"crossref","unstructured":"Washio T, Mitsunaga Y, Motoda H (2005) Mining quantitative frequent itemsets using adaptive density-based subspace clustering. In: Proceedings of the IEEE international conference on data mining (ICDM). IEEE Computer Society, pp 793\u2013796","DOI":"10.1109\/ICDM.2005.100"},{"key":"1478_CR71","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511815478","volume-title":"Social network analysis: methods and applications","author":"S Wasserman","year":"1994","unstructured":"Wasserman S, Faust K (1994) Social network analysis: methods and applications, vol 8. Cambridge University Press, Cambridge"},{"key":"1478_CR72","unstructured":"Werth T, Dreweke A, W\u00f6rlein M, Fischer I, Philippsen M (2008) Dagma: mining directed acyclic graphs. In: Proceedings of the IADIS European conference on data mining. IADIS Press, pp 11\u201318"},{"key":"1478_CR73","doi-asserted-by":"crossref","unstructured":"Werth T, W\u00f6rlein M, Dreweke A, Fischer I, Philippsen M (2009) Dag mining for code compaction. In: Data mining for business applications. Springer, pp 209\u2013223","DOI":"10.1007\/978-0-387-79420-4_15"},{"key":"1478_CR74","doi-asserted-by":"crossref","unstructured":"Worboys M (2012) The maptree: a fine-grained formal representation of space. In: International conference on geographic information science. Springer, pp 298\u2013310","DOI":"10.1007\/978-3-642-33024-7_22"},{"key":"1478_CR75","unstructured":"Yan X, Han J (2002) gSpan: Graph-bases substructure pattern mining. In: Proceedings of the IEEE international conference on data mining (ICDM). IEEE Computer Society, vol\u00a03, pp 721\u2013724"},{"key":"1478_CR76","doi-asserted-by":"crossref","unstructured":"Yan X, Han J (2003) CloseGraph. In: Proceedings of the ACM international conference on knowledge discovery and data mining (SIGKDD). ACM Press, vol\u00a06, p 286","DOI":"10.1145\/956750.956784"},{"key":"1478_CR77","doi-asserted-by":"crossref","unstructured":"Yan X, Han J, Afshar R (2003) Clospan: mining: closed sequential patterns in large datasets. In: Proceedings of the SIAM international conference on data mining (SDM), pp 166\u2013177","DOI":"10.1137\/1.9781611972733.15"},{"key":"1478_CR78","doi-asserted-by":"crossref","unstructured":"Yang H, Parthasarathy S, Mehta S (2005) A generalized framework for mining spatio-temporal patterns in scientific data. In: Proceedings of the ACM international conference on knowledge discovery and data mining (SIGKDD). ACM Press, pp 716\u2013721","DOI":"10.1145\/1081870.1081962"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-020-01478-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10115-020-01478-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-020-01478-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,24]],"date-time":"2021-06-24T01:24:55Z","timestamp":1624497895000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10115-020-01478-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,24]]},"references-count":78,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2020,10]]}},"alternative-id":["1478"],"URL":"https:\/\/doi.org\/10.1007\/s10115-020-01478-9","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"type":"print","value":"0219-1377"},{"type":"electronic","value":"0219-3116"}],"subject":[],"published":{"date-parts":[[2020,6,24]]},"assertion":[{"value":"8 June 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 May 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 June 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}