The Data Mining Forum                             open-source data mining software data science journal data mining conferences high utility mining book
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!.  
Find periodic patterns repecting the order of items
Posted by: akamba
Date: November 14, 2017 05:22AM

Hi philippe and all,
Your PFPM algorithm is very interesting. However, if i want to conserve order of items which part of your code can i modify ? Let me give more explanations. If the current itemset is {a,b}, algorithm will found it in the itemSet {a,b,c} and also in itemset {a,c,b}. I want PFPM just found {a,b} in {a,b,c} and not in {a,c,b} because in this itemset order of {a,b} is not respect.



Edited 1 time(s). Last edit at 11/16/2017 05:56AM by webmasterphilfv.

Options: ReplyQuote
Re: Find patter repecting order of them
Date: November 14, 2017 06:38AM

Hello,

In general, in itemset mining, there is no order between the items in an itemset. Thus, {a,b,c} and {a,c,b} are the same itemset.

The PFPM algorithm is thus designed with that assumption that there is no order in an itemset.

You could change that. But that would require some programming. If you want to do that, you should read the code or make sure that you understand the algorithm well first and then find the way to modify it. Personally, I did not think about it. But I think you can certainly do it.

Best regards,

Options: ReplyQuote


Your Name: 
Your Email: 
Subject: 
Spam prevention:
Please, solve the mathematical question and enter the answer in the input field below. This is for blocking bots that try to post this form automatically.
Question: how much is 9 plus 10?
This forum is powered by Phorum and provided by P. Fournier-Viger (© 2012).
Terms of use.