Sciweavers

535 search results - page 26 / 107
» Generalized Version Space Trees
Sort
View
JMLR
2010
108views more  JMLR 2010»
14 years 6 months ago
Tree Decomposition for Large-Scale SVM Problems
To handle problems created by large data sets, we propose a method that uses a decision tree to decompose a given data space and train SVMs on the decomposed regions. Although the...
Fu Chang, Chien-Yang Guo, Xiao-Rong Lin, Chi-Jen L...
ESA
1998
Springer
108views Algorithms» more  ESA 1998»
15 years 4 months ago
Finding an Optimal Path without Growing the Tree
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu
ECML
2006
Springer
15 years 3 months ago
The Minimum Volume Covering Ellipsoid Estimation in Kernel-Defined Feature Spaces
Minimum volume covering ellipsoid estimation is important in areas such as systems identification, control, video tracking, sensor management, and novelty detection. It is well kno...
Alexander N. Dolia, Tijl De Bie, Christopher J. Ha...
SAC
2006
ACM
15 years 5 months ago
Exploiting partial decision trees for feature subset selection in e-mail categorization
In this paper we propose PARTfs which adopts a supervised machine learning algorithm, namely partial decision trees, as a method for feature subset selection. In particular, it is...
Helmut Berger, Dieter Merkl, Michael Dittenbach
90
Voted
JLP
2010
110views more  JLP 2010»
14 years 10 months ago
Similarity, topology, and uniformity
We generalize various notions of generalized metrics even further to one general concept comprising them all. For convenience, we turn around the ordering in the target domain of ...
Reinhold Heckmann