hello . i have a question! i down load and run spmf.jar . because of this application have not some algoritm in defult mode! i want to add this algoritms as SPADE !how i can add algoritms to list of algoritms of spmf?

Hello,

I'm not sure that I understand your question.

If you mean that SPADE is not available in the list of algorithm, then you should download the latest version of SPMF. In the latest version of SPMF, SPADE is in the list of algorithms provided by the graphical user interface.

If you mean that you want to create some new algorithms that are not already in SPMF and add them to the graphical interface, then you need to modify the class ca.pfv.spmf.gui.MainWindow. There is some more details about this in the developpers guide ( http://www.philippe-fournier-viger.com/spmf/developers.php )

Best,

Philippe

oh, Thank for your replay .
if i want add some algorithms in this software! what am i do? it wand programming? is it possible guide me more? please help me more
-----
is i want to run some algorithms in one input db, how i can create this db for SPMF? for example this data :

ID Sequense
1 <{1} {5}>
2 <{1} {2,3,4}>
3 <{1,3}>
4 <{1} {2,3,4} {5}>
5 <{5}>
-----
oh! when i run spmf.jar befor, and select GSP algorithmو many Field show to me! for example gap and sliding window but now spmf do'nt show to me this field!!! why ? this is show in this link:
http://s5.picofile.com/file/8102463876/33.png
-----

Thank's alot.



Edited 1 time(s). Last edit at 12/02/2013 07:20AM by sedighe.

i found the way of create SPMF db! for example this db :

ID Sequense
1 <{1} {5}>
2 <{1} {2,3,4}>
3 <{1,3}>
4 <{1} {2,3,4} {5}>
5 <{5}>
in SPMF input db is :
1 -1 5 -1 -2
1 -1 2 3 4 -1 -2
1 3 -1 -2
1 -1 2 3 4 -1 5 -1 -2
5 -1 -2
---
i have a Question! is output of SPMF always true? what am i do for add aprioriALL and apriorisome to SPMF?



Edited 1 time(s). Last edit at 12/02/2013 10:17AM by sedighe.

About parameters

Yes, not all algorithms have the same parameters in SPMF. GSP may have some extra parameters that are not offered for other algorithms. This is normal. It means that these parameters have not been implemented for the other algorithms.

About adding AprioriALL and AprioriSome

To add new algorithms such as AprioriALL and AprioriSome, you first need to implement them. This is the first step because if you don't have the code for these algorithms, then you cannot add them.

To see how to implement an algorithm, you can check the algorithms already offered in SPMF. There is already some code for reading an input file for example. You can go to the download page and download the source code of SPMF. Then on the download page, there are also instructions about how to install SPMF in a development environment such as Eclipse or NetBeans. I recommend to use Eclipse.

For new algorithms, you should create new Java packages in SPMF. For example, if you want to add AprioriSome and AprioriAll you could create the following package:

ca.pfv.spmf.algorithms.sequentialpatterns.apriorisome

and

ca.pfv.spmf.algorithms.sequentialpatterns.aprioriall

Then, you could put your code in these folders.

After you have finished writing the code of the algorithms, you would need to integrate it to the user interface. This is simple. You just need to modify the Java file: ca.pfv.spmf.gui.MainWindow that is the user interface. You can look at how other algorithms are integrated in this file to see how it works.

Lastly, if you want to regenerate the JAR file after adding your new algorithms, then you can read the instructions for generating the JAR file in the developer's guide : http://www.philippe-fournier-viger.com/spmf/developers.php

Actually, the developer's guide contains many useful information. You should have a look at it.

You should also read the text about installing the source code in a development environment:

http://www.philippe-fournier-viger.com/spmf/how_to_install.txt

By the way, when you finish implementing AprioriSome or AprioriAll, i could help you to integrate them, if this is a problem.

Another important thing is that the input and output format should be the same as the other sequential pattern mining algorithm.

Best,

Philippe



Edited 2 time(s). Last edit at 12/02/2013 11:31AM by webmasterphilfv.

tank's for your answer
Yes, not all algorithms have the same parameters in SPMF. GSP may have some extra parameters that are not offered for other algorithms. This is normal. It means that these parameters have not been implemented for the other algorithms.
I Know it. but why we select GSP, do'nt see GSP's parameters?

The parameters of GSP in the user interface of SPMF are:

minsup,
max pattern length.

Those are the only parameters that have been implemented.

The sliding window and gap parameters have not been implemented for GSP.

If you want to try these parameters, you could check the Hirate-Yamana algorithm. It offers a mingap, maxgap, etc. parameters that are similar to the sliding window and gap parameters.

Philippe

when i select GSP, I See the page like this:

as we see in this picture, we have not any field for max-gap, min-gap and sliding window! i run GSP with the Status that see in this picture! so that i Receive this output:

1 -1 #SUP: 4
2 -1 #SUP: 2
3 -1 #SUP: 4
4 -1 #SUP: 4
5 -1 #SUP: 4
1 -1 2 -1 #SUP: 2
1 -1 3 -1 #SUP: 4
1 -1 4 -1 #SUP: 3
1 -1 5 -1 #SUP: 2
2 -1 3 -1 #SUP: 2
2 -1 4 -1 #SUP: 2
3 -1 4 -1 #SUP: 3
3 -1 5 -1 #SUP: 2
4 -1 5 -1 #SUP: 2
1 -1 2 -1 3 -1 #SUP: 2
1 -1 2 -1 4 -1 #SUP: 2
1 -1 3 -1 4 -1 #SUP: 3
1 -1 3 -1 5 -1 #SUP: 2
2 -1 3 -1 4 -1 #SUP: 2
1 -1 2 -1 3 -1 4 -1 #SUP: 2

but in one paper the output of GSP for that input was:

this out put is different for one input!! why? is it for that field that was not in SPMF for GSP? how much SPMF trust?

The implementation of GSP in SPMF is correct (it always generate the correct result), except that it does not consider the additional constraints of sliding window and maxgap. You can understand this as if you use GSP and set window = infinity and maxgap = infinity. That is the SPMF implementation.

Now, for that paper that you are talking, I don't know what parameter they used and what input database they used. Did you use the same input database and parameters when you run the SPMF implementation of GSP? If not, then it does not make sense to compare the result. By looking at the result, I think that you did not use the same database.



Edited 2 time(s). Last edit at 12/02/2013 03:06PM by webmasterphilfv.

The implementation of GSP in SPMF is correct (it always generate the correct result), except that it does not consider the additional constraints of sliding window and maxgap. You can understand this as if you use GSP and set window = infinity and maxgap = infinity. That is the SPMF implementation.

i do not Understand the meaning of this Sentence! . why SPMF have not GSP Parameters (max-gap, min-gap and sliding window) when we select GSP?
---
the input that i use was same . that input was this:

1 5 -1 2 -1 3 -1 4 -1 -2
1 -1 3 -1 4 -1 3 5 -1 -2
1 -1 2 -1 3 -1 4 -1 -2
1 -1 3 -1 5 -1 -2
4 -1 5 -1 -2

for this, SPMF have Different output with that paper!! why? (IN SPMF The parentheses are removed but in that paper ... )
---
I am Iranian. Really glad to meet you. You're a good man. I wish good luck . Sorry, for too much questions .
i am master student in IT field. My thesis is about data mining. I need some help.
i have one request! if i say some algorithm to you, then you can add those to SPMF for me?

If you do this to me, I really grateful to you.

The input cannot be the same.

You say that the input is:

1 5 -1 2 -1 3 -1 4 -1 -2
1 -1 3 -1 4 -1 3 5 -1 -2
1 -1 2 -1 3 -1 4 -1 -2
1 -1 3 -1 5 -1 -2
4 -1 5 -1 -2

and you say that the result in the article is the table that you posted.

But in this table there are some patterns like <(1 3)(5)> that cannot be found in any sequence of your input.

So either you typed the input file wrong or the article does not use the same input.

Can you give me the link of the article?

For the second question about implementing algorithms, I will copy the answer from the FAQ:

Could you implement the XXXXXXX algorithm for me?

I usually choose the algorithms that I implement according to my interests. If you would like that I implement a particular algorithm, you can send me a suggestion by e-mail with (1) the name of the algorithm and (2) the article describing the algorithm. I will read your suggestion. Then, I will evaluate if I'm interested to implement it or not. Then if I'm interested by the algorithm, it can take days, weeks or months before I have time to implement it (it depends on my schedule). If I'm not interested, I will not implement it.

Best,

Philippe

oh, tanks. i do this and mail to you, but what is your email?
Excuse, i am not take me this question:

The implementation of GSP in SPMF is correct (it always generate the correct result), except that it does not consider the additional constraints of sliding window and maxgap. You can understand this as if you use GSP and set window = infinity and maxgap = infinity. That is the SPMF implementation.

i do not Understand the meaning of this Sentence! sad smiley . why SPMF have not GSP Parameters (max-gap, min-gap and sliding window) when we select GSP?



Edited 1 time(s). Last edit at 12/03/2013 09:48AM by sedighe.

Ok.

In the article describing GSP they propose a few parameters:
- minsup
- sliding window
- maxgap
...
Let's call this version the "original version of GSP".

Now let's call the version in SPMF, the "SPMF version of GSP".

The "SPMF version of GSP" has only the minsup parameter.

The "SPMF version of GSP" generates the same result as "the orignal version of GSP" if you set the parameters of the "original version of GSP" as minsup, slidding window = infinity and maxgap = infinity.

oh, i Understanding your reply, now tanks a lot for add algorithms i make a document and put here for you
----
In my religion, take Solubility is very important! For this reason,Please forgive my Disturbance for too question . I believe in God. i believe, the People that help others,are God people and God loves them. At the end of my saying, I wish you all the best, the god man

hello again. i run apriori with spmf with this input:
1 -1 1 2 3 -1 1 3 -1 4 -1 3 6 -1 -2
1 4 -1 3 -1 2 3 -1 1 5 -1 2 -1 3 -1 -2
5 6 -1 1 2 -1 4 6 -1 3 -1 2 -1 -2
5 -1 7 -1 1 6 -1 3 -1 2 -1 3 -1 -2
1 -1 1 2 -1 3 4 -1 5 -1 7 -1 8 -1 -2
1 -1 1 2 4 -1 2 -1 3 -1 -2

and this is my out put with min_sup=0.5
-1 #SUP: 32
1 #SUP: 11
-2 #SUP: 6
2 #SUP: 9
3 #SUP: 11
4 #SUP: 5
5 #SUP: 4
6 #SUP: 4
1 2 #SUP: 3
1 4 #SUP: 4
2 4 #SUP: 3
1 2 4 #SUP: 3

and this is my out put with min_sup=0.4
-1 #SUP: 32
1 #SUP: 11
-2 #SUP: 6
2 #SUP: 9
3 #SUP: 11
4 #SUP: 5
5 #SUP: 4
6 #SUP: 4
1 2 #SUP: 3
1 4 #SUP: 4
2 4 #SUP: 3
1 2 4 #SUP: 3
what is this outputs!!!! :O why have not -1 for separate elements?!!!

please see this pic!! i make it in photoshop!! tis is aprioriALL! with this inputmin_sup=2)
1 -1 1 2 3 -1 1 3 -1 4 -1 3 6 -1 -2
1 4 -1 3 -1 2 3 -1 1 5 -1 2 -1 3 -1 -2
5 6 -1 1 2 -1 4 6 -1 3 -1 2 -1 -2
5 -1 7 -1 1 6 -1 3 -1 2 -1 3 -1 -2
1 -1 1 2 -1 3 4 -1 5 -1 7 -1 8 -1 -2
1 -1 1 2 4 -1 2 -1 3 -1 -2
and table of this input is :
http://upload.tehran98.com/upme/uploads/abcdbd922f3d288a1.jpg

