• Journal of Information Processing Systems
• /
• v.16 no.2
• /
• pp.494-507
• /
• 2020

This study proposed the movie recommendation system based on the user's personal information and movies rated using the method of k-clique and normalized discounted cumulative gain. The main idea is to solve the problem of cold-start and to increase the accuracy in the recommendation system further instead of using the basic technique that is commonly based on the behavior information of the users or based on the best-selling product. The personal information of the users and their relationship in the social network will divide into the various community with the help of the k-clique method. Later, the ranking measure method that is widely used in the searching engine will be used to check the top ranking movie and then recommend it to the new users. We strongly believe that this idea will prove to be significant and meaningful in predicting demand for new users. Ultimately, the result of the experiment in this paper serves as a guarantee that the proposed method offers substantial finding in raw data sets by increasing accuracy to 87.28% compared to the three most successful methods used in this experiment, and that it can solve the problem of cold-start.

• Journal of Information Technology Services
• /
• v.14 no.3
• /
• pp.49-65
• /
• 2015

As South Korean large business groups, also known as Chaebol, have broadened their influence in the domestic economy, it is important to analyze the influence of internal transactions among Chaebol affiliates on their performance. In this paper, relationship between internal transactions and efficiency of Chaebol affiliates has been analyzed. Top five Chaebol groups in South Korea are selected; they include Samsung, Hyundai Motors, LG, SK, and Lotte group. Based on internal transactions among affiliates, social networks are constructed for each Chaebol group to analyze centrality, network structures and cliques. Data Envelopment Analysis (DEA) was conducted to examine the efficiency of the Chaebol affiliates. Then, correlations between the degree centrality and the efficiency of Chaebol affiliates were analyzed, and the network structures of Chaebol groups are presented. The result shows that positive correlations between degree centrality and efficiency are observed among four Chaebol Groups. This paper shows that the Social Network Analysis (SNA) techniques can be used in the empirical research for the analysis of internal transactions of Chaebol groups.

• The Journal of the Korea Contents Association
• /
• v.10 no.6
• /
• pp.415-428
• /
• 2010

Converging technologies have become a major issue in science policy. This paper describes the current state of scientific collaboration for convergent technologies among researchers in South Korea, by conducting Social Network Analysis (SNA) with the data set of 1,095 researchers who have involved in the development of the convergent technologies. It is found that the researchers in convergent technology are more productive than the researchers in other technology domains. However, the researchers in convergent technologies have small number of collaborators, compared with their productivity. Only a few researchers have a role of the hub in the collaboration networks, meaning that the structure network is closer to than the core than the peripheral. The scientific collaboration network of the convergent technology researchers shows that the members of the network are close to each other, but there is small number of cliques.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.5 s.311
• /
• pp.37-44
• /
• 2006

In this paper, a new version of the ICM method(MICM, modified ICM) in which the contextual information is modelled by Markov random fields (MRF) is introduced. To extract the feature, a new local MRF model with a fitting block neighbourhood is proposed. This model selects contextual information not only from the relative intensity levels but also from the geometrically directional position of neighbouring cliques. Feature extraction depends on each block's contribution to the local variance. They discriminates it into several regions, for example context and background. Boundaries between these regions are also distinctive. The proposed algerian performs segmentation using directional block fitting procedure which confines merging to spatially adjacent elements and generates a partition such that pixels in unified cluster have a homogeneous intensity level. From experiment with ink rubbed copy images(Takbon, 拓本), this method is determined to be quite effective for feature identification. In particular, the new algorithm preserves the details of the images well without over- and under-smoothing problem occurring in general iterated conditional modes (ICM). And also, it may be noted that this method is applicable to the handwriting recognition.

• Journal of the Korean Data and Information Science Society
• /
• v.27 no.5
• /
• pp.1273-1284
• /
• 2016

In this paper, we analyzed the patents on machine learning using keyword network analysis and clique analysis. To construct a keyword network, important keywords were extracted based on the TF-IDF weight and their association, and network structure analysis and clique analysis was performed. Density and clustering coefficient of the patent keyword network are low, which shows that patent keywords on machine learning are weakly connected with each other. It is because the important patents on machine learning are mainly registered in the application system of machine learning rather thant machine learning techniques. Also, our results of clique analysis showed that the keywords found by cliques in 2005 patents are the subjects such as newsmaker verification, product forecasting, virus detection, biomarkers, and workflow management, while those in 2015 patents contain the subjects such as digital imaging, payment card, calling system, mammogram system, price prediction, etc. The clique analysis can be used not only for identifying specialized subjects, but also for search keywords in patent search systems.