序列模式挖掘算法BIDE

科技前沿 • 2025-03-02 07:39 • 阅读 52
大家好，我是讯享网，很高兴认识大家。
import java.io.BufferedReader; import java.io.FileInputStream; import java.io.FileNotFoundException; import java.io.IOException; import java.io.InputStreamReader; import java.util.ArrayList; import java.util.Date; import java.util.HashMap; import java.util.List; import java.util.Map; import java.util.Set; public class BIDE { public List<List<String>> db=new ArrayList<List<String>>(); public List<Double> sup=new ArrayList<Double>(); public int mm; public void init(){ try { FileInputStream in=new FileInputStream("E:/in中文.txt"); InputStreamReader fr=new InputStreamReader(in,"utf-8"); BufferedReader br=new BufferedReader(fr); String line=null; List<String> tmp=null; int count=0; String pline=null; while((line=br.readLine())!=null){ line=line.trim(); System.out.println(line); if(line.contains("星期")){ count++; if(count==9) break; tmp=new ArrayList<String>(); db.add(tmp); pline=null; continue; } if(line.matches("[\u4e00-\u9fa5]*")){ continue; } else { if(line!=pline) tmp.add(line); pline=line; System.out.println(line); } } mm=(int)(count*0.8); } catch (FileNotFoundException e) { // TODO Auto-generated catch block e.printStackTrace(); } catch (IOException e) { // TODO Auto-generated catch block e.printStackTrace(); } } public static void main(String[] args){ BIDE d=new BIDE(); d.init(); d.test(); Date st=new Date(); List<List<String>> ans=d.Bide(d.db,d.mm); Date end=new Date(); String pname=null; for(int k=0;k<ans.size();k++){ List<String> s=ans.get(k); pname=null; for(int i=0;i<s.size();i++){ String name=s.get(i); System.out.print(name+" "); pname=name; } System.out.print(d.sup.get(k)); System.out.println(""); } System.out.println("时间："+(end.getTime()-st.getTime())); } public List<List<String>> Bide(List<List<String>> sdb,int min_sup){ List<List<String>> fcs =new ArrayList<List<String>>(); Map<String,Integer> map=ge
讯享网
序列模式挖掘算法BIDE

相关推荐
