• The Journal of the Korea Contents Association
• /
• v.13 no.11
• /
• pp.48-58
• /
• 2013

The stock market is constantly changing and sometimes a slump or a sudden rising in stocks happens without any special reason. So the stock market is recognized as a complex system and it is hard to predict the change on stock prices. In this paper we consider the stock market to a network consisting of stocks. We analyzed the dynamics of the Korean stock market network and evaluated the changing of the correlation between shares consisting of the time series data of 137 companies belong to KOSPI200. Our analysis shows that the stock prices tend to plummet when the correlation between stocks is very high. We propose a method for recommending the stock portfolio based on the analysis of the stock market network. To show the effectiveness of the recommended portfolio, we conducted the simulated stock investment and compared the recommended portfolio with the efficient portfolio proposed Markowitz. According to the experiment results, the rate of return of the portfolio is about 10.6% which is about 3.7% and 5.6% higher than the average rate of return of the efficient portfolio and KOSPI200 respectively.

• Journal of Broadcast Engineering
• /
• v.15 no.5
• /
• pp.632-641
• /
• 2010

This paper shows the research about the personalized broadcasting system. The personalized broadcasting is the service that users only show the programs which they want to watch when they want to watch these. The purpose of the bi-directional broadcasting service is supporting more satisfied and more personalized services by permitting the bi-directional data transformation. This research also develops the user profiling system for the bi-directional and personalized broadcasting service. This system applied the TV-Anytime metadata specifications which is the standard for the personalized broadcasting services, the system supports the various functions for the bi-directionl and personalized broadcasting such as the user profiling, contents metadata and targeting advertisement services. The bi-directional and personalized broadcasting system increases the users' satisfaction with the recommendation and management of the personally favorite broadcasting contents and advertisements, the trial run results show that the services raise the users' satisfaction with the intelligent and discriminating broadcasting services.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.7
• /
• pp.887-892
• /
• 2005

Under pure P2P environments, collaborative filtering must be provided with only a few service items by real time information without accumulated data. However, in case of collaborative filtering with only a few service items collected locally, quality of recommended service becomes low. Therefore, it is necessary to research a method to improve quality of recommended service by users' context information. But because a great volume of users' context information can be recognized in a moment, there can be a scalability problem and there are limitations in supporting differentiated services according to fields and items. In this paper, we solved the scalability problem by clustering context information Per each service field and classifying il per each user, using SOM. In addition, we could recommend proper services for users by measuring the context information of the users belonging to the similar classification to the service requester among classified data and then using collaborative filtering.

• The Journal of the Korea Contents Association
• /
• v.7 no.6
• /
• pp.1-8
• /
• 2007

In electronic commerce, it is important for users to recommend the proper item among large item sets with saving time and effort. Therefore, if the recommendation system can be recommended the suitable item, we will gain a good satisfaction to the user. In this paper, we proposed the associative relation clustering split method in the collaborative filtering in order to perform the accuracy and the scalability. We produce the lift between associative items using the ratings data. and then split the node group that consists of the item to improve an efficiency of the associative relation cluster. This method differs the association about the items of groups. If the association of groups is filled, the reminding items combine. To estimate the performance, the suggested method is compared with the K-means and EM in the MovieLens data set.

• Journal of KIISE:Computing Practices and Letters
• /
• v.7 no.6
• /
• pp.684-695
• /
• 2001

Recent recommender system uses a method of combining collaborative filtering system and content based filtering system in order to solve sparsity and first rater problem in collaborative filtering system. Collaborative filtering systems use a database about user preferences to predict additional topics. Content based filtering systems provide recommendations by matching user interests with topic attributes. In this paper, we describe a method for discovery of user preference through combining two techniques for recommendation that allows the application of machine learning algorithm. The proposed collaborative filtering method clusters user using genetic algorithm based on items categorized by Naive Bayes classifier and the content based filtering method builds user profile through extracting user interest using relevance feedback. We evaluate our method on a large database of user ratings for web document and it significantly outperforms previously proposed methods.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.12 no.5
• /
• pp.385-392
• /
• 2002

