fp growth for data mining algorithm
2016-08-23
1 0 0
no vote
Other
Earn points
import java.util.*; public class Fptree { public static void main(String x[]) { Scanner sc=new Scanner(System.in); System.out.println("Ebter no of trans"); int no_t=sc.nextInt(); System.out.println("Enter no_itemset"); int no_i=sc.nextInt(); System.out.println("Enter min support"); int min_sup=sc.nextInt(); System.out.println("Enter 0 afer entering one transaction"); String d[][][]=new String [no_t][2][no_i]; for(int i=0;i<no_t;i++) { System.out.println("TID no:"+(i+1)); for(int k=0;k<no_i;k++) { String s=sc.next(); d[i][1][k]=s;
java
算法
数据挖掘
FPGrowth
Related Source Codes
Android AOA Android Open Accessory Development Usi
0
0
no vote
VPN source code accelerator
0
0
no vote
VPN source code
0
0
no vote
Springboot Campus Recruitment System
0
0
no vote
Java intelligent QR code access control management
0
0
no vote
No comment