⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 netflixmovie.java

📁 一个简单的mapreduce实现
💻 JAVA
字号:
//// Author - Jack Hebert (jhebert@cs.washington.edu)// Copyright 2007// Distributed under GPLv3//import java.util.*;public class NetflixMovie {	public String movie_id = "";	public ArrayList<Triple> features; 		public NetflixMovie(String id, String data) {		this.movie_id = id;		String[] toAdd = data.split(";");		this.features = new ArrayList<Triple>();		for(String s: toAdd) {			//if(this.features.size()>1000)			//	break;			this.features.add(new Triple(s));		}	}	// This returns the number of matching users.	public int MatchCount(NetflixMovie movie, int thresh) {		Iterator<Triple> it1 = this.features.iterator();		Iterator<Triple> it2 = movie.features.iterator();		int matchCount = 0;		Integer one = null;		Integer two = null;		while((it1.hasNext())&&(it2.hasNext())) {			if((one==null)&&(two==null)) {				one = it1.next().one;				two = it2.next().one;			}			if(one.equals(two)) {				matchCount += 1;				one = it1.next().one;				two = it2.next().one;			} else if(one.compareTo(two)<0)				one = it1.next().one;			else				two = it2.next().one;			if(matchCount>thresh)				break;		}		return matchCount;	}		// This returns the number of matching users.	public int MatchCount(NetflixMovie movie) {		Iterator<Triple> it1 = this.features.iterator();		Iterator<Triple> it2 = movie.features.iterator();		int matchCount = 0;		Integer one = null;		Integer two = null;		while((it1.hasNext())&&(it2.hasNext())) {			if((one==null)&&(two==null)) {				one = it1.next().one;				two = it2.next().one;			}			if(one.equals(two)) {				matchCount += 1;				one = it1.next().one;				two = it2.next().one;			} else if(one.compareTo(two)<0)				one = it1.next().one;			else				two = it2.next().one;		}		return matchCount;	}			// This returns the number of matching users divided by the total number of users	// reviewing the lesser-reviewed movie.	public double SimpleDistance(NetflixMovie movie) {		Iterator<Triple> it1 = this.features.iterator();		Iterator<Triple> it2 = movie.features.iterator();		int matchCount = 0;		int totalCount = 1;		Integer one = null;		Integer two = null;		while((it1.hasNext())&&(it2.hasNext())) {			if((one==null)&&(two==null)) {				one = it1.next().one;				two = it2.next().one;			}			if(one.equals(two)) {				matchCount += 1;				one = it1.next().one;				two = it2.next().one;			} else if(one.compareTo(two)<0)				one = it1.next().one;			else				two = it2.next().one;			totalCount +=1;		}		return matchCount / (double)totalCount;	}			public double ComplexDistance(NetflixMovie movie) {		return 0.0;	}			public class Triple {		public Integer one;		public Integer two;		public Triple(String data) {			String[] items = data.split(",");			one = new Integer(items[0]);			two = new Integer(items[1]);		}	}}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -