Sciweavers

214 search results - page 3 / 43
» A measure of similarity between graph vertices
Sort
View
CCCG
2004
13 years 7 months ago
Local properties of geometric graphs
We propose a definition of locality for properties of geometric graphs. We measure the local density of graphs using region-counting distances [8] between pairs of vertices, and w...
Jean Cardinal, Sébastien Collette, Stefan L...
ISDA
2009
IEEE
14 years 12 days ago
Similarity Analysis of Protein Binding Sites: A Generalization of the Maximum Common Subgraph Measure Based on Quasi-Clique Dete
—Protein binding sites are often represented by means of graphs capturing their most important geometrical and physicochemical properties. Searching for structural similarities a...
Imen Boukhris, Zied Elouedi, Thomas Fober, Marco M...
ICDM
2010
IEEE
230views Data Mining» more  ICDM 2010»
13 years 3 months ago
Clustering Large Attributed Graphs: An Efficient Incremental Approach
In recent years, many networks have become available for analysis, including social networks, sensor networks, biological networks, etc. Graph clustering has shown its effectivenes...
Yang Zhou, Hong Cheng, Jeffrey Xu Yu
WAW
2007
Springer
144views Algorithms» more  WAW 2007»
13 years 12 months ago
Approximating Betweenness Centrality
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...
David A. Bader, Shiva Kintali, Kamesh Madduri, Mil...
ICPR
2008
IEEE
14 years 5 days ago
Scale invariant face recognition using probabilistic similarity measure
In video surveillance, the size of face images is very small. However, few works have been done to investigate scale invariant face recognition. Our experiments on appearance-base...
Zhifei Wang, Zhenjiang Miao