Improved Social Network Analysis Method in SNS (SNS에서의 개선된 소셜 네트워크 분석 방법)
-
- Journal of Intelligence and Information Systems
- /
- v.18 no.4
- /
- pp.117-127
- /
- 2012
Due to the recent expansion of the Web 2.0 -based services, along with the widespread of smartphones, online social network services are being popularized among users. Online social network services are the online community services which enable users to communicate each other, share information and expand human relationships. In the social network services, each relation between users is represented by a graph consisting of nodes and links. As the users of online social network services are increasing rapidly, the SNS are actively utilized in enterprise marketing, analysis of social phenomenon and so on. Social Network Analysis (SNA) is the systematic way to analyze social relationships among the members of the social network using the network theory. In general social network theory consists of nodes and arcs, and it is often depicted in a social network diagram. In a social network diagram, nodes represent individual actors within the network and arcs represent relationships between the nodes. With SNA, we can measure relationships among the people such as degree of intimacy, intensity of connection and classification of the groups. Ever since Social Networking Services (SNS) have drawn increasing attention from millions of users, numerous researches have made to analyze their user relationships and messages. There are typical representative SNA methods: degree centrality, betweenness centrality and closeness centrality. In the degree of centrality analysis, the shortest path between nodes is not considered. However, it is used as a crucial factor in betweenness centrality, closeness centrality and other SNA methods. In previous researches in SNA, the computation time was not too expensive since the size of social network was small. Unfortunately, most SNA methods require significant time to process relevant data, and it makes difficult to apply the ever increasing SNS data in social network studies. For instance, if the number of nodes in online social network is n, the maximum number of link in social network is n(n-1)/2. It means that it is too expensive to analyze the social network, for example, if the number of nodes is 10,000 the number of links is 49,995,000. Therefore, we propose a heuristic-based method for finding the shortest path among users in the SNS user graph. Through the shortest path finding method, we will show how efficient our proposed approach may be by conducting betweenness centrality analysis and closeness centrality analysis, both of which are widely used in social network studies. Moreover, we devised an enhanced method with addition of best-first-search method and preprocessing step for the reduction of computation time and rapid search of the shortest paths in a huge size of online social network. Best-first-search method finds the shortest path heuristically, which generalizes human experiences. As large number of links is shared by only a few nodes in online social networks, most nods have relatively few connections. As a result, a node with multiple connections functions as a hub node. When searching for a particular node, looking for users with numerous links instead of searching all users indiscriminately has a better chance of finding the desired node more quickly. In this paper, we employ the degree of user node vn as heuristic evaluation function in a graph G = (N, E), where N is a set of vertices, and E is a set of links between two different nodes. As the heuristic evaluation function is used, the worst case could happen when the target node is situated in the bottom of skewed tree. In order to remove such a target node, the preprocessing step is conducted. Next, we find the shortest path between two nodes in social network efficiently and then analyze the social network. For the verification of the proposed method, we crawled 160,000 people from online and then constructed social network. Then we compared with previous methods, which are best-first-search and breath-first-search, in time for searching and analyzing. The suggested method takes 240 seconds to search nodes where breath-first-search based method takes 1,781 seconds (7.4 times faster). Moreover, for social network analysis, the suggested method is 6.8 times and 1.8 times faster than betweenness centrality analysis and closeness centrality analysis, respectively. The proposed method in this paper shows the possibility to analyze a large size of social network with the better performance in time. As a result, our method would improve the efficiency of social network analysis, making it particularly useful in studying social trends or phenomena.
In collaborative tagging systems such as Delicious.com and Flickr.com, users assign keywords or tags to their uploaded resources, such as bookmarks and pictures, for their future use or sharing purposes. The collection of resources and tags generated by a user is called a personomy, and the collection of all personomies constitutes the folksonomy. The most significant need of the folksonomy users Is to efficiently find useful resources or experts on specific topics. An excellent ranking algorithm would assign higher ranking to more useful resources or experts. What resources are considered useful In a folksonomic system? Does a standard superior to frequency or freshness exist? The resource recommended by more users with mere expertise should be worthy of attention. This ranking paradigm can be implemented through a graph-based ranking algorithm. Two well-known representatives of such a paradigm are Page Rank by Google and HITS(Hypertext Induced Topic Selection) by Kleinberg. Both Page Rank and HITS assign a higher evaluation score to pages linked to more higher-scored pages. HITS differs from PageRank in that it utilizes two kinds of scores: authority and hub scores. The ranking objects of these pages are limited to Web pages, whereas the ranking objects of a folksonomic system are somewhat heterogeneous(i.e., users, resources, and tags). Therefore, uniform application of the voting notion of PageRank and HITS based on the links to a folksonomy would be unreasonable, In a folksonomic system, each link corresponding to a property can have an opposite direction, depending on whether the property is an active or a passive voice. The current research stems from the Idea that a graph-based ranking algorithm could be applied to the folksonomic system using the concept of mutual Interactions between entitles, rather than the voting notion of PageRank or HITS. The concept of mutual interactions, proposed for ranking the Semantic Web resources, enables the calculation of importance scores of various resources unaffected by link directions. The weights of a property representing the mutual interaction between classes are assigned depending on the relative significance of the property to the resource importance of each class. This class-oriented approach is based on the fact that, in the Semantic Web, there are many heterogeneous classes; thus, applying a different appraisal standard for each class is more reasonable. This is similar to the evaluation method of humans, where different items are assigned specific weights, which are then summed up to determine the weighted average. We can check for missing properties more easily with this approach than with other predicate-oriented approaches. A user of a tagging system usually assigns more than one tags to the same resource, and there can be more than one tags with the same subjectivity and objectivity. In the case that many users assign similar tags to the same resource, grading the users differently depending on the assignment order becomes necessary. This idea comes from the studies in psychology wherein expertise involves the ability to select the most relevant information for achieving a goal. An expert should be someone who not only has a large collection of documents annotated with a particular tag, but also tends to add documents of high quality to his/her collections. Such documents are identified by the number, as well as the expertise, of users who have the same documents in their collections. In other words, there is a relationship of mutual reinforcement between the expertise of a user and the quality of a document. In addition, there is a need to rank entities related more closely to a certain entity. Considering the property of social media that ensures the popularity of a topic is temporary, recent data should have more weight than old data. We propose a comprehensive folksonomy ranking framework in which all these considerations are dealt with and that can be easily customized to each folksonomy site for ranking purposes. To examine the validity of our ranking algorithm and show the mechanism of adjusting property, time, and expertise weights, we first use a dataset designed for analyzing the effect of each ranking factor independently. We then show the ranking results of a real folksonomy site, with the ranking factors combined. Because the ground truth of a given dataset is not known when it comes to ranking, we inject simulated data whose ranking results can be predicted into the real dataset and compare the ranking results of our algorithm with that of a previous HITS-based algorithm. Our semantic ranking algorithm based on the concept of mutual interaction seems to be preferable to the HITS-based algorithm as a flexible folksonomy ranking framework. Some concrete points of difference are as follows. First, with the time concept applied to the property weights, our algorithm shows superior performance in lowering the scores of older data and raising the scores of newer data. Second, applying the time concept to the expertise weights, as well as to the property weights, our algorithm controls the conflicting influence of expertise weights and enhances overall consistency of time-valued ranking. The expertise weights of the previous study can act as an obstacle to the time-valued ranking because the number of followers increases as time goes on. Third, many new properties and classes can be included in our framework. The previous HITS-based algorithm, based on the voting notion, loses ground in the situation where the domain consists of more than two classes, or where other important properties, such as "sent through twitter" or "registered as a friend," are added to the domain. Forth, there is a big difference in the calculation time and memory use between the two kinds of algorithms. While the matrix multiplication of two matrices, has to be executed twice for the previous HITS-based algorithm, this is unnecessary with our algorithm. In our ranking framework, various folksonomy ranking policies can be expressed with the ranking factors combined and our approach can work, even if the folksonomy site is not implemented with Semantic Web languages. Above all, the time weight proposed in this paper will be applicable to various domains, including social media, where time value is considered important.
Korea-China FTA entered into force on the 20th of December 2015, and one year elapsed after its effectuation as the FTA with China, our country's largest trading partner. Therefore, this study looks at the trends of air transport trade between Korea and China, and examines the contents of concessions to the air transport services sector in Korea-China FTA, and analyzes the impact on the air transport sector by Korea-China FTA, and proposes our country's aviation policy direction in order to respond to such impact. In 2016 the trends of air transport trade between Korea and China are as follows : The export amount of air transport trade to China was 40.03 billion dollars, down by 9.3% from the last year, and occupied 32.2% of the total export amount to China. The import amount of air transport trade from China was 24.26 billion dollars, down by 9.1% from the last year, and occupied 27.7% of the total import amount from China. The contents of concessions to the air transport services sector in Korea-China FTA are as follows : China made concessions to the aircraft repair and maintenance services and the computer reservation system services with limitations on market access and national treatment in the air transport services sector of the China Schedule of Specific Commitments of Korea-China FTA Chapter 8 Annex. Korea made concessions to the computer reservation system services, selling and marketing of air transport services, and aircraft repair and maintenance without limitations on market access and national treatment in the air transport services sector of the Korea Schedule of Specific Commitments of Korea-China FTA Chapter 8 Annex. The impact on the air transport sector by Korea-China FTA are as follows : As for the impact on the air passenger market, in 2016 the arrival passengers of the international flight from China were 9.96 million, up by 20.6% from the last year, and the departure passengers to China were 9.90 million, up by 34.8% from the last year. As for the impact on the air cargo market, in 2016 the exported goods volumes of air cargo to China were 105,220.2 tons, up by 6.6% from the last year, and imported goods volumes from China were 133,750.9 tons, up by 12.3% from the last year. Among the major items of exported air cargo to China, the exported goods volumes of benefited items in the Tariff Schedule of China of Korea-China FTA were increased, and among the major items of imported air cargo from China, the imported goods volumes of benefited items in the Tariff Schedule of Korea of Korea-China FTA were increased. As for the impact on the logistics market, in 2016 the handling performance of exported air cargo to China by domestic forwarders were 119,618 tons, down by 2.1% from the last year, and the handling performance of imported air cargo from China were 79,430 tons, down by 4.4% from the last year. In 2016 the e-commerce export amount to China were 109.16 million dollars, up by 27.7% from the last year, and the e-commerce import amount from China were 89.43 million dollars, up by 72% from the last year. The author proposes the aviation policy direction of Korea according to Korea-China FTA as follows : First, the open skies between Korea and China shall be pushed ahead. In June 2006 Korea and China concluded the open skies agreement within the scope of the third freedom and fourth freedom of the air for passenger and cargo in Sandong Province and Hainan Province of China, and agreed the full open skies of flights between the two countries from the summer season in 2010. However, China protested against the interpretation of the draft of the memorandum of understanding to the air services agreement, therefore the further open skies did not take place. Through the separate aviation talks with China from Korea-China FTA, the gradual and selective open skies of air passenger market and air cargo market shall be pushed ahead. Second, the competitiveness of air transport industry and airport shall be secured. As for the strengthening methods of the competitiveness of Korea's air transport industry, the support system for the strengthening of national air carriers' competitiveness shall be prepared, and the new basis for competition of national air carriers shall be made, and the strategic network based on national interest shall be built. As for the strengthening methods of the competitiveness of Korea's airports, particularly Incheon Airport, the competitiveness of the network for aviation demand creation shall be strengthened, and the airport facilities and safety infrastructure shall be expanded, and the new added value through the airport shall be created, and the world's No.1 level of services shall be maintained. Third, the competitiveness of aviation logistics enterprises shall be strengthened. As for the strengthening methods of the competitiveness of Korea's aviation logistics enterprises, as the upbringing strategy of higher added value in response to the industry trends changes, the new logistics market shall be developed, and the logistics infrastructure shall be expanded, and the logistics professionals shall be trained. Additionally, as the expanding strategy of global logistics market, the support system for overseas investment of logistics enterprises shall be built, and according to expanding the global transport network, the international cooperation shall be strengthened, and the network infrastructure shall be secured. As for the strengthening methods of aviation logistics competitiveness of Incheon Airport, the enterprises' demand of moving in the logistics complex shall be responded, and the comparative advantage in the field of new growth cargo shall be preoccupied, and the logistics hub's capability shall be strengthened, and the competitiveness of cargo processing speed in the airport shall be advanced. Forth, in the subsequent negotiation of Korea-China FTA, the further opening of air transport services sector shall be secured. In the subsequent negotiation being initiated within two years after entry into force of Korea-China FTA, it is necessary to ask for the further opening of the concessions of computer reservation system services, and aircraft repair and maintenance services in which the concessions level of air transport services sector by China is insufficient compared to the concessions level in the existing FTA concluded by China. In conclusion, in order to respond to the impact on Korea's air passenger market, air cargo market and aviation logistics market by Korea-China FTA, the following policy tasks shall be pushed ahead : Taking into consideration of national air carriers' competitiveness and nation's benefits, the gradual and selective open skies shall be pushed ahead, and the support system to strengthen the competitiveness of air transport industry and airport shall be built, and entry into aviation logistics market by logistics enterprises shall be expanded, and the preparations to ask for the further opening of air transport services sector, low in the concessions level by China shall be made.