L2 have 22 elements!!! but output with SPMF is:
-1 #SUP: 32
1 #SUP: 11
-2 #SUP: 6
2 #SUP: 9
3 #SUP: 11
4 #SUP: 5
5 #SUP: 4
6 #SUP: 4
1 2 #SUP: 3
1 4 #SUP: 4
2 4 #SUP: 3
1 2 4 #SUP: 3

why?? :O



Edited 1 time(s). Last edit at 12/05/2013 11:49AM by sedighe.

"Apriori" is not a sequential pattern mining algorithm.

"Apriori" is a frequent itemset mining algorithm.

It is normal that Apriori does not generate sequential patterns. "Apriori" discovers frequent itemsets.

I think that you are confusing Apriori with AprioriAll. They are not the same and they don't do the same thing.

"AprioriALL" discovers sequential patterns.

"Apriori" is to discover frequent itemsets.

So therefore it is normal that Apriori and GSP do not produce the same output.



Edited 2 time(s). Last edit at 12/05/2013 04:21PM by webmasterphilfv.

yes. it is true. i know this before. therefor spmf have not aprioriALL? ( Oh my god ( :crying!!!! so i add this to the list of algorithms that i need it is very bad !

Yes, SPMF does not have AprioriALL. You can find the list of algorithms offered in SPMF on the SPMF website.

Actually, the reason why we did not implement AprioriALL is that it is a very old algorithm.

GSP is supposed to be faster.

Furthermore, SPADE, SPAM and PrefixSpan were shown to be faster than GSP.

Therefore, I'm not very interested in AprioriALL, unless someone implement it and offer it to SPMF.

Is there any special reason why you are interested in AprioriALL?

Philippe



Edited 2 time(s). Last edit at 12/06/2013 06:01AM by webmasterphilfv.

dear webmasterphilfv, your all replay are very good and Sufficient you are one of my best fierend . where i can find algorithms that was not in SPMF ? the algorithms that write in java? is there in the internet? can you introduce me one website for this?
i know aprioriALL is very old! but i need it for my work.
-----
i do aprioriALL manually ! I need one person to check it. can i ask you to check it? can i put this here for you with my handwriting?

I don't know any website for AprioriALL.

Checking your code? No, I'm not interested in this algorithm. I would not spend time reading the paper and checking your code to make sure that it works. You should try to make it by yourself.



Edited 2 time(s). Last edit at 12/07/2013 09:23AM by webmasterphilfv.

okkkkkkkkkkkk thanks alot i need java code of aprioriALL :|

THIS IS here:
http://en.pudn.com/downloads219/sourcecode/java/detail1031694_en.html
but have VIP account

https://code.google.com/p/polyucomp5121/source/browse/trunk/src/dm/core/?r=49

hello, i have a problem!!
this address load this for me :

403. That’s an error.

Request not allowed from your country That’s all we know.

HELLO. in my Language hello mean salam
one question:
i run MainTestGSP_saveToFile.java with netbeans! with this input:
1 -1 1 2 3 -1 1 3 -1 4 -1 3 6 -1 -2
1 4 -1 3 -1 2 3 -1 1 5 -1 -2
5 6 -1 1 2 -1 4 6 -1 3 -1 2 -1 -2
5 -1 7 -1 1 6 -1 3 -1 2 -1 3 -1 -2
i see this in output:
0: {t=0, 1 }{t=1, 1 2 3 }{t=2, 1 3 }{t=3, 4 }{t=4, 3 6 }
1: {t=0, 1 4 }{t=1, 3 }{t=2, 2 3 }{t=3, 1 5 }
2: {t=0, 5 6 }{t=1, 1 2 }{t=2, 4 6 }{t=3, 3 }{t=4, 2 }
3: {t=0, 5 }{t=2, 1 6 }{t=3, 3 }{t=4, 2 }{t=5, 3 }
what this output mean? the input why have not time! this input is "contextPrefixSpan.txt" .what the output time, mean?
-----
another question is what the different of MainTestClaSP_saveToFile.java and MainTestClaSP_saveToMemory.java?

Hi,

Let me explain to you something.

Example ending with "_saveToMemory" means that it keep the result into memory and the result is printed to the console.

Example ending with "_saveToFile" means that the result will be written to a file instead of printing to the console.

When I run the file MainTest..GSP_saveToMemory, this is printed to the console:

0: {t=0, 1 }{t=1, 1 2 3 }{t=2, 1 3 }{t=3, 4 }{t=4, 3 6 }
1: {t=0, 1 4 }{t=1, 3 }{t=2, 2 3 }{t=3, 1 5 }
2: {t=0, 5 6 }{t=1, 1 2 }{t=2, 4 6 }{t=3, 3 }{t=4, 2 }
3: {t=0, 5 }{t=2, 1 6 }{t=3, 3 }{t=4, 2 }{t=5, 3 }

The previous lines is the input database that was printed to the console. It is not the result. You can ignore the t= values and just read it as follows.

0: {t=0, 1 }{t=1, 1 2 3 }{t=2, 1 3 }{t=3, 4 }{t=4, 3 6 }

means that it is the first sequence (its ID is 0) and that item 1 was followed by 1,2,3, followed by 1,3, followed by 4 , followed by 3 and 6.

Now the output of the algorithm is as follows:


53 frequent pattern found.
1 -1 #SUP: 4
2 -1 #SUP: 4
3 -1 #SUP: 4
4 -1 #SUP: 3
5 -1 #SUP: 3
6 -1 #SUP: 3
1 -1 1 -1 #SUP: 2
1 2 -1 #SUP: 2
1 -1 2 -1 #SUP: 4
1 -1 3 -1 #SUP: 4
1 -1 4 -1 #SUP: 2
1 -1 6 -1 #SUP: 2
2 -1 1 -1 #SUP: 2
2 3 -1 #SUP: 2
2 -1 3 -1 #SUP: 3
2 -1 4 -1 #SUP: 2
2 -1 6 -1 #SUP: 2
3 -1 1 -1 #SUP: 2
3 -1 2 -1 #SUP: 3
3 -1 3 -1 #SUP: 3
4 -1 2 -1 #SUP: 2
4 -1 3 -1 #SUP: 3
5 -1 1 -1 #SUP: 2
5 -1 2 -1 #SUP: 2
5 -1 3 -1 #SUP: 2
5 -1 6 -1 #SUP: 2
6 -1 2 -1 #SUP: 2
6 -1 3 -1 #SUP: 2
1 2 -1 3 -1 #SUP: 2
1 2 -1 4 -1 #SUP: 2
1 2 -1 6 -1 #SUP: 2
1 -1 2 -1 1 -1 #SUP: 2
1 -1 2 3 -1 #SUP: 2
1 -1 2 -1 3 -1 #SUP: 2
1 -1 3 -1 1 -1 #SUP: 2
1 -1 3 -1 2 -1 #SUP: 3
1 -1 3 -1 3 -1 #SUP: 3
1 -1 4 -1 3 -1 #SUP: 2
2 3 -1 1 -1 #SUP: 2
2 -1 4 -1 3 -1 #SUP: 2
4 -1 3 -1 2 -1 #SUP: 2
5 -1 1 -1 2 -1 #SUP: 2
5 -1 1 -1 3 -1 #SUP: 2
5 -1 2 -1 3 -1 #SUP: 2
5 -1 3 -1 2 -1 #SUP: 2
5 -1 6 -1 2 -1 #SUP: 2
5 -1 6 -1 3 -1 #SUP: 2
6 -1 2 -1 3 -1 #SUP: 2
6 -1 3 -1 2 -1 #SUP: 2
1 2 -1 4 -1 3 -1 #SUP: 2
1 -1 2 3 -1 1 -1 #SUP: 2
5 -1 1 -1 3 -1 2 -1 #SUP: 2
5 -1 6 -1 3 -1 2 -1 #SUP: 2

For example the last patterns means that:

Item 5 was followed by 6, followed by 3, followed by 2, and this pattern has a support of 2 (this pattern occurs in two sequences).

Best,

hello my Friend i am happy to see your Message . i Understand your replay . tanks but i do not know meaning of console?

Hello,

The console is where a program writes its text output.

For example, in Windows, there is the CMD.exe console, which is also called the "command prompt". A program running in CMD.exe can be said to be a console program.

Another word is "terminal". In Linux, you can open a terminal to give somes commands to the operating system. This can also be described as a consol, i think.

Oh. yes. tanks for your replay. i have some question

1------
i run GSP with netbeans in SPMF.ZIP , i modify some element of this algorithm! like this:
double support = (double)0.5, mingap = 5, maxgap = 30, windowSize = 7;
and with my defined DB! after run this, i have not eny output about cpu usage! what code i add to this algorithm to see the amount of cpu usage with GSP ?

2----
I found aprioriALL code! but this is not run!! when i add that to SPMF.zip, in netbeans show like this:

and when i right click on it! i see this notice:

the code, i speak about that, is :
http://s5.picofile.com/file/8104121092/MainTestAprioriALL_saveToMemory.txt.html
what i should do ?
note: i have another code for apriopiALL like this:
http://s5.picofile.com/file/8104121492/MainTestAprioriALL2_saveToMemory.txt.html
not: i put the name of AprioriALL in java (i.e.MainTestAprioriALL2_saveToMemory.java )
3---
i use the paper that defined in this page of site:
http://www.philippe-fournier-viger.com/spmf/index.php?link=algorithms.php
any of them are paper or book? why some that i see () have not page number in paper!! :O
i search in google and found this for example :
http://scholar.google.com/scholar?q=SPADE%3A+An+Efficient+Algorithm+for+Mining+Frequent+Sequences&btnG=&hl=fa&as_sdt=0%2C5
and
http://scholar.google.com/scholar?q=Mining+Sequential+Patterns%3A+Generalizations+and+Performance+Improvements&btnG=&hl=fa&as_sdt=0%2C5
book is true or that are paper?
--------
thanks for your time that spend for me



Edited 1 time(s). Last edit at 12/14/2013 01:13PM by sedighe.

1) Calculating execution time in Java can be done as follows:

long startTime = System.currentTimeMillis();

...

long endTime = System.currentTimeMillis();

System.out.println(endTime - startTime);

2) This is a Java problem. The error is that there is no main method in the source code that you have found or that there is some compiling errors. For compiling errors, it could be that the first line in the class file that you have found indicates that the class should be in a different Java package than the package where you have put it.... Or it could be that you miss some files. Or it could be that the code that you have found has some errors. Or it could be that you did not setup your NetBeans project correctly.

