Seon-Phil Jeong

Clustering Method Using Item Preference Based on RFM for Recommendation System in U-Commerce

This paper proposes a new method using clustering of item preference based on Recency, Frequency, Monetary (RFM) for recommendation system in u-commerce under fixed mobile convergence service environment which is required by real time accessibility and agility. In this paper, using an implicit method without onerous question and answer to the users, not used user’s profile for rating to reduce customers’ search effort, it is necessary for us to keep the scoring of RFM to be able to reflect the attributes of the item and clustering in order to improve the accuracy of recommendation with high purchasability. To verify improved better performance of proposing system than the previous systems, we carry out the experiments in the same dataset collected in a cosmetic internet shopping mall.

A Case Study on Effective Technique of Distributed Data Storage for Big Data Processing in the Wireless Internet Environment

Technology industry is experiencing its dramatic changes in the amount of data that requires management and the place that such an asset are stored. Despite the exponential growth of information, business leaders are expecting agility in order to complete a lot of works much faster and less expensively using data. With the generalized spread of smart devices under this rapidly changing digital environment and subsequent spread of wireless Internet users and communication expenditure, the amount of data via wireless Internet worldwide is increasing rapidly at a faster rate every year. However, the communication environment cannot catch up with the demands of consumers for the super high-speed wireless Internet. Accordingly, this paper aims to look at the establishment of the cloud storage-based file system that can provide services to meet the needs of users in the cloud computing environment via wireless Internet and the examples of the establishment of such a system.

Bio Named Entity Recognition Based on Co-training Algorithm

One essential task in extracting information from biomedical literature is the bio Named Entity Recognition (NER) process, which basically defines the boundaries between typical words and biomedical terminology in particular text data, and assigns them based on domain knowledge. This paper presents a semi supervised integration of completely different classifiers to cover knowledge from unlabeled data to recognize bio named entities in text. We modified the original co-training, a semi supervised learning algorithm, with a scalable feature processing schema, which extracts the bio NER feature from a number of unlabeled data and converts different types of feature sets. Our base result shows that the classifiers of co-training achieve significant learning from unlabeled data.

Constructing RBAC Based Security Model in u-Healthcare Service Platform

In todays era of aging society, people want to handle personal health care by themselves in everyday life. In particular, the evolution of medical and IT convergence technology and mobile smart devices has made it possible for people to gather information on their health status anytime and anywhere easily using biometric information acquisition devices. Healthcare information systems can contribute to the improvement of the nations healthcare quality and the reduction of related cost. However, there are no perfect security models or mechanisms for healthcare service applications, and privacy information can therefore be leaked. In this paper, we examine security requirements related to privacy protection in u-healthcare service and propose an extended RBAC based security model. We propose and design u-healthcare service integration platform (u-HCSIP) applying RBAC security model. The proposed u-HCSIP performs four main functions: storing and exchanging personal health records (PHR), recommending meals and exercise, buying/selling private health information or experience, and managing personal health data using smart devices.

Clustering Method Using Weighted Preference Based on RFM Score for Personalized Recommendation System in u-Commerce

This paper proposes a new clustering method using the weighted preference based on RFM(Recency, Frequency, Monetary) Score for personalized recommendation in u-commerce under ubiquitous computing environment which is required by real time accessibility and agility. In this paper, using an implicit method without onerous question and answer to the users, not used user’s profile for rating, it is necessary for us to extract the most frequent purchase items from the whole purchase data and to calculate the weighted preference of item for customer in order to reduce customers’ search effort, to reflect frequently changing trends by emphasizing the important items and to improve the rate of recommendation with high purchasability. To verify improved better performance of proposing system than the previous systems, we carry out the experiments in the same dataset collected in a cosmetic internet shopping mall.

Efficient Purchase Pattern Clustering Based on SOM for Recommender System in u-Commerce

This paper proposes an efficient purchase pattern clustering method based on SOM(Self-Organizing Map) for Personal Ontology Recommender System in u-Commerce under ubiquitous computing environment which is required by real time accessibility and agility. In this paper, it is necessary for us to keep clustering the user’s information to join the user’s score based on RFM factors using SOM network and the analysis of RFM to be able to reflect the attributes of the user in order to reflect frequently changing trends of purchase pattern by emphasizing the important users and items, and to improve better performance of recommendation. The proposed makes the task of an efficient purchase pattern clustering based on SOM for preprocessing so as to be possible to recommend by the loyalty of RFM factors as considering user’s propensity. To verify improved better performance of proposing system than the previous systems, we carry out the experiments in the same dataset collected in a cosmetic internet shopping mall.

An application of improved gap-BIDE algorithm for discovering access patterns

Discovering access patterns from web log data is a typical sequential pattern mining application, and a lot of access pattern mining algorithms have been proposed. In this paper, we propose an improved approach of Gap-BIDE algorithm to extract user access patterns from web log data. Compared with the previous Gap-BIDE algorithm, a process of getting a large event set is proposed in the provided algorithm; the proposed approach can find out the frequent events by discarding the infrequent events which do not occur continuously in an accessing time before generating candidate patterns. In the experiment, we compare the previous access pattern mining algorithm with the proposed one, which shows that our approach is very efficient in discovering access patterns in large database.

Learning Listener's Preference for Music Recommender System

Along with the spread of digital music and recent growth in the digital music industry, the demands for music recommender are increasing. These days, listeners have increasingly preferred to digital real-time streamlining and downloading to listen to music because this is convenient and affordable for the listeners. In this paper, we propose music recommender system using learning listeners prefererece, such as Melon, Billboard, Bugs Music, Soribada, and Gini, with most popular current songs across all genres and styles. It is also necessary for us to make the task of calculating the preference with weight to reflect the preference of most popular current songs with its popular music charts on trends. We evaluated the proposed system on the data set of music sites to measure its performance. We reported some of the experimental result, which is better performance than the previous system.