Wird geladen...
Boosting association rule mining in large datasets via Gibbs sampling
Current algorithms for association rule mining from transaction data are mostly deterministic and enumerative. They can be computationally intractable even for mining a dataset containing just a few hundred transaction items, if no action is taken to constrain the search space. In this paper, we dev...
Gespeichert in:
| Veröffentlicht in: | Proc Natl Acad Sci U S A |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Artigo |
| Sprache: | Inglês |
| Veröffentlicht: |
National Academy of Sciences
2016
|
| Schlagworte: | |
| Online Zugang: | https://ncbi.nlm.nih.gov/pmc/articles/PMC4983808/ https://ncbi.nlm.nih.gov/pubmed/27091963 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1073/pnas.1604553113 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|