{"created":"2020-09-01T15:21:27.225071+00:00","id":4789,"links":{},"metadata":{"_buckets":{"deposit":"dc7c5583-6ec1-49c0-a889-9e757db4d10c"},"_deposit":{"id":"4789","owners":[],"pid":{"revision_id":0,"type":"recid","value":"4789"},"status":"published"},"_oai":{"id":"oai:meral.edu.mm:recid/4789","sets":["1582963302567:1597824273898"]},"communities":["ucsy"],"item_1583103067471":{"attribute_name":"Title","attribute_value_mlt":[{"subitem_1551255647225":"Extracting Community Cores in Heterogeneous Citation Network","subitem_1551255648112":"en"}]},"item_1583103085720":{"attribute_name":"Description","attribute_value_mlt":[{"interim":"The identification of closely connected cores in acomplex network has become an important feature inthe area of community mining in recent years.According to the network topology, it is true that alarge and complex graph have a set of denselyconnected sub-graphs as the cores. Extraction thesecores can reveal that some unexpected connectionpatterns between nodes in this type of network. In thispaper, a simple and efficient intersection-basedalgorithm is proposed for finding community cores inmulti-relational citation network by using the strengthof modularity-based Louvain method. The proposedsystem is applied on a part of CiteseerX digital library[5] as the real-world data set of heterogeneouscitation graph. Graph nodes represent individualpapers of CiteseerX data set which are linked by threetypes of above relationships. The experimental resultsshow that the proposed algorithm is highly effective incore extraction with comparable time complexity."}]},"item_1583103108160":{"attribute_name":"Keywords","attribute_value_mlt":[{"interim":"community mining"},{"interim":"community core"},{"interim":"citation network"},{"interim":"CiteseerX data set"}]},"item_1583103120197":{"attribute_name":"Files","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_access","date":[{"dateType":"Available","dateValue":"2019-07-02"}],"displaytype":"preview","filename":"12012.pdf","filesize":[{"value":"1843 Kb"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"url":"https://meral.edu.mm/record/4789/files/12012.pdf"},"version_id":"c5d0a36d-bf57-491e-b36e-30b23edea3a9"}]},"item_1583103131163":{"attribute_name":"Journal articles","attribute_value_mlt":[{"subitem_issue":"","subitem_journal_title":"Twelfth International Conference On Computer Applications (ICCA 2014)","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":"Khaing, Soe Soe"},{"subitem_authors_fullname":"Yin, Zin 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":"2014-02-17"},"item_1583159847033":{"attribute_name":"Identifier","attribute_value":"http://onlineresource.ucsy.edu.mm/handle/123456789/68"},"item_title":"Extracting Community Cores in Heterogeneous Citation Network","item_type_id":"21","owner":"1","path":["1597824273898"],"publish_date":"2019-07-02","publish_status":"0","recid":"4789","relation_version_is_last":true,"title":["Extracting Community Cores in Heterogeneous Citation Network"],"weko_creator_id":"1","weko_shared_id":-1},"updated":"2022-03-24T23:13:07.025237+00:00"}