Network Clustering in Vehicular Communication Networks

[1]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

[2]  Yuanan Liu,et al.  Local Scheduling Scheme for Opportunistic Routing , 2009, 2009 IEEE Wireless Communications and Networking Conference.

[3]  Hae-Sang Park,et al.  A simple and fast algorithm for K-medoids clustering , 2009, Expert Syst. Appl..

[4]  Edwin R. Hancock,et al.  Clustering and Embedding Using Commute Times , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  Ulrike von Luxburg,et al.  A tutorial on spectral clustering , 2007, Stat. Comput..

[6]  Yifan Chen,et al.  k-hop compound metric based clustering scheme for ad hoc networks , 2005, IEEE International Conference on Communications, 2005. ICC 2005. 2005.

[7]  Martin Everett,et al.  Ego network betweenness , 2005, Soc. Networks.

[8]  Clustering Using a Random Walk Based Distance Measure , 2005, ESANN.

[9]  M. Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  Prithwish Basu,et al.  A mobility based metric for clustering in mobile ad hoc networks , 2001, Proceedings 21st International Conference on Distributed Computing Systems Workshops.

[11]  P. Maher,et al.  Handbook of Matrices , 1999, The Mathematical Gazette.

[12]  Pedro Larrañaga,et al.  An empirical comparison of four initialization methods for the K-Means algorithm , 1999, Pattern Recognit. Lett..

[13]  Stefano Basagni,et al.  Distributed and mobility-adaptive clustering for multimedia support in multi-hop wireless networks , 1999, Gateway to 21st Century Communications Village. VTC 1999-Fall. IEEE VTS 50th Vehicular Technology Conference (Cat. No.99CH36324).

[14]  Anil K. Jain,et al.  Data clustering: a review , 1999, CSUR.

[15]  Taieb Znati,et al.  A mobility-based framework for adaptive clustering in wireless ad hoc networks , 1999, IEEE J. Sel. Areas Commun..

[16]  Stefano Basagni,et al.  Distributed clustering for ad hoc networks , 1999, Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99).

[17]  Jiawei Han,et al.  Efficient and Effective Clustering Methods for Spatial Data Mining , 1994, VLDB.

[18]  R. Merris.  Laplacian matrices of graphs: a survey , 1994 .

[19]  M. Narasimha Murty,et al.  A near-optimal initial seed value selection in K-means means algorithm using a genetic algorithm , 1993, Pattern Recognit. Lett..

[20]  B. Mohar.  THE LAPLACIAN SPECTRUM OF GRAPHS y , 1991 .