Geetha, M and D’Souza , R J (2012) An Efficient Discovery of Frequent Concepts Using Weighted Count Tree. In: Second International Conference on Computational Intelligence and Information Technology – CIIT 2012 , Dec 03-04 , President Hotel and Towers, Chennai, India .
![[img]](http://eprints.manipal.edu/style/images/fileicons/application_pdf.png) |
PDF
539-367-370springer_1.pdf - Published Version Restricted to Registered users only Download (54kB) | Request a copy |
Abstract
An algorithm that takes only one scan to discover all Frequent Concepts in a single scan of the database is presented. The algorithm is incremental, complete and order independent. The efficiency is achieved using prime number concept. Further, the experimental results show that this method is more space and time efficient than the existing Basis tree, FP-tree and PC–tree algorithms
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Uncontrolled Keywords: | Basis Tree, Frequent Concept, Prime Factor, Large Value Indicator |
| Subjects: | Engineering > MIT Manipal > Computer Science and Engineering |
| Depositing User: | MIT Library |
| Date Deposited: | 19 Mar 2013 11:34 |
| Last Modified: | 25 Mar 2013 05:32 |
| URI: | http://eprints.manipal.edu/id/eprint/79166 |
Actions (login required)
 |
View Item |