Sciweavers

2683 search results - page 269 / 537
» Machine learning problems from optimization perspective
Sort
View
111
Voted
ECML
2006
Springer
15 years 7 months ago
Cost-Sensitive Decision Tree Learning for Forensic Classification
Abstract. In some learning settings, the cost of acquiring features for classification must be paid up front, before the classifier is evaluated. In this paper, we introduce the fo...
Jason V. Davis, Jungwoo Ha, Christopher J. Rossbac...
134
Voted
EMNLP
2009
15 years 1 months ago
Reverse Engineering of Tree Kernel Feature Spaces
We present a framework to extract the most important features (tree fragments) from a Tree Kernel (TK) space according to their importance in the target kernelbased machine, e.g. ...
Daniele Pighin, Alessandro Moschitti
VEE
2005
ACM
150views Virtualization» more  VEE 2005»
15 years 9 months ago
Diagnosing performance overheads in the xen virtual machine environment
Virtual Machine (VM) environments (e.g., VMware and Xen) are experiencing a resurgence of interest for diverse uses including server consolidation and shared hosting. An applicati...
Aravind Menon, Jose Renato Santos, Yoshio Turner, ...
139
Voted
CIBCB
2005
IEEE
15 years 9 months ago
Feature Selection for Microarray Data Using Least Squares SVM and Particle Swarm Optimization
Feature selection is an important preprocessing technique for many pattern recognition problems. When the number of features is very large while the number of samples is relatively...
E. Ke Tang, Ponnuthurai N. Suganthan, Xin Yao
143
Voted
ICML
2004
IEEE
16 years 4 months ago
Kernel conditional random fields: representation and clique selection
Kernel conditional random fields (KCRFs) are introduced as a framework for discriminative modeling of graph-structured data. A representer theorem for conditional graphical models...
John D. Lafferty, Xiaojin Zhu, Yan Liu