AN OPTICAL NEURAL NETWORK MODEL FOR MINING FREQUENT ITEMSETS IN LARGE DATABASES
Journal Title: Indian Journal of Computer Science and Engineering - Year 2011, Vol 2, Issue 2
Abstract
This paper proposes a model for mining frequent patterns in large databases by implementing Optical Neural Networks. The whole database is scanned only once and stored as a matrix. The frequent patterns are then mined from this matrix using optical neuron network. This approach is extremely efficient in data mining, as the number of database scans is effectively less than two and all the frequent patterns are computed in parallel. Appropriate techniques are designed and performed on the proposed model to achieve this efficiency.
Authors and Affiliations
DIVYA BHATNAGAR , A. S. SAXENA
Keywords
Related Articles
- EP ID EP92001
- DOI -
- Views 127
- Downloads 0
PERFORMANCE ANALYSIS OF DOWNLINK MIMO IN 2X2 MOBILE WIMAX SYSTEM
In this paper, we analyze the error rate performance of downlink coded multiple-input multiple-output orthogonal frequency division multiple access (MIMO OFDMA) systems under frequency selective fading channel conditions...
A REVIEW OF M-LEARNING MODELS
In the most recent times, mobile visitors form the fastest growing Web community. The ease with which web pages or information is retrieved from the Web using PDAs or cell phones is a result of the rapid development in w...
Link Stability Based Hop By Hop Multicast Protocol For Vanets
Vanets are new emerging and challenging technology that makes an improvisation in traffic safety and efficiency. The constant growth of automobile industry is increasing the demand for car safety and the car to car conne...
A COMPARISON OF CONSTRUCTIVE AND PRUNING ALGORITHMS TO DESIGN NEURAL NETWORKS
This paper presents a comparison between constructive and pruning algorithms to design Neural Network (NN). Both algorithms have advantages as well as drawbacks while designing the architecture of NN. Constructive algori...
AN IMPROVEMENT IN LARSA AND ITS IMPLEMENTATION ON ALLOCATION OF SEATS TO CATEGORIES IN AN ORGANIZATION
In this paper, we propose modifications to LaRSA - a fast exact algorithm for the allocation of seat for the EU Parliament. This improvement shall reduce its run time by a considerable amount. Further, we apply this modi...