This forum is about

Identify rules knowing their second part

Posted by:
**
BERTHE Aboubacar
**

Date: June 19, 2018 06:40AM

Good afternoon Professor ,

My question is about a possible way to adapt the RuleGrowth/TRuleGrowth algorithm

to identify rules knowing their second part

For exemple from my sequential database I would like to identify only rules like X => { i } where i is the second part of my rules

and X can be any item set.

Is it an algorithm from the SPMF library that allow to do this? An extension of the RuleGrowth Algorithm or the TRuleGrowth algorithm to allow that?

Best Regards,

My question is about a possible way to adapt the RuleGrowth/TRuleGrowth algorithm

to identify rules knowing their second part

For exemple from my sequential database I would like to identify only rules like X => { i } where i is the second part of my rules

and X can be any item set.

Is it an algorithm from the SPMF library that allow to do this? An extension of the RuleGrowth Algorithm or the TRuleGrowth algorithm to allow that?

Best Regards,

Posted by:
**
webmasterphilfv
**

Date: June 19, 2018 07:21AM

Hello,

Yes, I call this a class sequential rules. There is this algorithm in SPMF:

*the TopSeqClassRules algorithm for mining the top-k class sequential rules*

that does that.

It will let you select {i} to find the k most frequent sequential rules of the form X --> {i}.

This algorithm is similar to RuleGrowth but modified to do that.

Best

Philippe

Edited 1 time(s). Last edit at 06/19/2018 07:22AM by webmasterphilfv.

Yes, I call this a class sequential rules. There is this algorithm in SPMF:

that does that.

It will let you select {i} to find the k most frequent sequential rules of the form X --> {i}.

This algorithm is similar to RuleGrowth but modified to do that.

Best

Philippe

Edited 1 time(s). Last edit at 06/19/2018 07:22AM by webmasterphilfv.