3) For algorithms in SPMF, you can get the page numbers on the documentation page:

http://www.philippe-fournier-viger.com/spmf/index.php?link=documentation.php

Otherwise, you can also search on Google to get them.



Edited 3 time(s). Last edit at 12/14/2013 02:24PM by webmasterphilfv.

Thanks for your reply but your answer was not Clear. for answer 1! i want cpu usage code, but you write about run-time . for answer 2 you speak about
Probability! but dont say to me what am i doing! i put AprioriALL code for you (i put two code for it) , i expect to edit that code . for 3, i ask about paper that you defined for algorithms in site! THEY have not page number and i do not know that these are book or Article!!! Excuse me, You did not answer my questions! any way thanks alot



Edited 1 time(s). Last edit at 12/15/2013 04:08AM by sedighe.

Hello,

1) There is no CPU usage measurement in SPMF. I'm not sure how you could do it. It a Java programming question rather than a question related to SPMF. You could check some relevant Java programming websites to see if it can be done in Java and how to do it.

2) The code for AprioriALL is not the code from SPMF. So I just gave you some general advices about what the problem may be. I will not check the code in details because it is not my code.

3) Yes, some papers do not have page numbers on the spmf webiste. If you want to get the full information about a paper, you can just search the paper title and authors in Google and you should get the full information about the papers on other websites. You should also get information about whether they are book or article.

OH. thanks for reply. if i want have information about memory! what am i do ?
like this that i highlight with red:
Total time ~ 12 ms
Frequent sequences count : 30
Max memory (mb):3.7285614013671875
run GSP with SPMF.zip! havent any output about memory!

Ok.

To get memory usage information, you just need to modify MainTestGSP_saveToFile or MainTestGSP_saveToMemory and add this line:


System.out.println(algorithm.printStatistics());

This line is for printing statistics such as memory usage, execution time, etc.

You should put it after algorithm.runAlgorithm(......);


Philippe

hello Friends i hope you are healthy and good. i have a question:
when i run SPADE in SPMF.jar! with this input:
1 -1 1 2 3 -1 1 3 -1 4 -1 3 6 -1 -2
1 4 -1 3 -1 2 3 -1 1 5 -1 2 -1 3 -1 -2
5 6 -1 1 2 -1 4 6 -1 3 -1 2 -1 -2
5 -1 7 -1 1 6 -1 3 -1 2 -1 3 -1 -2
1 -1 1 2 -1 3 4 -1 5 -1 7 -1 8 -1 -2
1 -1 1 2 4 -1 2 -1 3 -1 -2
i give this input:
1 -1 #SUP: 6
2 -1 #SUP: 6
3 -1 #SUP: 6
4 -1 #SUP: 5
5 -1 #SUP: 4
6 -1 #SUP: 3
5 -1 3 -1 #SUP: 3
5 -1 2 -1 #SUP: 3
5 -1 2 -1 3 -1 #SUP: 3
4 -1 3 -1 #SUP: 4
2 -1 4 -1 #SUP: 3
4 -1 2 -1 #SUP: 3
1 -1 4 -1 #SUP: 4
3 -1 3 -1 #SUP: 3
2 -1 3 -1 #SUP: 6
3 -1 2 -1 #SUP: 3
1 -1 3 -1 #SUP: 6
2 -1 2 -1 #SUP: 3
1 2 -1 #SUP: 4
1 -1 2 -1 #SUP: 6
1 -1 1 -1 #SUP: 4
1 -1 1 2 -1 #SUP: 3
1 -1 1 -1 3 -1 #SUP: 4
1 -1 1 2 -1 3 -1 #SUP: 3
1 -1 3 -1 2 -1 #SUP: 3
1 -1 2 -1 3 -1 #SUP: 5
1 2 -1 3 -1 #SUP: 4
1 2 -1 4 -1 #SUP: 3
1 -1 3 -1 3 -1 #SUP: 3
1 -1 4 -1 3 -1 #SUP: 3
this output is wrong!!!! why? :O
when i run SPMF.zip with netbeans whit the same input and run "MainTestSPADE_AGP_BitMap_saveToMemory.java" then i give this output:
***Level 0***


***Level 1***

