Informatics Publishing Limited

D. Puttegowda ¹, Rajesh Shukala ², N. A. Deepak ¹

Affiliations
1 Department of Computer Science, Ghousia College of Engineering, Ramanagara, IN
2 Department of Computer Science, Corporate Institute of Science and Technology, Bhopal, IN

Abstract

The information age has seen most of the activities generating huge volumes of data. The explosive growth of business, scientific and government databases sizes has far outpaced our ability to interpret and digest the stored data. This has created a need for new generation tools and techniques for automated and intelligent database analysis. These tools and techniques are the subjects of the rapidly emerging field of data mining. One of the important problems in data mining is discovering association rules from databases of transactions where each transaction consists of a set of items. The most time consuming operation in this discovery process is the computation of the frequency of the occurrences of interesting subset of items (called candidates) in the database of transactions. To prune the exponentially large space of candidates, most existing algorithms consider only those candidates that have a user defined minimum support. Even with the pruning, the task of finding all association rules requires a lot of computation power and memory. Parallel computers offer a potential solution to the computation requirement of this task, provided efficient and scalable parallel algorithms can be designed. In this paper, we have implemented Sequential and Parallel mining of Association Rules using Apriori algorithms and evaluated the performance of both algorithms.

Keywords

Association Rules, Apriori Algorithms, Minimum Support, Computation Power, Performance.

Full Text

   

N. A. Deepak ¹, Rajesh Shukla ², D. Puttegowda ¹

Affiliations
1 Department of Computer Science, Ghousia College of Engineering, Ramanagara-571511, IN
2 Corporate Institute of Technology, Bhopal, IN

Abstract

Independent Component Analysis (ICA) is the decomposition technique of a random vector of data into linear components which are “independent as possible.” Involves finding a suitable representation of multivariate data for computational and conceptual simplicity, the representation is often sought as a linear transformation of the original data. The linear transformation methods include Principal Component Analysis (PCA), Factor Analysis, and Projection Pursuit. Here attempt to transmit similar dimension multiple images as a single linear transformed image using Independent Component Analysis (ICA), Gaussian noise is added into linearly transformed image. We try to retrieve the original images one by one from noisy transformed image. The analysis is made by varying noise variance against peak signal to noise ratio (PSNR) with the original image. Our demonstrated work is highly useful in reducing bandwidth over the channel.

Keywords

Gaussian Noise, Independent Component Analysis (ICA), Principal Component Analysis (PCA), Peak Signal to Noise Ration (PSNR), Random Vector.

Full Text