{"controller"=>"catalog", "action"=>"show", "id"=>"232123220"}
  • EN
  • DA

Danish NationalResearch Database

  • Search Publications & Researchers
  • Open Access Indicator
  • Publications
  • Researchers
Example Finds records
water{} containing the word "water".
water supplies"{}" containing the phrase "water supplies".
author:"Doe, John"author:"{}" containing the prase "Doe, John" in the author field.
title:IEEEtitle:{} containing the word "IEEE" in the title field.
Need more help? Advanced search tutorial
  • Selected (0)
  • History

An Adaptive Algorithm for Finding Frequent Sets in Landmark Windows

    • Save to Mendeley
    • Export to BibTeX
    • Export to RIS
    • Email citation
Authors:
  • Dang, Xuan-Hong ;
    Close
    Department of Computer Science, Science and Technology, Aarhus University
  • Ong, Kok-Leong ;
    Close
    School of IT, Deakin University
  • Lee, Vincent
    Close
    Faculty of IT, Monash University
DOI:
10.1007/978-3-642-33362-0_47
Abstract:
We consider a CPU constrained environment for finding approximation of frequent sets in data streams using the landmark window. Our algorithm can detect overload situations, i.e., breaching the CPU capacity, and sheds data in the stream to “keep up”. This is done within a controlled error threshold by exploiting the Chernoff-bound. Empirical evaluation of the algorithm confirms the feasibility.
Type:
Conference paper
Language:
English
Published in:
Lecture Notes in Computer Science, 2012, Vol 7520, p. 590-597
Main Research Area:
Science/technology
Publication Status:
Published
Review type:
Peer Review
Conference:
International Conference on Scalable Uncertainty Management, 2012
Submission year:
2012
Scientific Level:
Scientific
ID:
232123220

Full text access

  • Openaccess Aarhus University
  • Doi Get publisher edition via DOI resolver
Checking for on-site access...

On-site access

At institution

  • Aarhus university.en

Metrics

Feedback

Sitemap

  • Search
    • Statistics
    • Tutorial
    • Data
    • FAQ
    • Contact
  • Open Access
    • Overview
    • Development
    • FAQ
    • Contact
  • About
    • Institutions
    • Release History
    • Cookies and privacy policy

Copyright © 1998–2018.

Fivu en