• Title/Summary/Keyword: Collaborative Clustering

Search Result 93, Processing Time 0.02 seconds

Analysis of Reference Inquiries in the Field of Social Science in the Collaborative Reference Service Using the Co-Word Technique

  • Cho, Jane
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.49 no.1
    • /
    • pp.129-148
    • /
    • 2015
  • This study grasped the true nature of the inquiry domain by analysing the requests for collaborative reference service in the social science field using the co-word technique, and schematized the intellectual structure. First, this study extracted 748 uncontrolled keywords from inquiries for reference in the field of social science. Second, calculated similarity indices between the words on the basis of co-occurrence frequency, and performed not only clustering but also MDS mapping. Third, to grasp the difference in inquiries for reference by period, dividing the period into two parts, and performed comparative analysis. As a result, there formed 5 clusters and "Korea Education" showed an overwhelming size with 40.3% among those clusters. The result of the analysis through the period division showed there were many questions about "Education" during the first half, while a lot of inquiries with focus on "welfare and business information" during the second half.

An Inference Similarity-based Federated Learning Framework for Enhancing Collaborative Perception in Autonomous Driving

  • Zilong Jin;Chi Zhang;Lejun Zhang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.18 no.5
    • /
    • pp.1223-1237
    • /
    • 2024
  • Autonomous vehicles use onboard sensors to sense the surrounding environment. In complex autonomous driving scenarios, the detection and recognition capabilities are constrained, which may result in serious accidents. An efficient way to enhance the detection and recognition capabilities is establishing collaborations with the neighbor vehicles. However, the collaborations introduce additional challenges in terms of the data heterogeneity, communication cost, and data privacy. In this paper, a novel personalized federated learning framework is proposed for addressing the challenges and enabling efficient collaborations in autonomous driving environment. For obtaining a global model, vehicles perform local training and transmit logits to a central unit instead of the entire model, and thus the communication cost is minimized, and the data privacy is protected. Then, the inference similarity is derived for capturing the characteristics of data heterogeneity. The vehicles are divided into clusters based on the inference similarity and a weighted aggregation is performed within a cluster. Finally, the vehicles download the corresponding aggregated global model and train a personalized model which is personalized for the cluster that has similar data distribution, so that accuracy is not affected by heterogeneous data. Experimental results demonstrate significant advantages of our proposed method in improving the efficiency of collaborative perception and reducing communication cost.

A Recommender System Model Combining Collaborative filtering and SOM Neural Networks (협동적 필터링과 SOM 신경망을 결합한 추천시스템 모델)

  • Lee, Mi-Hee;Woo, Young-Tae
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.9
    • /
    • pp.1213-1226
    • /
    • 2008
  • A recommender system supports people in making recommendations finding a set of people who are likely to provide good recommendations for a given person, or deriving recommendations from implicit behavior such as browsing activity, buying patterns, and time on task. We proposed new recommender system which combined SOM(Self-Organizing Map) neural networks with the Collaborative filtering which most recommender systems hat applied First, we segmented user groups according to demographic characteristics and then we trained the SOM with people's preferences as ito inputs. Finally we applied the classic collaborative filtering to the clustering with similarity in which an recommendation seeker belonged to, and therefore we didn't have to apply the collaborative filtering to the whose data set. Experiments were run for EachMovies data set. The results indicated that the predictive accuracy was increased in terms of MAE(Mean-Absolute-Error).

  • PDF

Automatic Recommendation of (IP)TV programs based on A Rank Model using Collaborative Filtering (협업 필터링을 이용한 순위 정렬 모델 기반 (IP)TV 프로그램 자동 추천)

  • Kim, Eun-Hui;Pyo, Shin-Jee;Kim, Mun-Churl
    • Journal of Broadcast Engineering
    • /
    • v.14 no.2
    • /
    • pp.238-252
    • /
    • 2009
  • Due to the rapid increase of available contents via the convergence of broadcasting and internet, the efficient access to personally preferred contents has become an important issue. In this paper, for recommendation scheme for TV programs using a collaborative filtering technique is studied. For recommendation of user preferred TV programs, our proposed recommendation scheme consists of offline and online computation. About offline computation, we propose reasoning implicitly each user's preference in TV programs in terms of program contents, genres and channels, and propose clustering users based on each user's preferences in terms of genres and channels by dynamic fuzzy clustering method. After an active user logs in, to recommend TV programs to the user with high accuracy, the online computation includes pulling similar users to an active user by similarity measure based on the standard preference list of active user and filtering-out of the watched TV programs of the similar users, which do not exist in EPG and ranking of the remaining TV programs by proposed rank model. Especially, in this paper, the BM (Best Match) algorithm is extended to make the recommended TV programs be ranked by taking into account user's preferences. The experimental results show that the proposed scheme with the extended BM model yields 62.1% of prediction accuracy in top five recommendations for the TV watching history of 2,441 people.

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.

