MERAL Myanmar Education Research and Learning Portal
Item
{"_buckets": {"deposit": "aae0f443-b580-4222-9e87-b78fd37edc4a"}, "_deposit": {"id": "4193", "owners": [], "pid": {"revision_id": 0, "type": "recid", "value": "4193"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/4193", "sets": ["1597824273898", "user-ucsy"]}, "communities": ["ucsy"], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "Implementation of Sales Analysis System for Fancy Shop based on Association Rule Mining", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "One of the important problems in data mining is discovering association rules from databases of transactions where each transaction consists of a set of items. The most time consuming operation in this discovery process is the computation of the frequency of the occurrences of interesting subset of items (called candidates) in the database of transactions. The proposed system presents the FP-Growth algorithm to avoid or reduce candidate generation. FP-growth method is efficient and scalable for mining both long and short frequent patterns without candidate generation. It not only heirs all the advantages in the FP-growth method, but also avoid its bottleneck in database size dependence when constructing the frequent pattern tree (FP-tree).It greatly reduces the need to traverse the database. This process analyzes customer buying habits by finding associations between the different items that customers place in their shopping baskets. The proposed system tends to analysis on the Sales System of Fancy Shop using FP-growth algorithm under association rules mining. The system evaluates more suitable products to sell and how to display them according to their purchasing products."}]}, "item_1583103108160": {"attribute_name": "Keywords", "attribute_value_mlt": [{"interim": "Data Mining"}, {"interim": "Association Rule"}, {"interim": "Apriori Algorithm"}, {"interim": "FP-growth Algorithm"}, {"interim": "Improved Association Rule"}]}, "item_1583103120197": {"attribute_name": "Files", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_access", "date": [{"dateType": "Available", "dateValue": "2019-08-06"}], "displaytype": "preview", "download_preview_message": "", "file_order": 0, "filename": "55345.pdf", "filesize": [{"value": "475 Kb"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 475000.0, "url": {"url": "https://meral.edu.mm/record/4193/files/55345.pdf"}, "version_id": "f1473788-5b1f-42e0-a5a1-fcbc2754648f"}]}, "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": "Oo, Khine Zin"}, {"subitem_authors_fullname": "Khaing, Aye Aye"}]}]}, "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/1888"}, "item_title": "Implementation of Sales Analysis System for Fancy Shop based on Association Rule Mining", "item_type_id": "21", "owner": "1", "path": ["1597824273898"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000004193", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2019-08-06"}, "publish_date": "2019-08-06", "publish_status": "0", "recid": "4193", "relation": {}, "relation_version_is_last": true, "title": ["Implementation of Sales Analysis System for Fancy Shop based on Association Rule Mining"], "weko_shared_id": -1}
Implementation of Sales Analysis System for Fancy Shop based on Association Rule Mining
http://hdl.handle.net/20.500.12678/0000004193
http://hdl.handle.net/20.500.12678/0000004193799b0e48-5368-453c-a6b2-0620720f79c7
aae0f443-b580-4222-9e87-b78fd37edc4a
Name / File | License | Actions |
---|---|---|
55345.pdf (475 Kb)
|
|
Publication type | ||||||
---|---|---|---|---|---|---|
Article | ||||||
Upload type | ||||||
Publication | ||||||
Title | ||||||
Title | Implementation of Sales Analysis System for Fancy Shop based on Association Rule Mining | |||||
Language | en | |||||
Publication date | 2009-12-30 | |||||
Authors | ||||||
Oo, Khine Zin | ||||||
Khaing, Aye Aye | ||||||
Description | ||||||
One of the important problems in data mining is discovering association rules from databases of transactions where each transaction consists of a set of items. The most time consuming operation in this discovery process is the computation of the frequency of the occurrences of interesting subset of items (called candidates) in the database of transactions. The proposed system presents the FP-Growth algorithm to avoid or reduce candidate generation. FP-growth method is efficient and scalable for mining both long and short frequent patterns without candidate generation. It not only heirs all the advantages in the FP-growth method, but also avoid its bottleneck in database size dependence when constructing the frequent pattern tree (FP-tree).It greatly reduces the need to traverse the database. This process analyzes customer buying habits by finding associations between the different items that customers place in their shopping baskets. The proposed system tends to analysis on the Sales System of Fancy Shop using FP-growth algorithm under association rules mining. The system evaluates more suitable products to sell and how to display them according to their purchasing products. | ||||||
Keywords | ||||||
Data Mining, Association Rule, Apriori Algorithm, FP-growth Algorithm, Improved Association Rule | ||||||
Identifier | http://onlineresource.ucsy.edu.mm/handle/123456789/1888 | |||||
Journal articles | ||||||
Fourth Local Conference on Parallel and Soft Computing | ||||||
Conference papers | ||||||
Books/reports/chapters | ||||||
Thesis/dissertations |