Skip to content

High-Utility Sequential Rule Mining Based on Segmentation

Notifications You must be signed in to change notification settings

IOTS-HIT/Segmentation

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

7 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Segmentation

High-Utility Sequential Rule Mining Based on Segmentation

The NoRepeat directory contains the implementation code of the algorithms RSC, RSCN, TotalSR and TotalUS, all of which are designed for mining sequences without repeated items. In these implementations, only the item with the highest utility is retained if duplicates appear within a sequence. The method TotalUS is implemented in Comparators.java under the TotalSR folder, and the execution mode can be specified in the main class Algo.java.

The Repeat directory contains the implementation code of the RSC and RSCR algorithms, which are capable of mining sequences that contain repeated items.

About

High-Utility Sequential Rule Mining Based on Segmentation

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published