{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,9]],"date-time":"2025-02-09T02:40:02Z","timestamp":1739068802664,"version":"3.37.0"},"publisher-location":"Dordrecht","reference-count":14,"publisher":"Springer Netherlands","isbn-type":[{"type":"print","value":"9789048123100"},{"type":"electronic","value":"9789048123117"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-90-481-2311-7_42","type":"book-chapter","created":{"date-parts":[[2009,4,18]],"date-time":"2009-04-18T14:33:41Z","timestamp":1240065221000},"page":"495-504","source":"Crossref","is-referenced-by-count":0,"title":["PC_Tree: Prime-Based and Compressed Tree for Maximal Frequent Patterns Mining"],"prefix":"10.1007","author":[{"given":"Mohammad","family":"Nadimi-Shahraki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Norwati","family":"Mustapha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Md Nasir B","family":"Sulaiman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali B","family":"Mamat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"42_CR1_42","first-page":"487","volume":"1215","author":"R. Agrawal","year":"1994","unstructured":"R. Agrawal and R. Srikant, Fast algorithms for mining association rules, 20th International Conference. Very Large Data Bases, VLDB, 1215: 487\u2013499 (1994).","journal-title":"Very Large Data Bases, VLDB"},{"key":"42_CR2_42","doi-asserted-by":"crossref","unstructured":"D. Burdick, M. Calimlim, and J. Gehrke, Mafia: A maximal frequent itemset algorithm for transactional databases, 17th International Conference on Data Engineering: pp. 443\u2013452 (2001).","DOI":"10.1109\/ICDE.2001.914857"},{"key":"42_CR3_42","unstructured":"S. Bashir and A.R. Baig, HybridMiner: Mining Maximal Frequent Itemsets Using Hybrid Database Representation Approach, 9th International Multitopic Conference, IEEE INMIC: pp. 1\u20137 (2005)."},{"key":"42_CR4_42","doi-asserted-by":"crossref","unstructured":"R.J. Bayardo Jr, Efficiently mining long patterns from databases, ACM SIGMOD International Conference on Management of Data: pp. 85\u201393 (1998).","DOI":"10.1145\/276304.276313"},{"issue":"1","key":"42_CR5_42","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10618-006-0059-1","volume":"15","author":"J. Han","year":"2007","unstructured":"J. Han, H. Cheng, D. Xin, and X. Yan, Frequent pattern mining: Current status and future directions, Data Mining and Knowledge Discovery, 15(1): 55\u201386 (2007).","journal-title":"Data Mining and Knowledge Discovery"},{"key":"42_CR6_42","doi-asserted-by":"crossref","unstructured":"D.I. Lin and Z.M. Kedem, Pincer-Search: A New Algorithm for Discovering the Maximum Frequent Set, Advances in Database Technology\u2014EDBT'98: 6th International Conference on Extending Database Technology, Valencia, Spain (1998).","DOI":"10.1007\/BFb0100980"},{"key":"42_CR7_42","doi-asserted-by":"crossref","unstructured":"R.C. Agarwal, C.C. Aggarwal, and V.V.V. Prasad, Depth first generation of long patterns, Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining: pp. 108\u2013118 (2000).","DOI":"10.1145\/347090.347114"},{"key":"42_CR8_42","unstructured":"R. Rymon, Search through systematic set enumeration, Third International Conference on Principles of Knowledge Representation and Reasoning: pp. 539\u2013550 (1992)."},{"issue":"8","key":"42_CR9_42","doi-asserted-by":"publisher","first-page":"967","DOI":"10.1080\/0020716031000112376","volume":"80","author":"N. Mustapha","year":"2003","unstructured":"N. Mustapha, M.N. Sulaiman, M. Othman, and M.H. Selamat, FAST DISCOVERY OF LONG PATTERNS FOR ASSOCIATION RULES, International Journal of Computer Mathematics, 80(8): 967\u2013976 (2003).","journal-title":"International Journal of Computer Mathematics"},{"key":"42_CR10_42","doi-asserted-by":"crossref","unstructured":"F. Chen, and M. Li, A Two-Way Hybrid Algorithm for Maximal Frequent Itemsets Mining, Fourth International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2007.","DOI":"10.1109\/FSKD.2007.130"},{"issue":"3","key":"42_CR11_42","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1109\/69.846291","volume":"12","author":"M.J. Zaki","year":"2000","unstructured":"M.J. Zaki, Scalable algorithms for association mining, IEEE Transactions on Knowledge and Data Engineering, 12(3): 372\u2013390 (2000).","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"42_CR12_42","volume-title":"Introduction to algorithms","author":"T.T. Cormen","year":"1990","unstructured":"T.T. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to algorithms: MIT Press, Cambridge, MA (1990)."},{"key":"42_CR13_42","doi-asserted-by":"crossref","unstructured":"M. Nadimi-Shahraki, N. Mustapha, M.N. Sulaiman, and A. Mamat, Incremental updating of frequent pattern: basic algorithms, Second International Conference on Information Systems Technology and Management (ICISTM 08) (1): 145\u2013148 (2008).","DOI":"10.1109\/ITSIM.2008.4631691"},{"key":"42_CR14_42","unstructured":"C.B.a.C. Merz, UCI Repository of Machine Learning, 1998."}],"container-title":["Lecture Notes in Electrical Engineering","Advances in Electrical Engineering and Computational Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-90-481-2311-7_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,9]],"date-time":"2025-02-09T02:03:20Z","timestamp":1739066600000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-90-481-2311-7_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9789048123100","9789048123117"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-90-481-2311-7_42","relation":{},"ISSN":["1876-1100"],"issn-type":[{"type":"print","value":"1876-1100"}],"subject":[],"published":{"date-parts":[[2009]]}}}