1 -1 #SUP: 6
2 -1 #SUP: 6
3 -1 #SUP: 6
4 -1 #SUP: 5
5 -1 #SUP: 4
6 -1 #SUP: 3

***Level 2***

1 -1 1 -1 #SUP: 4
5 -1 2 -1 #SUP: 3
4 -1 2 -1 #SUP: 3
3 -1 2 -1 #SUP: 3
2 -1 2 -1 #SUP: 3
1 -1 2 -1 #SUP: 6
1 2 -1 #SUP: 4
5 -1 3 -1 #SUP: 3
4 -1 3 -1 #SUP: 4
3 -1 3 -1 #SUP: 3
2 -1 3 -1 #SUP: 6
1 -1 3 -1 #SUP: 6
2 -1 4 -1 #SUP: 3
1 -1 4 -1 #SUP: 4

***Level 3***

1 -1 3 -1 2 -1 #SUP: 3
1 -1 1 2 -1 #SUP: 3
5 -1 2 -1 3 -1 #SUP: 3
1 -1 1 -1 3 -1 #SUP: 4
1 -1 2 -1 3 -1 #SUP: 5
1 2 -1 3 -1 #SUP: 4
1 -1 3 -1 3 -1 #SUP: 3
1 -1 4 -1 3 -1 #SUP: 3
1 2 -1 4 -1 #SUP: 3

***Level 4***

1 -1 1 2 -1 3 -1 #SUP: 3
it is true! why the first result that i say is not true and the same with this?
--
and i have another question ! what is the different this SPADEs?
"MainTestSPADE_AGP_BitMap_saveToMemory.java"
"MainTestSPADE_AGP_EntryList_saveToMemory.java"
"MainTestSPADE_AGP_FatBitMap_saveToMemory.java"
"MainTestSPADE_AGP_Parallelized_BitMap_saveToMemory.java"
"MainTestSPADE_AGP_Parallelized_EntryList_saveToMemory.java"
"MainTestSPADE_AGP_Parallelized_FatBitMap_saveToMemory.java"
what different between these???

hello. anybody there? i need to help

For the second question:

"MainTestSPADE_AGP_BitMap_saveToMemory.java"
"MainTestSPADE_AGP_EntryList_saveToMemory.java"
"MainTestSPADE_AGP_FatBitMap_saveToMemory.java"
"MainTestSPADE_AGP_Parallelized_BitMap_saveToMemory.java"
"MainTestSPADE_AGP_Parallelized_EntryList_saveToMemory.java"
"MainTestSPADE_AGP_Parallelized_FatBitMap_saveToMemory.java"

paralllelized means that this version can run on several threads on your computer. It could thus be faster

BitMap, EntryList and FatBitMap refers to the datastructure that is used for representing sid lists where patterns appears (lists of sequences ids). The FatBitMap version should be the fastest.

For the other question, why do you say that the result is not correct?

Best,

Philippe

Because the result os SPMF.jar is not the same as the result of SPMF.zip with netbeans! and another reasen is out put of aprioriall and gsp on the input that show below, is "1 2 -1 4 -1 #SUP: 3" that it is the same of output with SPMF.zip!

input:
1 -1 1 2 3 -1 1 3 -1 4 -1 3 6 -1 -2
1 4 -1 3 -1 2 3 -1 1 5 -1 2 -1 3 -1 -2
5 6 -1 1 2 -1 4 6 -1 3 -1 2 -1 -2
5 -1 7 -1 1 6 -1 3 -1 2 -1 3 -1 -2
1 -1 1 2 -1 3 4 -1 5 -1 7 -1 8 -1 -2
1 -1 1 2 4 -1 2 -1 3 -1 -2

Hello,

I have checked the output that you have pasted here and the output is the same in both case. Each single pattern in the first output is also in the second output (and vice-versa). So there is no problem here.

But if what you mean is that the output is not presented using the same format, then the reason is that you are comparing the _saveToMemory version with the _saveToFile version (used by SPMF.jar) of the same algorithm. If you compare the _saveToFile version (of SPMF.zip) with SPMF.jar, then the result will be formated the same.

For the other question, there is no AprioriALL in SPMF.

Philippe



Edited 3 time(s). Last edit at 12/25/2013 02:59PM by webmasterphilfv.

tanks but why a have Different out put as i put for you here!!! :O . are these output same?
1 -1 #SUP: 6
2 -1 #SUP: 6
3 -1 #SUP: 6
4 -1 #SUP: 5
5 -1 #SUP: 4
6 -1 #SUP: 3
5 -1 3 -1 #SUP: 3
5 -1 2 -1 #SUP: 3
5 -1 2 -1 3 -1 #SUP: 3
4 -1 3 -1 #SUP: 4
2 -1 4 -1 #SUP: 3
4 -1 2 -1 #SUP: 3
1 -1 4 -1 #SUP: 4
3 -1 3 -1 #SUP: 3
2 -1 3 -1 #SUP: 6
3 -1 2 -1 #SUP: 3
1 -1 3 -1 #SUP: 6
2 -1 2 -1 #SUP: 3
1 2 -1 #SUP: 4
1 -1 2 -1 #SUP: 6
1 -1 1 -1 #SUP: 4
1 -1 1 2 -1 #SUP: 3
1 -1 1 -1 3 -1 #SUP: 4
1 -1 1 2 -1 3 -1 #SUP: 3
1 -1 3 -1 2 -1 #SUP: 3
1 -1 2 -1 3 -1 #SUP: 5
1 2 -1 3 -1 #SUP: 4
1 2 -1 4 -1 #SUP: 3
1 -1 3 -1 3 -1 #SUP: 3
1 -1 4 -1 3 -1 #SUP: 3

and

***Level 0***


***Level 1***

1 -1 #SUP: 6
2 -1 #SUP: 6
3 -1 #SUP: 6
4 -1 #SUP: 5
5 -1 #SUP: 4
6 -1 #SUP: 3

***Level 2***

1 -1 1 -1 #SUP: 4
5 -1 2 -1 #SUP: 3
4 -1 2 -1 #SUP: 3
3 -1 2 -1 #SUP: 3
2 -1 2 -1 #SUP: 3
1 -1 2 -1 #SUP: 6
1 2 -1 #SUP: 4
5 -1 3 -1 #SUP: 3
4 -1 3 -1 #SUP: 4
3 -1 3 -1 #SUP: 3
2 -1 3 -1 #SUP: 6
1 -1 3 -1 #SUP: 6
2 -1 4 -1 #SUP: 3
1 -1 4 -1 #SUP: 4

***Level 3***

1 -1 3 -1 2 -1 #SUP: 3
1 -1 1 2 -1 #SUP: 3
5 -1 2 -1 3 -1 #SUP: 3
1 -1 1 -1 3 -1 #SUP: 4
1 -1 2 -1 3 -1 #SUP: 5
1 2 -1 3 -1 #SUP: 4
1 -1 3 -1 3 -1 #SUP: 3
1 -1 4 -1 3 -1 #SUP: 3
1 2 -1 4 -1 #SUP: 3

***Level 4***

1 -1 1 2 -1 3 -1 #SUP: 3

any way tanks for your reply i have another question:
in WAPMIN algorithm for Sequence pattern mining, i see som Article about it . this algorithm use wap-tree. the way of Draw this tree is simple but i do not see any wap-tree for items that Occur in same time for example draw for this DB that show behind, is simple :
ID Sequence
1 abd
2 dca
... ...

but for this DB:
ID Sequence
1 a(bc)d
2 ca(bd)f
... ...
this db have items b,c that Occur in Sequence 1 and in the same time! and b,d in sequence 2 to. how Draw wap-tree for this Sequences ? can you introduce me one site or article for this ?

i have another Explanation! wap-min is for web access! is not there any access that occur in same time? for example person a and person b click on same link in same time?

For the two output, I answered you already. The output are the same. If you check the patterns one by one for the two outputs, you will see that the same patterns appears in both output.

For the WAPMIN algorithm, I have not read this paper.

tanks so much Good luck to you

hello. how are you friends? exceusme, i have one question: i run frgrowth-itemset in SPMF! with this input:
1 -1 1 2 3 -1 1 3 -1 4 -1 3 6 -1 -2
1 4 -1 3 -1 2 3 -1 1 5 -1 2 -1 3 -1 -2
5 6 -1 1 2 -1 4 6 -1 3 -1 2 -1 -2
5 -1 7 -1 1 6 -1 3 -1 2 -1 3 -1 -2
1 -1 1 2 -1 3 4 -1 5 -1 7 -1 8 -1 -2
1 -1 1 2 4 -1 2 -1 3 -1 -2

and take this output:

