Sciweavers

1651 search results - page 132 / 331
» Measuring the Complexity of Classification Problems
Sort
View
FOGA
2011
12 years 11 months ago
The logarithmic hypervolume indicator
It was recently proven that sets of points maximizing the hypervolume indicator do not give a good multiplicative approximation of the Pareto front. We introduce a new “logarith...
Tobias Friedrich, Karl Bringmann, Thomas Voß...
BMCBI
2006
158views more  BMCBI 2006»
13 years 8 months ago
Parallelization of multicategory support vector machines (PMC-SVM) for classifying microarray data
Background: Multicategory Support Vector Machines (MC-SVM) are powerful classification systems with excellent performance in a variety of data classification problems. Since the p...
Chaoyang Zhang, Peng Li, Arun Rajendran, Youping D...
JMLR
2010
144views more  JMLR 2010»
13 years 2 months ago
Maximum Margin Learning with Incomplete Data: Learning Networks instead of Tables
In this paper we address the problem of predicting when the available data is incomplete. We show that changing the generally accepted table-wise view of the sample items into a g...
Sándor Szedmák, Yizhao Ni, Steve R. ...
DAC
1996
ACM
14 years 3 days ago
A Description Language for Design Process Management
A language for defining design discipline characteristics is proesign discipline characteristics such as abstraction levels, design object classifications and decompositions, desi...
Peter R. Sutton, Stephen W. Director
EMNLP
2006
13 years 9 months ago
Identification of Event Mentions and their Semantic Class
Complex tasks like question answering need to be able to identify events in text and the relations among those events. We show that this event identification task and a related ta...
Steven Bethard, James H. Martin