推荐系统指标——NDCG Java 代码

public double ndcgBinary(Triple[][] paraTrainingMatrix, Triple[][] paraTestingMatrix, int paraNumItems, int paraK) {
		int[] rankList;
		int[] idealRatingsRankList;
		int tempNumUsers = paraTrainingMatrix.length;

		double resultNdcg = 0;
		double resultDcg = 0;
		double resultIdcg = 0;
		double[] tempPredictions;
		boolean[] itemsInTrainingSet = new boolean[paraNumItems];

		for (int i = 0; i < paraTrainingMatrix.length; i++) {
						
			for (int j = 0; j < paraNumItems; j++) {
				itemsInTrainingSet[j] = false;
			} // Of for j
			
			// exclude items in training set.
			for (int j = 0; j < paraTrainingMatrix[i].length; j++) {
				itemsInTrainingSet[paraTrainingMatrix[i][j].item] = true;
			} // Of for j

			// predict for the items which are not in training set.
			tempPredictions = new double[paraNumItems];
			for (int j = 0; j < paraNumItems; j++) {
				if (itemsInTrainingSet[j]) {
					continue;
				} // Of if
				tempPredictions[j] = predict(i, j);
			} // Of for j

			//
			rankList = findTopK(tempPredictions, itemsInTrainingSet, paraK);
			idealRatingsRankList = new int[rankList.length];
			int tempNumHitItems = 0;
			for (int tempRank = 0; tempRank < rankList.length; tempRank++) {
				int tempItem = rankList[tempRank];
				for (int tempInd = 0; tempInd < paraTestingMatrix[i].length; tempInd++) {
					int tempGroundTruthTestingItem = paraTestingMatrix[i][tempInd].item;
					if (tempItem == tempGroundTruthTestingItem) {
						idealRatingsRankList[tempNumHitItems] = tempItem;
						tempNumHitItems++;
						resultDcg += Math.log(2) / Math.log(tempRank + 2);
					} // Of if
				} // Of for tempInd
			} // Of for tempRank

			// Idcg
			for (int tempGTRank = 0; tempGTRank < tempNumHitItems; tempGTRank++) {
				resultIdcg += Math.log(2) / Math.log(tempGTRank + 2);
			} // Of for tempGTRank

			if(resultIdcg > 0) {
				resultNdcg += resultDcg / resultIdcg;
			}//of if
		} // Of for i
		resultNdcg /= tempNumUsers;
		return resultNdcg;
	}// Of ndcgBinary

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值