Sciweavers

593 search results - page 55 / 119
» Optimizing Complex Loss Functions in Structured Prediction
Sort
View
CORR
2006
Springer
109views Education» more  CORR 2006»
13 years 9 months ago
On Conditional Branches in Optimal Decision Trees
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...
Michael B. Baer
BMCBI
2004
196views more  BMCBI 2004»
13 years 9 months ago
MUSCLE: a multiple sequence alignment method with reduced time and space complexity
Background: In a previous paper, we introduced MUSCLE, a new program for creating multiple alignments of protein sequences, giving a brief summary of the algorithm and showing MUS...
Robert C. Edgar
JMLR
2006
125views more  JMLR 2006»
13 years 9 months ago
Efficient Learning of Label Ranking by Soft Projections onto Polyhedra
We discuss the problem of learning to rank labels from a real valued feedback associated with each label. We cast the feedback as a preferences graph where the nodes of the graph ...
Shai Shalev-Shwartz, Yoram Singer
SIGMOD
2003
ACM
196views Database» more  SIGMOD 2003»
14 years 9 months ago
Spreadsheets in RDBMS for OLAP
One of the critical deficiencies of SQL is lack of support for ndimensional array-based computations which are frequent in OLAP environments. Relational OLAP (ROLAP) applications ...
Andrew Witkowski, Srikanth Bellamkonda, Tolga Bozk...
KDD
2008
ACM
147views Data Mining» more  KDD 2008»
14 years 9 months ago
Extracting shared subspace for multi-label classification
Multi-label problems arise in various domains such as multitopic document categorization and protein function prediction. One natural way to deal with such problems is to construc...
Shuiwang Ji, Lei Tang, Shipeng Yu, Jieping Ye