Rauf Aliev

BloomSpan: Memory-Efficient Maximal Frequent Substring Mining for Large-Scale Text

BloomSpan is a memory-efficient algorithm for mining Maximal Contiguous Frequent Phrases (MCFPs) from large text corpora. MCFPs are strictly contiguous token sequences satisfying a minimum document-support threshold; unlike general Sequential Pattern Mining, no gaps are permitted...