Asset Details
Do you wish to reserve the book?
A New Algorithm for Extracting Textual Maximal Frequent Itemsets from Arabic Documents
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
A New Algorithm for Extracting Textual Maximal Frequent Itemsets from Arabic Documents
Do you wish to request the book?
A New Algorithm for Extracting Textual Maximal Frequent Itemsets from Arabic Documents
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
A New Algorithm for Extracting Textual Maximal Frequent Itemsets from Arabic Documents
2021
Overview
In this paper, a new technique has been suggested for extracting textual maximal frequent itemsets named Maximal Itemset Miner Algorithm (MIMA). This algorithm begins search process through generating the best initial border in search space depending on minimum support of items in the first level that achieves the general minimum support determined by the user. Our approach for counting itemsets support combines the idea of vertical representation of the data with a queue data structure to store the itemsets. To reduce search space, the algorithm adopted several pruning conditions for each itemsets in the initial border. Experiments performed on standard textual CNN Arabic dataset and proposed method registers less execution time comparing with the Apriori algorithm when applying it on three different size datasets.
Publisher
IOP Publishing
Subject
