Sciweavers

136 search results - page 3 / 28
» Graph Nodes Clustering Based on the Commute-Time Kernel
Sort
View
NIPS
2004
13 years 7 months ago
Binet-Cauchy Kernels
We propose a family of kernels based on the Binet-Cauchy theorem and its extension to Fredholm operators. This includes as special cases all currently known kernels derived from t...
S. V. N. Vishwanathan, Alex J. Smola
IJCV
2007
208views more  IJCV 2007»
13 years 5 months ago
Binet-Cauchy Kernels on Dynamical Systems and its Application to the Analysis of Dynamic Scenes
We derive a family of kernels on dynamical systems by applying the Binet-Cauchy theorem to trajectories of states. Our derivation provides a unifying framework for all kernels on d...
S. V. N. Vishwanathan, Alexander J. Smola, Ren&eac...
PAKDD
2004
ACM
183views Data Mining» more  PAKDD 2004»
13 years 11 months ago
Constraint-Based Graph Clustering through Node Sequencing and Partitioning
This paper proposes a two-step graph partitioning method to discover constrained clusters with an objective function that follows the well-known minmax clustering principle. Compar...
Yu Qian, Kang Zhang, Wei Lai
CIB
2005
125views more  CIB 2005»
13 years 5 months ago
An On-Line Web Visualization System with Filtering and Clustering Graph
A Web graph refers to the graph that is used to represent relationships between Web pages in cyberspace, where a node represents a URL and an edge indicates a link between two URLs...
Wei Lai, Xiaodi Huang, Ronald Wibowo, Jiro Tanaka
SDM
2012
SIAM
304views Data Mining» more  SDM 2012»
11 years 8 months 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