closed frequent itemsets mining in java

Build an application that will compute all frequent closed itemsets (frequent itemsets with no imediat superset with the same support). The application will have as input a data file (space delimited text file - with the items encoded as integers) and a percentage, given as an integer (e.g. input 2 represents 2%). It will output all closed itemsets together with their support, it will also output the duration (the time needed to execute the task). you have to make the application process as fast as you can. the input file will be lines of numbers, and the numbers will be from 0 to 999, and in each line, every single number can only appear once. I don't need fancy GUI front-end. basically it will be a very small project which may have 2 or 3 classes, the input file format is like the one in the attachment, each line of numbers is viewed as one transaction and the numbers in each line are items. and you can get a very clear understanding about what's closed frequent itemset from google, and certain algorithms are also exist. I don't need fancy GUI interface, I just need it simple and working efficient( key point). [login to view URL]~frans/KDD/Software/FPgrowth/[login to view URL] and [login to view URL] may be a great help for getting the project done,