Deakin University
Browse

Stream quantiles via maximal entropy histograms

Version 2 2024-06-03, 16:51
Version 1 2015-03-17, 11:22
chapter
posted on 2024-06-03, 16:51 authored by O Arandjelović, D Pham, Svetha VenkateshSvetha Venkatesh
We address the problem of estimating the running quantile of a data stream when the memory for storing observations is limited.We (i) highlight the limitations of approaches previously described in the literature which make them unsuitable for non-stationary streams, (ii) describe a novel principle for the utilization of the available storage space, and (iii) introduce two novel algorithms which exploit the proposed principle. Experiments on three large realworld data sets demonstrate that the proposed methods vastly outperform the existing alternatives.

History

Volume

8835

Chapter number

40

Pagination

327-334

ISSN

0302-9743

eISSN

1611-3349

ISBN-13

9783319126395

Language

eng

Publication classification

B1 Book chapter, B Book chapter

Copyright notice

2014, Springer

Extent

71

Editor/Contributor(s)

Loo C, Yap KS, Wong KW, Teoh A, Huang K

Publisher

Springer Verlag

Place of publication

Berlin, Germany

Title of book

Neural information processing : 21st International Conference ICONIP 2014 Kuching, Malaysia, November 3-6, 2014 Proceedings, Part II

Series

Lecture Notes in Computer Science

Usage metrics

    Research Publications

    Categories

    No categories selected

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC