Next Article in Journal
Communication-Theoretic Model of Power Talk for a Single-Bus DC Microgrid
Previous Article in Journal
Throughput Capacity of Selfish Wireless Ad Hoc Networks with General Node Density
Article Menu

Export Article

Open AccessArticle
Information 2016, 7(1), 17; doi:10.3390/info7010017

Nearest Neighbor Search in the Metric Space of a Complex Network for Community Detection

Department of Computer Science and Engineering, Jaypee University of Information Technology, Waknaghat, Solan 173215, India
Author to whom correspondence should be addressed.
Academic Editors: Ana Paula Couto da Silva and Pedro O. S. Vaz de Melo
Received: 22 December 2015 / Revised: 26 February 2016 / Accepted: 11 March 2016 / Published: 16 March 2016
(This article belongs to the Special Issue Online Social Networks and Implications)
View Full-Text   |   Download PDF [261 KB, uploaded 16 March 2016]


The objective of this article is to bridge the gap between two important research directions: (1) nearest neighbor search, which is a fundamental computational tool for large data analysis; and (2) complex network analysis, which deals with large real graphs but is generally studied via graph theoretic analysis or spectral analysis. In this article, we have studied the nearest neighbor search problem in a complex network by the development of a suitable notion of nearness. The computation of efficient nearest neighbor search among the nodes of a complex network using the metric tree and locality sensitive hashing (LSH) are also studied and experimented. For evaluation of the proposed nearest neighbor search in a complex network, we applied it to a network community detection problem. Experiments are performed to verify the usefulness of nearness measures for the complex networks, the role of metric tree and LSH to compute fast and approximate node nearness and the the efficiency of community detection using nearest neighbor search. We observed that nearest neighbor between network nodes is a very efficient tool to explore better the community structure of the real networks. Several efficient approximation schemes are very useful for large networks, which hardly made any degradation of results, whereas they save lot of computational times, and nearest neighbor based community detection approach is very competitive in terms of efficiency and time. View Full-Text
Keywords: complex network; nearest neighbor; metric tree; locality sensitive hashing; community detection complex network; nearest neighbor; metric tree; locality sensitive hashing; community detection
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Saha, S.; Ghrera, S.P. Nearest Neighbor Search in the Metric Space of a Complex Network for Community Detection. Information 2016, 7, 17.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Information EISSN 2078-2489 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top