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": "99bbbac9-c7b0-42b4-9a64-94f8b8dc4173"}, "_deposit": {"id": "4599", "owners": [], "pid": {"revision_id": 0, "type": "recid", "value": "4599"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/4599", "sets": ["user-ucsy"]}, "communities": ["ucsy"], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "An Improvement of FP-Growth Mining Algorithm Using Linked list", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "Frequent pattern mining such as association rules,clustering, and classification is one of the most centralareas in the data mining research. One of the foremostprocesses in association rule mining is the discovering ofthe frequent pattern. To draw on all substantial frequentpatterns from the sizable amount of transaction data,various algorithms have been proposed. The proposedresearch aims to mine frequent patterns from the sizableamount of transaction database by using linked list. In thismethod, first scanning the database, the count of frequent 1-itemsets is searched using the hash map and for nextitemsets, it is stored in the linked list, second scanning thedatabase. The frequent 2-itemsets is generated using hashtable and so on. So, the proposed research needs only twoscans and this proposed method requires shorter processingtime and smaller memory space."}]}, "item_1583103108160": {"attribute_name": "Keywords", "attribute_value_mlt": [{"interim": "frequent pattern mining"}, {"interim": "data mining"}, {"interim": "linked list,"}, {"interim": "hash table"}]}, "item_1583103120197": {"attribute_name": "Files", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_access", "date": [{"dateType": "Available", "dateValue": "2020-03-17"}], "displaytype": "preview", "download_preview_message": "", "file_order": 0, "filename": "An Improvement of FP-Growth Mining Algorithm Using Linked List.pdf", "filesize": [{"value": "310 Kb"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 310000.0, "url": {"url": "https://meral.edu.mm/record/4599/files/An Improvement of FP-Growth Mining Algorithm Using Linked List.pdf"}, "version_id": "a5713ca2-f09f-410f-9930-57a8528be702"}]}, "item_1583103131163": {"attribute_name": "Journal articles", "attribute_value_mlt": [{"subitem_issue": "", "subitem_journal_title": "Proceedings of the Eighteenth International Conference On Computer Applications (ICCA 2020)", "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": "Maw, San San"}]}]}, "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": "2020-02-28"}, "item_1583159847033": {"attribute_name": "Identifier", "attribute_value": "978-1-7281-5925-6"}, "item_title": "An Improvement of FP-Growth Mining Algorithm Using Linked list", "item_type_id": "21", "owner": "1", "path": ["1597824273898"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000004599", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2020-03-17"}, "publish_date": "2020-03-17", "publish_status": "0", "recid": "4599", "relation": {}, "relation_version_is_last": true, "title": ["An Improvement of FP-Growth Mining Algorithm Using Linked list"], "weko_shared_id": -1}
  1. University of Computer Studies, Yangon
  2. Conferences

An Improvement of FP-Growth Mining Algorithm Using Linked list

http://hdl.handle.net/20.500.12678/0000004599
http://hdl.handle.net/20.500.12678/0000004599
595a1412-facb-4575-8100-6cde008f75de
99bbbac9-c7b0-42b4-9a64-94f8b8dc4173
None
Preview
Name / File License Actions
An An Improvement of FP-Growth Mining Algorithm Using Linked List.pdf (310 Kb)
Publication type
Article
Upload type
Publication
Title
Title An Improvement of FP-Growth Mining Algorithm Using Linked list
Language en
Publication date 2020-02-28
Authors
Maw, San San
Description
Frequent pattern mining such as association rules,clustering, and classification is one of the most centralareas in the data mining research. One of the foremostprocesses in association rule mining is the discovering ofthe frequent pattern. To draw on all substantial frequentpatterns from the sizable amount of transaction data,various algorithms have been proposed. The proposedresearch aims to mine frequent patterns from the sizableamount of transaction database by using linked list. In thismethod, first scanning the database, the count of frequent 1-itemsets is searched using the hash map and for nextitemsets, it is stored in the linked list, second scanning thedatabase. The frequent 2-itemsets is generated using hashtable and so on. So, the proposed research needs only twoscans and this proposed method requires shorter processingtime and smaller memory space.
Keywords
frequent pattern mining, data mining, linked list,, hash table
Identifier 978-1-7281-5925-6
Journal articles
Proceedings of the Eighteenth International Conference On Computer Applications (ICCA 2020)
Conference papers
Books/reports/chapters
Thesis/dissertations
Back
0
0
views
downloads
See details
Views Downloads

Versions

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