An effective algorithm for mining interesting quantitative association rules

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Keith C. C. Chan Department of Computing, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong
Wai-Ho Au Department of Computing, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong
Published in:
· Proceeding
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
Pages 88-90
ACM New York, NY, USA ©1997
table of contents ISBN:0-89791-850-9 doi>10.1145/331697.331714
An effective algorithm for mining interesting quantitative association rules Published by ACM 1997 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 9
· Downloads (cumulative): 619
· Citation Count: 5


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


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

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder