Pages that link to "Item:Q1401958"

The following pages link to On the difficulty of approximately maximizing agreements. (Q1401958):

Displaying 17 items.

• Algorithmic aspects of determining depth functions in a procedure for optimal hypothesis selection in data classification problems (Q341367) (← links)
• A new column generation algorithm for logical analysis of data (Q646710) (← links)
• A Fisher consistent multiclass loss function with variable margin on positive examples (Q887268) (← links)
• Kernel methods in machine learning (Q930651) (← links)
• Margin-based first-order rule learning (Q1009245) (← links)
• Hardness results for neural network approximation problems (Q1603592) (← links)
• The computational complexity of densest region detection (Q1604217) (← links)
• A theory of learning from different domains (Q1959571) (← links)
• Goal scoring, coherent loss and applications to machine learning (Q2191765) (← links)
• Applications of regularized least squares to pattern classification (Q2381579) (← links)
• An experimental evaluation of simplicity in rule learning (Q2389614) (← links)
• Quadratic Convergence of Smoothing Newton's Method for 0/1 Loss Optimization (Q5020852) (← links)
• (Q5148983) (← links)
• Maximizing agreements with one-sided error with applications to heuristic learning (Q5916204) (← links)
• Maximizing agreements with one-sided error with applications to heuristic learning (Q5921687) (← links)
• A nonlinear kernel SVM Classifier via \(L_{0/1}\) soft-margin loss with classification performance (Q6073171) (← links)
• Turning Grain Maps into Diagrams (Q6173521) (← links)