Online estimation of discrete densities
| dc.contributor.author | Geilke, Michael | |
| dc.contributor.author | Frank, Eibe | |
| dc.contributor.author | Karwath, Andreas | |
| dc.contributor.author | Kramer, Stefan | |
| dc.contributor.editor | Xiong, H | |
| dc.contributor.editor | Karypis, G | |
| dc.contributor.editor | Thuraisingham, B | |
| dc.contributor.editor | Cook, D | |
| dc.contributor.editor | Wu, X | |
| dc.coverage.spatial | Conference held at Dallas, Texas | |
| dc.date.accessioned | 2024-12-06T02:27:31Z | |
| dc.date.available | 2024-12-06T02:27:31Z | |
| dc.date.issued | 2013 | |
| dc.description.abstract | We address the problem of estimating a discrete joint density online, that is, the algorithm is only provided the current example and its current estimate. The proposed online estimator of discrete densities, EDDO (Estimation of Discrete Densities Online), uses classifier chains to model dependencies among features. Each classifier in the chain estimates the probability of one particular feature. Because a single chain may not provide a reliable estimate, we also consider ensembles of classifier chains and ensembles of weighted classifier chains. For all density estimators, we provide consistency proofs and propose algorithms to perform certain inference tasks. The empirical evaluation of the estimators is conducted in several experiments and on data sets of up to several million instances: We compare them to density estimates computed from Bayesian structure learners, evaluate them under the influence of noise, measure their ability to deal with concept drift, and measure the run-time performance. Our experiments demonstrate that, even though designed to work online, EDDO delivers estimators of competitive accuracy compared to batch Bayesian structure learners and batch variants of EDDO. | |
| dc.identifier.citation | Geilke, M., Frank, E., Karwath, A., & Kramer, S. (2013). Online estimation of discrete densities. Proceedings / IEEE International Conference on Data Mining. IEEE International Conference on Data Mining, 191-200. https://doi.org/10.1109/ICDM.2013.91 | |
| dc.identifier.doi | 10.1109/ICDM.2013.91 | |
| dc.identifier.issn | 1550-4786 | |
| dc.identifier.uri | https://hdl.handle.net/10289/17079 | |
| dc.language.iso | en | |
| dc.publisher | IEEE | |
| dc.relation.isPartOf | Proceedings of the 13th IEEE International Conference on Data Mining | |
| dc.rights | This is an accepted version of a conference paper published online at https://ieeexplore.ieee.org/document/6729503. © 2013 IEEE. | |
| dc.rights.uri | http://creativecommons.org/licenses/by/4.0/ | |
| dc.source | IEEE 13th International Conference on Data Mining 2013 | |
| dc.subject | (ensembles of) classifier chains | |
| dc.subject | Bayes methods | |
| dc.subject | computer science | |
| dc.subject | data streams | |
| dc.subject | density estimation | |
| dc.subject | density measurement | |
| dc.subject | estimation | |
| dc.subject | Hoeffding trees | |
| dc.subject | inference algorithms | |
| dc.subject | joints | |
| dc.subject | noise measurement | |
| dc.subject | radiation detectors | |
| dc.subject | Science & Technology | |
| dc.subject | Technology | |
| dc.subject | Computer Science, Artificial Intelligence | |
| dc.subject | Computer Science | |
| dc.subject | CLASSIFICATION | |
| dc.subject.anzsrc2020 | 46 Information and Computing Sciences | |
| dc.subject.anzsrc2020 | 4905 Statistics | |
| dc.subject.anzsrc2020 | 49 Mathematical Sciences | |
| dc.subject.anzsrc2020 | 4603 Computer Vision and Multimedia Computation | |
| dc.subject.anzsrc2020 | 4611 Machine Learning | |
| dc.title | Online estimation of discrete densities | |
| dc.type | Conference Contribution | |
| pubs.publisher-url | https://ieeexplore.ieee.org/document/6729503 |