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 102
- Downloads 0
BF-PSO optimized PID Controller design using ISE, IAE, IATE and MSE error criteria
A PID controller is designed using ISE, IAE, ITAE and MSE error criteria for stable linear time invariant continuous system. A BF-PSO PID controller is designed for the plant to meet the desired performance specification...
THE PROCESS OF SPEECH RECOGNITION, PERCEPTION, SPEECH SIGNALS AND SPEECH PRODUCTION IN HUMAN BEINGS
Automatic recognition of speech by machine has been a goal of research for more than five decades. In spite of glamour of designing an intelligent machine that can recognize the spoken word and recognize its meaning,...
Development and Verification of VHDL code for 16 bit ADC for FPGA based Beam Position Measurement Board
FPGA based designed card provide several advantages over custom designed IC based cards such as reduced cost, reduction in components, reduction in size ,easily coded . It is flexible because its parameters can be...
64 Bit Domino Logic Adder with 180nm CMOS Technology
Based on 180nm CMOS technology a 64 bit domino logic adder is designed for energy and speed optimization. The adder is designed using 4 bit slice of carry look-ahead adder. Multiple slices are connected in ripple...
Extending the UML metamodel to grant prop up for crosscutting concerns
Aspect-orientation is an idiom used to describe approaches that unambiguously capture, model and implement crosscutting concerns (or aspects). There is presently a quantity of new encoding languages as well as exte...