MERAL Myanmar Education Research and Learning Portal
Item
{"_buckets": {"deposit": "743edfd1-74ed-4c0e-9c5d-55fccac45a46"}, "_deposit": {"id": "3447", "owners": [], "pid": {"revision_id": 0, "type": "recid", "value": "3447"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/3447", "sets": ["user-ucsy"]}, "communities": ["ucsy"], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "Comparison of Apriori, FP-growth and Dynamic FP- growth for Frequent Patterns", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "Frequent pattern mining is one of the active research themes in data mining. It is an important role in all data mining tasks such as clustering, classification, prediction and association analysis. Frequent pattern is the most time consuming process due to a massive number of patterns generated. Frequent patterns are generated by using association rule mining algorithms that use candidate generation and association rules such as Apriori algorithm, and the algorithms without candidate set generation and FP-tree such as FP-growth and DynFP-growth algorithms. In this paper, this system used computer sales items for generating frequent patterns by applying Apriori, FP-Growth and DynFP-Growth algorithms. The frequent patterns are used for comparing performance results with run time and scalability. The scalability and run time of DynFP-Growth algorithm is faster than Apriori and FP-Growth algorithms."}]}, "item_1583103108160": {"attribute_name": "Keywords", "attribute_value_mlt": [{"interim": "frequent pattern mining"}, {"interim": "association mining algorithms"}, {"interim": "performance improvements"}]}, "item_1583103120197": {"attribute_name": "Files", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_access", "date": [{"dateType": "Available", "dateValue": "2019-07-23"}], "displaytype": "preview", "download_preview_message": "", "file_order": 0, "filename": "psc2010paper (241).pdf", "filesize": [{"value": "537 Kb"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 537000.0, "url": {"url": "https://meral.edu.mm/record/3447/files/psc2010paper (241).pdf"}, "version_id": "f42a7e22-6492-40a0-9f48-2ff43f28f4be"}]}, "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": "Cho, War War"}, {"subitem_authors_fullname": "Nwe, Nwe"}]}]}, "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/1196"}, "item_title": "Comparison of Apriori, FP-growth and Dynamic FP- growth for Frequent Patterns", "item_type_id": "21", "owner": "1", "path": ["1597824273898"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000003447", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2019-07-23"}, "publish_date": "2019-07-23", "publish_status": "0", "recid": "3447", "relation": {}, "relation_version_is_last": true, "title": ["Comparison of Apriori, FP-growth and Dynamic FP- growth for Frequent Patterns"], "weko_shared_id": -1}
Comparison of Apriori, FP-growth and Dynamic FP- growth for Frequent Patterns
http://hdl.handle.net/20.500.12678/0000003447
http://hdl.handle.net/20.500.12678/00000034472f4f1213-d055-4aa6-a77d-4d9b9ae8cfca
743edfd1-74ed-4c0e-9c5d-55fccac45a46
Name / File | License | Actions |
---|---|---|
psc2010paper (241).pdf (537 Kb)
|
|
Publication type | ||||||
---|---|---|---|---|---|---|
Article | ||||||
Upload type | ||||||
Publication | ||||||
Title | ||||||
Title | Comparison of Apriori, FP-growth and Dynamic FP- growth for Frequent Patterns | |||||
Language | en | |||||
Publication date | 2010-12-16 | |||||
Authors | ||||||
Cho, War War | ||||||
Nwe, Nwe | ||||||
Description | ||||||
Frequent pattern mining is one of the active research themes in data mining. It is an important role in all data mining tasks such as clustering, classification, prediction and association analysis. Frequent pattern is the most time consuming process due to a massive number of patterns generated. Frequent patterns are generated by using association rule mining algorithms that use candidate generation and association rules such as Apriori algorithm, and the algorithms without candidate set generation and FP-tree such as FP-growth and DynFP-growth algorithms. In this paper, this system used computer sales items for generating frequent patterns by applying Apriori, FP-Growth and DynFP-Growth algorithms. The frequent patterns are used for comparing performance results with run time and scalability. The scalability and run time of DynFP-Growth algorithm is faster than Apriori and FP-Growth algorithms. | ||||||
Keywords | ||||||
frequent pattern mining, association mining algorithms, performance improvements | ||||||
Identifier | http://onlineresource.ucsy.edu.mm/handle/123456789/1196 | |||||
Journal articles | ||||||
Fifth Local Conference on Parallel and Soft Computing | ||||||
Conference papers | ||||||
Books/reports/chapters | ||||||
Thesis/dissertations |