Efficient algorithms for mining constrained frequent patterns from uncertain data

doi:10.1145/1610555.1610557

Efficient algorithms for mining constrained frequent patterns from uncertain data

Full Text:

Pdf

Buy this Article

Authors:	Carson Kai-Sang Leung	The University of Manitoba, Winnipeg, MB, Canada
	Dale A. Brajczuk	The University of Manitoba, Winnipeg, MB, Canada

Published in:

	· Proceeding
	U '09 Proceedings of the 1st ACM SIGKDD Workshop on Knowledge Discovery from Uncertain Data
	ACM New York, NY, USA ©2009 table of contents ISBN: 978-1-60558-675-5 doi>10.1145/1610555.1610557

	2009 Article
Bibliometrics
· Downloads (6 Weeks): 12 · Downloads (12 Months): 98 · Citation Count: 4

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref
Upcoming Conference:
- KDD '12

Tags: algorithms constrained mining data mining design experimentation frequent itemsets human factors knowledge discovery and data mining management performance theory uncertain data mining uncertainty uncertainty, fuzzy, and probabilistic reasoning user constraints

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2012 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player