6 #SUP: 4
5 6 #SUP: 3
1 5 6 #SUP: 3
-2 5 6 #SUP: 3
-2 1 5 6 #SUP: 3
-2 3 5 6 #SUP: 3
-2 1 3 5 6 #SUP: 4
-2 2 5 6 #SUP: 3
-2 1 2 5 6 #SUP: 5
-2 1 2 3 5 6 #SUP: 5
-2 1 2 3 3 5 6 #SUP: 1
-2 1 2 3 5 6 #SUP: 1
-2 2 3 5 6 #SUP: 5
-2 2 3 3 5 6 #SUP: 1
-2 2 3 5 6 #SUP: 1
3 5 6 #SUP: 3
1 3 5 6 #SUP: 4
2 5 6 #SUP: 3
1 2 5 6 #SUP: 5
1 2 3 5 6 #SUP: 5
1 2 3 3 5 6 #SUP: 1
1 2 3 5 6 #SUP: 1
2 3 5 6 #SUP: 5
2 3 3 5 6 #SUP: 1
2 3 5 6 #SUP: 1
4 6 #SUP: 3
-2 4 6 #SUP: 3
-2 3 4 6 #SUP: 3
-2 1 3 4 6 #SUP: 5
-2 1 1 3 4 6 #SUP: 3
-2 1 1 1 3 4 6 #SUP: 3
-2 1 1 1 3 3 4 6 #SUP: 2
-2 1 1 1 3 3 3 4 6 #SUP: 1
-2 1 1 1 3 3 4 6 #SUP: 1
-2 1 1 3 3 4 6 #SUP: 2
-2 1 1 3 3 3 4 6 #SUP: 1
-2 1 1 3 3 4 6 #SUP: 1
-2 1 1 3 4 6 #SUP: 3
-2 1 1 3 3 4 6 #SUP: 2
-2 1 1 3 3 3 4 6 #SUP: 1
-2 1 1 3 3 4 6 #SUP: 1
-2 1 3 3 4 6 #SUP: 2
-2 1 3 3 3 4 6 #SUP: 1
-2 1 3 3 4 6 #SUP: 1
-2 1 3 4 6 #SUP: 3
-2 1 1 3 4 6 #SUP: 3
-2 1 1 3 3 4 6 #SUP: 2
-2 1 1 3 3 3 4 6 #SUP: 1
-2 1 1 3 3 4 6 #SUP: 1
-2 1 3 3 4 6 #SUP: 2
-2 1 3 3 3 4 6 #SUP: 1
-2 1 3 3 4 6 #SUP: 1
-2 1 3 4 6 #SUP: 3
-2 1 3 3 4 6 #SUP: 2
-2 1 3 3 3 4 6 #SUP: 1
-2 1 3 3 4 6 #SUP: 1
-2 3 3 4 6 #SUP: 2
-2 3 3 3 4 6 #SUP: 1
-2 3 3 4 6 #SUP: 1
-2 2 4 6 #SUP: 3
-2 2 3 4 6 #SUP: 3
-2 1 2 3 4 6 #SUP: 7
-2 1 1 2 3 4 6 #SUP: 3
-2 1 1 1 2 3 4 6 #SUP: 3
-2 1 1 1 2 3 3 4 6 #SUP: 2
-2 1 1 1 2 3 3 3 4 6 #SUP: 1
-2 1 1 1 2 3 3 4 6 #SUP: 1
-2 1 1 2 3 3 4 6 #SUP: 2
-2 1 1 2 3 3 3 4 6 #SUP: 1
-2 1 1 2 3 3 4 6 #SUP: 1
-2 1 1 2 3 4 6 #SUP: 3
-2 1 1 2 3 3 4 6 #SUP: 2
-2 1 1 2 3 3 3 4 6 #SUP: 1
-2 1 1 2 3 3 4 6 #SUP: 1
-2 1 2 3 3 4 6 #SUP: 2
-2 1 2 3 3 3 4 6 #SUP: 1
-2 1 2 3 3 4 6 #SUP: 1
-2 1 2 3 4 6 #SUP: 3
-2 1 1 2 3 4 6 #SUP: 3
-2 1 1 2 3 3 4 6 #SUP: 2
-2 1 1 2 3 3 3 4 6 #SUP: 1
-2 1 1 2 3 3 4 6 #SUP: 1
-2 1 2 3 3 4 6 #SUP: 2
-2 1 2 3 3 3 4 6 #SUP: 1
-2 1 2 3 3 4 6 #SUP: 1
-2 1 2 3 4 6 #SUP: 3
-2 1 2 3 3 4 6 #SUP: 2
-2 1 2 3 3 3 4 6 #SUP: 1
-2 1 2 3 3 4 6 #SUP: 1
-2 2 3 3 4 6 #SUP: 2
-2 2 3 3 3 4 6 #SUP: 1
-2 2 3 3 4 6 #SUP: 1
-2 1 2 4 6 #SUP: 3
-2 1 1 2 4 6 #SUP: 2
-2 1 1 1 2 4 6 #SUP: 1
-2 1 1 2 4 6 #SUP: 1
-2 1 4 6 #SUP: 3
-2 1 1 4 6 #SUP: 2
-2 1 1 1 4 6 #SUP: 1
-2 1 1 4 6 #SUP: 1
3 4 6 #SUP: 3
1 3 4 6 #SUP: 5
1 1 3 4 6 #SUP: 3
1 1 1 3 4 6 #SUP: 3
1 1 1 3 3 4 6 #SUP: 2
1 1 1 3 3 3 4 6 #SUP: 1
1 1 1 3 3 4 6 #SUP: 1
1 1 3 3 4 6 #SUP: 2
1 1 3 3 3 4 6 #SUP: 1
1 1 3 3 4 6 #SUP: 1
1 1 3 4 6 #SUP: 3
1 1 3 3 4 6 #SUP: 2
1 1 3 3 3 4 6 #SUP: 1
1 1 3 3 4 6 #SUP: 1
1 3 3 4 6 #SUP: 2
1 3 3 3 4 6 #SUP: 1
1 3 3 4 6 #SUP: 1
1 3 4 6 #SUP: 3
1 1 3 4 6 #SUP: 3
1 1 3 3 4 6 #SUP: 2
1 1 3 3 3 4 6 #SUP: 1
1 1 3 3 4 6 #SUP: 1
1 3 3 4 6 #SUP: 2
1 3 3 3 4 6 #SUP: 1
1 3 3 4 6 #SUP: 1
1 3 4 6 #SUP: 3
1 3 3 4 6 #SUP: 2
1 3 3 3 4 6 #SUP: 1
1 3 3 4 6 #SUP: 1
3 3 4 6 #SUP: 2
3 3 3 4 6 #SUP: 1
3 3 4 6 #SUP: 1
2 4 6 #SUP: 3
2 3 4 6 #SUP: 3
1 2 3 4 6 #SUP: 7
1 1 2 3 4 6 #SUP: 3
1 1 1 2 3 4 6 #SUP: 3
1 1 1 2 3 3 4 6 #SUP: 2
1 1 1 2 3 3 3 4 6 #SUP: 1
1 1 1 2 3 3 4 6 #SUP: 1
1 1 2 3 3 4 6 #SUP: 2
1 1 2 3 3 3 4 6 #SUP: 1
1 1 2 3 3 4 6 #SUP: 1
1 1 2 3 4 6 #SUP: 3
1 1 2 3 3 4 6 #SUP: 2
1 1 2 3 3 3 4 6 #SUP: 1
1 1 2 3 3 4 6 #SUP: 1
1 2 3 3 4 6 #SUP: 2
1 2 3 3 3 4 6 #SUP: 1
1 2 3 3 4 6 #SUP: 1
1 2 3 4 6 #SUP: 3
1 1 2 3 4 6 #SUP: 3
1 1 2 3 3 4 6 #SUP: 2
1 1 2 3 3 3 4 6 #SUP: 1
1 1 2 3 3 4 6 #SUP: 1
1 2 3 3 4 6 #SUP: 2
1 2 3 3 3 4 6 #SUP: 1
1 2 3 3 4 6 #SUP: 1
1 2 3 4 6 #SUP: 3
1 2 3 3 4 6 #SUP: 2
1 2 3 3 3 4 6 #SUP: 1
1 2 3 3 4 6 #SUP: 1
2 3 3 4 6 #SUP: 2
2 3 3 3 4 6 #SUP: 1
2 3 3 4 6 #SUP: 1
1 2 4 6 #SUP: 3
1 1 2 4 6 #SUP: 2
1 1 1 2 4 6 #SUP: 1
1 1 2 4 6 #SUP: 1
1 4 6 #SUP: 3
1 1 4 6 #SUP: 2
1 1 1 4 6 #SUP: 1
1 1 4 6 #SUP: 1
-2 6 #SUP: 4
-2 2 6 #SUP: 4
-2 1 2 6 #SUP: 4
-2 1 1 2 6 #SUP: 2
-2 1 1 1 2 6 #SUP: 1
-2 1 1 2 6 #SUP: 1
-2 2 3 6 #SUP: 4
-2 2 3 3 6 #SUP: 4
-2 1 2 3 3 6 #SUP: 4
-2 1 1 2 3 3 6 #SUP: 3
-2 1 1 1 2 3 3 6 #SUP: 3
-2 1 1 2 3 3 6 #SUP: 3
-2 1 2 3 3 6 #SUP: 3
-2 1 1 2 3 3 6 #SUP: 3
-2 1 2 3 3 6 #SUP: 3
-2 1 2 3 6 #SUP: 4
-2 1 1 2 3 6 #SUP: 6
-2 1 1 1 2 3 6 #SUP: 3
-2 1 1 2 3 6 #SUP: 3
-2 1 6 #SUP: 4
-2 1 1 6 #SUP: 2
-2 1 1 1 6 #SUP: 1
-2 1 1 6 #SUP: 1
-2 3 6 #SUP: 4
-2 3 3 6 #SUP: 4
-2 1 3 3 6 #SUP: 4
-2 1 1 3 3 6 #SUP: 3
-2 1 1 1 3 3 6 #SUP: 3
-2 1 1 3 3 6 #SUP: 3
-2 1 3 3 6 #SUP: 3
-2 1 1 3 3 6 #SUP: 3
-2 1 3 3 6 #SUP: 3
-2 1 3 6 #SUP: 4
-2 1 1 3 6 #SUP: 6
-2 1 1 1 3 6 #SUP: 3
-2 1 1 3 6 #SUP: 3
2 6 #SUP: 4
1 2 6 #SUP: 4
1 1 2 6 #SUP: 2
1 1 1 2 6 #SUP: 1
1 1 2 6 #SUP: 1
2 3 6 #SUP: 4
2 3 3 6 #SUP: 4
1 2 3 3 6 #SUP: 4
1 1 2 3 3 6 #SUP: 3
1 1 1 2 3 3 6 #SUP: 3
1 1 2 3 3 6 #SUP: 3
1 2 3 3 6 #SUP: 3
1 1 2 3 3 6 #SUP: 3
1 2 3 3 6 #SUP: 3
1 2 3 6 #SUP: 4
1 1 2 3 6 #SUP: 6
1 1 1 2 3 6 #SUP: 3
1 1 2 3 6 #SUP: 3
1 6 #SUP: 4
1 1 6 #SUP: 2
1 1 1 6 #SUP: 1
1 1 6 #SUP: 1
3 6 #SUP: 4
3 3 6 #SUP: 4
1 3 3 6 #SUP: 4
1 1 3 3 6 #SUP: 3
1 1 1 3 3 6 #SUP: 3
1 1 3 3 6 #SUP: 3
1 3 3 6 #SUP: 3
1 1 3 3 6 #SUP: 3
1 3 3 6 #SUP: 3
1 3 6 #SUP: 4
1 1 3 6 #SUP: 6
1 1 1 3 6 #SUP: 3
1 1 3 6 #SUP: 3
5 #SUP: 4
4 5 #SUP: 3
-2 4 5 #SUP: 3
-2 3 4 5 #SUP: 3
-2 1 3 4 5 #SUP: 5
-2 1 1 3 4 5 #SUP: 4
-2 1 1 3 3 4 5 #SUP: 2
-2 1 1 3 3 3 4 5 #SUP: 1
-2 1 1 3 3 4 5 #SUP: 1
-2 1 3 3 4 5 #SUP: 2
-2 1 3 3 3 4 5 #SUP: 1
-2 1 3 3 4 5 #SUP: 1
-2 1 3 4 5 #SUP: 4
-2 1 3 3 4 5 #SUP: 2
-2 1 3 3 3 4 5 #SUP: 1
-2 1 3 3 4 5 #SUP: 1
-2 3 3 4 5 #SUP: 2
-2 3 3 3 4 5 #SUP: 1
-2 3 3 4 5 #SUP: 1
-2 2 4 5 #SUP: 3
-2 1 2 4 5 #SUP: 3
-2 1 1 2 4 5 #SUP: 3
-2 2 3 4 5 #SUP: 3
-2 1 2 3 4 5 #SUP: 9
-2 1 1 2 3 4 5 #SUP: 7
-2 1 1 2 3 3 4 5 #SUP: 4
-2 1 1 2 3 3 3 4 5 #SUP: 2
-2 1 1 2 3 3 4 5 #SUP: 2
-2 1 2 3 3 4 5 #SUP: 4
-2 1 2 3 3 3 4 5 #SUP: 2
-2 1 2 3 3 4 5 #SUP: 2
-2 1 2 3 4 5 #SUP: 7
-2 1 2 3 3 4 5 #SUP: 4
-2 1 2 3 3 3 4 5 #SUP: 2
-2 1 2 3 3 4 5 #SUP: 2
-2 2 3 3 4 5 #SUP: 4
-2 2 3 3 3 4 5 #SUP: 2
-2 2 3 3 4 5 #SUP: 2
-2 1 4 5 #SUP: 3
3 4 5 #SUP: 3
1 3 4 5 #SUP: 5
1 1 3 4 5 #SUP: 4
1 1 3 3 4 5 #SUP: 2
1 1 3 3 3 4 5 #SUP: 1
1 1 3 3 4 5 #SUP: 1
1 3 3 4 5 #SUP: 2
1 3 3 3 4 5 #SUP: 1
1 3 3 4 5 #SUP: 1
1 3 4 5 #SUP: 4
1 3 3 4 5 #SUP: 2
1 3 3 3 4 5 #SUP: 1
1 3 3 4 5 #SUP: 1
3 3 4 5 #SUP: 2
3 3 3 4 5 #SUP: 1
3 3 4 5 #SUP: 1
2 4 5 #SUP: 3
1 2 4 5 #SUP: 3
1 1 2 4 5 #SUP: 3
2 3 4 5 #SUP: 3
1 2 3 4 5 #SUP: 9
1 1 2 3 4 5 #SUP: 7
1 1 2 3 3 4 5 #SUP: 4
1 1 2 3 3 3 4 5 #SUP: 2
1 1 2 3 3 4 5 #SUP: 2
1 2 3 3 4 5 #SUP: 4
1 2 3 3 3 4 5 #SUP: 2
1 2 3 3 4 5 #SUP: 2
1 2 3 4 5 #SUP: 7
1 2 3 3 4 5 #SUP: 4
1 2 3 3 3 4 5 #SUP: 2
1 2 3 3 4 5 #SUP: 2
2 3 3 4 5 #SUP: 4
2 3 3 3 4 5 #SUP: 2
2 3 3 4 5 #SUP: 2
1 4 5 #SUP: 3
-2 5 #SUP: 4
-2 2 5 #SUP: 4
-2 1 2 5 #SUP: 4
-2 1 1 2 5 #SUP: 3
-2 2 3 5 #SUP: 4
-2 2 3 3 5 #SUP: 4
-2 1 2 3 3 5 #SUP: 7
-2 1 1 2 3 3 5 #SUP: 6
-2 1 2 3 3 5 #SUP: 6
-2 1 2 3 5 #SUP: 4
-2 1 1 2 3 5 #SUP: 7
-2 1 5 #SUP: 4
-2 3 5 #SUP: 4
-2 3 3 5 #SUP: 4
-2 1 3 3 5 #SUP: 4
-2 1 1 3 3 5 #SUP: 3
-2 1 3 3 5 #SUP: 3
-2 1 3 5 #SUP: 4
-2 1 1 3 5 #SUP: 4
2 5 #SUP: 4
1 2 5 #SUP: 4
1 1 2 5 #SUP: 3
2 3 5 #SUP: 4
2 3 3 5 #SUP: 4
1 2 3 3 5 #SUP: 7
1 1 2 3 3 5 #SUP: 6
1 2 3 3 5 #SUP: 6
1 2 3 5 #SUP: 4
1 1 2 3 5 #SUP: 7
1 5 #SUP: 4
3 5 #SUP: 4
3 3 5 #SUP: 4
1 3 3 5 #SUP: 4
1 1 3 3 5 #SUP: 3
1 3 3 5 #SUP: 3
1 3 5 #SUP: 4
1 1 3 5 #SUP: 4
4 #SUP: 5
-2 4 #SUP: 5
-2 2 4 #SUP: 5
-2 2 2 4 #SUP: 3
-2 2 2 3 4 #SUP: 3
-2 1 2 2 3 4 #SUP: 5
-2 1 1 2 2 3 4 #SUP: 4
-2 1 1 2 2 3 3 4 #SUP: 2
-2 1 1 2 2 3 3 3 4 #SUP: 1
-2 1 1 2 2 3 3 4 #SUP: 1
-2 1 2 2 3 3 4 #SUP: 2
-2 1 2 2 3 3 3 4 #SUP: 1
-2 1 2 2 3 3 4 #SUP: 1
-2 1 2 2 3 4 #SUP: 4
-2 1 2 2 3 3 4 #SUP: 2
-2 1 2 2 3 3 3 4 #SUP: 1
-2 1 2 2 3 3 4 #SUP: 1
-2 2 2 3 3 4 #SUP: 2
-2 2 2 3 3 3 4 #SUP: 1
-2 2 2 3 3 4 #SUP: 1
-2 1 2 2 4 #SUP: 3
-2 2 3 4 #SUP: 5
-2 2 3 3 4 #SUP: 5
-2 2 3 3 3 4 #SUP: 3
-2 1 2 3 3 3 4 #SUP: 3
-2 1 1 2 3 3 3 4 #SUP: 3
-2 1 1 1 2 3 3 3 4 #SUP: 1
-2 1 1 2 3 3 3 4 #SUP: 1
-2 1 2 3 3 3 4 #SUP: 3
-2 1 1 2 3 3 3 4 #SUP: 1
-2 1 2 3 3 3 4 #SUP: 1
-2 1 2 3 3 4 #SUP: 5
-2 1 1 2 3 3 4 #SUP: 12
-2 1 1 1 2 3 3 4 #SUP: 3
-2 1 1 2 3 3 4 #SUP: 3
-2 1 2 3 4 #SUP: 5
-2 1 1 2 3 4 #SUP: 15
-2 1 1 1 2 3 4 #SUP: 3
-2 1 1 2 3 4 #SUP: 3
-2 1 2 4 #SUP: 5
-2 1 1 2 4 #SUP: 7
-2 1 1 1 2 4 #SUP: 1
-2 1 1 2 4 #SUP: 1
-2 3 4 #SUP: 5
-2 3 3 4 #SUP: 5
-2 1 3 3 4 #SUP: 6
-2 1 1 3 3 4 #SUP: 6
-2 1 1 1 3 3 4 #SUP: 3
-2 1 1 3 3 4 #SUP: 3
-2 1 3 3 4 #SUP: 6
-2 1 1 3 3 4 #SUP: 3
-2 1 3 3 4 #SUP: 3
-2 1 3 4 #SUP: 5
-2 1 1 3 4 #SUP: 11
-2 1 1 1 3 4 #SUP: 3
-2 1 1 3 4 #SUP: 3
-2 1 4 #SUP: 5
-2 1 1 4 #SUP: 5
-2 1 1 1 4 #SUP: 1
-2 1 1 4 #SUP: 1
2 4 #SUP: 5
2 2 4 #SUP: 3
2 2 3 4 #SUP: 3
1 2 2 3 4 #SUP: 5
1 1 2 2 3 4 #SUP: 4
1 1 2 2 3 3 4 #SUP: 2
1 1 2 2 3 3 3 4 #SUP: 1
1 1 2 2 3 3 4 #SUP: 1
1 2 2 3 3 4 #SUP: 2
1 2 2 3 3 3 4 #SUP: 1
1 2 2 3 3 4 #SUP: 1
1 2 2 3 4 #SUP: 4
1 2 2 3 3 4 #SUP: 2
1 2 2 3 3 3 4 #SUP: 1
1 2 2 3 3 4 #SUP: 1
2 2 3 3 4 #SUP: 2
2 2 3 3 3 4 #SUP: 1
2 2 3 3 4 #SUP: 1
1 2 2 4 #SUP: 3
2 3 4 #SUP: 5
2 3 3 4 #SUP: 5
2 3 3 3 4 #SUP: 3
1 2 3 3 3 4 #SUP: 3
1 1 2 3 3 3 4 #SUP: 3
1 1 1 2 3 3 3 4 #SUP: 1
1 1 2 3 3 3 4 #SUP: 1
1 2 3 3 3 4 #SUP: 3
1 1 2 3 3 3 4 #SUP: 1
1 2 3 3 3 4 #SUP: 1
1 2 3 3 4 #SUP: 5
1 1 2 3 3 4 #SUP: 12
1 1 1 2 3 3 4 #SUP: 3
1 1 2 3 3 4 #SUP: 3
1 2 3 4 #SUP: 5
1 1 2 3 4 #SUP: 15
1 1 1 2 3 4 #SUP: 3
1 1 2 3 4 #SUP: 3
1 2 4 #SUP: 5
1 1 2 4 #SUP: 7
1 1 1 2 4 #SUP: 1
1 1 2 4 #SUP: 1
3 4 #SUP: 5
3 3 4 #SUP: 5
1 3 3 4 #SUP: 6
1 1 3 3 4 #SUP: 6
1 1 1 3 3 4 #SUP: 3
1 1 3 3 4 #SUP: 3
1 3 3 4 #SUP: 6
1 1 3 3 4 #SUP: 3
1 3 3 4 #SUP: 3
1 3 4 #SUP: 5
1 1 3 4 #SUP: 11
1 1 1 3 4 #SUP: 3
1 1 3 4 #SUP: 3
1 4 #SUP: 5
1 1 4 #SUP: 5
1 1 1 4 #SUP: 1
1 1 4 #SUP: 1
-2 #SUP: 6
-2 2 #SUP: 6
-2 2 2 #SUP: 3
-2 2 2 3 #SUP: 3
-2 1 2 2 3 #SUP: 5
-2 1 1 2 2 3 #SUP: 4
-2 1 1 2 2 3 3 #SUP: 2
-2 1 1 2 2 3 3 3 #SUP: 1
-2 1 1 2 2 3 3 #SUP: 1
-2 1 2 2 3 3 #SUP: 2
-2 1 2 2 3 3 3 #SUP: 1
-2 1 2 2 3 3 #SUP: 1
-2 1 2 2 3 #SUP: 4
-2 1 2 2 3 3 #SUP: 2
-2 1 2 2 3 3 3 #SUP: 1
-2 1 2 2 3 3 #SUP: 1
-2 2 2 3 3 #SUP: 2
-2 2 2 3 3 3 #SUP: 1
-2 2 2 3 3 #SUP: 1
-2 1 2 2 #SUP: 3
-2 2 3 #SUP: 6
-2 2 3 3 #SUP: 6
-2 2 3 3 3 #SUP: 3
-2 1 2 3 3 3 #SUP: 3
-2 1 1 2 3 3 3 #SUP: 3
-2 1 1 1 2 3 3 3 #SUP: 1
-2 1 1 2 3 3 3 #SUP: 1
-2 1 2 3 3 3 #SUP: 3
-2 1 1 2 3 3 3 #SUP: 1
-2 1 2 3 3 3 #SUP: 1
-2 1 2 3 3 #SUP: 6
-2 1 1 2 3 3 #SUP: 12
-2 1 1 1 2 3 3 #SUP: 3
-2 1 1 2 3 3 #SUP: 3
-2 1 2 3 #SUP: 6
-2 1 1 2 3 #SUP: 15
-2 1 1 1 2 3 #SUP: 3
-2 1 1 2 3 #SUP: 3
-2 1 2 #SUP: 6
-2 1 1 2 #SUP: 7
-2 1 1 1 2 #SUP: 1
-2 1 1 2 #SUP: 1
-2 3 #SUP: 6
-2 3 3 #SUP: 6
-2 1 3 3 #SUP: 7
-2 1 1 3 3 #SUP: 6
-2 1 1 1 3 3 #SUP: 3
-2 1 1 3 3 #SUP: 3
-2 1 3 3 #SUP: 6
-2 1 1 3 3 #SUP: 3
-2 1 3 3 #SUP: 3
-2 1 3 #SUP: 6
-2 1 1 3 #SUP: 11
-2 1 1 1 3 #SUP: 3
-2 1 1 3 #SUP: 3
-2 1 #SUP: 6
-2 1 1 #SUP: 5
-2 1 1 1 #SUP: 1
-2 1 1 #SUP: 1
2 #SUP: 6
2 2 #SUP: 3
2 2 3 #SUP: 3
1 2 2 3 #SUP: 5
1 1 2 2 3 #SUP: 4
1 1 2 2 3 3 #SUP: 2
1 1 2 2 3 3 3 #SUP: 1
1 1 2 2 3 3 #SUP: 1
1 2 2 3 3 #SUP: 2
1 2 2 3 3 3 #SUP: 1
1 2 2 3 3 #SUP: 1
1 2 2 3 #SUP: 4
1 2 2 3 3 #SUP: 2
1 2 2 3 3 3 #SUP: 1
1 2 2 3 3 #SUP: 1
2 2 3 3 #SUP: 2
2 2 3 3 3 #SUP: 1
2 2 3 3 #SUP: 1
1 2 2 #SUP: 3
2 3 #SUP: 6
2 3 3 #SUP: 6
2 3 3 3 #SUP: 3
1 2 3 3 3 #SUP: 3
1 1 2 3 3 3 #SUP: 3
1 1 1 2 3 3 3 #SUP: 1
1 1 2 3 3 3 #SUP: 1
1 2 3 3 3 #SUP: 3
1 1 2 3 3 3 #SUP: 1
1 2 3 3 3 #SUP: 1
1 2 3 3 #SUP: 6
1 1 2 3 3 #SUP: 12
1 1 1 2 3 3 #SUP: 3
1 1 2 3 3 #SUP: 3
1 2 3 #SUP: 6
1 1 2 3 #SUP: 15
1 1 1 2 3 #SUP: 3
1 1 2 3 #SUP: 3
1 2 #SUP: 6
1 1 2 #SUP: 7
1 1 1 2 #SUP: 1
1 1 2 #SUP: 1
3 #SUP: 6
3 3 #SUP: 6
1 3 3 #SUP: 7
1 1 3 3 #SUP: 6
1 1 1 3 3 #SUP: 3
1 1 3 3 #SUP: 3
1 3 3 #SUP: 6
1 1 3 3 #SUP: 3
1 3 3 #SUP: 3
1 3 #SUP: 6
1 1 3 #SUP: 11
1 1 1 3 #SUP: 3
1 1 3 #SUP: 3
1 #SUP: 6
1 1 #SUP: 5
1 1 1 #SUP: 1
1 1 #SUP: 1
-1 #SUP: 6
i do not understand the meaning of this output! on the other hand why is not this output in spmf output format (have not -1 and -2 )?

