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": "5fa0eabf-aa87-436c-837f-bb3912843f92"}, "_deposit": {"id": "5067", "owners": [], "pid": {"revision_id": 0, "type": "recid", "value": "5067"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/5067", "sets": ["1597824273898", "user-ucsy"]}, "communities": ["ucsy"], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "Analysis on Efficiency of Apriori and MBAT Algorithms", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "Data Mining is a fast developing field ofcomputer science and technology, which arehelpful to enable end users for decision makingprocess. One of the most important data miningprocesses is that of Association Rule Mining. Thispaper intends to the analysis on efficiency of thetwo algorithms (Apriori and MBAT) which findingfrequent itemsets in Association Rule Mining. TheAssociation Rule Mining is based mainly ondiscovering frequent itemsets. Apriori algorithmand other popular Association Rule Miningalgorithms mainly generate a large number ofcandidate items and scanning the database toomany times. To remove these deficiencies, thispaper presents a method named Matrix BasedFrequent Itemsets Minining algorithm with Tags(MBAT) which can reduce the number ofcandidate itemsets. In this paper, the system usedJava Programming Language with Follow Meproducts dataset to compare these two algorithms."}]}, "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-18"}], "displaytype": "preview", "download_preview_message": "", "file_order": 0, "filename": "62_PDFsam_PSC_final proof.pdf", "filesize": [{"value": "136 Kb"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 136000.0, "url": {"url": "https://meral.edu.mm/record/5067/files/62_PDFsam_PSC_final proof.pdf"}, "version_id": "2763f264-0fab-4e0b-abee-52cd03ca9c21"}]}, "item_1583103131163": {"attribute_name": "Journal articles", "attribute_value_mlt": [{"subitem_issue": "", "subitem_journal_title": "Eighth 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": "Aung, Yu Nandar"}, {"subitem_authors_fullname": "Zaw, Ei Phyu"}]}]}, "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": "2017-12-27"}, "item_1583159847033": {"attribute_name": "Identifier", "attribute_value": "http://onlineresource.ucsy.edu.mm/handle/123456789/959"}, "item_title": "Analysis on Efficiency of Apriori and MBAT Algorithms", "item_type_id": "21", "owner": "1", "path": ["1597824273898"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000005067", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2019-07-18"}, "publish_date": "2019-07-18", "publish_status": "0", "recid": "5067", "relation": {}, "relation_version_is_last": true, "title": ["Analysis on Efficiency of Apriori and MBAT Algorithms"], "weko_shared_id": -1}
  1. University of Computer Studies, Yangon
  2. Conferences

Analysis on Efficiency of Apriori and MBAT Algorithms

http://hdl.handle.net/20.500.12678/0000005067
http://hdl.handle.net/20.500.12678/0000005067
103d6e16-9838-4e0e-babc-964f6f815064
5fa0eabf-aa87-436c-837f-bb3912843f92
None
Preview
Name / File License Actions
62_PDFsam_PSC_final 62_PDFsam_PSC_final proof.pdf (136 Kb)
Back
0
0
views
downloads
See details
Views Downloads

Versions

Ver.1 2020-09-01 15:42:21.150831
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