{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:17:57Z","timestamp":1740169077055,"version":"3.37.3"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2016]]},"DOI":"10.1109\/access.2016.2624418","type":"journal-article","created":{"date-parts":[[2016,11,11]],"date-time":"2016-11-11T22:02:03Z","timestamp":1478901723000},"page":"7847-7858","source":"Crossref","is-referenced-by-count":4,"title":["An Effective Pattern Pruning and Summarization Method Retaining High Quality Patterns With High Area Coverage in Relational Datasets"],"prefix":"10.1109","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6651-0079","authenticated-orcid":false,"given":"Pei-Yuan","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gary C. L.","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew K. C.","family":"Wong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081907"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8640.1990.tb00129.x"},{"key":"ref33","article-title":"CHARM: An efficient algorithm for closed association rule mining","volume":"10","author":"zaki","year":"1999"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-005-0002-x"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276313"},{"key":"ref30","first-page":"19","author":"aggarwal","year":"2014","journal-title":"Frequent Pattern Mining Algorithms A Survey Frequent Pattern Mining"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btw211"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2014.2306840"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2006.10"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956779"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2008.38"},{"key":"ref40","first-page":"399","article-title":"Effective and efficient itemset pattern summarization: Regression-based approaches","author":"ruoming","year":"2008","journal-title":"Proc 14th ACM SIGKDD Int Conf Knowl Discovery Data Mining"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/312129.312216"},{"key":"ref12","first-page":"47","article-title":"Pruning and grouping discovered association rules","author":"toivonen","year":"1995","journal-title":"Proc MLnet Workshop Statistics Machine Learning Discovery Databases"},{"article-title":"Association pattern analysis for pattern pruning, clustering and summarization","year":"2008","author":"li","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1999.754924"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.2307\/2529686"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-2836(76)80054-X"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1975.224183"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16001-1_13"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281240"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-12-S5-S5"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2001.914857"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2006.70"},{"key":"ref3","first-page":"487","article-title":"Fast algorithms for mining association rules in large databases","author":"agrawal","year":"1994","journal-title":"Proc 20th Int Conf Very Large Data Bases"},{"key":"ref6","first-page":"21","article-title":"Closet: An efficient algorithm for mining frequent closed itemsets","author":"pei","year":"2000","journal-title":"Proc Int Workshop Knowl Discov and Data Mining"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0100980"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2001.989514"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.100"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.60"},{"article-title":"UCI machine learning repository, school of information and computer science","year":"2007","author":"asuncion","key":"ref2"},{"key":"ref9","first-page":"139","article-title":"?-Tolerance closed frequent itemsets","author":"cheng","year":"2006","journal-title":"Proc 6th Int Conf Data Mining"},{"journal-title":"Data Mining Concepts and Techniques","year":"2006","author":"han","key":"ref1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/69.649314"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871547"},{"key":"ref22","first-page":"63","article-title":"Statistically significant patterns","author":"wang","year":"2005","journal-title":"Mining Sequential Patterns from Large Data Sets"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR.2006.895"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081907"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-007-0092-4"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014057"},{"key":"ref23","first-page":"27","author":"cumming","year":"2012","journal-title":"Understanding The New Statistics Effect Sizes Confidence Intervals and Meta-Analysis"},{"key":"ref44","first-page":"527","article-title":"Summarizing probabilistic frequent patterns: A fast approach","author":"chunyang","year":"2013","journal-title":"Proc ACM SIGKDD Int Conf Knowledge Discovery and Data Mining"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-009-0196-0"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150495"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-014-0815-2"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/7419931\/07742397.pdf?arnumber=7742397","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:26:45Z","timestamp":1642004805000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7742397\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"references-count":45,"URL":"https:\/\/doi.org\/10.1109\/access.2016.2624418","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2016]]}}}