{"_buckets": {"deposit": "ec9c27cc-b166-439b-94a0-e9ea130567a7"}, "_deposit": {"id": "5071", "owners": [], "pid": {"revision_id": 0, "type": "recid", "value": "5071"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/5071", "sets": ["user-ucsy"]}, "communities": ["ucsy"], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "Searching Optimal Bus-routes based on Frequent Subgraph Mining", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "This paper proposed an approach ofsearching the optimal bus-routes based on datamining technology called Frequent SubgraphMining (FSM).FSM is an important task forexploratory data analysis on graph data. Manyapproaches handling graph data assume that thedata structure of the mining task is small enoughto fit in the main memory of a computer. However,as the real-world graph data grows, both in sizeand quantity, such an assumption does not holdany longer. To overcome this problem, theproposed system use MapReduce frameworkwhich is becoming the de-facto paradigm forcomputation on massive data. In this paper, it hasthree main phases: partition, preparation andmining. The mining phase use MapReduceparadigm. The proposed system demonstrates thesearching of optimal routes, which means theminimum bus-stops, in Yangon region. It can helpthe travelers in finding the bus-stops and routesduring their visit in Yangon."}]}, "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": "65_PDFsam_PSC_final proof.pdf", "filesize": [{"value": "137 Kb"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 137000.0, "url": {"url": "https://meral.edu.mm/record/5071/files/65_PDFsam_PSC_final proof.pdf"}, "version_id": "348cf6f4-ca24-4270-9ab6-8bd36969068c"}]}, "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": "Lwin, Khin Moe"}, {"subitem_authors_fullname": "Soe, Khin Mar"}]}]}, "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/962"}, "item_title": "Searching Optimal Bus-routes based on Frequent Subgraph Mining", "item_type_id": "21", "owner": "1", "path": ["1597824273898"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000005071", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2019-07-18"}, "publish_date": "2019-07-18", "publish_status": "0", "recid": "5071", "relation": {}, "relation_version_is_last": true, "title": ["Searching Optimal Bus-routes based on Frequent Subgraph Mining"], "weko_shared_id": -1}