A Novel Approach for Finding Rare Items Based on Multiple Minimum Support Framework

Citations of this article
Mendeley users who have this article in their library.


Pattern mining methods describe valuable and advantageous items from a large amount of records stored in the corporate datasets and repositories. While mining, literature has almost singularly focused on frequent itemset but in many applications rare ones are of higher interest. For Example medical dataset can be considered, where rare combination of prodrome plays a vital role for the physicians. As rare items contain worthwhile information, researchers are making efforts to examine effective methodologies to extract the same. In this paper, an effort is made to analyze the complete set of rare items for finding almost all possible rare association rules from the dataset. The Proposed approach makes use of Maximum constraint model for extracting the rare items. A new approach is efficient to mine rare association rules which can be defined as rules containing the rare items. Based on the study of relevant data structures of the mining space, this approach utilizes a tree structure to ascertain the rare items. Finally, it is demonstrated that this new approach is more virtuous and robust than the existing algorithms.




Bhatt, U., & Patel, P. (2015). A Novel Approach for Finding Rare Items Based on Multiple Minimum Support Framework. In Procedia Computer Science (Vol. 57, pp. 1088–1095). Elsevier. https://doi.org/10.1016/j.procs.2015.07.391

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free