• Title/Summary/Keyword: 개인화추천

Search Result 526, Processing Time 0.024 seconds

Tour Social Network Service System Using Context Awareness (상황인식 기반의 관광 소셜 네트워크 서비스 응용)

  • Jang, Min-seok;Kim, Su-gyum;Choi, Jeong-pil;Sung, In-tae;Oh, Young-jun;Shim, Jang-sup;Lee, Kang-whan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2014.10a
    • /
    • pp.573-576
    • /
    • 2014
  • In this paper, it provides social network service using context-aware for tourism. For this the service requires Anthropomorphic natural process. The service object need to provide the function analyzing, storing and processing user action. In this paper, it provides an algorithm to analysis with personalized context aware for users. Providing service is an algorithm providing social network, helped by 'Friend recommendation algorithm' which to make relations and 'Attraction recommendation algorithm' which to recommend somewhere significant. Especially when guide is used, server analysis history and location of users to provide optimal travel path, named 'Travel path recommendation algorithm'. Such as this tourism social network technology can provide more user friendly service. This proposed tour guide system is expected to be applied to a wider vary application services.

  • PDF

Fashion attribute-based mixed reality visualization service (패션 속성기반 혼합현실 시각화 서비스)

  • Yoo, Yongmin;Lee, Kyounguk;Kim, Kyungsun
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2022.05a
    • /
    • pp.2-5
    • /
    • 2022
  • With the advent of deep learning and the rapid development of ICT (Information and Communication Technology), research using artificial intelligence is being actively conducted in various fields of society such as politics, economy, and culture and so on. Deep learning-based artificial intelligence technology is subdivided into various domains such as natural language processing, image processing, speech processing, and recommendation system. In particular, as the industry is advanced, the need for a recommendation system that analyzes market trends and individual characteristics and recommends them to consumers is increasingly required. In line with these technological developments, this paper extracts and classifies attribute information from structured or unstructured text and image big data through deep learning-based technology development of 'language processing intelligence' and 'image processing intelligence', and We propose an artificial intelligence-based 'customized fashion advisor' service integration system that analyzes trends and new materials, discovers 'market-consumer' insights through consumer taste analysis, and can recommend style, virtual fitting, and design support.

  • PDF

A Research on Image Metadata Extraction through YCrCb Color Model Analysis for Media Hyper-personalization Recommendation (미디어 초개인화 추천을 위한 YCrCb 컬러 모델 분석을 통한 영상의 메타데이터 추출에 대한 연구)

  • Park, Hyo-Gyeong;Yong, Sung-Jung;You, Yeon-Hwi;Moon, Il-Young
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2021.10a
    • /
    • pp.277-280
    • /
    • 2021
  • Recently as various contents are mass produced based on high accessibility, the media contents market is more active. Users want to find content that suits their taste, and each platform is competing for personalized recommendations for content. For an efficient recommendation system, high-quality metadata is required. Existing platforms take a method in which the user directly inputs the metadata of an image. This will waste time and money processing large amounts of data. In this paper, for media hyperpersonalization recommendation, keyframes are extracted based on the YCrCb color model of the video based on movie trailers, movie genres are distinguished through supervised learning of artificial intelligence and In the future, we would like to propose a utilization plan for generating metadata.

  • PDF

Efficient Web Document Search based on Users' Understanding Levels (사용자의 이해수준에 따른 효율적인 웹문서 검색)

  • Shim, Sang-Hee;Lee, Soo-Jung
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.1
    • /
    • pp.38-46
    • /
    • 2009
  • With the rapid increase in the number of Web documents, the problem of information overload is growing more serious in Internet search. In order to ease the problem, researchers are paying attention to personalization, which creates Web environment fittingly for users' preference, but most of search engines produce results focused on users' queries. Thus, the present study examined the method of producing search results personalized based on a user's understanding level. A characteristic that differentiates this study from previous researches is that it considers users' understanding level and searches documents of difficulty fit for the level first. The difficulty level of a document is adjusted based on the understanding level of users who access the document, and a user's understanding level is updated periodically based on the difficulty of documents accessed by the user. A Web search system based on the results of this study is expected to bring very useful results to Web users of various age groups.

