GSP工具类1频繁模式计算方法更新

linyiqun · linyiqun · commit 9821455fa171 · 2015-02-10T10:49:03.000+08:00
GSP工具类1频繁模式计算方法更新
diff --git a/SequentialPatterns/DataMining_GSP/GSPTool.java b/SequentialPatterns/DataMining_GSP/GSPTool.java
@@ -94,28 +94,65 @@ private void readDataFile() {
 	 * @return
 	 */
 	private ArrayList<Sequence> generateOneFrequencyItem() {
+		int count = 0;
+		int currentTransanctionID = 0;
 		Sequence tempSeq;
 		ItemSet tempItemSet;
+		HashMap<Integer, Integer> itemNumMap = new HashMap<>();
 		ArrayList<Sequence> seqList = new ArrayList<>();
-		ArrayList<Integer> itemNumArray = new ArrayList<>();
 
 		for (Sequence seq : totalSequences) {
 			for (ItemSet itemSet : seq.getItemSetList()) {
 				for (int num : itemSet.getItems()) {
 					// ���û�д����������������Ӳ���
-					if (!itemNumArray.contains(num)) {
-						itemNumArray.add(num);
+					if (!itemNumMap.containsKey(num)) {
+						itemNumMap.put(num, 1);
 					}
 				}
 			}
 		}
+		
+		boolean isContain = false;
+		int number = 0;
+		for (Map.Entry entry : itemNumMap.entrySet()) {
+			count = 0;
+			number = (int) entry.getKey();
+			for (Sequence seq : totalSequences) {
+				isContain = false;
+				
+				for (ItemSet itemSet : seq.getItemSetList()) {
+					for (int num : itemSet.getItems()) {
+						// ���û�д����������������Ӳ���
+						if (num == number) {
+							isContain = true;
+							break;
+						}
+					}
+					
+					if(isContain){
+						break;
+					}
+				}
+				
+				if(isContain){
+					count++;
+				}
+			}
+			
+			itemNumMap.put(number, count);
+		}
+		
+
+		for (Map.Entry entry : itemNumMap.entrySet()) {
+			count = (int) entry.getValue();
+			if (count >= minSupportCount) {
+				tempSeq = new Sequence();
+				tempItemSet = new ItemSet(new int[] { (int) entry.getKey() });
 
-		for (int num : itemNumArray) {
-			tempSeq = new Sequence();
-			tempItemSet = new ItemSet(new int[] { num });
+				tempSeq.getItemSetList().add(tempItemSet);
+				seqList.add(tempSeq);
+			}
 
-			tempSeq.getItemSetList().add(tempItemSet);
-			seqList.add(tempSeq);
 		}
 		// ��������������
 		Collections.sort(seqList);
