{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T08:42:15Z","timestamp":1769935335536,"version":"3.49.0"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,12,14]],"date-time":"2018-12-14T00:00:00Z","timestamp":1544745600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1007\/s10115-018-1300-0","type":"journal-article","created":{"date-parts":[[2018,12,14]],"date-time":"2018-12-14T13:43:50Z","timestamp":1544795030000},"page":"431-462","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["MH-DAGMiner: maximal hierarchical sub-DAG mining in directed weighted networks"],"prefix":"10.1007","volume":"61","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7819-1332","authenticated-orcid":false,"given":"T. M. G.","family":"Tennakoon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richi","family":"Nayak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,14]]},"reference":[{"key":"1300_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-319-07821-2_1","volume-title":"Frequent pattern mining","year":"2014","unstructured":"Aggarwal CC, Han J (eds) (2014) Frequent pattern mining. Springer, Berlin, pp 1\u201317"},{"issue":"1","key":"1300_CR2","first-page":"8","volume":"12","author":"F Bonchi","year":"2011","unstructured":"Bonchi F (2011) Influence propagation in social networks: a data mining perspective. IEEE Intell Inform Bull 12(1):8\u2013105","journal-title":"IEEE Intell Inform Bull"},{"key":"1300_CR3","doi-asserted-by":"crossref","unstructured":"Chen YL, Kao HP, Ko MT (2004) Mining DAG patterns from DAG databases. In: International conference on web-age information management, pp 579\u2013588","DOI":"10.1007\/978-3-540-27772-9_58"},{"key":"1300_CR4","doi-asserted-by":"crossref","unstructured":"Cooley R, Mobasher B, Srivastava J (1997) Web mining: information and pattern discovery on the world wide web. In: IEEE international conference on tools with artificial intelligence, pp\u00a0558\u2013567","DOI":"10.1109\/TAI.1997.632303"},{"key":"1300_CR5","first-page":"335","volume":"1","author":"J Edmonds","year":"1968","unstructured":"Edmonds J (1968) Optimum branchings. Math Decis Sci 1:335\u2013345","journal-title":"Math Decis Sci"},{"key":"1300_CR6","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.engappai.2015.06.019","volume":"45","author":"A Fariha","year":"2015","unstructured":"Fariha A, Ahmed CF, Leung CK et al (2015) A new framework for mining frequent interaction patterns from meeting databases. Eng Appl Artif Intell 45:103\u2013118","journal-title":"Eng Appl Artif Intell"},{"key":"1300_CR7","doi-asserted-by":"crossref","unstructured":"Gupte M, Shankar P, Li J et al (2011) Finding hierarchy in directed online social networks. In: International conference on world wide web WWW \u201911, pp\u00a0557\u2013566","DOI":"10.1145\/1963405.1963484"},{"key":"1300_CR8","doi-asserted-by":"crossref","unstructured":"Huan J, Wang W, Prins J (2003) Efficient mining of frequent subgraphs in the presence of isomorphism. In: IEEE international conference on data mining (ICDM), pp\u00a0549\u2013552","DOI":"10.1109\/ICDM.2003.1250974"},{"key":"1300_CR9","doi-asserted-by":"crossref","unstructured":"Huan J, Wang W, Prins J et al (2004) SPIN: mining maximal frequent subgraphs from graph databases. In: ACM SIGKDD international conference on knowledge discovery and data mining, pp\u00a0581\u2013586","DOI":"10.1145\/1014052.1014123"},{"issue":"3","key":"1300_CR10","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.compind.2003.10.006","volume":"53","author":"S Hwang","year":"2004","unstructured":"Hwang S, Wei C, Yang W (2004) Discovery of temporal patterns from process instances. Comput Ind 53(3):345\u2013364","journal-title":"Comput Ind"},{"key":"1300_CR11","doi-asserted-by":"crossref","unstructured":"Inokuchi A, Washio T, Motoda H (2000) An a priori-based algorithm for mining frequent substructures from graph data. In: European conference on principles of data mining and knowledge discovery, pp\u00a013\u201323","DOI":"10.1007\/3-540-45372-5_2"},{"issue":"6","key":"1300_CR12","first-page":"1897","volume":"11","author":"R Jiadong","year":"2015","unstructured":"Jiadong R, HuiFang W, Yue M et al (2015) Efficient software fault localization by hierarchical instrumentation and maximal frequent subgraph mining. Int J Innov Comput Inf Control 11(6):1897\u20131911","journal-title":"Int J Innov Comput Inf Control"},{"issue":"1","key":"1300_CR13","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(1):75\u2013105","journal-title":"Knowl Eng Rev"},{"issue":"1","key":"1300_CR14","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1145\/107005.107032","volume":"23","author":"R Johnsonbaugh","year":"1991","unstructured":"Johnsonbaugh R, Kalin M (1991) A graph generation software package. ACM SIGCSE Bull 23(1):151\u2013154","journal-title":"ACM SIGCSE Bull"},{"key":"1300_CR15","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos \u00c9 (2003) Maximizing the spread of influence through a social network. In: ACM SIGKDD international conference on Knowledge discovery and data mining, pp\u00a0137\u2013146","DOI":"10.1145\/956750.956769"},{"key":"1300_CR16","unstructured":"Leung CW (2010) Technical notes on extending gSpan to directed graphs. Technical Report, Management University, Singapore"},{"key":"1300_CR17","doi-asserted-by":"crossref","unstructured":"Li Y, Lin Q, Zhong G, Duan D et al (2009) A directed labeled graph frequent pattern mining algorithm based on minimum code. In: International conference on multimedia and ubiquitous engineering, pp\u00a0353\u2013359","DOI":"10.1109\/MUE.2009.67"},{"key":"1300_CR18","doi-asserted-by":"crossref","unstructured":"Nijssen S, Kok J N (2004) A quickstart in frequent structure mining can make a difference. In: ACM SIGKDD international conference on knowledge discovery and data mining, pp\u00a0647\u2013652","DOI":"10.1145\/1014052.1014134"},{"key":"1300_CR19","unstructured":"Sreenivasa GJ, Ananthanarayana VS (2006) Efficient mining of frequent rooted continuous directed subgraphs. In: International conference on advanced computing and communications (ADCOM), pp\u00a0553\u2013558"},{"issue":"1","key":"1300_CR20","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1002\/net.3230070103","volume":"7","author":"RE Tarjan","year":"1977","unstructured":"Tarjan RE (1977) Finding optimum branchings. Networks 7(1):25\u20133","journal-title":"Networks"},{"key":"1300_CR21","unstructured":"Termier A, Tamada Y, Numata K et al (2007) DIGDAG, a first algorithm to mine closed frequent embedded sub-DAGs. In: Mining and learning with graphs workshop (MLG\u201907), pp 41\u201345"},{"issue":"3","key":"1300_CR22","first-page":"10:1","volume":"4","author":"LT Thomas","year":"2010","unstructured":"Thomas LT, Valluri SR, Karlapalem K (2010) MARGIN: maximal frequent subgraph mining. ACM Trans Knowl Discov Data (TKDD) 4(3):10:1\u201310:42","journal-title":"ACM Trans Knowl Discov Data (TKDD)"},{"issue":"9","key":"1300_CR23","doi-asserted-by":"publisher","first-page":"1128","DOI":"10.1109\/TKDE.2004.47","volume":"16","author":"W Aalst Van der","year":"2004","unstructured":"Van der Aalst W, Weijters T, Maruster L (2004) Workflow mining: discovering process models from event logs. IEEE Trans Knowl Data Eng 16(9):1128\u20131142","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"6","key":"1300_CR24","doi-asserted-by":"publisher","first-page":"753","DOI":"10.7155\/jgaa.00247","volume":"15","author":"R Vijayalakshmi","year":"2001","unstructured":"Vijayalakshmi R, Rethnasamy N, Roddick JF et al (2001) FP-GraphMiner: a fast frequent pattern mining algorithm for network graphs. J Graph Algorithms Appl 15(6):753\u2013776","journal-title":"J Graph Algorithms Appl"},{"key":"1300_CR25","unstructured":"Werth T, Dreweke A, W\u00f6rlein M et al (2008) DAGMA: mining directed acyclic graphs. In: IADIS European conference on data mining, pp\u00a011\u201318"},{"key":"1300_CR26","unstructured":"Yan X, Han J (2002) Gspan: graph-based substructure pattern mining. In: IEEE international conference on data mining (ICDM \u201902), pp\u00a0721\u2013724"},{"key":"1300_CR27","doi-asserted-by":"crossref","unstructured":"Yan X, Han J (2003) CloseGraph: mining closed frequent graph patterns. In: ACM SIGKDD international conference on knowledge discovery and data mining, pp\u00a0286\u2013295","DOI":"10.1145\/956750.956784"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-018-1300-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-018-1300-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-018-1300-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,12]],"date-time":"2023-09-12T05:13:46Z","timestamp":1694495626000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-018-1300-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,14]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["1300"],"URL":"https:\/\/doi.org\/10.1007\/s10115-018-1300-0","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,12,14]]},"assertion":[{"value":"12 June 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 September 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 November 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 December 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}