Skip to main navigation Skip to search Skip to main content

Fast counting in machine learning applications

  • S. Karan
  • , M. Eichhorn
  • , B. Hurlburt
  • , G. Iraci
  • , J. Zola
  • SUNY Buffalo

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

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.

Original languageEnglish
Title of host publication34th Conference on Uncertainty in Artificial Intelligence 2018, UAI 2018
EditorsRicardo Silva, Amir Globerson, Amir Globerson
PublisherAssociation For Uncertainty in Artificial Intelligence (AUAI)
Pages540-549
Number of pages10
ISBN (Electronic)9781510871601
StatePublished - 2018
Event34th Conference on Uncertainty in Artificial Intelligence 2018, UAI 2018 - Monterey, United States
Duration: Aug 6 2018Aug 10 2018

Publication series

Name34th Conference on Uncertainty in Artificial Intelligence 2018, UAI 2018
Volume2

Conference

Conference34th Conference on Uncertainty in Artificial Intelligence 2018, UAI 2018
Country/TerritoryUnited States
CityMonterey
Period08/6/1808/10/18

Fingerprint

Dive into the research topics of 'Fast counting in machine learning applications'. Together they form a unique fingerprint.

Cite this