Application of algebraic graph descriptors for clustering of real-world structures

Details Application of algebraic graph descriptors for clustering of real-world structures Application of algebraic graph descriptors for clustering of real-world structures

Jan 2008

adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=2008spie.6937e..95c&link_type=abstract

Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments 2007. Edited by Romaniuk, Rys

Statistics

Applications

Scientific paper

We propose several vector graph descriptors created on the basis of vertex rank measures such as PageRank, Hubs and Authorities or Betweenness Centrality. The descriptors are used for clustering artificial and real-world data. We present the comparison of descriptors with the use of criteria such as computational complexity, size and quality of clustering. The experiments were performed mainly on the sets of aerial photos transformed to graphs with the use of Harris corner detection and Delaunay triangulation. The results show that the introduced pattern vectors can be a lower dimensional, less computationally expensive and graph size independent alternative for spectral descriptors, such as defined by Wilson, Hancock and Luo in [1].

Affiliated with

Also associated with

No associations

Rating

Application of algebraic graph descriptors for clustering of real-world structures does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Application of algebraic graph descriptors for clustering of real-world structures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Application of algebraic graph descriptors for clustering of real-world structures will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-1258303