Sciweavers

44 search results - page 8 / 9
» Information cut for clustering using a gradient descent appr...
Sort
View
ICDM
2010
IEEE
226views Data Mining» more  ICDM 2010»
13 years 3 months ago
Edge Weight Regularization over Multiple Graphs for Similarity Learning
The growth of the web has directly influenced the increase in the availability of relational data. One of the key problems in mining such data is computing the similarity between o...
Pradeep Muthukrishnan, Dragomir R. Radev, Qiaozhu ...
SIAMSC
2008
182views more  SIAMSC 2008»
13 years 5 months ago
A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation
We propose a distributed algorithm for solving Euclidean metric realization problems arising from large 3D graphs, using only noisy distance information, and without any prior kno...
Pratik Biswas, Kim-Chuan Toh, Yinyu Ye
NIPS
2007
13 years 6 months ago
Fixing Max-Product: Convergent Message Passing Algorithms for MAP LP-Relaxations
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
Amir Globerson, Tommi Jaakkola
ICASSP
2011
IEEE
12 years 9 months ago
An adaptive bayesian clustering and multivariate region merging based technique for efficient segmentation of color images
We propose a methodology for improved segmentation of images in a Bayesian framework by fusion of color, texture and gradient information. The proposed algorithm is initialized by...
Sreenath Rao Vantaram, Eli Saber
TNN
2010
234views Management» more  TNN 2010»
13 years 4 days ago
Novel maximum-margin training algorithms for supervised neural networks
This paper proposes three novel training methods, two of them based on the back-propagation approach and a third one based on information theory for Multilayer Perceptron (MLP) bin...
Oswaldo Ludwig, Urbano Nunes