{"created":"2020-09-01T10:00:04.236837+00:00","id":3355,"links":{},"metadata":{"_buckets":{"deposit":"8e184101-e2a5-4b80-bd93-c9a208e22c8c"},"_deposit":{"id":"3355","owners":[],"pid":{"revision_id":0,"type":"recid","value":"3355"},"status":"published"},"_oai":{"id":"oai:meral.edu.mm:recid/3355","sets":["1582963302567:1597824273898"]},"communities":["ucsy"],"item_1583103067471":{"attribute_name":"Title","attribute_value_mlt":[{"subitem_1551255647225":"Improving Association Rules Mining by Hashing Algorithm","subitem_1551255648112":"en"}]},"item_1583103085720":{"attribute_name":"Description","attribute_value_mlt":[{"interim":"Association rule mining, is one of the mostimportant and well researched techniques of datamining. It is the process of discovering large itemsetsappeared in a sufficient number of transactions.Large itemsets from a huge number of candidatelarge itemsets are dominating factor for the overalldata mining performance. This paper presentsmining association rules among items in a largedatabase of sales transactions. To address thisproblem, it present an effective hash-based algorithmfor the candidate set generation. This system appliesan algorithm DHP (Direct Hashing and Pruning) onapplication cosmetic sales data to generate frequentassociation patterns. Generation of smallercandidate sets enables to effectively trim thetransaction database size at a much earlier stage ofthe iterations, thereby reducing the computationalcost of later iterations significantly. Theexperimental results of our system are also discussedin this paper."}]},"item_1583103108160":{"attribute_name":"Keywords","attribute_value":[]},"item_1583103120197":{"attribute_name":"Files","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_access","date":[{"dateType":"Available","dateValue":"2019-07-22"}],"displaytype":"preview","filename":"psc2010paper (180).pdf","filesize":[{"value":"48 Kb"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"url":"https://meral.edu.mm/record/3355/files/psc2010paper (180).pdf"},"version_id":"0ceb1184-2609-4b4b-9cf7-248729997b31"}]},"item_1583103131163":{"attribute_name":"Journal articles","attribute_value_mlt":[{"subitem_issue":"","subitem_journal_title":"Fifth Local Conference on Parallel and Soft Computing","subitem_pages":"","subitem_volume":""}]},"item_1583103147082":{"attribute_name":"Conference papers","attribute_value_mlt":[{"subitem_acronym":"","subitem_c_date":"","subitem_conference_title":"","subitem_part":"","subitem_place":"","subitem_session":"","subitem_website":""}]},"item_1583103211336":{"attribute_name":"Books/reports/chapters","attribute_value_mlt":[{"subitem_book_title":"","subitem_isbn":"","subitem_pages":"","subitem_place":"","subitem_publisher":""}]},"item_1583103233624":{"attribute_name":"Thesis/dissertations","attribute_value_mlt":[{"subitem_awarding_university":"","subitem_supervisor(s)":[{"subitem_supervisor":""}]}]},"item_1583105942107":{"attribute_name":"Authors","attribute_value_mlt":[{"subitem_authors":[{"subitem_authors_fullname":"Lwin, Nang Khine Zar"},{"subitem_authors_fullname":"Tun, Nay Min"}]}]},"item_1583108359239":{"attribute_name":"Upload type","attribute_value_mlt":[{"interim":"Publication"}]},"item_1583108428133":{"attribute_name":"Publication type","attribute_value_mlt":[{"interim":"Article"}]},"item_1583159729339":{"attribute_name":"Publication date","attribute_value":"2010-12-16"},"item_1583159847033":{"attribute_name":"Identifier","attribute_value":"http://onlineresource.ucsy.edu.mm/handle/123456789/1114"},"item_title":"Improving Association Rules Mining by Hashing Algorithm","item_type_id":"21","owner":"1","path":["1597824273898"],"publish_date":"2019-07-22","publish_status":"0","recid":"3355","relation_version_is_last":true,"title":["Improving Association Rules Mining by Hashing Algorithm"],"weko_creator_id":"1","weko_shared_id":-1},"updated":"2021-12-13T06:03:33.972121+00:00"}