Log in
Language:

MERAL Myanmar Education Research and Learning Portal

  • Top
  • Universities
  • Ranking
To
lat lon distance
To

Field does not validate



Index Link

Index Tree

Please input email address.

WEKO

One fine body…

WEKO

One fine body…

Item

{"_buckets": {"deposit": "980724f3-a243-479a-b6ec-b4090131b9f0"}, "_deposit": {"id": "3719", "owners": [], "pid": {"revision_id": 0, "type": "recid", "value": "3719"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/3719", "sets": ["user-ucsy"]}, "communities": ["ucsy"], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "MINING FREQUENT itemsets using advanced 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": []}, "item_1583103120197": {"attribute_name": "Files", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_access", "date": [{"dateType": "Available", "dateValue": "2019-07-29"}], "displaytype": "preview", "download_preview_message": "", "file_order": 0, "filename": "54029.pdf", "filesize": [{"value": "494 Kb"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 494000.0, "url": {"url": "https://meral.edu.mm/record/3719/files/54029.pdf"}, "version_id": "43e95dca-2279-4f7f-9779-16a7a4989f87"}]}, "item_1583103131163": {"attribute_name": "Journal articles", "attribute_value_mlt": [{"subitem_issue": "", "subitem_journal_title": "Fourth 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": "Lynn, Nay Chi"}, {"subitem_authors_fullname": "Moe, Khin Myat Myat"}]}]}, "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": "2009-12-30"}, "item_1583159847033": {"attribute_name": "Identifier", "attribute_value": "http://onlineresource.ucsy.edu.mm/handle/123456789/1456"}, "item_title": "MINING FREQUENT itemsets using advanced partition APPROACH", "item_type_id": "21", "owner": "1", "path": ["1597824273898"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000003719", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2019-07-29"}, "publish_date": "2019-07-29", "publish_status": "0", "recid": "3719", "relation": {}, "relation_version_is_last": true, "title": ["MINING FREQUENT itemsets using advanced partition APPROACH"], "weko_shared_id": -1}
  1. University of Computer Studies, Yangon
  2. Conferences

MINING FREQUENT itemsets using advanced partition APPROACH

http://hdl.handle.net/20.500.12678/0000003719
http://hdl.handle.net/20.500.12678/0000003719
927066ef-0b84-4431-93b2-ac9098b37c60
980724f3-a243-479a-b6ec-b4090131b9f0
None
Preview
Name / File License Actions
54029.pdf 54029.pdf (494 Kb)
Back
0
0
views
downloads
See details
Views Downloads

Versions

Ver.1 2020-09-01 13:23:14.681460
Show All versions

Share

Mendeley Twitter Facebook Print Addthis

Export

OAI-PMH
  • OAI-PMH DublinCore
Other Formats
  • JSON

Confirm


Back to MERAL


Back to MERAL