政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/111933
English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  全文笔数/总笔数 : 96163/126772 (76%)
造访人次 : 32224654      在线人数 : 324
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻
    政大機構典藏 > 商學院 > 資訊管理學系 > 會議論文 >  Item 140.119/111933


    请使用永久网址来引用或连结此文件: http://nccur.lib.nccu.edu.tw/handle/140.119/111933


    题名: Finding maximal quasi-cliques containing a target vertex in a graph
    作者: 陳良弼
    Chou, Yuan Heng
    Wang, En Tzu
    Chen, Arbee L. P.
    贡献者: 資訊管理系
    关键词: Graphic methods;Information management;Biological networks;Complete graphs;Dense sub-graphs;Maximal clique;Maximal quasi-cliques;Pruning techniques;Quasi-cliques;Synthetic datasets;Graph theory
    日期: 2015-07
    上传时间: 2017-08-14 15:33:55 (UTC+8)
    摘要: 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.
    關聯: DATA 2015 - 4th International Conference on Data Management Technologies and Applications, Proceedings, (), 5-15
    4th International Conference on Data Management Technologies and Applications, DATA 2015; Colmar, Alsace; France; 20 July 2015 到 22 July 2015; 代碼 113501
    数据类型: conference
    显示于类别:[資訊管理學系] 會議論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    index.html0KbHTML248检视/开启


    在政大典藏中所有的数据项都受到原著作权保护.


    社群 sharing

    著作權政策宣告
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回馈