EconPapers    
Economics at your fingertips  
 

Best-first search–based approach for mining top-k closed frequent itemsets from uncertain databases

Nguyen Le, Huy Vo and Thien Nguyen

PLOS ONE, 2026, vol. 21, issue 6, 1-41

Abstract: Uncertain data mining has become critical due to data generated by sensor networks, RFID systems, and data integration platforms. Mining top-k closed frequent itemsets from uncertain databases is particularly challenging because probabilistic support evaluation is expensive and the search space grows exponentially. Most existing methods rely on depth-first search (DFS) traversal, which explores candidates in enumeration order and often discovers high-support patterns late, leading to weak pruning and costly closure verification. This paper proposes TUFCI, a best-first-search-based algorithm for mining top-k closed frequent itemsets from uncertain databases. TUFCI explores candidates in descending order of probabilistic support using a priority queue, enabling early discovery of strong patterns, rapid threshold elevation, and safe early termination. Support-ordered exploration also improves closure checking by prioritizing supersets most likely to violate the closure property, thereby reducing redundant superset examinations. Experimental results demonstrate that TUFCI significantly outperforms DFS-based approaches in runtime and reduces the number of closure checks, especially on dense datasets.

Date: 2026
References: Add references at CitEc
Citations:

Downloads: (external link)
https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0351951 (text/html)
https://journals.plos.org/plosone/article/file?id= ... 51951&type=printable (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:plo:pone00:0351951

DOI: 10.1371/journal.pone.0351951

Access Statistics for this article

More articles in PLOS ONE from Public Library of Science
Bibliographic data for series maintained by plosone ().

 
Page updated 2026-06-21
Handle: RePEc:plo:pone00:0351951