Referenced Items are not available for this document.
The problem of discovery association rules in large databases is considered. An encoding method for converting large databases to small one is proposed. Significant efficiency is obtained by applying some modified known algorithm on our proposed database layout. In addition, a new algorithm based on the proposed encoding method is introduced. Using some properties of numbers our database converts itemset to numerical domain. Our implementation indicates that the proposed layout made the size of database significantly smaller. Also the time to find association rules is reduced.
Published in:
Evolutionary Computation, 2008. CEC 2008. (IEEE World Congress on Computational Intelligence). IEEE Congress on
Date of Conference: 1-6 June 2008
- Page(s):
- 2323 - 2326
- E-ISBN :
- 978-1-4244-1823-7
- Print ISBN:
- 978-1-4244-1822-0
- INSPEC Accession Number:
- 10250816
- Conference Location :
- Hong Kong
- Digital Object Identifier :
- 10.1109/CEC.2008.4631107
- 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.
