• Journal of Digital Contents Society
• /
• v.19 no.5
• /
• pp.845-852
• /
• 2018

This study has developed a preventive launcher from smartphone addiction for the digital generation and the contents recommendation based on machine learning which used multiple and collective intelligence. This could provide convenient digital nurturing experience for the parents who fear their children's over use of digital devices and also suggest individually adaptive digital learning methods that enhance the learning efficiency and pleasurable and safe learning environment for the children. Suggested application is a kind of gamification launcher that protects children from harmful contents and from smartphone addiction with time limit settings. For parents who find difficulty choosing from various kinds of contents and applications for education, this suggested system could provide a learning analytic report based on big data after collecting and analyzing the data of their children's learning and activities and recommend contents necessary for their kids using recommended algorithm by collective intelligence.

• Journal of Korea Multimedia Society
• /
• v.17 no.8
• /
• pp.946-952
• /
• 2014

Mobility prediction is one of hot topics using location history information. It is useful for not only user-level applications such as people finder and recommendation sharing service but also for system-level applications such as hand-off management, resource allocation, and quality of service of wireless services. Most of current prediction techniques often use a set of significant locations without taking into account possible location information changes for prediction. Markov-based, LZ-based and Prediction by Pattern Matching techniques consider interesting locations to enhance the prediction accuracy, but they do not consider interesting location changes. In our paper, we propose an algorithm which integrates the changing or emerging new location information. This approach is based on Active LeZi algorithm, but both of new location and all possible location contexts will be updated in the tree with the fixed depth. Furthermore, the tree will also be updated even when there is no new location detected but the expected route is changed. We find that our algorithm is adaptive to predict next location. We evaluate our proposed system on a part of Dartmouth dataset consisting of 1026 users. An accuracy rate of more than 84% is achieved.

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

웹 상에 정보가 폭발적으로 증가함에 따라 각 사용자에게 맞는 정보를 선별하여 제공하는 개인화 서비스는 매우 중요한 이슈가 되었다. 기존 추천시스템들은 컨텐츠 기반 필터링과 협업 필터링 기법을 기반으로 한다. 그러나 이러한 방법들은 충분히 수집된 사용자 정보를 필요로 하기 때문에, 적절한 추천이 이루어지기 까지 다소 시간이 소요되는 문제를 가지고 있다. 또한 사용자의 성향이 지나치게 편중되는 경우, 사용자의 취향변화를 반영하여 새로운 상품을 추천하는 것은 어렵다. 실제로 사용자들은 웹 사이트의 방문 목적에 따라 개인화된 상품추천을 원하기도 하고, 많은 사용자들에게 인기 있는 상품을 원하기도 한다. 본 논문에서는 사용자의 행동분석을 기반으로, 협업 필터링을 기반으로 하는 개인화된 추천과 다수의 사용자들에게 공통적으로 인기 있는 상품의 추천 비율을 동적으로 조합하여 최종 추천 상품들을 선별하는 새로운 적응형 추천 시스템을 제안한다. 본 논문에서는 MovieLens의 데이터 셋을 이용하여 기존 추천기법들과 추천결과에 대한 정확도를 비교 실험하였으며, 보다 높은 정확도를 보이는 실험결과를 통해 제안시스템의 유효성을 확인하였다.

• Journal of Internet Computing and Services
• /
• v.15 no.5
• /
• pp.83-93
• /
• 2014

Providing personalized services customized to users' needs and preferences becomes highlighted as a key area of user-context computing. It is essential for context-aware technology to be developed more intelligent and meaningful services by being widely applied to a variety of sectors and domains. SDO (Standard Development Organization) such as MPEG and W3C has been actively developed to be standardized services and to improve context-awareness services. Yet current standards related to context-aware technology, such as MPEG-7, MPEG-21, MPEG-V, and emotionML, are not capable enough to support various systems and diverse services. Against this backdrop, the MPEG User Description, referred to also as MPEG-UD Standard, is to ensure interoperability among recommendation services, which take into account user's context when generating recommendations to users. In this light, we introduce standards related to the user context and propose the structure for RD-Engine and the Remote Responsive User Interface(RRUI) system in reference to MPEG-UD. This system collects unit resources matching specific condition according to the user's contexts described by MPEG-UD. In so doing, it improves adaptive user interface considering device features in real-time. By automatically generating adaptive user interfaces tailored to an individual's contexts, the proposed system aims to achieve high-quality user experience for a complex service.

• Journal of Intelligence and Information Systems
• /
• v.21 no.1
• /
• pp.119-142
• /
• 2015

