NDLI: Automatic Selection of Number of Clusters in Networks Using Relative Eigenvalue Quality

Content Provider	IEEE Xplore Digital Library
Author	Shea, J.M. Macker, J.P.
Copyright Year	2013
Description	Author affiliation: Inf. Technol. Div., Naval Res. Lab., Washington, DC, USA (Macker, J.P.) \|\| Wireless Inf. Networking Group, Univ. of Florida, Gainesville, FL, USA (Shea, J.M.)
Abstract	In communication networks, it is often useful to partition the networks into disjoint clusters so that hierarchical protocols, such as hierarchical routing, can be used. Many clustering techniques have been developed for this purpose, including connectivity-based, centroid-based, and spectral methods. One issue with all of these methods is how to select an appropriate number of clusters from the structure of the network. In this paper, we consider clustering techniques based on spectral graph theory in which the relations among nodes in a communication network are mapped onto a graph. We consider techniques that are designed to minimize the multiway normalized cut, a metric that tries to simultaneously minimize the number of edges cut between clusters while balancing the volumes of the clusters. We develop a new method for determining the number of clusters based on the eigenvalues of a normalized graph Laplacian matrix by comparing the eigenvalues to the statistics of a certain type of random cut of the graph. Performance results are presented to demonstrate the effectiveness of our algorithm.
Sponsorship	IEEE Commun. Soc.
Starting Page	131
Ending Page	136
File Size	883311
Page Count	6
File Format	PDF
ISBN	9780769551241
DOI	10.1109/MILCOM.2013.32
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2013-11-18
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Eigenvalues and eigenfunctions Clustering algorithms Measurement Laplace equations Vectors Mobile communication Communication networks graph theory clustering ad hoc networks
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in