• Journal of the Korea Society of Computer and Information
• /
• v.22 no.5
• /
• pp.57-63
• /
• 2017

In the paper, we propose a new reliable technique for measuring food intake based on image automatically without user intervention. First, food and bowl image before and after meal is obtained by user. The food and the bowl are divided into each region by the K-means clustering, Otsu algorithm, Morphology, etc. And the volume of food is measured by a proportional expression based on the information of the container such as it's entrance diameter, depth, and bottom diameter. Finally, our method calculates the volume of the consumed food by the difference between before and after meal. The proposed technique has higher accuracy than existing method for measuring food intake automatically. The experiment result shows that the average error rate is up to 7% for three types of containers. Computer simulation results indicate that the proposed algorithm is a convenient and accurate method of measuring the food intake.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2019.05a
• /
• pp.273-276
• /
• 2019

There is a lot of information in our world, quick access to the most accurate information or finding the information we need is more difficult and complicated. The recommendation system has become important for users to quickly find the product according to user's preference. A social recommendation system using community detection based on label propagation is proposed. In this paper, we applied community detection based on label propagation and collaborative filtering in the movie recommendation system. We implement with MovieLens dataset, the users will be clustering to the community by using label propagation algorithm, Our proposed algorithm will be recommended movie with finding the most similar community to the new user according to the personal propensity of users. Mean Absolute Error (MAE) is used to shown efficient of our proposed method.

• International Journal of Advanced Culture Technology
• /
• v.10 no.2
• /
• pp.240-245
• /
• 2022

Because of the importance of the information, encryption algorithms are heavily used. Raw data is encrypted and secure, but problems arise when the key for decryption is exposed. In particular, large-scale Internet sites such as Facebook and Amazon suffer serious damage when user data is exposed. Recently, research into a new fourth-generation encryption technology that can protect user-related data without the use of a key required for encryption is attracting attention. Also, data clustering technology using encryption is attracting attention. In this paper, we try to reduce key exposure by using homomorphic encryption. In addition, we want to maintain privacy through similarity measurement. Additionally, holistic similarity measurements are time-consuming and expensive as the data size and scope increases. Therefore, Min-Hash has been studied to efficiently estimate the similarity between two signatures Methods of measuring similarity that have been studied in the past are time-consuming and expensive as the size and area of data increases. However, Min-Hash allowed us to efficiently infer the similarity between the two sets. Min-Hash is widely used for anti-plagiarism, graph and image analysis, and genetic analysis. Therefore, this paper reports privacy using homomorphic encryption and presents a model for efficient similarity measurement using Min-Hash.

• Journal of KIISE:Software and Applications
• /
• v.31 no.4
• /
• pp.467-477
• /
• 2004

While recommender systems were used by a few E-commerce sites former days, they are now becoming serious business tools that are re-shaping the world of I-commerce. And collaborative filtering has been a very successful recommendation technique in both research and practice. But there are two problems in personalized recommender systems, it is First-Rating problem and Sparsity problem. In this paper, we solve these problems using the associative relation clustering and “Lift” of association rules. We produce “Lift” between items using user's rating data. And we apply Threshold by -cut to the association between items. To make an efficiency of associative relation cluster higher, we use not only the existing Hypergraph Clique Clustering algorithm but also the suggested Split Cluster method. If the cluster is completed, we calculate a similarity iten in each inner cluster. And the index is saved in the database for the fast access. We apply the creating index to predict the preference for new items. To estimate the Performance, the suggested method is compared with existing collaborative filtering techniques. As a result, the proposed method is efficient for improving the accuracy of prediction through solving problems of existing collaborative filtering techniques.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.5
• /
• pp.19-24
• /
• 2016

In Long Term Evolution-Advanced (LTE-A), small cell enhancement(SCE) has been developed as a cost-effective way of supporting exponentially increasing demand of wireless data services and satisfying the user quality of service(QoS). However, due to the dense and irregular distribution of a large number of small cells, the offloading scheme should be applied in the small cell network. In this paper, we propose an user offloading scheme for SCE in LTE-Advanced system. We divide the small cells into different clusters according to the reference signal received power(RSRP) from user equipment(UE). Within a cluster, We apply the user offloading scheme with the consideration of the number of users and interference conditions. Simulation results show that proposed scheme can improve the throughput, and spectral efficiency of small cell users. Eventually, proposed scheme can improve overall cell performance.

