• Title/Summary/Keyword: 평균 사용자 유사도

Search Result 109, Processing Time 0.028 seconds

Emotion-based Video Scene Retrieval using Interactive Genetic Algorithm (대화형 유전자 알고리즘을 이용한 감성기반 비디오 장면 검색)

  • Yoo Hun-Woo;Cho Sung-Bae
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.10 no.6
    • /
    • pp.514-528
    • /
    • 2004
  • An emotion-based video scene retrieval algorithm is proposed in this paper. First, abrupt/gradual shot boundaries are detected in the video clip representing a specific story Then, five video features such as 'average color histogram' 'average brightness', 'average edge histogram', 'average shot duration', and 'gradual change rate' are extracted from each of the videos and mapping between these features and the emotional space that user has in mind is achieved by an interactive genetic algorithm. Once the proposed algorithm has selected videos that contain the corresponding emotion from initial population of videos, feature vectors from the selected videos are regarded as chromosomes and a genetic crossover is applied over them. Next, new chromosomes after crossover and feature vectors in the database videos are compared based on the similarity function to obtain the most similar videos as solutions of the next generation. By iterating above procedures, new population of videos that user has in mind are retrieved. In order to show the validity of the proposed method, six example categories such as 'action', 'excitement', 'suspense', 'quietness', 'relaxation', 'happiness' are used as emotions for experiments. Over 300 commercial videos, retrieval results show 70% effectiveness in average.

Scalable Collaborative Filtering Technique based on Adaptive Clustering (적응형 군집화 기반 확장 용이한 협업 필터링 기법)

  • Lee, O-Joun;Hong, Min-Sung;Lee, Won-Jin;Lee, Jae-Dong
    • Journal of Intelligence and Information Systems
    • /
    • v.20 no.2
    • /
    • pp.73-92
    • /
    • 2014
  • An Adaptive Clustering-based Collaborative Filtering Technique was proposed to solve the fundamental problems of collaborative filtering, such as cold-start problems, scalability problems and data sparsity problems. Previous collaborative filtering techniques were carried out according to the recommendations based on the predicted preference of the user to a particular item using a similar item subset and a similar user subset composed based on the preference of users to items. For this reason, if the density of the user preference matrix is low, the reliability of the recommendation system will decrease rapidly. Therefore, the difficulty of creating a similar item subset and similar user subset will be increased. In addition, as the scale of service increases, the time needed to create a similar item subset and similar user subset increases geometrically, and the response time of the recommendation system is then increased. To solve these problems, this paper suggests a collaborative filtering technique that adapts a condition actively to the model and adopts the concepts of a context-based filtering technique. This technique consists of four major methodologies. First, items are made, the users are clustered according their feature vectors, and an inter-cluster preference between each item cluster and user cluster is then assumed. According to this method, the run-time for creating a similar item subset or user subset can be economized, the reliability of a recommendation system can be made higher than that using only the user preference information for creating a similar item subset or similar user subset, and the cold start problem can be partially solved. Second, recommendations are made using the prior composed item and user clusters and inter-cluster preference between each item cluster and user cluster. In this phase, a list of items is made for users by examining the item clusters in the order of the size of the inter-cluster preference of the user cluster, in which the user belongs, and selecting and ranking the items according to the predicted or recorded user preference information. Using this method, the creation of a recommendation model phase bears the highest load of the recommendation system, and it minimizes the load of the recommendation system in run-time. Therefore, the scalability problem and large scale recommendation system can be performed with collaborative filtering, which is highly reliable. Third, the missing user preference information is predicted using the item and user clusters. Using this method, the problem caused by the low density of the user preference matrix can be mitigated. Existing studies on this used an item-based prediction or user-based prediction. In this paper, Hao Ji's idea, which uses both an item-based prediction and user-based prediction, was improved. The reliability of the recommendation service can be improved by combining the predictive values of both techniques by applying the condition of the recommendation model. By predicting the user preference based on the item or user clusters, the time required to predict the user preference can be reduced, and missing user preference in run-time can be predicted. Fourth, the item and user feature vector can be made to learn the following input of the user feedback. This phase applied normalized user feedback to the item and user feature vector. This method can mitigate the problems caused by the use of the concepts of context-based filtering, such as the item and user feature vector based on the user profile and item properties. The problems with using the item and user feature vector are due to the limitation of quantifying the qualitative features of the items and users. Therefore, the elements of the user and item feature vectors are made to match one to one, and if user feedback to a particular item is obtained, it will be applied to the feature vector using the opposite one. Verification of this method was accomplished by comparing the performance with existing hybrid filtering techniques. Two methods were used for verification: MAE(Mean Absolute Error) and response time. Using MAE, this technique was confirmed to improve the reliability of the recommendation system. Using the response time, this technique was found to be suitable for a large scaled recommendation system. This paper suggested an Adaptive Clustering-based Collaborative Filtering Technique with high reliability and low time complexity, but it had some limitations. This technique focused on reducing the time complexity. Hence, an improvement in reliability was not expected. The next topic will be to improve this technique by rule-based filtering.

Building Error-Reflected Models for Collaborative Filtering Recommender System (협업적 여과 추천 시스템을 위한 에러반영 모델 구축)

  • Kim, Heung-Nam;Jo, Geun-Sik
    • The KIPS Transactions:PartD
    • /
    • v.16D no.3
    • /
    • pp.451-462
    • /
    • 2009
  • Collaborative Filtering (CF), one of the most successful technologies among recommender systems, is a system assisting users in easily finding the useful information. However, despite its success and popularity, CF encounters a serious limitation with quality evaluation, called cold start problems. To alleviate this limitation, in this paper, we propose a unique method of building models derived from explicit ratings and applying the models to CF recommender systems. The proposed method is divided into two phases, an offline phase and an online phase. First, the offline phase is a building pre-computed model phase in which most of tasks can be conducted. Second, the online phase is either a prediction or recommendation phase in which the models are used. In a model building phase, we first determine a priori predicted rating and subsequently identify prediction errors for each user. From this error information, an error-reflected model is constructed. The error-reflected model, which is reflected average prior prediction errors of user neighbors and item neighbors, can make accurate predictions in the situation where users or items have few opinions; this is known as the cold start problems. In addition, in order to reduce the re-building tasks, the error-reflected model is designed such that the model is updated effectively and users'new opinions are reflected incrementally, even when users present a new rating feedback.

Development of Personalized Learning Course Recommendation Model for ITS (ITS를 위한 개인화 학습코스 추천 모델 개발)

  • Han, Ji-Won;Jo, Jae-Choon;Lim, Heui-Seok
    • Journal of the Korea Convergence Society
    • /
    • v.9 no.10
    • /
    • pp.21-28
    • /
    • 2018
  • To help users who are experiencing difficulties finding the right learning course corresponding to their level of proficiency, we developed a recommendation model for personalized learning course for Intelligence Tutoring System(ITS). The Personalized Learning Course Recommendation model for ITS analyzes the learner profile and extracts the keyword by calculating the weight of each word. The similarity of vector between extracted words is measured through the cosine similarity method. Finally, the three courses of top similarity are recommended for learners. To analyze the effects of the recommendation model, we applied the recommendation model to the Women's ability development center. And mean, standard deviation, skewness, and kurtosis values of question items were calculated through the satisfaction survey. The results of the experiment showed high satisfaction levels in accuracy, novelty, self-reference and usefulness, which proved the effectiveness of the recommendation model. This study is meaningful in the sense that it suggested a learner-centered recommendation system based on machine learning, which has not been researched enough both in domestic, foreign domains.

Automatic TV Program Recommendation using LDA based Latent Topic Inference (LDA 기반 은닉 토픽 추론을 이용한 TV 프로그램 자동 추천)

  • Kim, Eun-Hui;Pyo, Shin-Jee;Kim, Mun-Churl
    • Journal of Broadcast Engineering
    • /
    • v.17 no.2
    • /
    • pp.270-283
    • /
    • 2012
  • With the advent of multi-channel TV, IPTV and smart TV services, excessive amounts of TV program contents become available at users' sides, which makes it very difficult for TV viewers to easily find and consume their preferred TV programs. Therefore, the service of automatic TV recommendation is an important issue for TV users for future intelligent TV services, which allows to improve access to their preferred TV contents. In this paper, we present a recommendation model based on statistical machine learning using a collaborative filtering concept by taking in account both public and personal preferences on TV program contents. For this, users' preference on TV programs is modeled as a latent topic variable using LDA (Latent Dirichlet Allocation) which is recently applied in various application domains. To apply LDA for TV recommendation appropriately, TV viewers's interested topics is regarded as latent topics in LDA, and asymmetric Dirichlet distribution is applied on the LDA which can reveal the diversity of the TV viewers' interests on topics based on the analysis of the real TV usage history data. The experimental results show that the proposed LDA based TV recommendation method yields average 66.5% with top 5 ranked TV programs in weekly recommendation, average 77.9% precision in bimonthly recommendation with top 5 ranked TV programs for the TV usage history data of similar taste user groups.

Shape region segmentation based on color and edge characteristics of moving images (동영상의 컬러 및 에지 정보에 기초한 shape 영역 segmentation 기법 연구)

  • Park, Jin-Nam;Lee, Jae-Duck;Yoon, Sung-Soo;Huh, Young;Jung, Sung-Hwan
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2001.11b
    • /
    • pp.149-154
    • /
    • 2001
  • 멀티미디어 정보표현 기술인 MPEG-7 표준이 빠른 속도의 진전을 보임에 따라 이를 활용한 검색 기술 개발도 활발히 진행 중에 있다 방대한 량의 동영상 내용 검색 기술 연구에 있어서 우선적으로 고려되어야 할 부분이 내용이 연속되는 프레임들의 분류이다. 이를 위해서는 물리적인 장면전환이 이루어지는 부분에 대한 실시간 자동 cut detection 기술 및 이 컷 프레임 영상에 대한 내용 기술을 자동적으로 수행할 필요성이 있다. 각 컷 프레임의 자동 내용 기술의 전처리로써 본 논문에서는 장면전환이 생기는 프레임의 영상의 어떠한 정보도 사전 정보로 취하지 않고 사용자의 개입이 없는 상황에서 영상의 컬러 특성 및 에지 정보만을 가지고 shape 영역 segmentation을 자동으로 실행하는 방법을 제안한다. 제안한 방법의 성능은 segmentation된 영상과 원 영상과의 영역비교를 통한 유사도에 의해 평가하며, 시뮬레이션 결과에서 제안한 알고리즘은 평균 90%이상의 영역 분할이 정확하게 됨을 알 수 있었고, 컬러의 구분이 명확하지 않은 자연영상에서도 robust한 segmentation 결과를 나타냄을 본 연구를 통하여 알 수 있었다.

  • PDF

XML Schema Matching based on Ontology Update for the Transformation of XML Documents (XML 문서의 변환을 위한 온톨로지 갱신 기반 XML 스키마 매칭)

  • Lee, Kyong-Ho;Lee, Jun-Seung
    • Journal of KIISE:Databases
    • /
    • v.33 no.7
    • /
    • pp.727-740
    • /
    • 2006
  • Schema matching is important as a prerequisite to the transformation of XML documents. This paper presents a schema matching method for the transformation of XML documents. The proposed method consists of two steps: preliminary matching relationships between leaf nodes in the two XML schemas are computed based on proposed ontology and leaf node similarity, and final matchings are extracted based on a proposed path similarity. Particularly, for a sophisticated schema matching, the proposed ontology is incrementally updated by users' feedback. furthermore, since the ontology can describe various relationships between concepts, the proposed method can compute complex matchings as well as simple matchings. Experimental results with schemas used in various domains show that the proposed method is superior to previous works, resulting in a precision of 97% and a recall of 83 % on the average. Furthermore, the dynamic ontology increased by 9 percent overall.

Design and Implementation of a Content-based Color Image Retrieval System based on Color -Spatial Feature (색상-공간 특징을 사용한 내용기반 칼라 이미지 검색 시스템의 설계 및 구현)

  • An, Cheol-Ung;Kim, Seung-Ho
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.5 no.5
    • /
    • pp.628-638
    • /
    • 1999
  • In this paper, we presents a method of retrieving 24 bpp RGB images based on color-spatial features. For each image, it is subdivided into regions by using similarity of color after converting RGB color space to CIE L*u*v* color space that is perceptually uniform. Our segmentation algorithm constrains the size of region because a small region is discardable and a large region is difficult to extract spatial feature. For each region, averaging color and center of region are extracted to construct color-spatial features. During the image retrieval process, the color and spatial features of query are compared with those of the database images using our similarity measure to determine the set of candidate images to be retrieved. We implement a content-based color image retrieval system using the proposed method. The system is able to retrieve images by user graphic or example image query. Experimental results show that Recall/Precision is 0.80/0.84.

Performance evaluation of diversity reception of underwater acoustic code division multiple access using lake experiment (저수지 실험을 통한 수중 음향 코드 분할 다중 접속 방식의 다이버시티 수신 성능 검증)

  • Seo, Bo-Min;Cho, Ho-Shin
    • The Journal of the Acoustical Society of Korea
    • /
    • v.36 no.1
    • /
    • pp.39-48
    • /
    • 2017
  • CDMA (Code Division Multiple Access) is promising medium access control schemes for underwater acoustic sensor networks because of its robustness against frequency-selective fading and high frequency-reuse efficiency. In this paper, we design diversity schemes of underwater CDMA transceiver for the forward and reverse links. User data are multiplexed by Walsh code and a pseudo random noise code acquisition process is added for phase error correction before decoding the user data at the receiver. Then, the diversity reception using equal gain combining and maximal ratio combining is performed in order to minimize performance degradation caused by rich multipath fading of underwater acoustic channel. We evaluated the performance of diversity transceiver through lake experiment, which was performed at Lake Kyungcheon, Mungyeong city using two transmitters and two receivers placed 460 m apart at an average depth of 40 m. The lake experiment results show that user data are recovered with error-free in both of the forward and reverse links.

A Study on Clustering of Core Competencies to Deploy in and Develop Courseworks for New Digital Technology (카드소팅을 활용한 디지털 신기술 과정 핵심역량 군집화에 관한 연구)

  • Ji-Woon Lee;Ho Lee;Joung-Huem Kwon
    • Journal of Practical Engineering Education
    • /
    • v.14 no.3
    • /
    • pp.565-572
    • /
    • 2022
  • Card sorting is a useful data collection method for understanding users' perceptions of relationships between items. In general, card sorting is an intuitive and cost-effective technique that is very useful for user research and evaluation. In this study, the core competencies of each field were used as competency cards used in the next stage of card sorting for course development, and the clustering results were derived by applying the K-means algorithm to cluster the results. As a result of card sorting, competency clustering for core competencies for each occupation in each field was verified based on Participant-Centric Analysis (PCA). For the number of core competency cards for each occupation, the number of participants who agreed appropriately for clustering and the degree of card similarity were derived compared to the number of sorting participants.