Identifying and Evaluating the Internet Opinion Leader Community Through k-clique Clustering
نویسندگان
چکیده
With the rapid development of the Internet technology, the Internet has become an important source of information for many acquiring the public sentiment. Opinion leaders play an important role in leading in the direction of the public opinion. In this paper, we drew the community components from the replies of every post in BBS according to the structure of the community in the network, and we came up with a method of extracting the opinion leader community (OLC) based on the hierarchical structure. In this way there were more overlapping appearances among members of the communities. Thus, the relationship between any two communities can be enhanced, which makes it easier to identify the OLC. Then, we analyzed the revolution of the OLC and put forward a timedividing method of dividing the whole communities into different parts based on the characteristics of the post and the time period and gave the suitable measurement parameter to get the evolution result of the communities. Finally, experiments proved the efficiency of the OLC extracting method and the properties of the OLC revolution were summarized.
منابع مشابه
Non-Parametric Detection of Network Communities; The Natural Way; A Cascaded Stackelberg Game
Real-World networks have an inherently dynamic structure and are often composed of communities that are constantly changing in membership. Identifying these communities is of great importance when analyzing structural properties of networks. Hence, recent years have witnessed intense research in of solving the challenging problem of detecting such evolving communities. The mainstream approach t...
متن کاملNetwork clustering via clique relaxations: A community based approach
In this paper, we present a general purpose network clustering algorithm based on a novel clique relaxation concept of k-community, which is defined as a connected subgraph such that endpoints of every edge have at least k common neighbors within the subgraph. A salient feature of this approach is that it does not use any prior information about the structure of the network. By defining a clust...
متن کاملGraph theoretic generalizations of clique: optimization and extensions
Graph Theoretic Generalizations of Clique: Optimization and Extensions. (August 2007) Balabhaskar Balasundaram, B.Tech., Indian Institute of Technology – Madras Chair of Advisory Committee: Dr. Sergiy Butenko This dissertation considers graph theoretic generalizations of the maximum clique problem. Models that were originally proposed in social network analysis literature, are investigated from...
متن کاملFinding Community Base on Web Graph Clustering
Search Pointers organize the main part of the application on the Internet. However, because of Information management hardware, high volume of data and word similarities in different fields the most answers to the user s’ questions aren`t correct. So the web graph clustering and cluster placement in corresponding answers helps user to achieve his or her intended results. Community (web communit...
متن کاملClustering Text Reviews for Opinion Mining
Rapid development of the Internet has lead to the purchase of products based on the reviews provided by the web surfers. It is therefore extremely important to organize the reviews according to the topic. Commonly, this can be achieved by using clustering techniques. Research on document clustering which is an un-supervised from of learning process helps in organizing documents or text reviews ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JCP
دوره 8 شماره
صفحات -
تاریخ انتشار 2013