Sciweavers

449 search results - page 5 / 90
» Measuring the Similarity of Geometric Graphs
Sort
View
CCCG
2004
13 years 9 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...
DIALM
2008
ACM
179views Algorithms» more  DIALM 2008»
13 years 9 months ago
Distance graphs: from random geometric graphs to Bernoulli graphs and between
A random geometric graph G(n, r) is a graph resulting from placing n points uniformly at random on the unit area disk, and connecting two points iff their Euclidean distance is at ...
Chen Avin
IWVF
2001
Springer
13 years 12 months ago
A Skeletal Measure of 2D Shape Similarity
This paper presents a geometric measure that can be used to gauge the similarity of 2D shapes by comparing their skeletons. The measure is defined to be the rate of change of bou...
Andrea Torsello, Edwin R. Hancock
DMIN
2006
151views Data Mining» more  DMIN 2006»
13 years 8 months ago
Rough Set Theory: Approach for Similarity Measure in Cluster Analysis
- Clustering of data is an important data mining application. One of the problems with traditional partitioning clustering methods is that they partition the data into hard bound n...
Shuchita Upadhyaya, Alka Arora, Rajni Jain