Sciweavers

564 search results - page 75 / 113
» Experimental Comparisons of Derivative Free Optimization Alg...
Sort
View
NIPS
2007
13 years 10 months ago
Convex Clustering with Exemplar-Based Models
Clustering is often formulated as the maximum likelihood estimation of a mixture model that explains the data. The EM algorithm widely used to solve the resulting optimization pro...
Danial Lashkari, Polina Golland
ICML
2010
IEEE
13 years 10 months ago
Risk minimization, probability elicitation, and cost-sensitive SVMs
A new procedure for learning cost-sensitive SVM classifiers is proposed. The SVM hinge loss is extended to the cost sensitive setting, and the cost-sensitive SVM is derived as the...
Hamed Masnadi-Shirazi, Nuno Vasconcelos
CP
2011
Springer
12 years 8 months ago
Pruning Rules for Constrained Optimisation for Conditional Preferences
A depth-first search algorithm can be used to find optimal solutions of a Constraint Satisfaction Problem (CSP) with respect to a set of conditional preferences statements (e.g.,...
Nic Wilson, Walid Trabelsi
IJCV
2007
179views more  IJCV 2007»
13 years 8 months ago
Global Detection of Salient Convex Boundaries
As an important geometric property of many structures or structural components, convexity plays an important role in computer vision and image understanding. In this paper, we desc...
Song Wang, Joachim S. Stahl, Adam Bailey, Michael ...
CIKM
2004
Springer
14 years 2 months ago
Soft clustering criterion functions for partitional document clustering: a summary of results
Recently published studies have shown that partitional clustering algorithms that optimize certain criterion functions, which measure key aspects of inter- and intra-cluster simil...
Ying Zhao, George Karypis