With the explosive growth in the volume of information, Internet users are experiencing considerable difficulties in obtaining necessary information online. Against this backdrop, ever-greater importance is being placed on a recommender system that provides information catered to user preferences and tastes in an attempt to address issues associated with information overload. To this end, a number of techniques have been proposed, including content-based filtering (CBF), demographic filtering (DF) and collaborative filtering (CF). Among them, CBF and DF require external information and thus cannot be applied to a variety of domains. CF, on the other hand, is widely used since it is relatively free from the domain constraint. The CF technique is broadly classified into memory-based CF, model-based CF and hybrid CF. Model-based CF addresses the drawbacks of CF by considering the Bayesian model, clustering model or dependency network model. This filtering technique not only improves the sparsity and scalability issues but also boosts predictive performance. However, it involves expensive model-building and results in a tradeoff between performance and scalability. Such tradeoff is attributed to reduced coverage, which is a type of sparsity issues. In addition, expensive model-building may lead to performance instability since changes in the domain environment cannot be immediately incorporated into the model due to high costs involved. Cumulative changes in the domain environment that have failed to be reflected eventually undermine system performance. This study incorporates the Markov model of transition probabilities and the concept of fuzzy clustering with CBCF to propose predictive clustering-based CF (PCCF) that solves the issues of reduced coverage and of unstable performance. The method improves performance instability by tracking the changes in user preferences and bridging the gap between the static model and dynamic users. Furthermore, the issue of reduced coverage also improves by expanding the coverage based on transition probabilities and clustering probabilities. The proposed method consists of four processes. First, user preferences are normalized in preference clustering. Second, changes in user preferences are detected from review score entries during preference transition detection. Third, user propensities are normalized using patterns of changes (propensities) in user preferences in propensity clustering. Lastly, the preference prediction model is developed to predict user preferences for items during preference prediction. The proposed method has been validated by testing the robustness of performance instability and scalability-performance tradeoff. The initial test compared and analyzed the performance of individual recommender systems each enabled by IBCF, CBCF, ICFEC and PCCF under an environment where data sparsity had been minimized. The following test adjusted the optimal number of clusters in CBCF, ICFEC and PCCF for a comparative analysis of subsequent changes in the system performance. The test results revealed that the suggested method produced insignificant improvement in performance in comparison with the existing techniques. In addition, it failed to achieve significant improvement in the standard deviation that indicates the degree of data fluctuation. Notwithstanding, it resulted in marked improvement over the existing techniques in terms of range that indicates the level of performance fluctuation. The level of performance fluctuation before and after the model generation improved by 51.31% in the initial test. Then in the following test, there has been 36.05% improvement in the level of performance fluctuation driven by the changes in the number of clusters. This signifies that the proposed method, despite the slight performance improvement, clearly offers better performance stability compared to the existing techniques. Further research on this study will be directed toward enhancing the recommendation performance that failed to demonstrate significant improvement over the existing techniques. The future research will consider the introduction of a high-dimensional parameter-free clustering algorithm or deep learning-based model in order to improve performance in recommendations.

• Journal of Intelligence and Information Systems
• /
• v.13 no.4
• /
• pp.65-78
• /
• 2007

This paper proposes a new method of weighted template matching for machine-printed numeral recognition. The proposed weighted template matching, which emphasizes the feature of a pattern using adaptive Hamming distance on local feature areas, improves the recognition rate while template matching processes an input image as one global feature. Template matching is vulnerable to random noises that generate ragged outlines of a pattern when it is binarized. This paper offers a method of chain code trimming in order to remove ragged outlines. The method corrects specific chain codes within the chain codes of the inner and the outer contour of a pattern. The experiment compares confusion matrices of both the template matching and the proposed weighted template matching with chain code trimming. The result shows that the proposed method improves fairly the recognition rate of the machine-printed numerals.

• Progress in Medical Physics
• /
• v.19 no.3
• /
• pp.143-149
• /
• 2008

The aim of this study is to suggest the method for image enhancement of digital chest radiograph and evaluate clinically the quality of the resultant image. A nonlinear iterative filter was developed in order to reduce quantum noise preserving edge. Dynamic range was adjusted and adaptive image enhancement was performed based on the property of anatomic region and the degree of compatibility with neighboring pixels. The lung fields were enhanced appropriately to visualize effectively vascular tissue, bronchus and lung tissue with the desired mediastinum enhancement. Clinic evaluation was performed by three radiologists with at least 8 years experience. The anatomic regions of 11 in PA and 9 in Lateral were observed carefully in each 100 radiographs according to ITU (International Telecommunication Union) recommendation 500 protocol. The result showed the mean 3.4 between good and adequate. This means that the clinical utility of the image quality is enough. In this study, image enhancement was carried out considering image display device and human perceptual system to prevent the loss of useful anatomic information. In order to increase the diagnostic accuracy in digital radiograph, the continuous study on image enhancement is needed.

