• 제목/요약/키워드: Preference probability matrix

검색결과 4건 처리시간 0.019초

A Bayesian Approach to Paired Comparison of Several Products of Poisson Rates

  • Kim Dae-Hwang;Kim Hea-Jung
    • 한국통계학회:학술대회논문집
    • /
    • 한국통계학회 2004년도 학술발표논문집
    • /
    • pp.229-236
    • /
    • 2004
  • This article presents a multiple comparison ranking procedure for several products of the Poisson rates. A preference probability matrix that warrants the optimal comparison ranking is introduced. Using a Bayesian Monte Carlo method, we develop simulation-based procedure to estimate the matrix and obtain the optimal ranking via a row-sum scores method. Necessary theory and two illustrative examples are provided.

  • PDF

Study on Tag, Trust and Probability Matrix Factorization Based Social Network Recommendation

  • Liu, Zhigang;Zhong, Haidong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제12권5호
    • /
    • pp.2082-2102
    • /
    • 2018
  • In recent years, social network related applications such as WeChat, Facebook, Twitter and so on, have attracted hundreds of millions of people to share their experience, plan or organize, and attend social events with friends. In these operations, plenty of valuable information is accumulated, which makes an innovative approach to explore users' preference and overcome challenges in traditional recommender systems. Based on the study of the existing social network recommendation methods, we find there is an abundant information that can be incorporated into probability matrix factorization (PMF) model to handle challenges such as data sparsity in many recommender systems. Therefore, the research put forward a unified social network recommendation framework that combine tags, trust between users, ratings with PMF. The uniformed method is based on three existing recommendation models (SoRecUser, SoRecItem and SoRec), and the complexity analysis indicates that our approach has good effectiveness and can be applied to large-scale datasets. Furthermore, experimental results on publicly available Last.fm dataset show that our method outperforms the existing state-of-art social network recommendation approaches, measured by MAE and MRSE in different data sparse conditions.

선호도 전이 확률을 이용한 멀티미디어 컨텐츠 추천 시스템 (A Multimedia Contents Recommendation System using Preference Transition Probability)

  • 박성준;강상길;김영국
    • 한국지능시스템학회논문지
    • /
    • 제16권2호
    • /
    • pp.164-171
    • /
    • 2006
  • 최근에 서비스되기 시작한 디지털 멀티미디어 방송은 다양한 종류의 수많은 컨텐츠를 제공하기 때문에 고객은 때로 자신이 선호하는 컨텐츠를 찾는데 많은 시간을 소비한다. 심지어는 선호 컨텐츠를 찾는 동안 이미 방송이 끝날 수도 있다. 이와 같은 문제를 해결하기 위해서는 고객이 필요로 하는 최소 정보만을 추천하기 위한 방법이 필요하다. 본 논문에서는 고객이 시청한 컨텐츠 선호도 전이 확률을 이용하여 고객이 선호하는 컨텐츠를 미리 예측하여 추천하기 위한 알고리즘과 시스템을 제안한다. 제안하는 시스템은 클라이언트 관리자 에이전트, 모니터링 에이전트, 러닝 에이전트, 그리고 추천 에이전트 모듈로 구성된다. 클라이언트 관리자 에이전트는 다른 모듈과 상호 작용을 하면서 조정자 역할을 한다. 모니터링 에이전트는 컨텐츠에 대한 고객의 선호도를 분석하기 위해 고객이 이용했던 usage history 데이터를 수집하기 위한 에이전트이다. 러닝 에이전트는 고객으로부터 수집된 usage history 데이터를 정제하여 시간 변화에 따른 상태 전이 행렬로 모델링하기 위한 에이전트이다. 추천 에이전트는 고객의 상태 전이 행렬로 구성된 모델링 데이터에 본 논문에서 제안하는 선호도 전이 확률 모델을 이용하여 고객이 바로 다음에 선호하게 될 컨텐츠를 추천하기 위한 에이전트이다. 추천 에이전트 모듈에서 컨텐츠에 대한 고객의 선호도 전이 확률을 이용하는 추천 알고리즘을 제안한다. 제안하는 추천 시스템은 무선 인터넷 표준 플랫폼인 WIPI(Wireless Internet Platform for Interoperability) 플랫폼에서 프로토타입 시스템을 설계, 구현하였으며, 실험결과 제안된 선호도 전이 확률 모델의 추천 정확도가 전형적인 방법에 비해 효과적임을 보인다.

Service Deployment Strategy for Customer Experience and Cost Optimization under Hybrid Network Computing Environment

  • Ning Wang;Huiqing Wang;Xiaoting Wang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제17권11호
    • /
    • pp.3030-3049
    • /
    • 2023
  • With the development and wide application of hybrid network computing modes like cloud computing, edge computing and fog computing, the customer service requests and the collaborative optimization of various computing resources face huge challenges. Considering the characteristics of network environment resources, the optimized deployment of service resources is a feasible solution. So, in this paper, the optimal goals for deploying service resources are customer experience and service cost. The focus is on the system impact of deploying services on load, fault tolerance, service cost, and quality of service (QoS). Therefore, the alternate node filtering algorithm (ANF) and the adjustment factor of cost matrix are proposed in this paper to enhance the system service performance without changing the minimum total service cost, and corresponding theoretical proof has been provided. In addition, for improving the fault tolerance of system, the alternate node preference factor and algorithm (ANP) are presented, which can effectively reduce the probability of data copy loss, based on which an improved cost-efficient replica deployment strategy named ICERD is given. Finally, by simulating the random occurrence of cloud node failures in the experiments and comparing the ICERD strategy with representative strategies, it has been validated that the ICERD strategy proposed in this paper not only effectively reduces customer access latency, meets customers' QoS requests, and improves system service quality, but also maintains the load balancing of the entire system, reduces service cost, enhances system fault tolerance, which further confirm the effectiveness and reliability of the ICERD strategy.