Hi,

FPGrowth is not a sequential pattern mining algorithm. It is a frequent itemset mining algorithm. Therefore, the output format is itemsets instead of sequential patterns. For this reason the format is different.

The output format of FPGrowth is as follows. Each line is a frequent itemset.
Each frequent itemset is a list of integers separated by single space. Then the keyword "#SUP:" appears followed by the support of the itemset.

So for example, consider this line of output:

1 2 5 #SUP: 3

It would mean that the itemset {1, 2, 5} is a frequent itemset with a support of 3 transactions.

Now, note that the input of FPGrowth is also different. It is a transaction database. I see that in the results that you have paste that you have run it on a sequence database. This is not a good idea. For a transaction database, the following assumptions are made:

an item cannot occur more than once on each line
each item is a positive integer
there is no -1 or -2 etc.

You can check the example about FPGrowth if you want more details about it.

Best,

Excuse me, i have one question! what is the different between frequent pattern and frequent sequence pattern? i know what is sequence pattern but what different between it and frequent pattern ?

oh, tank you for your reply my Friend

dsd



Edited 1 time(s). Last edit at 02/07/2014 04:56AM by webmasterphilfv.

another question: i run seq-dim_(prifixspan+Apriori) on contextMDsequence wit min_sup=50% and take this output:

