Referenced Items are not available for this document.
This paper presents a new association rule mining algorithm called MFP. The MFP algorithm can convert a transaction database into an MFP_tree through scanning the database only once, and then do the mining of the tree. The MFP algorithm usually is more efficient than FP_growth. We used it for mining some formulas of synthetic perfume essence and obtained the success.
Published in:
Advanced Computer Theory and Engineering (ICACTE), 2010 3rd International Conference on
(Volume:5
)
Date of Conference: 20-22 Aug. 2010
- Page(s):
- V5-122 - V5-125
- ISSN :
- 2154-7491
- Print ISBN:
- 978-1-4244-6539-2
- INSPEC Accession Number:
- 11537791
- Conference Location :
- Chengdu
- Digital Object Identifier :
- 10.1109/ICACTE.2010.5579104
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
