Sciweavers

49 search results - page 7 / 10
» Alternative similarity functions for graph kernels
Sort
View
KDD
2004
ACM
190views Data Mining» more  KDD 2004»
14 years 7 months ago
Kernel k-means: spectral clustering and normalized cuts
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
CVPR
2010
IEEE
13 years 7 months ago
Learning kernels for variants of normalized cuts: Convex relaxations and applications
We propose a new algorithm for learning kernels for variants of the Normalized Cuts (NCuts) objective – i.e., given a set of training examples with known partitions, how should ...
Lopamudra Mukherjee, Vikas Singh, Jiming Peng, Chr...
PVLDB
2010
152views more  PVLDB 2010»
13 years 5 months ago
k-Nearest Neighbors in Uncertain Graphs
Complex networks, such as biological, social, and communication networks, often entail uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of sim...
Michalis Potamias, Francesco Bonchi, Aristides Gio...
BMCBI
2007
137views more  BMCBI 2007»
13 years 7 months ago
Bayesian refinement of protein functional site matching
Background: Matching functional sites is a key problem for the understanding of protein function and evolution. The commonly used graph theoretic approach, and other related appro...
Kanti V. Mardia, Vysaul B. Nyirongo, Peter J. Gree...
JMLR
2010
147views more  JMLR 2010»
13 years 2 months ago
Image Denoising with Kernels Based on Natural Image Relations
A successful class of image denoising methods is based on Bayesian approaches working in wavelet representations. The performance of these methods improves when relations among th...
Valero Laparra, Juan Gutierrez, Gustavo Camps-Vall...