A Case Study on the Personalized Online Recruitment Services : Focusing on Worldjob+'s Use of Splunk (개인화된 구직정보서비스 제공에 관한 사례연구 : 월드잡플러스의 스플렁크 활용을 중심으로)

  • Rhee, MoonKi Kyle;Lee, Jae Deug;Park, Seong Taek
    • Journal of the Korea Convergence Society
    • /
    • v.9 no.2
    • /
    • pp.241-250
    • /
    • 2018
  • Online recruitment services have emerged as one of the most popular Internet services, providing job seekers with a comprehensive list of jobs and a search engine. But many recruitment services suffer from shortcomings due to their reliance on traditional client-pull information access model, in manay cases resulting in unfocused search results. Worldjob+, being operated by The Human Resources Development Service of Korea, addresses these problems and uses Splunk, a platform for analyzing machine data, to provide a more proactive and personalised services. It focuses on enhancing the existing system in two different ways: (a) using personalised automated matching techniques to proactively recommend most preferrable profile or specification information for each job opening announcement or recruiting company, (b) and to recommend most preferrable or desirable job opening announcement for each job-seeker. This approach is a feature-free recommendation technique that recommends information items to a given user based on what similar users have previously liked. A brief discussion about the potential benefit is also provided as a conclusion.

Design and Implementation of Chronic Disease Risk Analysis System according to Personalized Food Intake Preferences (개인 식품섭취 선호도에 따른 만성질환 발생 위험도 분석 시스템 설계 및 구현)

  • Jeon, So Hye;Kim, Nam Hyun
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.3
    • /
    • pp.147-155
    • /
    • 2014
  • While variety of content on the internet has increased with the development of IT and person's needs about suitable information are increasing rapidly, studies for personalized service have been actively performed. In the study, we proposed the Hypertension and Diabetes risk analysis system according to personal food intake preference using the analysis method of buying preferences in product recommendation system. For the analysis of food intake preference, the Pearson correlation coefficient is used to calculate similarity weights between each reference analysis data and sample data and then reference data should be grouping into the similarity weights and calculating risk of hypertension and diabetes each group. To evaluate the significance of this system, 1,021 subjects are applied the system. Hypertension and diabetes groups' risk is significant higher than normal group statistically so, it is confirmed that food intake preference and the diseases were relevant. In this paper, we verify the validity of hypertension and diabetes risk analysis system using a personal food intake preference.

A Predictive Algorithm using 2-way Collaborative Filtering for Recommender Systems (추천 시스템을 위한 2-way 협동적 필터링 방법을 이용한 예측 알고리즘)

  • Park, Ji-Sun;Kim, Taek-Hun;Ryu, Young-Suk;Yang, Sung-Bong
    • Journal of KIISE:Software and Applications
    • /
    • v.29 no.9
    • /
    • pp.669-675
    • /
    • 2002
  • In recent years most of personalized recommender systems in electronic commerce utilize collaborative filtering algorithm in order to recommend more appropriate items. User-based collaborative filtering is based on the ratings of other users who have similar preferences to a user in order to predict the rating of an item that the user hasn't seen yet. This nay decrease the accuracy of prediction because the similarity between two users is computed with respect to the two users and only when an item has been rated by the users. In item-based collaborative filtering, the preference of an item is predicted based on the similarity between the item and each of other items that have rated by users. This method, however, uses the ratings of users who are not the neighbors of a user for computing the similarity between a pair of items. Hence item-based collaborative filtering may degrade the accuracy of a recommender system. In this paper, we present a new approach that a user's neighborhood is used when we compute the similarity between the items in traditional item-based collaborative filtering in order to compensate the weak points of the current item-based collaborative filtering and to improve the prediction accuracy. We empirically evaluate the accuracy of our approach to compare with several different collaborative filtering approaches using the EachMovie collaborative filtering data set. The experimental results show that our approach provides better quality in prediction and recommendation list than other collaborative filtering approaches.

A Study on the Effect of Network Centralities on Recommendation Performance (네트워크 중심성 척도가 추천 성능에 미치는 영향에 대한 연구)

  • Lee, Dongwon
    • Journal of Intelligence and Information Systems
    • /
    • v.27 no.1
    • /
    • pp.23-46
    • /
    • 2021
  • Collaborative filtering, which is often used in personalization recommendations, is recognized as a very useful technique to find similar customers and recommend products to them based on their purchase history. However, the traditional collaborative filtering technique has raised the question of having difficulty calculating the similarity for new customers or products due to the method of calculating similaritiesbased on direct connections and common features among customers. For this reason, a hybrid technique was designed to use content-based filtering techniques together. On the one hand, efforts have been made to solve these problems by applying the structural characteristics of social networks. This applies a method of indirectly calculating similarities through their similar customers placed between them. This means creating a customer's network based on purchasing data and calculating the similarity between the two based on the features of the network that indirectly connects the two customers within this network. Such similarity can be used as a measure to predict whether the target customer accepts recommendations. The centrality metrics of networks can be utilized for the calculation of these similarities. Different centrality metrics have important implications in that they may have different effects on recommended performance. In this study, furthermore, the effect of these centrality metrics on the performance of recommendation may vary depending on recommender algorithms. In addition, recommendation techniques using network analysis can be expected to contribute to increasing recommendation performance even if they apply not only to new customers or products but also to entire customers or products. By considering a customer's purchase of an item as a link generated between the customer and the item on the network, the prediction of user acceptance of recommendation is solved as a prediction of whether a new link will be created between them. As the classification models fit the purpose of solving the binary problem of whether the link is engaged or not, decision tree, k-nearest neighbors (KNN), logistic regression, artificial neural network, and support vector machine (SVM) are selected in the research. The data for performance evaluation used order data collected from an online shopping mall over four years and two months. Among them, the previous three years and eight months constitute social networks composed of and the experiment was conducted by organizing the data collected into the social network. The next four months' records were used to train and evaluate recommender models. Experiments with the centrality metrics applied to each model show that the recommendation acceptance rates of the centrality metrics are different for each algorithm at a meaningful level. In this work, we analyzed only four commonly used centrality metrics: degree centrality, betweenness centrality, closeness centrality, and eigenvector centrality. Eigenvector centrality records the lowest performance in all models except support vector machines. Closeness centrality and betweenness centrality show similar performance across all models. Degree centrality ranking moderate across overall models while betweenness centrality always ranking higher than degree centrality. Finally, closeness centrality is characterized by distinct differences in performance according to the model. It ranks first in logistic regression, artificial neural network, and decision tree withnumerically high performance. However, it only records very low rankings in support vector machine and K-neighborhood with low-performance levels. As the experiment results reveal, in a classification model, network centrality metrics over a subnetwork that connects the two nodes can effectively predict the connectivity between two nodes in a social network. Furthermore, each metric has a different performance depending on the classification model type. This result implies that choosing appropriate metrics for each algorithm can lead to achieving higher recommendation performance. In general, betweenness centrality can guarantee a high level of performance in any model. It would be possible to consider the introduction of proximity centrality to obtain higher performance for certain models.

Personalized Media Control Method using Probabilistic Fuzzy Rule-based Learning (확률적 퍼지 룰 기반 학습에 의한 개인화된 미디어 제어 방법)

  • Lee, Hyong-Euk;Kim, Yong-Hwi;Lee, Tae-Youb;Park, Kwang-Hyun;Kim, Yong-Soo;Cho, Joon-Myun;Bien, Z. Zenn
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.17 no.2
    • /
    • pp.244-251
    • /
    • 2007
  • Intention reading technique is essential to provide personalized services toward more convenient and human-friendly services in complex ubiquitous environment such as a smart home. If a system has knowledge about an user's intention of his/her behavioral pattern, the system can provide mote qualified and satisfactory services automatically in advance to the user's explicit command. In this sense, learning capability is considered as a key function for the intention reading technique in view of knowledge discovery. In this paper, ore introduce a personalized media control method for a possible application iii a smart home. Note that data pattern such as human behavior contains lots of inconsistent data due to limitation of feature extraction and insufficiently available features, where separable data groups are intermingled with inseparable data groups. To deal with such a data pattern, we introduce an effective engineering approach with the combination of fuzzy logic and probabilistic reasoning. The proposed learning system, which is based on IFCS (Iterative Fuzzy Clustering with Supervision) algorithm, extract probabilistic fuzzy rules effectively from the given numerical training data pattern. Furthermore, an extended architectural design methodology of the learning system incorporating with the IFCS algorithm are introduced. Finally, experimental results of the media contents recommendation system are given to show the effectiveness of the proposed system.

