Log in
Language:

MERAL Myanmar Education Research and Learning Portal

  • MERAL
  • Universities
  • Ranking
AND
To


Index Link

Index Tree

WEKO

One fine body…

Item

{"_buckets": {"deposit": "e0a9333f-2cc5-4177-8913-5c93f9fb24f8"}, "_deposit": {"id": "5012", "owners": [], "pid": {"revision_id": 0, "type": "recid", "value": "5012"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/5012"}, "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "Implementing Association Rules Generator using CHARM", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "In traditional association rule mining thatbased on Apriori-like algorithm, all frequent itemsetsare computed and strong association rules are thengenerated from the set of all frequent itemsets as a nextstep. By contrast, in closed association rule mining,instead of mining all frequent itemsets in the first step,only the set of all closed frequent itemsets is minedwhere the size of the set of all closed frequent itemsetsis much smaller than that of all frequent itemsets.Instead of generating rules from the set of all frequentitemsets, rules are generated from the set of all closedfrequent itemsets , where the size of rules generatedfrom the set of closed frequent itemsets is much smallerthan that generated from the set of all closed frequentitemsets. This paper describes the concept of closedassociation rule mining, how CHARM algorithm worksto find out all closed frequent itemsets, and theimplementation of rules generating system or rulesgenerator that mainly uses closed association rulemining techniques by using CHARM Algorithm."}]}, "item_1583103108160": {"attribute_name": "Keywords", "attribute_value_mlt": [{"interim": "itemsets"}, {"interim": "transaction sets"}, {"interim": "support"}, {"interim": "confidence"}, {"interim": "closed frequent itemsets"}, {"interim": "closure of itemsets"}, {"interim": "closure of  transaction sets"}]}, "item_1583103120197": {"attribute_name": "Files", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_access", "date": [{"dateType": "Available", "dateValue": "2019-07-15"}], "displaytype": "preview", "download_preview_message": "", "filename": "psc2010paper (162).pdf", "filesize": [{"value": "110 Kb"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 110000, "url": {"url": "https://meral.edu.mm/record/5012/files/psc2010paper (162).pdf"}, "version_id": "9fe0cb3c-0b27-4762-875d-6d7b8464959c"}]}, "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": "Aung, Zay"}, {"subitem_authors_fullname": "Naing, Thinn"}]}]}, "item_1583108359239": {"attribute_name": "Upload type", "attribute_name_i18n": "Upload type", "attribute_value": "Publication"}, "item_1583108428133": {"attribute_name": "Publication type", "attribute_name_i18n": "Publication type", "attribute_value": "Article"}, "item_1583159729339": {"attribute_name": "Publication date", "attribute_name_i18n": "Publication date", "attribute_value": "2010-12-16"}, "item_1583159847033": {"attribute_name": "Identifier", "attribute_value": "http://onlineresource.ucsy.edu.mm/handle/123456789/908"}, "item_title": "Implementing Association Rules Generator using CHARM", "item_type_id": "21", "owner": "1", "path": ["1582963302567/1597824273898"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000005012", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2019-07-15"}, "publish_date": "2019-07-15", "publish_status": "0", "recid": "5012", "relation": {}, "relation_version_is_last": true, "title": ["Implementing Association Rules Generator using CHARM"], "weko_shared_id": -1}
  1. University of Computer Studies, Yangon
  2. Conferences

Implementing Association Rules Generator using CHARM

http://hdl.handle.net/20.500.12678/0000005012
7241b07b-af39-4ed2-a72b-54c262fe02d9
e0a9333f-2cc5-4177-8913-5c93f9fb24f8
Preview
Name / File License Actions
psc2010paper psc2010paper (162).pdf (110 Kb)
Publication type Article
Upload type Publication
Title
Implementing Association Rules Generator using CHARM
en
Publication date 2010-12-16
Authors
Aung, Zay
Naing, Thinn
Description
In traditional association rule mining thatbased on Apriori-like algorithm, all frequent itemsetsare computed and strong association rules are thengenerated from the set of all frequent itemsets as a nextstep. By contrast, in closed association rule mining,instead of mining all frequent itemsets in the first step,only the set of all closed frequent itemsets is minedwhere the size of the set of all closed frequent itemsetsis much smaller than that of all frequent itemsets.Instead of generating rules from the set of all frequentitemsets, rules are generated from the set of all closedfrequent itemsets , where the size of rules generatedfrom the set of closed frequent itemsets is much smallerthan that generated from the set of all closed frequentitemsets. This paper describes the concept of closedassociation rule mining, how CHARM algorithm worksto find out all closed frequent itemsets, and theimplementation of rules generating system or rulesgenerator that mainly uses closed association rulemining techniques by using CHARM Algorithm.
Keywords
itemsets
Keywords
transaction sets
Keywords
support
Keywords
confidence
Keywords
closed frequent itemsets
Keywords
closure of itemsets
Keywords
closure of transaction sets
Journal articles
Fifth Local Conference on Parallel and Soft Computing
Conference papers
Books/reports/chapters
Thesis/dissertations
Back
0
0
views
downloads
See details
Views Downloads

Versions

Ver.1 2020-09-01 15:38:05.710726
Show All versions

Share

Mendeley CiteULike Twitter Facebook Print Addthis

Export

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

Confirm


Back to MERAL


Back to MERAL