Hello,

This is to announce that I have made a Java implementation of the SPAM algorithm for sequential pattern mining.

For those of you who are interested in the SPAM algorithm, you can download the source code of my implementation as part of the Sequential Pattern Mining Framework.

I think that the SPAM algorithm is a nice algorithm. It seems pretty fast and it is memory efficient.

The article describing SPAM is:

Jay Ayres, Johannes Gehrke, Tomi Yiu, and Jason Flannick. Sequential PAttern Mining Using Bitmaps. In Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Edmonton, Alberta, Canada, July 2002.

The article is relatively easy to read compared to some other data mining algorithms.

Philippe



Edited 2 time(s). Last edit at 08/11/2011 10:29PM by webmasterphilfv.

Wow!!! I was looking for that SPAM source code for a long time.

Thanks!!!

Carlos

I am looking for that SPAM source code
thinks
Shupengzhai

Thank u sir

PLEASE give me source code of Sequential pattern mining algo

You can download sequential pattern mining algorithms here : here

Philippe



Edited 1 time(s). Last edit at 02/08/2017 06:43PM by webmasterphilfv.

Dear Sir/Mam,

I couldn't see yhe code properly,If possible can u send the SPAM algorithm sourcecode.



Regards,
Gladence.

Hello,

Go to the download page:

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

Download spmf.zip:

http://www.philippe-fournier-viger.com/spmf/spmf.zip


Then, read the installation instructions for installing the source code and compile it:

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

The source code of SPAM will be in the folder:

ca.pfv.spmf.algorithms.sequential_patterns.spam

or something like that.

Best,

Philippe

I want source code for sp mining the text and algo or for dpattern mining

i want SPRIT and WAP-MIN source code! where i found it?

Can you explain to me about 5 last lines of part III in pager http://www.philippe-fournier-viger.com/spmf/SPAM.pdf

Quote

In the final bitmap, the second bit
and the third bit for the first customer have value one, which
means that the last itemset (i.e. {b, d}) of the sequence appears in both transaction 2 and transaction 3, and the other
itemsets in the sequence (i.e. {a}) appear in transaction 1

and if you can, please do many examples about some sequences with mini surport is 2

I had understand. Mustn't transaction 2 and transaction 3, it is transaction second and transaction third of customer ID 1

Dear Sir

Kindly arrange source code of FAst Sequential Pattern Update Algorithm(FASTUP)

Aprrov

Thanks for the request.

I'm not very interested by this algorithm since it is old (1998) and it is based on GSP and GSP is very slow.

Some other algorithms like IncSpan (2004) are probably faster since they are not based on GSP.

apurv Wrote:
-------------------------------------------------------
> Dear Sir
>
> Kindly arrange source code of IncSpan aLGORITHM.
>
> Aprrov

Thanks for the request. Maybe I would do it in the future because now, I'm busy with other projects. I take note of all the requests.

Hello,

I'm working on pattern mining, I want the java source code of spam algorithm,
please kindly send me the code.

Thanks and regards
Megha

You can get the Java source code of SPAM and faster algorithms in the SPMF data mining library.

ssss