Sink Node Elimination to Enhance the Performance of Overlapping Detection Algorithms along with Comparison of Existing Algorithm
| Autor: | Er. Rohit Kumar, Er. Harpreet Arora |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Multidisciplinary
Community structure 02 engineering and technology 020204 information systems 0202 electrical engineering electronic engineering information engineering Entropy (information theory) 020201 artificial intelligence & image processing Statistical analysis Adjacency matrix Community finding Cluster analysis MATLAB Algorithm computer computer.programming_language Mathematics |
| Zdroj: | Indian Journal of Science and Technology. 10:1-5 |
| ISSN: | 0974-5645 0974-6846 |
| Popis: | Objectives: To eliminate Sink nodes so that rate of detection can improve within the community overlapping detection and this also increases the modularity. It also consumes less time. Methods/Statistical Analysis: Modified k-clique Algorithm is used. Clique algorithm considers Sink nodes. Sink nodes are those which do not have any connecting edge. The proposed algorithm (MKC) does eliminate these nodes and hence consider only those nodes which are connected in nature. To detect the Sink nodes adjacency matrix is used. MATLAB is used for the simulation. Community detection toolbox is used which provides several functions for graph generations, clustering algorithms etc., Findings: This approach produces better result in terms of community finding. More community are discovered with the proposed approach and also entropy is improved greatly. Result in terms of time consumption is reduced almost by 50%. Application/Improvements: The length and complexity of the cliques found is reduced considerably. The speed is almost enhanced by 5% which can further be increased by using hop count mechanism in addition to the already used Sink node elimination. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|