Best-first search-based approach for mining top-k closed frequent itemsets from uncertain databases.
Saved in:
| Title: | Best-first search-based approach for mining top-k closed frequent itemsets from uncertain databases. |
|---|---|
| Authors: | Le N; Faculty of Information Technology, Ton Duc Thang University, Ho Chi Minh City, Vietnam., Vo H; Faculty of Information Technology, Ton Duc Thang University, Ho Chi Minh City, Vietnam., Nguyen T; Natural Language Processing and Knowledge Discovery Research Group, Faculty of Information Technology, Ton Duc Thang University, Ho Chi Minh City, Vietnam. |
| Source: | PloS one [PLoS One] 2026 Jun 17; Vol. 21 (6), pp. e0351951. Date of Electronic Publication: 2026 Jun 17 (Print Publication: 2026). |
| Publication Type: | Journal Article |
| Journal Info: | Publisher: Public Library of Science Country of Publication: United States NLM ID: 101285081 Publication Model: eCollection Cited Medium: Internet ISSN: 1932-6203 (Electronic) Linking ISSN: 19326203 NLM ISO Abbreviation: PLoS One Subsets: MEDLINE |
| Database: | MEDLINE Ultimate |
|
Full text is not displayed to guests.
Login for full access.
|
|
| ISSN: | 1932-6203 |
|---|---|
| DOI: | 10.1371/journal.pone.0351951 |
