Java代码

1. public double caculateVectorSpace(Map<String, Integer> articleVectorMap, Map<String, Integer> classVectorMap) {   
2.         if (articleVectorMap == null || classVectorMap == null) {   
3.             if (logger.isDebugEnabled()) {   
4.                 logger.debug("itemVectorMap or classVectorMap is null");   
5.             }   
6.                
7.             return 20;   
8.         }   
9.            
10.         int dotItem = 0;   
11.         double denominatorOne = 0;   
12.         double denominatorTwo = 0;   
13.            
14.            
15.         for (Entry<String, Integer> entry : articleVectorMap.entrySet()) {   
16.             String word = entry.getKey();   
17.             double categoryWordFreq = 0;   
18.             double articleWordFreq = 0;   
19.                
20.             if (classVectorMap.containsKey(word)) {   
21.                 categoryWordFreq = classVectorMap.get(word).intValue() / classVectorMap.size();   
22.                 articleWordFreq = entry.getValue().intValue() / articleVectorMap.size();   
23.             }   
24.                
25.             dotItem += categoryWordFreq * articleWordFreq;   
26.             denominatorOne += categoryWordFreq * categoryWordFreq;   
27.             denominatorTwo += articleWordFreq * articleWordFreq;   
28.         }   
29.            
30.         double denominator = Math.sqrt(denominatorOne) * Math.sqrt(denominatorTwo);   
31.            
32.         double ratio =  dotItem / denominator;   
33.            
34.         return Math.acos(ratio);   
35.     }  

public double caculateVectorSpace(Map<String, Integer> articleVectorMap, Map<String, Integer> classVectorMap) {
		if (articleVectorMap == null || classVectorMap == null) {
			if (logger.isDebugEnabled()) {
				logger.debug("itemVectorMap or classVectorMap is null");
			}
			
			return 20;
		}
		
		int dotItem = 0;
		double denominatorOne = 0;
		double denominatorTwo = 0;
		
		
		for (Entry<String, Integer> entry : articleVectorMap.entrySet()) {
			String word = entry.getKey();
			double categoryWordFreq = 0;
			double articleWordFreq = 0;
			
			if (classVectorMap.containsKey(word)) {
				categoryWordFreq = classVectorMap.get(word).intValue() / classVectorMap.size();
				articleWordFreq = entry.getValue().intValue() / articleVectorMap.size();
			}
			
			dotItem += categoryWordFreq * articleWordFreq;
			denominatorOne += categoryWordFreq * categoryWordFreq;
			denominatorTwo += articleWordFreq * articleWordFreq;
		}
		
		double denominator = Math.sqrt(denominatorOne) * Math.sqrt(denominatorTwo);
		
		double ratio =  dotItem / denominator;
		
		return Math.acos(ratio);
	}

Java代码

1. protected Map<String, List<MatchCondition>> analyse(Map<String, Map<String, Integer>> articleVectorMap, Map<String, Map<String, Integer>> categoryVectorMap) {   
2.            
3.         Map<String, List<MatchCondition>> result = new HashMap<String, List<MatchCondition>>();   
4.            
5.         for (Entry<String, Map<String, Integer>> categoryEntry : categoryVectorMap.entrySet()) {   
6.                
7.             for (Entry<String, Map<String, Integer>> itemEntry : articleVectorMap.entrySet()) {   
8.                 double acos = caculateVector(itemEntry.getValue(), filterVectorMap(categoryEntry.getValue()));   
9.                 if (acos < vectorGene) {   
10.                     if (result.get(itemEntry.getKey()) != null) {   
11.                         List<MatchCondition> list = result.get(itemEntry.getKey());   
12.                            
13.                         if (list.size() < kNum) {   
14.                             list.add(new MatchCondition(itemEntry.getKey(), categoryEntry.getKey(), acos));   
15.                         } else {   
16.                             if (list.size() == kNum) {   
17.                                 Collections.sort(list, new MatchConditionComparator());   
18.                             }   
19.                                
20.                             int n = 0;   
21.                             for (MatchCondition condition : list) {   
22.                                 if (acos < condition.getAcos()) {   
23.                                     list.set(n, new MatchCondition(itemEntry.getKey(), categoryEntry.getKey(), acos));   
24.                                 }   
25.                                 n++;   
26.                             }   
27.                         }   
28.                     } else {   
29.                         List<MatchCondition> list = new LinkedList<MatchCondition>();   
30.                         list.add(new MatchCondition(itemEntry.getKey(), categoryEntry.getKey(), acos));   
31.                         result.put(itemEntry.getKey(), list);   
32.                     }   
33.                        
34.                 }   
35.             }   
36.                
37.         }   
38.            
39.         return result;   
40.     }  

protected Map<String, List<MatchCondition>> analyse(Map<String, Map<String, Integer>> articleVectorMap, Map<String, Map<String, Integer>> categoryVectorMap) {
		
		Map<String, List<MatchCondition>> result = new HashMap<String, List<MatchCondition>>();
		
		for (Entry<String, Map<String, Integer>> categoryEntry : categoryVectorMap.entrySet()) {
			
			for (Entry<String, Map<String, Integer>> itemEntry : articleVectorMap.entrySet()) {
				double acos = caculateVector(itemEntry.getValue(), filterVectorMap(categoryEntry.getValue()));
				if (acos < vectorGene) {
					if (result.get(itemEntry.getKey()) != null) {
						List<MatchCondition> list = result.get(itemEntry.getKey());
						
						if (list.size() < kNum) {
							list.add(new MatchCondition(itemEntry.getKey(), categoryEntry.getKey(), acos));
						} else {
							if (list.size() == kNum) {
								Collections.sort(list, new MatchConditionComparator());
							}
							
							int n = 0;
							for (MatchCondition condition : list) {
								if (acos < condition.getAcos()) {
									list.set(n, new MatchCondition(itemEntry.getKey(), categoryEntry.getKey(), acos));
								}
								n++;
							}
						}
					} else {
						List<MatchCondition> list = new LinkedList<MatchCondition>();
						list.add(new MatchCondition(itemEntry.getKey(), categoryEntry.getKey(), acos));
						result.put(itemEntry.getKey(), list);
					}
					
				}
			}
			
		}
		
		return result;
	}