{"_buckets": {"deposit": "2b1321bd-e1d1-45db-83bd-5faed82edf55"}, "_deposit": {"created_by": 45, "id": "5407", "owner": "45", "owners": [45], "owners_ext": {"displayname": "", "username": ""}, "pid": {"revision_id": 0, "type": "recid", "value": "5407"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/5407", "sets": ["user-uit"]}, "communities": ["uit"], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "MINING FREQUENT ITEMSETS USING ADVAN CED PARTITION APPROACH", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "Frequent itemsets mining plays an important part in many data mining tasks. This technique has been used in numerous practical applications, including market basket analysis. This paper presents mining frequent itemsets in large database of medical sales transaction by using the advanced partition approach. This advanced partition approach executes in two phases. In phase 1, the advanced partition approach logically divides the database into a number of non-overlapping partitions. These partitions are considered one at a time and all local frequent itemsets for those partitions are generated using the apriori method. In phase 2, the advanced partition approach finds the final set of frequent itemsets. The purpose of this paper is to extract the final sets of frequent itemsets from medical retail datasets and to support efficient information used to plan marketing or advertising strategies for medical stores and companies. Algorithms for finding frequent itemsets like Apriori, needs many database scans. But, this advanced partition approach needs to scan the entire database only one time. So, it reduces the time taken for the large database scan in mining frequent itemsets."}]}, "item_1583103108160": {"attribute_name": "Keywords", "attribute_value_mlt": [{"interim": "Frequent Itemsets Mining"}, {"interim": "Market Basket Analysis"}]}, "item_1583103120197": {"attribute_name": "Files", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_access", "date": [{"dateType": "Available", "dateValue": "2020-09-16"}], "displaytype": "preview", "download_preview_message": "", "file_order": 0, "filename": "MINING FREQUENT ITEMSETS USING ADVAN CED PARTITION APPROACH.pdf", "filesize": [{"value": "490 Kb"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_0", "mimetype": "application/pdf", "size": 490000.0, "url": {"url": "https://meral.edu.mm/record/5407/files/MINING FREQUENT ITEMSETS USING ADVAN CED PARTITION APPROACH.pdf"}, "version_id": "7d408383-b7ed-4a43-af06-2d81a0ad69e8"}]}, "item_1583103147082": {"attribute_name": "Conference papers", "attribute_value_mlt": [{"subitem_acronym": "PSC", "subitem_c_date": "30 December, 2009", "subitem_conference_title": "FOURTH LOCAL CONFERENCE ON PARALLEL AND SOFT COMPUTING", "subitem_place": "University of Computer Studies, Yangon, Myanmar", "subitem_website": "https://www.ucsy.edu.mm/FourthPSC.do"}]}, "item_1583105942107": {"attribute_name": "Authors", "attribute_value_mlt": [{"subitem_authors": [{"subitem_authors_fullname": "Nay Chi Lynn"}, {"subitem_authors_fullname": "Khin Myat Myat Moe"}]}]}, "item_1583108359239": {"attribute_name": "Upload type", "attribute_value_mlt": [{"interim": "Publication"}]}, "item_1583108428133": {"attribute_name": "Publication type", "attribute_value_mlt": [{"interim": "Conference paper"}]}, "item_1583159729339": {"attribute_name": "Publication date", "attribute_value": "2009-12-30"}, "item_title": "MINING FREQUENT ITEMSETS USING ADVAN CED PARTITION APPROACH", "item_type_id": "21", "owner": "45", "path": ["1596102391527"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000005407", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2020-09-16"}, "publish_date": "2020-09-16", "publish_status": "0", "recid": "5407", "relation": {}, "relation_version_is_last": true, "title": ["MINING FREQUENT ITEMSETS USING ADVAN CED PARTITION APPROACH"], "weko_shared_id": -1}