MERAL Myanmar Education Research and Learning Portal
Item
{"_buckets": {"deposit": "2f82ac0d-d08c-466d-badd-a13bce18f428"}, "_deposit": {"id": "4814", "owners": [], "pid": {"revision_id": 0, "type": "recid", "value": "4814"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/4814", "sets": ["user-ucsy"]}, "communities": ["ucsy"], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "A Graph-theoretic Framework for Multi-layered k-community Clique Relaxation", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "In network-based data mining, clique percolation brings an attractive feature for finding communities in a graph as well as the overlapping areas of these communities. Despite complete clique formalization, some of the properties of clique structure have been relaxed to investigate more effective and efficient manners to identify the community structure in large and sparse network. In this paper, it is proposed the idea that how to take advantages of the clique relaxation concept of k-community, introduced by Verma and Butenko (2013), with some modifications in clustering cohesive groups. In addition, we intend to promote the quality of the cluster by means of new multi-layered consideration."}]}, "item_1583103108160": {"attribute_name": "Keywords", "attribute_value_mlt": [{"interim": "finding community"}, {"interim": "clique percolation"}, {"interim": "clique relaxation"}, {"interim": "k-community"}]}, "item_1583103120197": {"attribute_name": "Files", "attribute_type": "file", "attribute_value": []}, "item_1583103131163": {"attribute_name": "Journal articles", "attribute_value_mlt": [{"subitem_issue": "", "subitem_journal_title": "Eleventh International Conference On Computer Applications (ICCA 2013)", "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": "2013-02-26"}, "item_1583159847033": {"attribute_name": "Identifier", "attribute_value": "http://onlineresource.ucsy.edu.mm/handle/123456789/710"}, "item_title": "A Graph-theoretic Framework for Multi-layered k-community Clique Relaxation", "item_type_id": "21", "owner": "1", "path": ["1597824273898"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000004814", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2019-07-11"}, "publish_date": "2019-07-11", "publish_status": "0", "recid": "4814", "relation": {}, "relation_version_is_last": true, "title": ["A Graph-theoretic Framework for Multi-layered k-community Clique Relaxation"], "weko_shared_id": -1}
A Graph-theoretic Framework for Multi-layered k-community Clique Relaxation
http://hdl.handle.net/20.500.12678/0000004814
http://hdl.handle.net/20.500.12678/0000004814eef15fed-898d-4001-ab69-6c6d5bb7d9e5
2f82ac0d-d08c-466d-badd-a13bce18f428
Publication type | ||||||
---|---|---|---|---|---|---|
Article | ||||||
Upload type | ||||||
Publication | ||||||
Title | ||||||
Title | A Graph-theoretic Framework for Multi-layered k-community Clique Relaxation | |||||
Language | en | |||||
Publication date | 2013-02-26 | |||||
Authors | ||||||
Khaing, Soe Soe | ||||||
Yin, Zin Mar | ||||||
Description | ||||||
In network-based data mining, clique percolation brings an attractive feature for finding communities in a graph as well as the overlapping areas of these communities. Despite complete clique formalization, some of the properties of clique structure have been relaxed to investigate more effective and efficient manners to identify the community structure in large and sparse network. In this paper, it is proposed the idea that how to take advantages of the clique relaxation concept of k-community, introduced by Verma and Butenko (2013), with some modifications in clustering cohesive groups. In addition, we intend to promote the quality of the cluster by means of new multi-layered consideration. | ||||||
Keywords | ||||||
finding community, clique percolation, clique relaxation, k-community | ||||||
Identifier | http://onlineresource.ucsy.edu.mm/handle/123456789/710 | |||||
Journal articles | ||||||
Eleventh International Conference On Computer Applications (ICCA 2013) | ||||||
Conference papers | ||||||
Books/reports/chapters | ||||||
Thesis/dissertations |