Sciweavers

511 search results - page 23 / 103
» The intrinsic dimensionality of graphs
Sort
View
SDM
2012
SIAM
304views Data Mining» more  SDM 2012»
12 years 7 days ago
Fast Random Walk Graph Kernel
Random walk graph kernel has been used as an important tool for various data mining tasks including classification and similarity computation. Despite its usefulness, however, it...
U. Kang, Hanghang Tong, Jimeng Sun
CVPR
2008
IEEE
14 years 12 months ago
Non-negative graph embedding
We introduce a general formulation, called non-negative graph embedding, for non-negative data decomposition by integrating the characteristics of both intrinsic and penalty graph...
Jianchao Yang, Shuicheng Yan, Yun Fu, Xuelong Li, ...
AMW
2011
13 years 1 months ago
SNQL: A Social Networks Query and Transformation Language
Abstract. Social Network (SN) data has become ubiquitous, demanding advanced and flexible means to represent, transform and query such data. In addition to the intrinsic challenge...
Mauro San Martín, Claudio Gutierrez, Peter ...
SODA
2008
ACM
135views Algorithms» more  SODA 2008»
13 years 11 months ago
Rapid mixing of Gibbs sampling on graphs that are sparse on average
Gibbs sampling also known as Glauber dynamics is a popular technique for sampling high dimensional distributions defined on graphs. Of special interest is the behavior of Gibbs sa...
Elchanan Mossel, Allan Sly
ECCV
2004
Springer
14 years 11 months ago
Many-to-Many Feature Matching Using Spherical Coding of Directed Graphs
In recent work, we presented a framework for many-to-many matching of multi-scale feature hierarchies, in which features and their relations were captured in a vertex-labeled, edge...
M. Fatih Demirci, Ali Shokoufandeh, Sven J. Dickin...