• Journal of Technology Innovation
• /
• v.30 no.1
• /
• pp.57-104
• /
• 2022

The government has supported the innovation of private firms by intervening the market for various purposes, such as preventing market failure, alleviating information asymmetry, and allocating resources efficiently. Although the government's R&D budget increased rapidly in the 2000s, it is not clear whether the government intervention has made desirable impact on the market. To address this, the current study attempts to explore this issue by doing a systematic literature review on foreign and domestic papers in an integrated way. In total, 168 studies are analyzed using contents analysis approach and various lens, such as policy additionality, policy tools, firm size, unit of analysis, data and method, are adopted for analysis. Overlapping policy target, time lag between government intervention and policy effects, non-linearity of financial supports, interference between different polices, and out-dated R&D tax incentive system are reported as factors hampering the effect of the government intervention. Many policy prescriptions, such as program evaluation indices reflecting behavioral additionality, an introduction of policy mix and evidence-based policy using machine learning, are suggested to improve these hurdles.

• Asia-Pacific Journal of Business Venturing and Entrepreneurship
• /
• v.18 no.1
• /
• pp.67-83
• /
• 2023

The social venture start-up phenomenon is found from the perspectives of social enterprise and for-profit enterprise. This study aims to fundamentally explore the start-up phenomenon of social ventures from these two perspectives. Considering the lack of prior research that researched both social and commercial perspectives at the same time, this paper analyzed using grounded theory approach of Strauss & Corbin(1998), an inductive research method that analyzes based on prior research and interview data. In order to collect data for this study, eight corporate representatives currently operating social ventures were interviewed and data and phenomena were analyzed. This progressed to a theoretical saturation where no additional information was derived. The analysis results of this study using the grounded theory approach are as follows. As a result of open coding and axial coding, 147 concepts and 70 subcategories were derived, and 18 categories were derived through the final abstraction process. In the selective coding, 'expansion of social venture entry in the social domain' and 'expansion of social function of for-profit companies' were selected as key categories, and a story line was formed around this. In this study, we saw that it is necessary to conduct academic research and analysis on the competitive factors required for companies that pursue the values of two conflicting relationships, such as social ventures, to survive with competitiveness. In practice, concepts such as collaboration with for-profit companies, value combination, entrepreneurship competency and performance improvement, social value execution competency reinforcement, communication strategy, for-profit enterprise value investment, and entrepreneur management competency were derived. This study explains the social venture phenomenon for social enterprises, commercial enterprises, and entrepreneurs who want to enter the social venture field. It is expected to provide the implications necessary for successful social venture startups.

• 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.