• Journal of Korean society of Dental Hygiene
• /
• v.9 no.4
• /
• pp.633-643
• /
• 2009

Objectives : This study is aimed to help the dental hygiene department students to improve their adaptive ability to the field work by letting them know the performing levels required of the job world, by renovating the knowledge-centered curriculum, and by finding out the core competencies needed for successfully performing their duties and tasks in the work field. Methods : The survey tool was recomposed through the examination of the preceeding studies on basic vocational competencies and skills, and the survey has been done to 200 dentists in Seoul and Gyunggi provice. Results : 1. As for the job-getting routs, 35.1% of them finds their jobs through the job portal sites, and 21.3% through the recommendation by professors. So we can see the meaningful difference in the employment ways. 2. Dental hygiene clinics think that the purpose of their cooperation with the colleges is mainly to secure human resources by requiring the colleges to give field-centered education the colleges through. 3. The clinics for dental hygienic students' field learning have a great power for hiring the students. So it is necessary to set up a good management system of the clinics for dental hygienic students' field learning in order to reinforce the students' competitive power in getting jobs. 4. The priorities in basic working abilities needed for the task performance are in the order of vocational responsibility, self-managing & developing ability, interpersonal skill, and problem solving ability. 5. The core competencies required of those who graduate from dental hygiene school show the following scores by Likert measurement; good personality and vocational consciousness 2.16(${\pm}.677$), understanding power of major-related knowledge 2.19(${\pm}.723$), field adapting ability 2.31(${\pm}.748$), get-along-with ability 2.32(${\pm}.799$), interpersonal skill 2.42(${\pm}.768$), and self-development ability such as getting certificates 2.43(${\pm}.729$). Among the core competencies, the only meaningful factor which influences on their satisfaction measurement has been identified as the professional ability related to the major. Conclusions : The results suggest that the knowledge and skill related to the major are core competencies of able human resources and closely related with the professionality of the job, and so they are very important. However, job basic abilities are also proved to be important, which reinforce the students' activeness, self-regulation, and creativeness, and help them to pursue their lasting growth in their abilities.

• Journal of Intelligence and Information Systems
• /
• v.17 no.4
• /
• pp.95-108
• /
• 2011

TThis is a study of the personalization method that intelligently adapts the level of clustering considering purchasing index of a customer. In the e-biz era, many companies gather customers' demographic and transactional information such as age, gender, purchasing date and product category. They use this information to predict customer's preferences or purchasing patterns so that they can provide more customized services to their customers. The previous Customer-Segmentation method provides customized services for each customer group. This method clusters a whole customer set into different groups based on their similarity and builds predictive models for the resulting groups. Thus, it can manage the number of predictive models and also provide more data for the customers who do not have enough data to build a good predictive model by using the data of other similar customers. However, this method often fails to provide highly personalized services to each customer, which is especially important to VIP customers. Furthermore, it clusters the customers who already have a considerable amount of data as well as the customers who only have small amount of data, which causes to increase computational cost unnecessarily without significant performance improvement. The other conventional method called 1-to-1 method provides more customized services than the Customer-Segmentation method for each individual customer since the predictive model are built using only the data for the individual customer. This method not only provides highly personalized services but also builds a relatively simple and less costly model that satisfies with each customer. However, the 1-to-1 method has a limitation that it does not produce a good predictive model when a customer has only a few numbers of data. In other words, if a customer has insufficient number of transactional data then the performance rate of this method deteriorate. In order to overcome the limitations of these two conventional methods, we suggested the new method called Intelligent Customer Segmentation method that provides adaptive personalized services according to the customer's purchasing index. The suggested method clusters customers according to their purchasing index, so that the prediction for the less purchasing customers are based on the data in more intensively clustered groups, and for the VIP customers, who already have a considerable amount of data, clustered to a much lesser extent or not clustered at all. The main idea of this method is that applying clustering technique when the number of transactional data of the target customer is less than the predefined criterion data size. In order to find this criterion number, we suggest the algorithm called sliding window correlation analysis in this study. The algorithm purposes to find the transactional data size that the performance of the 1-to-1 method is radically decreased due to the data sparity. After finding this criterion data size, we apply the conventional 1-to-1 method for the customers who have more data than the criterion and apply clustering technique who have less than this amount until they can use at least the predefined criterion amount of data for model building processes. We apply the two conventional methods and the newly suggested method to Neilsen's beverage purchasing data to predict the purchasing amounts of the customers and the purchasing categories. We use two data mining techniques (Support Vector Machine and Linear Regression) and two types of performance measures (MAE and RMSE) in order to predict two dependent variables as aforementioned. The results show that the suggested Intelligent Customer Segmentation method can outperform the conventional 1-to-1 method in many cases and produces the same level of performances compare with the Customer-Segmentation method spending much less computational cost.