ANALYSIS OF CLIQUE BY MATRIX FACTORIZATION AND PARTITION METHODS
Journal Title: International Journal of Computer Science and Management Studies (IJCSMS) www.ijcsms.com - Year 2011, Vol 11, Issue 3
Abstract
In real life clustering of high dimensional data is a big problem. To find out the dense regions from increasing dimensions is one of them. We have already studied the clustering techniques of low dimensional data sets like k-means, k-mediod, BIRCH, CLARANS, CURE, DBScan, PAM etc. If a region is dense then it consists with number of data points with a minimum support of input parameter ø other wise it cannot take into clustering. So in this approach we have implemented CLIQUE to find out the clusters from multidimensional data sets. In dimension growth subspace clustering the clustering process start at single dimensional subspaces and grows upward to higher dimensional ones. It is a partition method where each dimension divided like a grid structure. In this paper the elimination of redundant objects from the regions by matrix factorization and partition method are implemented. The comparisons between CLIQUES with these two methods are studied. The redundant data point belongs to which region to form a cluster is also studied.
Authors and Affiliations
Raghunath Kar , Dr. Susant Kumar Das
Keywords
Related Articles
- EP ID EP119823
- DOI -
- Views 143
- Downloads 0
Macroeconomic Variables and Stock Market: US Review
This focus of this paper are the effect, implication, impact and realtionship between selected macroeconomic variables and wider US indices S&P 500 and industrial Dow Jones Industrial Average (DJIA). I Consider infl...
Wireless ad-hoc networks Broadcasting Protocol And Routing Characteristics
The mobile ad hoc network (MANET) has recently been recognized as an attractive network architecture for wireless communication. Reliable broadcast is an important operation in MANET (e.g., giving orders, searching route...
ENHANCING ORGANIZATIONAL EFFECTIVENESS THROUGH CUSTOMER ENGAGEMENT
Customer satisfaction is “merely the entry point for achieving a deeper foundation that rests on total customer engagement,” by Benson Smith and Tony Rutigliano. Everyone aims to satisfy the customers: in fact, you and y...
COMPATIBLE SERVICE RETRIEVAL USING IMPROVED SIMILARITY MEASURE
Now-a-days retrieving suitable services become a prominent need for the user. However available service retrieving mechanism uses the compatible similarity between the services so that user can get likely homogeneous ser...
Securing Route Discovery in MANETs: Analysis and Improvement
In this paper, we show that the security proof for the route discovery algorithm end air A is flawed, and moreover, this algorithm is vulnerable to a hidden channel attack. We also analyze the security framework that was...