[ * * * ]{t=0, 1 } #SUP: 2
[ 1 * * ]{t=0, 1 } #SUP: 2
[ * * 1 ]{t=0, 1 } #SUP: 2
[ 1 * 1 ]{t=0, 1 } #SUP: 2
[ * * * ]{t=0, 2 } #SUP: 4
[ 1 * * ]{t=0, 2 } #SUP: 3
[ * * 1 ]{t=0, 2 } #SUP: 2
[ * 2 * ]{t=0, 2 } #SUP: 2
[ 1 * 1 ]{t=0, 2 } #SUP: 2
[ 1 2 * ]{t=0, 2 } #SUP: 2
[ * * * ]{t=0, 3 } #SUP: 3
[ 1 * * ]{t=0, 3 } #SUP: 2
[ * * * ]{t=0, 3 5 } #SUP: 2
[ * * * ]{t=0, 5 } #SUP: 2
[ * * * ]{t=0, 6 } #SUP: 2
[ 1 * * ]{t=0, 6 } #SUP: 2
[ * 2 * ]{t=0, 6 } #SUP: 2
[ 1 2 * ]{t=0, 6 } #SUP: 2
[ * * * ]{t=0, 2 }{t=0, 3 } #SUP: 3
[ 1 * * ]{t=0, 2 }{t=0, 3 } #SUP: 2
[ * * * ]{t=0, 2 }{t=0, 3 5 } #SUP: 2
[ * * * ]{t=0, 2 }{t=0, 6 } #SUP: 2
[ 1 * * ]{t=0, 2 }{t=0, 6 } #SUP: 2
[ * 2 * ]{t=0, 2 }{t=0, 6 } #SUP: 2
[ 1 2 * ]{t=0, 2 }{t=0, 6 } #SUP: 2
[ * * * ]{t=0, 2 }{t=0, 5 } #SUP: 2


