政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/74687
English  |  正體中文  |  简体中文  |  Post-Print筆數 : 20 |  Items with full text/Total items : 90029/119959 (75%)
Visitors : 24035954      Online Users : 152
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/74687


    Title: A better strategy of discovering link-pattern based communities by classical clustering methods
    Authors: Lin, C.-Y.;Koh, J.-L.;Chen, Arbee L. P.
    陳良弼
    Contributors: 資科系
    Keywords: Clustering methods;Clustering results;Data clustering;Distance functions;Interaction behavior;Link patterns;Link-pattern based community;Memory utilization;Objective functions;Optimal solutions;Partitioning methods;Social network;Social Networks;Cluster analysis;Data mining;Problem solving;Clustering algorithms
    Date: 2010
    Issue Date: 2015-04-17 17:20:20 (UTC+8)
    Abstract: The definition of a community in social networks varies with applications. To generalize different types of communities, the concept of linkpattern based community was proposed in a previous study to group nodes into communities, where the nodes in a community have similar intra-community and inter-community interaction behaviors. In this paper, by defining centroid of a community, a distance function is provided to measure the similarity between the link pattern of a node and the centroid of a community. The problem of discovering link-pattern based communities is transformed into a data clustering problem on nodes for minimizing a given objective function. By extending the partitioning methods of cluster analysis, two algorithms named G-LPC and KM-LPC are proposed to solve the problem. The experiment results show that KM-LPC outperforms the previous work on the efficiency, the memory utilization, and the clustering result. Besides, G-LPC achieves the best result approaching the optimal solution. © 2010 Springer-Verlag Berlin Heidelberg.
    Relation: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Data Type: conference
    DOI link: http://dx.doi.org/10.1007/978-3-642-13657-3_9
    DOI: 10.1007/978-3-642-13657-3_9
    Appears in Collections:[Department of Computer Science ] Proceedings

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML626View/Open


    All items in 政大典藏 are protected by copyright, with all rights reserved.


    社群 sharing

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