Collaborative filtering method for personalization can suggest new items and information which a user hasn t expected. But there are some problems. Not only the steps for calculating similarity value between each user is complex but also it doesn t reflect user s interest dynamically when a user input a query. In this paper, classifying users by their interest makes calculating similarity simple. We propose the a1gorithm for readjusting user s interest dynamically using the profile and Bayesian learning. When a user input a keyword searching for a item, his new interest is readjusted. And the user s profile that consists of used key words and the presence frequency of key words is designed and used to reflect the recent interest of users. Our methods of adjusting user s interest using the profile and Bayesian learning can improve the real satisfaction of users through the experiment with data set, collected in University s library. It recommends a user items which he would be interested in.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.5
• /
• pp.656-662
• /
• 2012

In this paper, we describe a new summarizing method based on a graph-based and a sense-based analysis. In the graph-based analysis, we convert sentences in a document into word vectors and calculate the similarity between each sentence using LSA. We reflect this similarity of sentences and the rarity scores of words in sentences to define weights of edges in the graph. Meanwhile, in the sense-based analysis, in order to determine the sense of words, subjectivity or objectivity, we built a database which is extended from the golden standards using Wordnet. We calculate the subjectivity of sentences from the sense of words, and select more subjective sentences. Lastly, we combine the results of these two methods. We evaluate the performance of the proposed method using classification games, which are usually used to measure the performances of summarization methods. We compare our method with the MS-Word auto-summarization, and verify the effectiveness of ours.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.15 no.4
• /
• pp.709-716
• /
• 2020

In social media, when posting a post, tag information of an image is generally used because the search is mainly performed using a tag. Users want to expose the post to many people by attaching the tag to the post. Also, the user has trouble posting the tag to be tagged along with the post, and posts that have not been tagged are also posted. In this paper, we propose a method to find an image similar to the input image, extract the label attached to the image, find the posts on instagram, where the label exists as a tag, and recommend other tags in the post. In the proposed method, the label is extracted from the image through the model of the convolutional neural network (CNN) deep learning technique, and the instagram is crawled with the extracted label to sort and recommended tags other than the label. We can see that it is easy to post an image using the recommended tag, increase the exposure of the search, and derive high accuracy due to fewer search errors.

• Journal of KIISE:Software and Applications
• /
• v.33 no.11
• /
• pp.953-964
• /
• 2006

Due to the usefulness of the collaborative filtering, it has been widely used in both the research and commercial field. However, there are still some challenges for it to be more efficient, especially the scalability problem, the sparsity problem and the cold start problem. In this paper. we address these problems and provide a novel distributed approach based on agents collaboration for the problems. We have tried to solve the scalability problem by making each agent save its users ratings and broadcast them to the users friends so that only friends ratings and his own ratings are kept in an agents local database. To reduce quality degradation of recommendation caused by the lack of rating data, we introduce a method using friends opinions instead of real rating data when they are not available. We also suggest a collaborative filtering algorithm based on user profile to provide new users with recommendation service. Experiments show that our suggested approach is helpful to the new user problem as well as is more scalable than traditional centralized CF filtering systems and alleviate the sparsity problem.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.22 no.9
• /
• pp.25-31
• /
• 2008

The field of induction motor is magnetized and demagnetized for each reversal of the current. This field component of the motor accounts for most of the reactive component of inductive load. Reactive power needs to sustain the electromagnetic field required for the induction motor to operate. Power factor of induction motor is usually low and power factor correction needs. Power factor becomes low by the effect of the reduction operation of load capacity. In most cases, Capacitor capacity for the power factor correction should be complied with the recommendation by the motor capacity. But Capacitor value for power factor correction can't change during the normal operation. In this paper, we analyzed characteristics of power and power factor changing by load fluctuation of low-voltage small size induction motor and show that lower power factor correction's parameter of existing recommendation should be revised by new value.