LARSALocation-AwareRecommenderSystem.pptVIP

4 Non-spatial User Ratings For Spatial Items user, rating, item, ilocation travel locality travel penalty expensive computational overhead so,employs “early termination” * 4.1 Query Processing Algorithm 1.找出全部item中，TravelPenalty最小的k个item，将k个item按照RecScore从大到小排序，形成表R 2.设LowestRecScore为R中最小的 也就是第K个 RecScore值 3.找出剩余item中TravelPenalty最小的item 4.设 MaxPossibleScore MAX_RATING – TravelPenalty 5.IF MaxPossibleScore LowestRecScore 6.不再找了，直接return R 7. 算出此item的RecScore 8.IF RecScore LowestRecScore RecScore替换LowestRecScore 进入R 重新找一个LowestRecScore 回到3 * 4.2 Incremental Travel Penalty Comput