The Data Mining Forum                             open-source data mining software open-source data mining software data science journal data mining conferences
This forum is about data mining, data science and big data: algorithms, source code, datasets, implementations, optimizations, etc. You are welcome to post call for papers, data mining job ads, link to source code of data mining algorithms or anything else related to data mining. The forum is hosted by P. Fournier-Viger. No registration is required to use this forum!.  
Help again plz
Posted by: Marwa
Date: March 09, 2013 09:54AM

Dear Philippe

really thank you very much
i tried it and it give me the results smiling smiley

i want to ask u if u can help me in dealing with data like this






the new transaction (sequence) begins with ">" and the mining process should start from the next line, and the transaction can be in many lines.

the characters beside ">" is the transaction ID.

also if the memory consumption function can be added to it.

sorry for annoying you but i am in a very need to compare this with my work

waiting ur reply
and thx very much again smiling smiley

Options: ReplyQuote
Re: Help again plz
Date: March 10, 2013 10:52AM


Could you send your input file to my e-mail : philippe.fv (AT)

This would allow me to make sure that it reads the correct format.

To check the memory, you just need to add these two lines:

double currentMemory = (Runtime.getRuntime().totalMemory() -  Runtime.getRuntime().freeMemory())
				/ 1024d / 1024d;
		System.out.println(" Memory = " + currentMemory);

You can add them at the end of runAlgorithm() in the class AlgoPrefixSpanStrings that you are using or anywhere else but after running the algorithm.


Edited 2 time(s). Last edit at 03/10/2013 10:53AM by webmasterphilfv.

Options: ReplyQuote
Re: Help again plz
Posted by: Marwa
Date: March 11, 2013 04:22AM


I sent to you the input file

waiting your reply
thx smiling smiley

Options: ReplyQuote

This forum is powered by Phorum and provided by P. Fournier-Viger (© 2012).
Terms of use.