The hardware and bandwidth for this mirror is donated by METANET, the Webhosting and Full Service-Cloud Provider.
If you wish to report a bug, or if you are interested in having us mirror your free-software or open-source project, please feel free to contact us at mirror[@]metanet.ch.
Advertisers use a variety of online marketing channels to reach consumers and they want to know the degree each channel contributes to their marketing success. This is called online multi-channel attribution problem. This package contains a probabilistic algorithm for the attribution problem. The model uses a k-order Markov representation to identify structural correlations in the customer journey data. The package also contains three heuristic algorithms (first-touch, last-touch and linear-touch approach) for the same problem. The algorithms are implemented in C++.
| Version: | 2.0.7 |
| Imports: | Rcpp |
| LinkingTo: | Rcpp, RcppArmadillo |
| Published: | 2023-05-17 |
| DOI: | 10.32614/CRAN.package.ChannelAttribution |
| Author: | Davide Altomare [cre, aut], David Loris [aut] |
| Maintainer: | Davide Altomare <info at channelattribution.io> |
| License: | GPL-3 | file LICENSE |
| Copyright: | see file COPYRIGHTS |
| URL: | https://channelattribution.io |
| NeedsCompilation: | yes |
| CRAN checks: | ChannelAttribution results |
| Reference manual: | ChannelAttribution.pdf |
| Package source: | ChannelAttribution_2.0.7.tar.gz |
| Windows binaries: | r-devel: ChannelAttribution_2.0.7.zip, r-release: ChannelAttribution_2.0.7.zip, r-oldrel: ChannelAttribution_2.0.7.zip |
| macOS binaries: | r-release (arm64): ChannelAttribution_2.0.7.tgz, r-oldrel (arm64): ChannelAttribution_2.0.7.tgz, r-release (x86_64): ChannelAttribution_2.0.7.tgz, r-oldrel (x86_64): ChannelAttribution_2.0.7.tgz |
| Old sources: | ChannelAttribution archive |
| Reverse imports: | ChannelAttributionApp |
Please use the canonical form https://CRAN.R-project.org/package=ChannelAttribution to link to this page.
These binaries (installable software) and packages are in development.
They may not be fully stable and should be used with caution. We make no claims about them.