• The Journal of the Convergence on Culture Technology
• /
• v.6 no.4
• /
• pp.575-582
• /
• 2020

We proposes a method to estimate political preference of users who write comments on internet news. We collected and analyzed a massive amount of new comment data from internet news to extract features that effectively characterizes political preference of users. We expect that it helps user to obtain unbiased information from internet news and online discussion by providing estimated political stance of news comment writer. Through comprehensive tests we prove the effectiveness of two proposed methods, lexicon-based algorithm and similarity-based algorithm.

• Journal of Information Processing Systems
• /
• v.15 no.2
• /
• pp.359-373
• /
• 2019

For clustering large-scale data, which cannot be loaded into memory entirely, incremental clustering algorithms are very popular. Usually, these algorithms only concern the within-cluster compactness and ignore the between-cluster separation. In this paper, we propose two incremental fuzzy compactness and separation (FCS) clustering algorithms, Single-Pass FCS (SPFCS) and Online FCS (OFCS), based on a fuzzy scatter matrix. Firstly, we introduce two incremental clustering methods called single-pass and online fuzzy C-means algorithms. Then, we combine these two methods separately with the weighted fuzzy C-means algorithm, so that they can be applied to the FCS algorithm. Afterwards, we optimize the within-cluster matrix and betweencluster matrix simultaneously to obtain the minimum within-cluster distance and maximum between-cluster distance. Finally, large-scale datasets can be well clustered within limited memory. We implemented experiments on some artificial datasets and real datasets separately. And experimental results show that, compared with SPFCM and OFCM, our SPFCS and OFCS are more robust to the value of fuzzy index m and noise.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.4
• /
• pp.1263-1274
• /
• 2021

In online competitive social networks, each user can be influenced by different competing influencers and consequently chooses different products. But their interest may change over time and may have swings between different products. The existing influence spreading models seldom take into account the time-related shifts. This paper proposes a minimum cost influence maximization algorithm based on the competitive transition probability. In the model, we set a one-dimensional vector for each node to record the probability that the node chooses each different competing influencer. In the process of propagation, the influence maximization on Competitive Linear Threshold (IMCLT) spreading model is proposed. This model does not determine by which competing influencer the node is activated, but sets different weights for all competing influencers. In the process of spreading, we select the seed nodes according to the cost function of each node, and evaluate the final influence based on the competitive transition probability. Experiments on different datasets show that the proposed minimum cost competitive influence maximization algorithm based on IMCLT spreading model has excellent performance compared with other methods, and the computational performance of the method is also reasonable.

• The Journal of Asian Finance, Economics and Business
• /
• v.8 no.8
• /
• pp.443-451
• /
• 2021

The classification standards for hotels in Vietnam are different from many other hotel classification standards in the world. This study aims to analyze customer reviews on the TripAdvisor website to develop a new algorithm for hotel rating that is independent of Vietnam's hotel classification standards. This method can be applied to individual hotels, or hotels of a region or the whole country, while online booking sites only rate individual hotels. Data was crawled from TripAdvisor with 22,287 reviews of 5 cities in Vietnam. This study used a statistical model to analyze the review dataset and build an algorithm to rate hotels according to aspects or hotel overall. The results have less rating deviation when compared to the TripAdvisor system. This study also supports hotel managers to regularly update the status of their hotels using data from customer reviews, from which, managers can strategize long-term solutions to improve the quality of the hotel in all aspects and attract more travelers to Vietnam. Moreover, this method can be developed into an automatic system to rate hotels and update the status of service quality more quickly, thus, saving time and costs.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.399-400
• /
• 2009

As a part of the era of human centric applications people started to care about their well being utilizing any possible mean. This paper proposes a framework for real time on-body sensor health-care system, addresses the current issues in such systems, and utilizes an enhanced online divisive agglomerative clustering algorithm (EODAC); an algorithm that builds a top-down tree-like structure of clusters that evolves with streaming data to rationally cluster on-body sensor data and give accurate diagnoses remotely, guaranteeing high performance, and scalability. Furthermore it does not depend on the number of data points.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.1280-1283
• /
• 2008

