Metraipolis › archive › dc_08cb503a65a3

Best-first search-based approach for mining top-k closed frequent itemsets from uncertain databases — Europe PMC PMID:42308266

Source
Europe PMC (en)
Original
https://europepmc.org/article/MED/42308266
DOI
10.1371/journal.pone.0351951
License (as archived)
solo-consultazione
Archived
2026-10-06T17:32:25.839Z
SHA-256 of the archived text
86918d84ec1551d3e3d68fd87ff0b3e0cb43ea156679b2c9032f4aae4750a4cc
Stable URL of this page
https://metraipolis.com/documento/dc_08cb503a65a3

How to cite

Best-first search-based approach for mining top-k closed frequent itemsets from uncertain databases — Europe PMC PMID:42308266 — Europe PMC (en), https://europepmc.org/article/MED/42308266 (solo-consultazione); archived copy: https://metraipolis.com/documento/dc_08cb503a65a3 (Metraipolis archive dc_08cb503a65a3, sha256 86918d84ec1551d3e3d68fd87ff0b3e0cb43ea156679b2c9032f4aae4750a4cc)
BibTeX
@misc{dc08cb503a65a3,
  title = {Best-first search-based approach for mining top-k closed frequent itemsets from uncertain databases — Europe PMC PMID:42308266},
  howpublished = {Europe PMC (en)},
  url = {https://europepmc.org/article/MED/42308266},
  note = {License solo-consultazione; archived copy https://metraipolis.com/documento/dc_08cb503a65a3; sha256 86918d84ec1551d3e3d68fd87ff0b3e0cb43ea156679b2c9032f4aae4750a4cc},
  year = {2026}
}

Archived text

The text is not reproduced here: the archive holds it as solo-consultazione (consultation only, no republication). Read it at the original source: https://europepmc.org/article/MED/42308266. Agents can read the archived copy with the MCP tool read_document.