Sciweavers

214 search results - page 43 / 43
» A measure of similarity between graph vertices
Sort
View
ICML
2004
IEEE
14 years 6 months ago
Boosting margin based distance functions for clustering
The performance of graph based clustering methods critically depends on the quality of the distance function, used to compute similarities between pairs of neighboring nodes. In t...
Tomer Hertz, Aharon Bar-Hillel, Daphna Weinshall
KDD
2007
ACM
136views Data Mining» more  KDD 2007»
14 years 5 months ago
Information genealogy: uncovering the flow of ideas in non-hyperlinked document databases
We now have incrementally-grown databases of text documents ranging back for over a decade in areas ranging from personal email, to news-articles and conference proceedings. While...
Benyah Shaparenko, Thorsten Joachims
IROS
2007
IEEE
254views Robotics» more  IROS 2007»
13 years 11 months ago
3D datasets segmentation based on local attribute variation
— We present a Graph-based method for low-level segmentation of unfiltered 3D data. The core of this approach is based on the construction of a local neighborhood structure and ...
Carla Silva Rocha Aguiar, Sébastien Druon, ...
KDD
2010
ACM
252views Data Mining» more  KDD 2010»
13 years 9 months ago
Fast query execution for retrieval models based on path-constrained random walks
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
Ni Lao, William W. Cohen