OpenAlex
PricingAboutJobs
Log inGet started
Work

Finding the most interesting patterns in a database quickly by using sequential sampling

HTML

Year: 2003
Type: article
Source: OpenGrey (Institut de l'Information Scientifique et Technique)
DOI: 10.5555/944919.944956
Authors: Tobias Scheffer, Stefan Wrobel
Institutions: Otto-von-Guericke-Universität Magdeburg, University of Bonn
Language: English

Topic: Data Mining Algorithms and Applications
Subfield: Information Systems
Field: Computer Science
Domain: Physical Sciences
Keywords: sequential sampling, database query optimization, utility functions, set-membership estimation, sample complexity bounds, association rule discovery, subgroup discovery, hypothesis space search, worst-case analysis

Open Access status: closed
OpenAlex ID: W2153747975
FWCI: 11.43
Cites: 33
Cited by: 84
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms
Security