Bayesian Learning through Weight of Listener's Prefered Music Site for Music Recommender System

  • Cho, Young Sung;Moon, Song Chul
    • Journal of Information Technology Applications and Management
    • /
    • v.23 no.1
    • /
    • pp.33-43
    • /
    • 2016
  • 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 it is convenient and affordable for the listeners to do that. We use Bayesian learning through weight of listener's prefered music site such as Melon, Billboard, Bugs Music, Soribada, and Gini. We reflect most popular current songs across all genres and styles for music recommender system using user profile. It is necessary for us to make the task of preprocessing of clustering the preference with weight of listener's preferred music site with popular music charts. 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.

The Development of Recommender System Using Clustering-based CBR (클러스터링 기반 사례기반추론을 이용한 추천시스템 개발)

  • Lee, Hui-Jeong;Hong, Tae-Ho
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2004.05a
    • /
    • pp.519-522
    • /
    • 2004
  • 웹의 급격한 확산과 더불어 고객에게 맞춤화된 정보 제공의 필요성이 높아지고 있다. 또한 전자상거래 기업은 맞춤화와 개인화 서비스를 실현하기 위해서 웹 기반의 추천시스템에 많은 관심을 가지고 있다. 협업필터링(Collaborative filtering)은 개인화된 정보필터링 기법으로 추천시스템에서 가장 많이 사용되고 있다. 본 연구에서는 MovieLens 데이터 셋의 아이템속성을 고려하여 클러스터링 기반의 사례기반추론을 통한 협업필터링 추천시스템을 개발하고 기존의 방법과 제안된 모델의 성과를 비교 분석하였다.

  • PDF

Preprocessing Methods for Improving Prediction Accuracy in Recommender Systems (추천 시스템의 예측 정확도 향상을 위한 전처리 방법)

  • 박석인;김택헌;류영석;양성봉
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2002.04b
    • /
    • pp.247-249
    • /
    • 2002
  • 협력적 여과(collaborative filtering) 방법을 사용하는 추천 시스템에서 예측 정확도를 높이는 방법들 중 하나는 군집화(clustering)방법이 있다. 군집화 방법은 선호도가 유사한 사용자들을 미리 같은 군집으로 만들고, 군집 내에 속한 사용자들을 이웃으로 선정하여 예측을 수행하기 때문에 군집화의 결과가 예측의 정확도에 직접적인 영향을 주게 된다. 본 연구에서는 군집화 결과의 향상을 위해 데이터를 전 처리하는 두 가지 방법과 군집화의 특성을 이용한 새로운 예측식을 제안하고, 기존 연구 방법과의 비교 실험을 통해 실험결과를 분석한다.

  • PDF

Evaluation of Collaborative Filtering Methods for Developing Online Music Contents Recommendation System (온라인 음악 콘텐츠 추천 시스템 구현을 위한 협업 필터링 기법들의 비교 평가)

  • Yoo, Youngseok;Kim, Jiyeon;Sohn, Bangyong;Jung, Jongjin
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.66 no.7
    • /
    • pp.1083-1091
    • /
    • 2017
  • As big data technologies have been developed and massive data have exploded from users through various channels, CEO of global IT enterprise mentioned core importance of data in next generation business. Therefore various machine learning technologies have been necessary to apply data driven services but especially recommendation has been core technique in viewpoint of directly providing summarized information or exact choice of items to users in information flooding environment. Recently evolved recommendation techniques have been proposed by many researchers and most of service companies with big data tried to apply refined recommendation method on their online business. For example, Amazon used item to item collaborative filtering method on its sales distribution platform. In this paper, we develop a commercial web service for suggesting music contents and implement three representative collaborative filtering methods on the service. We also produce recommendation lists with three methods based on real world sample data and evaluate the usefulness of them by comparison among the produced result. This study is meaningful in terms of suggesting the right direction and practicality when companies and developers want to develop web services by applying big data based recommendation techniques in practical environment.

Probabilistic Reinterpretation of Collaborative Filtering Approaches Considering Cluster Information of Item Contents (항목 내용물의 클러스터 정보를 고려한 협력필터링 방법의 확률적 재해석)

  • Kim, Byeong-Man;Li, Qing;Oh, Sang-Yeop
    • 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.