Fast Counting in Machine Learning Applications
Abstract
We propose scalable methods to execute counting queries in machine learning applications. To achieve memory and computational efficiency, we abstract counting queries and their context such that the counts can be aggregated as a stream. We demonstrate performance and scalability of the resulting approach on random queries, and through extensive experimentation using Bayesian networks learning and association rule mining. Our methods significantly outperform commonly used ADtrees and hash tables, and are practical alternatives for processing large-scale data.
Cite
Text
Karan et al. "Fast Counting in Machine Learning Applications." Conference on Uncertainty in Artificial Intelligence, 2018.Markdown
[Karan et al. "Fast Counting in Machine Learning Applications." Conference on Uncertainty in Artificial Intelligence, 2018.](https://mlanthology.org/uai/2018/karan2018uai-fast/)BibTeX
@inproceedings{karan2018uai-fast,
title = {{Fast Counting in Machine Learning Applications}},
author = {Karan, Subhadeep and Eichhorn, Matthew and Hurlburt, Blake and Iraci, Grant and Zola, Jaroslaw},
booktitle = {Conference on Uncertainty in Artificial Intelligence},
year = {2018},
pages = {540-549},
url = {https://mlanthology.org/uai/2018/karan2018uai-fast/}
}