{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T00:59:38Z","timestamp":1730249978443,"version":"3.28.0"},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/icmla.2004.1383532","type":"proceedings-article","created":{"date-parts":[[2005,4,6]],"date-time":"2005-04-06T15:12:58Z","timestamp":1112800378000},"page":"336-343","source":"Crossref","is-referenced-by-count":0,"title":["A comparative study among three algorithms for frequent pattern generation"],"prefix":"10.1109","author":[{"given":"R.","family":"Islam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.M.","family":"Khan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Azud us zaman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.S.","family":"Kabir Robin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"3","article-title":"CLOSET: An efficient algorithm for mining frequent closed itemsets (PDF)","author":"pei","year":"2000","journal-title":"Proc 2000 ACM-SIGMOD International Workshop on Data Mining and Knowledge Discovery"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276313"},{"key":"10","first-page":"283","article-title":"New algorithms for fast discovery of association rules","author":"zaki","year":"0","journal-title":"Proc of the Third Int'l Conf on Knowledge Discovery in Databases and Data Mining"},{"key":"1","first-page":"487","article-title":"Fast algorithms for mining association rules","author":"agrawal","year":"0","journal-title":"VLDB'94"},{"key":"7","first-page":"39","article-title":"Predictive item pruning FP-tree algorithm","volume":"52","author":"mamun-or-rashid","year":"2003","journal-title":"The Dhaka University-journal of Science"},{"key":"6","article-title":"The DCP algorithm for frequent set counting","volume":"cs 2007 7","author":"orlando","year":"2001","journal-title":"Technical Report"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335372"},{"journal-title":"Using Pattern Decomposition(PD) Methods for Finding All Frequent Patterns in Large Datasets","year":"0","author":"zou","key":"4"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253325"},{"key":"8","first-page":"175","article-title":"An effective hash based algorithm for mining association rules","author":"park","year":"0","journal-title":"Proc 1995 ACM SIGMOD Conf Management of Data"},{"key":"11","article-title":"Pincer-search: A new algorithm for discovering the maximum frequent set","author":"lin","year":"1998","journal-title":"Proc of the Sixth European Conf on Extending DatabaseTechnology"},{"journal-title":"Database Management Systems","year":"1998","author":"ramakrishnan","key":"12"}],"event":{"name":"2004 International Conference on Machine Learning and Applications, 2004.","location":"Louisville, Kentucky, USA"},"container-title":["2004 International Conference on Machine Learning and Applications, 2004. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9504\/30147\/01383532.pdf?arnumber=1383532","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,14]],"date-time":"2017-03-14T03:51:52Z","timestamp":1489463512000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1383532\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/icmla.2004.1383532","relation":{},"subject":[]}}