{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T05:13:16Z","timestamp":1738300396091,"version":"3.35.0"},"reference-count":72,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,5,18]],"date-time":"2008-05-18T00:00:00Z","timestamp":1211068800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2008,12]]},"DOI":"10.1007\/s10618-008-0098-x","type":"journal-article","created":{"date-parts":[[2008,5,17]],"date-time":"2008-05-17T02:21:54Z","timestamp":1210990914000},"page":"457-495","source":"Crossref","is-referenced-by-count":20,"title":["An integrated, generic approach to pattern mining: data mining template library"],"prefix":"10.1007","volume":"17","author":[{"given":"Vineet","family":"Chaoji","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad","family":"Al Hasan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saeed","family":"Salem","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammed J.","family":"Zaki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,5,18]]},"reference":[{"key":"98_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal R, Imielinski T, Swami A (1993) Mining association rules between sets of items in large databases. In: ACM SIGMOD conference on management of data","DOI":"10.1145\/170035.170072"},{"key":"98_CR2","unstructured":"Agrawal R, Mannila H, Srikant R, Toivonen H, Verkamo AI (1996) Fast discovery of association rules. In: Advances in knowledge discovery and data mining. AAAI Press, Menlo Park, CA, pp 307\u2013328"},{"key":"98_CR3","unstructured":"Agrawal R, Srikant R (1995) Mining sequential patterns. In: 11th International conference on data engineering"},{"key":"98_CR4","unstructured":"Antunes C, Oliveira AL (2004) Sequential pattern mining algorithms: Trade-offs between speed and memory. In: 2nd International workshop on mining graphs, trees and sequences with ECML\/PKDD"},{"key":"98_CR5","doi-asserted-by":"crossref","unstructured":"Asai T, Abe K, Kawasoe S, Arimura H, Satamoto H, Arikawa S (2002) Efficient substructure discovery from large semi-structured data. In: 2nd SIAM international conference on data mining","DOI":"10.1137\/1.9781611972726.10"},{"key":"98_CR6","doi-asserted-by":"crossref","unstructured":"Asai T, Arimura H, Uno T, Nakano S (2003) Discovering frequent substructures in large unordered trees. In: 6th International conference on discovery science","DOI":"10.1007\/978-3-540-39644-4_6"},{"key":"98_CR7","doi-asserted-by":"crossref","unstructured":"Ayres J, Flannick J, Gehrke JE, Yiu T (2002) Sequential pattern mining using a bitmap representation. In: ACM SIGKDD international conference on knowledge discovery and data mining","DOI":"10.1145\/775047.775109"},{"key":"98_CR8","doi-asserted-by":"crossref","unstructured":"Balcazar JL, Casas-Garriga G (2005) On horn axiomatizations for sequential data. In: 10th International confererence on database theory","DOI":"10.1007\/978-3-540-30570-5_15"},{"key":"98_CR9","doi-asserted-by":"crossref","unstructured":"Bayardo RJ Jr (1998) Efficiently mining long patterns from databases. In: SIGMOD \u201998: Proceedings of the 1998 ACM SIGMOD international conference on Management of data. ACM, New York, USA, pp 85\u201393","DOI":"10.1145\/276304.276313"},{"key":"98_CR10","doi-asserted-by":"crossref","unstructured":"Brin S, Motwani R, Ullman J, Tsur S (1997) Dynamic itemset counting and implication rules for market basket data. In: ACM SIGMOD conference on management of data","DOI":"10.1145\/253260.253325"},{"key":"98_CR11","doi-asserted-by":"crossref","unstructured":"Buehrer G, Parthasarathy S, Ghoting A (2006). Out-of-core frequent pattern mining on a commodity PC. In: ACM SIGKDD international conference on knowledge discovery and data mining","DOI":"10.1145\/1150402.1150416"},{"key":"98_CR12","doi-asserted-by":"crossref","unstructured":"Burdick D, Calimlim M, Gehrke J (2001a) MAFIA: a maximal frequent itemset algorithm for transactional databases. In: IEEE international conference on data engineering","DOI":"10.1109\/ICDE.2001.914857"},{"key":"98_CR13","doi-asserted-by":"crossref","unstructured":"Burdick D, Calimlim M, Gehrke J (2001b) MAFIA: a maximal frequent itemset algorithm for transactional databases. In: 17th International conference on data engineering","DOI":"10.1109\/ICDE.2001.914857"},{"key":"98_CR14","doi-asserted-by":"crossref","unstructured":"Chi Y, Yang Y, Muntz RR (2003) Indexing and mining free trees. In: 3rd IEEE international conference on data mining","DOI":"10.1109\/ICDM.2003.1250964"},{"key":"98_CR15","unstructured":"Chi Y, Yang Y, Muntz RR (2004a) HybridTreeMiner: an efficient algorihtm for mining frequent rooted trees and free trees using canonical forms. In: 16th International conference on scientific and statistical database management"},{"key":"98_CR16","doi-asserted-by":"crossref","unstructured":"Chi Y, Yang Y, Xia Y, Muntz RR (2004b) CMTreeMiner: mining both closed and maximal frequent subtrees. In: 8th Pacific-Asia conferernce on knowledge discovery and data mining","DOI":"10.1007\/978-3-540-24775-3_9"},{"key":"98_CR17","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1613\/jair.43","volume":"1","author":"D Cook","year":"1994","unstructured":"Cook D, Holder L (1994) Substructure discovery using minimal description length and background knowledge. J Arti Intell Res 1: 231\u2013255","journal-title":"J Arti Intell Res"},{"key":"98_CR18","unstructured":"Dehaspe L, Toivonen H, King R (1998) Finding frequent substructures in chemical compounds. In: 4th ACM SIGKDD international conference knowledge discovery and data mining"},{"key":"98_CR19","doi-asserted-by":"crossref","unstructured":"Ganter B, Wille R (1999) Formal concept analysis: mathematical foundations. Springer-Verlag","DOI":"10.1007\/978-3-642-59830-2"},{"key":"98_CR20","unstructured":"Garofalakis M, Rastogi R, Shim K (1999) SPIRIT: sequential pattern mining with regular expression constraints. In: 25th International conference on very large data bases"},{"key":"98_CR21","unstructured":"Ghoting A, Buehrer G, Parthasarathy S, Kim D, Nguyen A, Chen Y-K, Dubey P (2005) Cache-conscious frequent pattern mining on a modern processor. In: 31st International conference on very large data bases"},{"key":"98_CR22","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1145\/1007730.1007744","volume":"6","author":"B Goethals","year":"2003","unstructured":"Goethals B, Zaki MJ (2003) Advances in frequent itemset mining implementations: report on FIMI\u201903. SIGKDD Explor 6: 109\u2013117","journal-title":"SIGKDD Explor"},{"key":"98_CR23","unstructured":"Gschwind T (2001) PSTL\u2014A C++ Persistent Standard Template Library. In: 6th USENIX conference on object-oriented technologies and systems"},{"key":"98_CR24","doi-asserted-by":"crossref","unstructured":"Han J, Pei J, Yin Y (2000a) Mining frequent patterns without candidate generation. In: ACM SIGMOD conference on management of data","DOI":"10.1145\/342009.335372"},{"key":"98_CR25","doi-asserted-by":"crossref","unstructured":"Han J, Pei J, Yin Y (2000b). Mining frequent patterns without candidate generation. In: ACM SIGMOD conference on management of data","DOI":"10.1145\/342009.335372"},{"key":"98_CR26","unstructured":"Hasan MA, Chaoji V, Salem S, Zaki M (2005) DMTL: A generic Data Mining Template Library. In: 1st Workshop on library-centric software design (with OOPSLA)"},{"key":"98_CR27","doi-asserted-by":"crossref","unstructured":"Horv\u00e1th T, Ramon J, Wrobel S (2006) Frequent subgraph mining in outerplanar graphs. In: 12th ACM SIGKDD international conference on knowledge discovery and data mining","DOI":"10.1145\/1150402.1150427"},{"key":"98_CR28","doi-asserted-by":"crossref","unstructured":"Huan J, Wang W, Prins J (2003a) Efficient mining of frequent subgraphs in the presence of isomorphism. In: IEEE international conference on data mining","DOI":"10.1109\/ICDM.2003.1250974"},{"key":"98_CR29","unstructured":"Huan J, Wang W, Prins J (2003b) Efficient mining of frequent subgraphs in the presence of isomorphism (Technical report TR03-021). University of North Carolina"},{"key":"98_CR30","doi-asserted-by":"crossref","unstructured":"Inokuchi A, Washio T, Motoda H (2000) An apriori-based algorithm for mining frequent substructures from graph data. In: 4th European conference on principles of knowledge discovery and data mining","DOI":"10.1007\/3-540-45372-5_2"},{"key":"98_CR31","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1023\/A:1021726221443","volume":"50","author":"A Inokuchi","year":"2003","unstructured":"Inokuchi A, Washio T, Motoda H (2003) Complete mining of frequent patterns from graphs: Mining graph data. Machine Learn 50: 321\u2013354","journal-title":"Machine Learn"},{"key":"98_CR32","doi-asserted-by":"crossref","unstructured":"Kramer S, Raedt LD, Helma C (2001) Molecular feature mining in HIV data. In: ACM SIGKDD international conference on knowledge discovery and data mining","DOI":"10.1145\/502512.502533"},{"key":"98_CR33","unstructured":"Kuramochi M, Karypis G (2001). Frequent subgraph discovery. In: 1st IEEE international conference on data mining"},{"key":"98_CR34","doi-asserted-by":"crossref","first-page":"1038","DOI":"10.1109\/TKDE.2004.33","volume":"16","author":"M Kuramochi","year":"2004","unstructured":"Kuramochi M, Karypis G (2004) An efficient algorithm for discovering frequent subgraphs. IEEE Transactions on Knowledge and Data Engineering 16: 1038\u20131051","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"98_CR35","unstructured":"Mannila H, Toivonen H. (1996) Discovering generalized episodes using minimal occurences. In: 2nd International conference knowledge discovery and data mining"},{"key":"98_CR36","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1023\/A:1009796218281","volume":"1","author":"H Mannila","year":"1997","unstructured":"Mannila H, Toivonen H. (1997) Levelwise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery 1: 241\u2013258","journal-title":"Data Mining and Knowledge Discovery"},{"key":"98_CR37","unstructured":"Mannila H, Toivonen H, Verkamo I (1995) Discovering frequent episodes in sequences. In: 1st International conference knowledge discovery and data mining"},{"key":"98_CR38","unstructured":"Musser D, Derge G, Saini A. (2001) STL tutorial and reference guide, 2nd edition. Addison-Wesley"},{"key":"98_CR39","unstructured":"Nijssen S, Kok J (2003) Efficient discovery of frequent unordered trees. In: 1st Internationall workshop on mining graphs, trees and sequences"},{"key":"98_CR40","doi-asserted-by":"crossref","unstructured":"Nijssen S, Kok J (2004) A quickstart in frequent structure mining can make a difference. In: ACM SIGKDD international conference on knowledge discovery and data mining","DOI":"10.1145\/1014052.1014134"},{"key":"98_CR41","unstructured":"Oates T, Schmill MD, Jensen D, Cohen PR (1997) A family of algorithms for finding temporal structure in data. In: 6th International workshop on AI and statistics"},{"key":"98_CR42","doi-asserted-by":"crossref","unstructured":"Pasquier N, Bastide Y, Taouil R, Lakhal L (1999) Discovering frequent closed itemsets for association rules. In: 7th International conference on database theory","DOI":"10.1007\/3-540-49257-7_25"},{"key":"98_CR43","unstructured":"Pei J, Han J, Mortazavi-Asl B, Pinto H, Chen Q, Dayal U, Hsu M-C (2001). PrefixSpan: mining sequential patterns efficiently by prefixprojected pattern growth. In: IEEE international conference on data engineering"},{"key":"98_CR44","unstructured":"Savasere A, Omiecinski E, Navathe S (1995) An efficient algorithm for mining association rules in large databases. In: 21st International conference on very large data bases"},{"key":"98_CR45","doi-asserted-by":"crossref","unstructured":"Shasha D, Wang J, Zhang S (2004) Unordered tree mining with applications to phylogeny. In: IEEE international conference on data engineering","DOI":"10.1109\/ICDE.2004.1320039"},{"key":"98_CR46","unstructured":"Siek J, Lee L, Lumsdaine A (2002). The boost graph library. Addison-Wesley"},{"key":"98_CR47","doi-asserted-by":"crossref","unstructured":"Srikant R, Agrawal R (1996) Mining sequential patterns: Generalizations and performance improvements. In: 5th International conference extending database technology","DOI":"10.1007\/BFb0014140"},{"key":"98_CR48","doi-asserted-by":"crossref","unstructured":"Termier A, Rousset M-C, Sebag M (2002) TreeFinder: a first step towards xml data mining. In: IEEE international conference on data mining","DOI":"10.1109\/ICDM.2002.1183987"},{"key":"98_CR49","unstructured":"Termier A, Rousset M-C, Sebag M (2004) Dryade: a new approach for discovering closed frequent trees in heterogeneous tree databases. In: IEEE international conference on data mining"},{"key":"98_CR50","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"JR Ullmann","year":"1976","unstructured":"Ullmann JR (1976) An algorithm for subgraph isomorphism. J ACM 23: 31\u2013","journal-title":"J ACM"},{"key":"98_CR51","doi-asserted-by":"crossref","unstructured":"Wang C, Hong M, Pei J, Zhou H, Wang W, Shi B (2004) Efficient pattern-growth methods for frequent tree pattern mining. In: Pacific-Asia conference on knowledge discovery and data mining","DOI":"10.1007\/978-3-540-24775-3_54"},{"key":"98_CR52","doi-asserted-by":"crossref","unstructured":"Wang J, Han J (2004) BIDE: efficient mining of frequent closed sequences. In: IEEE international conference on data engineering","DOI":"10.1109\/ICDE.2004.1319986"},{"key":"98_CR53","doi-asserted-by":"crossref","unstructured":"Wang J, Han J, Pei J. (2003). CLOSET+: searching for the best strategies for mining frequent closed itemsets. In: ACM SIGKDD international conference on knowledge discovery and data mining","DOI":"10.1145\/956750.956779"},{"key":"98_CR54","doi-asserted-by":"crossref","unstructured":"Wang K, Liu H (1998) Discovering typical structures of documents: a road map approach. In: ACM SIGIR international conference on information retrieval","DOI":"10.1145\/290941.290982"},{"key":"98_CR55","unstructured":"Witten I, Frank E (1999) Data mining: practical machine learning tools and techniques with java implementations. Morgan Kauffman"},{"key":"98_CR56","doi-asserted-by":"crossref","unstructured":"Xiao Y, Yao J-F, Li Z, Dunham MH (2003) Efficient data mining for maximal frequent subtrees. In: IEEE international conference on data mining","DOI":"10.1109\/ICDM.2003.1250943"},{"key":"98_CR57","unstructured":"Yan X, Han J (2002a) gSpan: graph-based substructure pattern mining. In: IEEE international conference on data mining"},{"key":"98_CR58","unstructured":"Yan X, Han J (2002b) gSpan: graph-based substructure pattern mining (Technical report UIUCDCS-R-2002-2296). University of Illinois at Urbana-Champaign"},{"key":"98_CR59","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","DOI":"10.1145\/956750.956784"},{"key":"98_CR60","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0004-3702(94)00066-A","volume":"75","author":"K Yoshida","year":"1995","unstructured":"Yoshida K, Motoda H (1995) CLIP: concept learning from inference patterns. Artif Intel 75: 63\u201392","journal-title":"Artif Intel"},{"key":"98_CR61","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1109\/69.846291","volume":"12","author":"MJ Zaki","year":"2000","unstructured":"Zaki MJ (2000a) Scalable algorithms for association mining. IEEE Trans Knowl Data Eng 12: 372\u2013390","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"98_CR62","doi-asserted-by":"crossref","unstructured":"Zaki MJ (2000b) Sequences mining in categorical domains: Incorporating constraints. In: 9th International conference on information and knowledge management","DOI":"10.1145\/354756.354849"},{"key":"98_CR63","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1023\/A:1007652502315","volume":"42","author":"MJ Zaki","year":"2001","unstructured":"Zaki MJ (2001) SPADE: An efficient algorithm for mining frequent sequences. Machine Learn J 42: 31\u201360","journal-title":"Machine Learn J"},{"key":"98_CR64","doi-asserted-by":"crossref","unstructured":"Zaki MJ (2002) Efficiently mining frequent trees in a forest. In: 8th ACM SIGKDD international conference on knowledge discovery and data mining","DOI":"10.1145\/775056.775058"},{"key":"98_CR65","first-page":"33","volume":"66","author":"MJ Zaki","year":"2005","unstructured":"Zaki MJ (2005a) Efficiently mining frequent embedded unordered trees. Fundamenta Informaticae 66: 33\u201352","journal-title":"Fundamenta Informaticae"},{"key":"98_CR66","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1109\/TKDE.2005.125","volume":"17","author":"MJ Zaki","year":"2005","unstructured":"Zaki MJ (2005b) Efficiently mining frequent trees in a forest: algorithms and applications. IEEE Trans Knowledge Data Eng 17: 1021\u20131035","journal-title":"IEEE Trans Knowledge Data Eng"},{"key":"98_CR67","doi-asserted-by":"crossref","unstructured":"Zaki MJ, Gouda K (2003) Fast vertical mining using Diffsets. In: 9th ACM SIGKDD international conference on knowledge discovery and data mining, pp 326\u2013335","DOI":"10.1145\/956750.956788"},{"key":"98_CR68","doi-asserted-by":"crossref","unstructured":"Zaki MJ, Hsiao C-J (2002) ChARM: an efficient algorithm for closed itemset mining. In: 2nd SIAM international conference on data mining","DOI":"10.1137\/1.9781611972726.27"},{"key":"98_CR69","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1109\/TKDE.2005.60","volume":"17","author":"MJ Zaki","year":"2005","unstructured":"Zaki MJ, Hsiao C-J (2005) Efficient algorithms for mining closed itemsets and their lattice structure. IEEE Trans Knowl Data Eng 17: 462\u2013478","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"98_CR70","doi-asserted-by":"crossref","unstructured":"Zaki MJ, Parimi N, De N, Gao F, Phoophakdee B, Urban J, Chaoji V, Hasan M, Salem S (2004) Towards generic pattern mining. In: International conference on formal concept analysis (Invited paper)","DOI":"10.1007\/978-3-540-32262-7_1"},{"key":"98_CR71","doi-asserted-by":"crossref","unstructured":"Zaki MJ, Parthasarathy S, Ogihara M, Li W (1997) New algorithms for fast discovery of association rules. In: 3rd International conference on knowledge discovery and data mining","DOI":"10.1007\/978-1-4615-5669-5_1"},{"key":"98_CR72","doi-asserted-by":"crossref","unstructured":"Zou B, Ma X, Kemme B, Newton G, Precu D (2006) Data mining using relational database management systems. In: Pacific-asia conference on knowledge discovery and data mining","DOI":"10.1007\/11731139_75"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-008-0098-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-008-0098-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-008-0098-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T09:50:09Z","timestamp":1738230609000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-008-0098-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5,18]]},"references-count":72,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,12]]}},"alternative-id":["98"],"URL":"https:\/\/doi.org\/10.1007\/s10618-008-0098-x","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"type":"print","value":"1384-5810"},{"type":"electronic","value":"1573-756X"}],"subject":[],"published":{"date-parts":[[2008,5,18]]}}}