The network performance of MOGs(Multiplayer Online Games) can be measured by the amount of network loads and the response times on user inputs. This paper introduces a frame locking algorithm and a game turn algorithm that have been used for game synchronization in the area of RTS(Real-time Strategy Simulation) Games, a kind of MOG; the results of performance evaluation of these two algorithms are also given. In addition, a server architecture for MOG servers in which replacing synchronization algorithms can be done easily for pursuing efficient performance evaluation, is also introduced.

• The Journal of the Korea Contents Association
• /
• v.20 no.4
• /
• pp.1-13
• /
• 2020

In order to understand the recommendation algorithm applied to the online video platform, this study examines the relationship between the content characteristics of K-pop music videos and related videos recommended for playback on YouTube, and analyses which videos are recommended as related videos through network analysis. As a result, the more liked videos, the higher recommendation ranking and most of the videos belonging to the same channel or produced by the same agency were recommended as related videos. As a result of the network analysis of the related video, the network of K-pop music video is strongly formed, and the BTS music video is highly centralized in the network analysis of the related video. These results suggest that the network between K-pops is strong, so when you enter K-pop as a search query and watch videos, you can enjoy K-pop continuously. But when watching other genres of video, K-pop may not be recommended as a related video.

• Journal of the Korea Convergence Society
• /
• v.9 no.7
• /
• pp.25-31
• /
• 2018

Online news has replaced the traditional newspaper and has brought about a profound transformation in the way we access and share information. News websites have had the ability for users to post comments for quite some time, and some have also begun to crowdsource reactions to news articles. The field of sentiment analysis seeks to computationally model the emotions and reactions experienced when presented with text. In this work, we analyze more than 100,000 news articles over ten categories with five user-generated emotional annotations to determine whether or not these reactions have a mathematical correlation to the news body text and propose a simple sentiment analysis algorithm that requires minimal preprocessing and no machine learning. We show that it is effective even for a morphologically complex language like Korean.

• Journal of Institute of Control, Robotics and Systems
• /
• v.22 no.3
• /
• pp.192-198
• /
• 2016

Motion planning problem is still one of the important issues in robotic applications. In many real-time motion planning problems, it is advisable to find a feasible solution quickly and improve the found solution toward the optimal one before the previously-arranged motion plan ends. For such reasons, sampling-based approaches are becoming popular for real-time application. Especially the use of a rapidly exploring random $tree^*$ ($RRT^*$) algorithm is attractive in real-time application, because it is possible to approach an optimal solution by iterating itself. This paper presents a modified version of informed $RRT^*$ which is an extended version of $RRT^*$ to increase the rate of convergence to optimal solution by improving the sampling method of $RRT^*$. In online motion planning, the robot plans a path while simultaneously moving along the planned path. Therefore, the part of the path near the robot is less likely to be sampled extensively. For a better solution in online motion planning, we modified the sampling method of informed $RRT^*$ by combining with the sampling method to improve the path nearby robot. With comparison among basic $RRT^*$, informed $RRT^*$ and the proposed $RRT^*$ in online motion planning, the proposed $RRT^*$ showed the best result by representing the closest solution to optimum.

• Information Systems Review
• /
• v.25 no.4
• /
• pp.67-87
• /
• 2023

Many online shopping sites now offer personalized recommendation systems to improve consumers' shopping experiences by lowering costs (time, cost, etc.), catering to consumers' tastes, and stimulating consumers' potential shopping needs. So far, domestic and foreign research on the personalized recommendation system has mainly focused on the field of computer science, which is advantageous for obtaining accurate personalized recommendation results for users but difficult to continuously track the users' psychological states or behavioral intentions. This study attempted to investigate the effect of the characteristics of the personalized recommendation system in the online shopping environment on consumer perception and purchase intention for consumers using the Stimulus-Organism-Response (S-O-R) model. The analysis results adopted all hypotheses on the effect of the quality of the personalized recommendation system and information quality on trust and perceived value. Through the empirical results of this study, the factors influencing consumers' use of personalized recommendation system can be identified. In order to increase more purchase, online shopping companies need to understand consumers' tastes and improve the quality of the personalized system by improving the recommendation algorithm thus to provide more information about products.