• Journal of KIISE:Software and Applications
• /
• v.31 no.3
• /
• pp.332-342
• /
• 2004

With the explosive growth of information in our real life, information filtering is quickly becoming a popular technique for reducing information overload. Information filtering technique is divided into two categories: content-based filtering and collaborative filtering (or social filtering). Content-based filtering selects the information based on contents; while collaborative filtering combines the opinions of other persons to make a prediction for the target user. In this paper, we describe a new filtering approach that seamlessly combines content-based filtering and collaborative filtering to take advantages from both of them, where a technique using user profiles efficiently on the collaborative filtering framework is introduced to predict a user's preference. The proposed approach is experimentally evaluated and compared to conventional filtering. Our experiments showed that the proposed approach not only achieved significant improvement in prediction quality, but also dealt with new users well.

• Journal of Intelligence and Information Systems
• /
• v.13 no.3
• /
• pp.83-99
• /
• 2007

Nowadays, the advancement of digital information technology resulting in the increased interest of the management and the use of information has given stimulus to the research on the use and management of information. In this paper, we propose an integrated data mining model that can provide the necessary information and interface to users of scientific information portal service according to their respective classification groups. The integrated model classifies users from log files automatically collected by the web server based on users' behavioral patterns. By classifying the existing users of the web site, which provides information service, and analyzing their patterns, we proposed a web site utilization methodology that provides dynamic interface and user oriented site operating policy. In addition, we believe that our research can provide continuous web site user support, as well as provide information service according to user classification groups.

• KIPS Transactions on Computer and Communication Systems
• /
• v.3 no.3
• /
• pp.81-86
• /
• 2014

According to the development of streaming services with P2P and mobile network technologies, researches to enhance the service quality in mobile environment have been proposed. However, streaming services considering high-speed mobile environment and characteristics of heterogenous terminals have been hindered from being provided with the required quality from user because of bandwidth congestion between selfish peers of existing P2P system. It is also prone to long delay and loss in accordance with the repeated traffic amounts because there are no optimized solution for traffic localization. The structure to enhance peer contribution for service differentiation and peer selection with clustering scheme with location information of terminal can satisfy both users and service providers with service quality and efficiency. In this paper, we propose an incentive mechanism and resource distribution scheme with user contribution and traffic cost information based on user location, which make mobile users increase the satisfaction of service quality in LTE environments.

• Journal of Korea Multimedia Society
• /
• v.14 no.4
• /
• pp.567-576
• /
• 2011

In current Web 2.0 environment, one of the most core technology is social bookmarking which users put tags and bookmarks to their interesting Web pages. The main purpose of social bookmarking is an effective information service by use of retrieval, grouping and share based on user's bookmark information and tagging result of their interesting Web pages. But, current social bookmarking system uses the number of bookmarks and tag information separately in information retrieval, where the number of bookmarks stand for user's degree of interest on Web contents, information retrieval, and classification serve the purpose of tag information. Because of above reason, social bookmarking system does not utilize effectively the bookmark information and tagging result. This paper proposes a Web contents ranking algorithm combining bookmarks and tag information, based on preceding research on associative tag extraction by tag clustering. Moreover, we conduct a performance evaluation comparing with existing retrieval methodology for efficiency analysis of our proposed algorithm. As the result, social bookmarking system utilizing bookmark with tag, key point of our research, deduces a effective retrieval results compare with existing systems.

• Journal of KIISE:Software and Applications
• /
• v.32 no.9
• /
• pp.901-911
• /
• 2005

With the development of e-commerce and the proliferation of easily accessible information, information filtering has become a popular technique to prune large information spaces so that users are directed toward those items that best meet their needs and preferences. While many collaborative filtering systems have succeeded in capturing the similarities among users or items based on ratings to provide good recommendations, there are still some challenges for them to be more efficient, especially the user bias problem, non-transitive association problem and cold start problem. Those three problems impede us to capture more accurate similarities among users or items. In this paper, we provide probabilistic model approaches for UCHM and ICHM which are suggested to solve the addressed problems in hopes of achieving better performance. In this probabilistic model, objects (users or items) are classified into groups and predictions are made for users considering the Gaussian distribution of user ratings. Experiments on a real-word data set illustrate that our proposed approach is comparable with others.