| dc.contributor | 資訊管理系 | zh_Tw |
| dc.creator (作者) | 陳良弼 | zh_TW |
| dc.creator (作者) | Chou, Yuan Heng | en_US |
| dc.creator (作者) | Wang, En Tzu | en_US |
| dc.creator (作者) | Chen, Arbee L. P. | en_US |
| dc.date (日期) | 2015-07 | en_US |
| dc.date.accessioned | 14-Aug-2017 15:33:55 (UTC+8) | - |
| dc.date.available | 14-Aug-2017 15:33:55 (UTC+8) | - |
| dc.date.issued (上傳時間) | 14-Aug-2017 15:33:55 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/111933 | - |
| dc.description.abstract (摘要) | Many real-world phenomena such as social networks and biological networks can be modeled as graphs. Discovering dense sub-graphs from these graphs may be able to find interesting facts about the phenomena. Quasi-cliques are a type of dense graphs, which is close to the complete graphs. In this paper, we want to find all maximal quasi-cliques containing a target vertex in the graph for some applications. A quasi-clique is defined as a maximal quasi-clique if it is not contained by any other quasi-cliques. We propose an algorithm to solve this problem and use several pruning techniques to improve the performance. Moreover, we propose another algorithm to solve a special case of this problem, i.e. finding the maximal cliques. The experiment results reveal that our method outperforms the previous work both in real and synthetic datasets in most cases. | en_US |
| dc.format.extent | 121 bytes | - |
| dc.format.mimetype | text/html | - |
| dc.relation (關聯) | DATA 2015 - 4th International Conference on Data Management Technologies and Applications, Proceedings, (), 5-15 | en_US |
| dc.relation (關聯) | 4th International Conference on Data Management Technologies and Applications, DATA 2015; Colmar, Alsace; France; 20 July 2015 到 22 July 2015; 代碼 113501 | zh_TW |
| dc.subject (關鍵詞) | Graphic methods; Information management; Biological networks; Complete graphs; Dense sub-graphs; Maximal clique; Maximal quasi-cliques; Pruning techniques; Quasi-cliques; Synthetic datasets; Graph theory | en_US |
| dc.title (題名) | Finding maximal quasi-cliques containing a target vertex in a graph | en_US |
| dc.type (資料類型) | conference | |
