Metodebevisregistrering
Semi-supervised Apriori Algorithm
The Semi-supervised Apriori algorithm extends the classic Apriori frequent-itemset miner by injecting background knowledge or labeled constraints — such as must-link pairs, forbidden items, or user-specified minimum support thresholds per group — to bias discovery toward practically meaningful association rules and reduce the search space.
Kilderegistrering
Citater kopieret ordret fra metodens kilderegistrering. Ingen påstandsniveauverifikation er udledt heraf.
Semi-supervised Apriori Algorithm for Constrained Association Rule Mining
Taksonomisk metoderegistrering · ml-model / machine-learning
- Agrawal, R., & Srikant, R. (1994). Fast algorithms for mining association rules. Proceedings of the 20th International Conference on Very Large Data Bases (VLDB), 487–499. · URL
- Liu, B., Hsu, W., & Ma, Y. (1999). Mining association rules with multiple minimum supports. Proceedings of the 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 337–341. · DOI 10.1145/312129.312274
Kuraterede påstande
Påstande gemt i bevis-loggen, hver med sin egen vurdering.
Ingen kuraterede påstande endnu
Denne visning opfinder ikke en påstandsvurdering, når loggen ingen har.
Relaterede metoder
Genereret fra metodegrafen og vist som maskinelt foreslåede relationer — ingen bevispåstand er udledt.