Personalized Exhibition Booth Recommendation Methodology Using Sequential Association Rule (순차 연관 규칙을 이용한 개인화된 전시 부스 추천 방법)

  • Moon, Hyun-Sil;Jung, Min-Kyu;Kim, Jae-Kyeong;Kim, Hyea-Kyeong
    • Journal of Intelligence and Information Systems
    • /
    • v.16 no.4
    • /
    • pp.195-211
    • /
    • 2010
  • An exhibition is defined as market events for specific duration to present exhibitors' main product range to either business or private visitors, and it also plays a key role as effective marketing channels. Especially, as the effect of the opinions of the visitors after the exhibition impacts directly on sales or the image of companies, exhibition organizers must consider various needs of visitors. To meet needs of visitors, ubiquitous technologies have been applied in some exhibitions. However, despite of the development of the ubiquitous technologies, their services cannot always reflect visitors' preferences as they only generate information when visitors request. As a result, they have reached their limit to meet needs of visitors, which consequently might lead them to loss of marketing opportunity. Recommendation systems can be the right type to overcome these limitations. They can recommend the booths to coincide with visitors' preferences, so that they help visitors who are in difficulty for choices in exhibition environment. One of the most successful and widely used technologies for building recommender systems is called Collaborative Filtering. Traditional recommender systems, however, only use neighbors' evaluations or behaviors for a personalized prediction. Therefore, they can not reflect visitors' dynamic preference, and also lack of accuracy in exhibition environment. Although there is much useful information to infer visitors' preference in ubiquitous environment (e.g., visitors' current location, booth visit path, and so on), they use only limited information for recommendation. In this study, we propose a booth recommendation methodology using Sequential Association Rule which considers the sequence of visiting. Recent studies of Sequential Association Rule use the constraints to improve the performance. However, since traditional Sequential Association Rule considers the whole rules to recommendation, they have a scalability problem when they are adapted to a large exhibition scale. To solve this problem, our methodology composes the confidence database before recommendation process. To compose the confidence database, we first search preceding rules which have the frequency above threshold. Next, we compute the confidences of each preceding rules to each booth which is not contained in preceding rules. Therefore, the confidence database has two kinds of information which are preceding rules and their confidence to each booth. In recommendation process, we just generate preceding rules of the target visitors based on the records of the visits, and recommend booths according to the confidence database. Throughout these steps, we expect reduction of time spent on recommendation process. To evaluate proposed methodology, we use real booth visit records which are collected by RFID technology in IT exhibition. Booth visit records also contain the visit sequence of each visitor. We compare the performance of proposed methodology with traditional Collaborative Filtering system. As a result, our proposed methodology generally shows higher performance than traditional Collaborative Filtering. We can also see some features of it in experimental results. First, it shows the highest performance at one booth recommendation. It detects preceding rules with some portions of visitors. Therefore, if there is a visitor who moved with very a different pattern compared to the whole visitors, it cannot give a correct recommendation for him/her even though we increase the number of recommendation. Trained by the whole visitors, it cannot correctly give recommendation to visitors who have a unique path. Second, the performance of general recommendation systems increase as time expands. However, our methodology shows higher performance with limited information like one or two time periods. Therefore, not only can it recommend even if there is not much information of the target visitors' booth visit records, but also it uses only small amount of information in recommendation process. We expect that it can give real?time recommendations in exhibition environment. Overall, our methodology shows higher performance ability than traditional Collaborative Filtering systems, we expect it could be applied in booth recommendation system to satisfy visitors in exhibition environment.