Sciweavers

482 search results - page 38 / 97
» A Linear-Time Graph Kernel
Sort
View
ISBRA
2007
Springer
15 years 3 months ago
Discovering Relations Among GO-Annotated Clusters by Graph Kernel Methods
The biological interpretation of large-scale gene expression data is one of the challenges in current bioinformatics. The state-of-theart approach is to perform clustering and then...
Italo Zoppis, Daniele Merico, Marco Antoniotti, Bu...
SDM
2012
SIAM
294views Data Mining» more  SDM 2012»
13 years 4 days ago
Kernelized Probabilistic Matrix Factorization: Exploiting Graphs and Side Information
We propose a new matrix completion algorithm— Kernelized Probabilistic Matrix Factorization (KPMF), which effectively incorporates external side information into the matrix fac...
Tinghui Zhou, Hanhuai Shan, Arindam Banerjee, Guil...
COMBINATORICS
2006
221views more  COMBINATORICS 2006»
14 years 9 months ago
Kernels of Directed Graph Laplacians
Abstract. Let G denote a directed graph with adjacency matrix Q and indegree matrix D. We consider the Kirchhoff matrix L = D - Q, sometimes referred to as the directed Laplacian. ...
John S. Caughman IV, J. J. P. Veerman
3DIM
2005
IEEE
15 years 3 months ago
Globally Convergent Range Image Registration by Graph Kernel Algorithm
Automatic range image registration without any knowledge of the viewpoint requires identification of common regions across different range images and then establishing point corr...
Radim Sára, Ikuko Shimizu Okatani, Akihiro ...
DM
1999
145views more  DM 1999»
14 years 9 months ago
Modular decomposition and transitive orientation
A module of an undirected graph is a set X of nodes such for each node x not in X , either every member of X is adjacent to x, or no member of X is adjacent to x. There is a canon...
Ross M. McConnell, Jeremy Spinrad