Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
134
click to vote
KDD
2001
ACM
196
views
Data Mining
»
more
KDD 2001
»
Efficient discovery of error-tolerant frequent itemsets in high dimensions
16 years 3 months ago
Download
research.microsoft.com
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...
Cheng Yang, Usama M. Fayyad, Paul S. Bradley
claim paper
Read More »