Summary: | 碩士 === 國立中山大學 === 電機工程學系研究所 === 96 === In this thesis, we propose a system for finding friend groups in Blogosphere. This system includes two parts: The first part can traverse the Blogosphere so as to obtain the friend network; and the second part is used to find friend groups from the friend network. Our practical performance was tested on Wretch, which is the largest Blogosphere in Taiwan. In today''s blog service environment, the establishments of friend relationships are usually unidirectional, i.e., a blogger can add any other as his friend without confirmation. Traditional methods such as clique/club or 2-clique/club are not suitable because the bidirectional link is built incompletely in the social network under such circumstances. To solve this problem, we propose the 1.5-club based on transitive extension. We further make a comparison among the results of finding groups by 1-club, 1.5-club, 2-club and k-clique, and analyze the historical data of social networks from over almost one year. The experimental results show that our proposed method is effective and promising.
|