feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    UID:
    almahu_9948130041802882
    Format: IX, 330 p. 111 illus., 63 illus. in color. , online resource.
    ISBN: 9783030139629
    Series Statement: Studies in Big Data, 56
    Content: This book presents a unique approach to stream data mining. Unlike the vast majority of previous approaches, which are largely based on heuristics, it highlights methods and algorithms that are mathematically justified. First, it describes how to adapt static decision trees to accommodate data streams; in this regard, new splitting criteria are developed to guarantee that they are asymptotically equivalent to the classical batch tree. Moreover, new decision trees are designed, leading to the original concept of hybrid trees. In turn, nonparametric techniques based on Parzen kernels and orthogonal series are employed to address concept drift in the problem of non-stationary regressions and classification in a time-varying environment. Lastly, an extremely challenging problem that involves designing ensembles and automatically choosing their sizes is described and solved. Given its scope, the book is intended for a professional audience of researchers and practitioners who deal with stream data, e.g. in telecommunication, banking, and sensor networks.
    Note: Introduction and Overview of the Main Results of the Book -- Basic concepts of data stream mining -- Decision Trees in Data Stream Mining -- Splitting Criteria based on the McDiarmid’s Theorem.
    In: Springer eBooks
    Additional Edition: Printed edition: ISBN 9783030139612
    Additional Edition: Printed edition: ISBN 9783030139636
    Additional Edition: Printed edition: ISBN 9783030139643
    Language: English
    Subjects: Computer Science
    RVK:
    URL: Volltext  (URL des Erstveröffentlichers)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Book
    Book
    Warszawa :Instytut Badań Literackich Pan Wadawnictwo,
    UID:
    almahu_BV044705130
    Format: 464 Seiten, 23 ungezählte Seiten Bildtafeln : , Illustrationen ; , 24 cm.
    ISBN: 978-83-65832-19-1
    Note: Literaturverzeichnis Seite 421-444 ; Index ; Englische Zusammenfassung unter dem Titel: Modern Orpheus , Text polnisch
    Language: Polish
    Subjects: Slavic Studies
    RVK:
    RVK:
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Online Resource
    Online Resource
    Cham :Springer International Publishing :
    UID:
    edoccha_9959767498002883
    Format: 1 online resource (331 pages).
    Edition: 1st ed. 2020.
    ISBN: 3-030-13962-X
    Series Statement: Studies in Big Data, 56
    Content: This book presents a unique approach to stream data mining. Unlike the vast majority of previous approaches, which are largely based on heuristics, it highlights methods and algorithms that are mathematically justified. First, it describes how to adapt static decision trees to accommodate data streams; in this regard, new splitting criteria are developed to guarantee that they are asymptotically equivalent to the classical batch tree. Moreover, new decision trees are designed, leading to the original concept of hybrid trees. In turn, nonparametric techniques based on Parzen kernels and orthogonal series are employed to address concept drift in the problem of non-stationary regressions and classification in a time-varying environment. Lastly, an extremely challenging problem that involves designing ensembles and automatically choosing their sizes is described and solved. Given its scope, the book is intended for a professional audience of researchers and practitioners who deal with stream data, e.g. in telecommunication, banking, and sensor networks.
    Note: Introduction and Overview of the Main Results of the Book -- Basic concepts of data stream mining -- Decision Trees in Data Stream Mining -- Splitting Criteria based on the McDiarmid’s Theorem.
    Additional Edition: ISBN 3-030-13961-1
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Online Resource
    Online Resource
    Cham :Springer International Publishing :
    UID:
    almafu_9959767498002883
    Format: 1 online resource (331 pages).
    Edition: 1st ed. 2020.
    ISBN: 3-030-13962-X
    Series Statement: Studies in Big Data, 56
    Content: This book presents a unique approach to stream data mining. Unlike the vast majority of previous approaches, which are largely based on heuristics, it highlights methods and algorithms that are mathematically justified. First, it describes how to adapt static decision trees to accommodate data streams; in this regard, new splitting criteria are developed to guarantee that they are asymptotically equivalent to the classical batch tree. Moreover, new decision trees are designed, leading to the original concept of hybrid trees. In turn, nonparametric techniques based on Parzen kernels and orthogonal series are employed to address concept drift in the problem of non-stationary regressions and classification in a time-varying environment. Lastly, an extremely challenging problem that involves designing ensembles and automatically choosing their sizes is described and solved. Given its scope, the book is intended for a professional audience of researchers and practitioners who deal with stream data, e.g. in telecommunication, banking, and sensor networks.
    Note: Introduction and Overview of the Main Results of the Book -- Basic concepts of data stream mining -- Decision Trees in Data Stream Mining -- Splitting Criteria based on the McDiarmid’s Theorem.
    Additional Edition: ISBN 3-030-13961-1
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages