Advertisement
Published in:
2017 | OriginalPaper | Chapter
Mining Rare Patterns Using Hyper-Linked Data Structure
Authors : Anindita Borah, Bhabesh Nath
Published in: Pattern Recognition and Machine Intelligence
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Abstract
Rare pattern mining has emerged as a compelling field of research over the years. Experimental results from literature illustrate that tree-based approaches are most efficient among the rare pattern mining techniques. Despite their significance and implication, tree-based approaches become inefficient while dealing with sparse data and data with short patterns and also suffer from the limitation of memory. In this study, an efficient rare pattern mining technique has been proposed that employs a hyper-linked data structure to overcome the shortcomings of tree data structure based approaches. The hyper-linked data structure enables dynamic adjustment of links during the mining process that reduces the space overhead and performs better with sparse datasets.