### Abstract

We propose a new approach to large-scale machine learning, learning over compressed data: First compress the training data somehow and then employ various machine learning algorithms on the compressed data, with the hope that the computation time is significantly reduced when the training data is well compressed. As the first step, we consider a variant of the Zero-Suppressed Binary Decision Diagram (ZDD) as the data structure for representing the training data, which is a generalization of the ZDD by incorporating non-determinism. For the learning algorithm to be employed, we consider boosting algorithm called AdaBoost* and its precursor AdaBoost. In this work, we give efficient implementations of the boosting algorithms whose running times (per iteration) are linear in the size of the given ZDD.

Original language | English |
---|---|

Title of host publication | WALCOM |

Subtitle of host publication | Algorithms and Computation - 12th International Conference, WALCOM 2018, Proceedings |

Editors | M. Sohel Rahman, Wing-Kin Sung, Ryuhei Uehara |

Publisher | Springer Verlag |

Pages | 195-206 |

Number of pages | 12 |

ISBN (Print) | 9783319751719 |

DOIs | |

Publication status | Published - Jan 1 2018 |

Event | 12th International Conference and Workshop on Algorithms and Computation, WALCOM 2018 - Dhaka, Bangladesh Duration: Mar 3 2018 → Mar 5 2018 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 10755 LNCS |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Other

Other | 12th International Conference and Workshop on Algorithms and Computation, WALCOM 2018 |
---|---|

Country | Bangladesh |

City | Dhaka |

Period | 3/3/18 → 3/5/18 |

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Computer Science(all)

## Fingerprint Dive into the research topics of 'Boosting over non-deterministic ZDDs'. Together they form a unique fingerprint.

## Cite this

*WALCOM: Algorithms and Computation - 12th International Conference, WALCOM 2018, Proceedings*(pp. 195-206). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10755 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-75172-6_17