what meaning of t in this output?

Here is the details about the input and output format of SEQDIM:


Input file format

The input file format is defined as follows. It is a text file where each line represents a multi-dimensional sequence from a sequence database. Each line is separated into two parts: (1) a MD-pattern and (2) a sequence.

The first part is a list of dimension values separated by single spaces. A dimension value is a positive integer or the symbol "*" meaning "any values". Finally, the value "-3" indicates the end of the first part. Note that each line should have the same number of dimension values.
The second part of each line is a sequence. Each item in a sequence is represented by a postive integers and items from the same itemset whithin a sequence are separated by single space. Note that it is assumed that items whithin a same itemset are sorted according to a total order and that no item can appear twice in the same itemset. The value "-1" indicates the end of an itemset. The value "-2" indicates the end of a sequence (it appears at the end of each line).

For example, the input file "ContextMDSequenceNoTime.txt" contains the following four lines (four sequences).

1 1 1 -3 2 4 -1 3 -1 2 -1 1 -1 -2
1 2 2 -3 2 6 -1 3 5 -1 6 7 -1 -2
1 2 1 -3 1 8 -1 1 -1 2 -1 6 -1 -2
* 3 3 -3 2 5 -1 3 5 -1 -2

This file contains four MD-sequences (four lines). Each line has 3 dimensions in each MD-Pattern. For example, consider the second line. It represents a MD-sequence where the value for the three dimensions are respectively 1, 2 and 2. Then, the sequence in this MD-Sequence is the itemset {2, 6} followed by the itemset {3, 5}, followed by the itemset {6, 7}.

Output file format

The output file format is defined as follows. It is a text file. Each line is a frequent MD sequential pattern. Each line is separated into three parts: (1) a MD-pattern, (2) a sequence and (3) the support of the MD sequential pattern formed by the first and second part.

The first part is a list of dimension values separated by single spaces between the symbols "[" and "]". A dimension value is a positive integer or the symbol "*" meaning "any values". Note that each line have the same number of dimension values.
The second part of each line is a sequence. A sequence is a list of itemset. Each itemset is represented by {t=x, ...} where x is an integer indicating that the itemset is the x-th itemset of the sequence and where "..." is a list of items separated by single spaces. Each item in an itemset is represented by a postive integers. Note that it is assumed that items whithin a same itemset are sorted according to a total order and that no item can appear twice in the same itemset.
The third part is the keyword "#SUP:" followed by an integer indicating the support of the pattern as a number of sequences.

For example, a few lines from the output file from the previous example are shown below:

[ 1 * * ]{t=0, 2 }{t=0, 3 } #SUP: 2
[ * * * ]{t=0, 2 }{t=0, 3 } #SUP: 3
[ * * * ]{t=0, 2 }{t=0, 3 5 } #SUP: 2

Consider the first line. It presents a MD-sequential pattern having the dimension values 1, * and *. Furthemore, the line indicates that this pattern is for the sequence containing the itemset {2} followed by the itemset {3} and that the MD-Sequential-pattern has a support of 2 transactions. The next lines follow the same format.

tanks for your complete answer. a question:
[ 1 * * ]{t=0, 2 }{t=0, 3 } #SUP: 2
in this line i have two itemset : {2} and {3} . itemset {2} is 0-th itemset in sequence and also {3} is 0-th itemset!!!! is it possible? :O is {2} is 0-th itemset in sequence, {3} should 1-th itemset in same sequence!!

---

in your answer have one word "total order" . i do not understand what this mean!! is this mean the order of items in Originals DB ?

Yes you are right about 0-th itemset and 1-th itemset. I will fix this definition later.


For total order, it a mathematic definition that say that all elements into a set are ordered by some order with respect to each other.

For example, consider the set of all the letters from A to Z. The letters have a total order that is called the alphabetical order. This order is a,b,c,d,e ... Since all letters are ordered with respect to each other, we call this a total order.

Another example of total order is integers. Each number 1,2,3,4,5 is ordered with respect to each other number (i.e. you know which number is smaller or greater than any other numbers).

tank you my friend = ممنون دوست خوبم

Excuse me, i have one question! what is the different between frequent pattern and frequent sequence pattern? i know what is sequence pattern but what different between it and frequent pattern ?

oh, tank you for your reply my Friend

Hello,

"Frequent pattern mining" sometimes refer to "itemset mining".

But it can also refer to any kind of patterns in general such as itemsets, association rules, episodes, sequential patterns, etc.

It depends on the context.

HELLO, i want java code of two algorithms:
SPRIT and WAP-MIN? any body can help me ?

NO BODY CAN HELP ME?