GClustering Algorithm
Journal Title: International Journal of Advanced Research in Computer Engineering & Technology(IJARCET) - Year 2012, Vol 1, Issue 7
Abstract
—Graph clustering poses significant challenges because of the complex structures which may be present in the underlying data. The massive size of the underlying graph makes explicit structural enumeration very difficult. Consequently, most techniques for clustering multi-dimensional data are difficult to generalize to the case of massive graphs. Recently, methods have been proposed for clustering graph data, though these methods are designed for static data, and are not applicable to the case of graph streams. Furthermore, these techniques are especially not effective for the case of massive graphs, since a huge number of distinct edges may need to be tracked simultaneously. This result in storage and computational challenges during the clustering process.The finding of clusters, well-connected components in a graph, is useful in many applications from natural function prediction to social community detection. An important insight is that many clustering applications need only the subset of best clusters, and not all clusters in the entire graph. In this paper we propose a new technique, GClustering, which probabilistically searches large, edge weighted, directed graphs for their best clusters in linear time. The algorithm is inherently parallelizable, and is able to find variable size, overlapping clusters. To increase scalability, a parameter is introduced that controls memory use. When compared with three other state-of-the art clustering techniques, GClustering algorithm achieves running time speedups of up to 70% on large scale real world datasets. In addition, the clusters returned by GClustering are consistently found to be better both in calculated score and when compared on real world benchmarks.
Authors and Affiliations
Mr. Promod Kumar Sahu , G. Ravi teja2
Keywords
Related Articles
- EP ID EP157013
- DOI -
- Views 90
- Downloads 0
Correlation Preserved Indexing Based Approach For Document Clustering
Document clustering is the act of collecting similar documents into clusters, where similarity is some function on a document. Document clustering method achieves 1) a high accuracy for documents 2) document fre...
Comparative Study on Performance Analysis of High Resolution Direction of Arrival Estimation Algorithms
Abstract-Array processing involves manipulation of signals induced on various antenna elements. Its capabilities of steering nulls to reduce co channel interferences and pointing independent beams toward various mobi...
INTERLEAVED FORWARD ERROR CORRECTING (FEC) CODES BASED ON BINAR SHUFFLE ALGORITHM (B.S.A)
Forward Error Correcting (FEC) is one of the technique is used for controlling errors without sending any retransmission to sender. Example of forward error correcting codes are hamming, lower-density parity-ch...
“Cloud Service Utilization” Journey to cloud...
As we know that cloud computing is an emerging area, the services provided by the cloud is helpful to overcome the limitation of Information Technology. Such as Globalization, Security, Storage and the most impor...
CLASSIFICATION OF TEXT USING FUZZY BASED INCREMENTAL FEATURE CLUSTERING ALGORITHM
The dimensionality of feature vector plays a major in text classification. We can reduce the dimensionality of feature vector by using feature clustering based on fuzzy logic. We propose a fuzzy based incremental...