![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextgreen.png)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextred.png)
![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextgreen.png)
![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltext_open_medium.gif)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextred.png)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltext_restricted_medium.gif)
Temporal-Hmine-Rev Algorithm for Mining Frequent Patterns in Temporal Databases
Subscribe/Renew Journal
A temporal association rule is an association rule that holds during specific time intervals. The problem is to discover complete set of frequent patterns with respect to calendar schema from a set of time stamped transactions. This paper uses the data structure H-struct (Hyper-structure) of Hmine-rev, and incorporated temporal aspects and it is called T-Hmine-rev (Temporal-Hmine-reverse). Hmine-rev is a revised algorithm of H-mine (Hyper-structure mining) which is used for mining frequent patterns and it does not need any adjustment of H-struct links structure like H-mine. Hmine-rev works well on sparse dataset and H-struct is used for fast mining on time-based dataset.
Keywords
Association Rule, Calendar Schema, Frequent Patterns, H-Struct, Temporal Association Rule.
User
Subscription
Login to verify subscription
Font Size
Information
![](https://i-scholar.in/public/site/images/abstractview.png)
Abstract Views: 272
![](https://i-scholar.in/public/site/images/pdfview.png)
PDF Views: 8