Best-first search–based approach for mining top-k closed frequent itemsets from uncertain databases
Nguyen Le, Huy Vo, Thien Nguyen · 2026
Read Best-first search–based approach for mining top-k closed frequent itemsets from uncertain databases by Nguyen Le, Huy Vo, Thien Nguyen (2026) in the Tower of Babel, a free online library of public-domain works preserved in clean, searchable text. No sign-up. The full text is served as a plain-text file at a predictable URL, where text is present: https://antarctic-labs.com/tower-of-babel/plos-pone-0351951.txt.
Description
Finding the most common shopping-basket style patterns in messy, uncertain data is slow work. Nguyen Le, Huy Vo, and Thien Nguyen propose a smarter search method, called TUFCI, in this 2026 PLOS One computer science paper.
Older methods walk through candidates in a fixed order and often find the strongest patterns late, wasting effort. The new method keeps a priority line so high-scoring candidates come first, letting weak branches be cut early and the search stop sooner. Extra checks that confirm a pattern cannot grow are also saved. In tests, the method ran faster than depth-first rivals, especially on dense datasets.
Catalog record
| CREATOR | Nguyen Le, Huy Vo, Thien Nguyen |
|---|---|
| YEAR | 2026 |
| COLLECTION | PAPERS |
| FORMAT | TXT |
| FILE SIZE | 107247 |
| LICENSE | CC_BY |
| RIGHTS | CC BY |
| SOURCE | PLOS |