Laddar...
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...
Sparad:
| I publikationen: | Proc Natl Acad Sci U S A |
|---|---|
| Huvudupphovsmän: | , , , |
| Materialtyp: | Artigo |
| Språk: | Inglês |
| Publicerad: |
National Academy of Sciences
2016
|
| Ämnen: | |
| Länkar: | 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 |
| Taggar: |
Lägg till en tagg
Inga taggar, Lägg till första taggen!
|