Sciweavers

41 search results - page 3 / 9
» Compound Poisson Approximation via Information Functionals
Sort
View
ML
2008
ACM
248views Machine Learning» more  ML 2008»
13 years 10 months ago
Feature selection via sensitivity analysis of SVM probabilistic outputs
Feature selection is an important aspect of solving data-mining and machine-learning problems. This paper proposes a feature-selection method for the Support Vector Machine (SVM) l...
Kai Quan Shen, Chong Jin Ong, Xiao Ping Li, Einar ...
CVPR
2008
IEEE
15 years 27 days ago
Multi-label image segmentation via point-wise repetition
Bottom-up segmentation tends to rely on local features. Yet, many natural and man-made objects contain repeating elements. Such structural and more spread-out features are importa...
Gang Zeng, Luc J. Van Gool
UIST
2005
ACM
14 years 4 months ago
Informal prototyping of continuous graphical interactions by demonstration
Informal prototyping tools have shown great potential in facilitating the early stage design of user interfaces. However, continuous interactions, an important constituent of high...
Yang Li, James A. Landay
INFORMS
1998
100views more  INFORMS 1998»
13 years 10 months ago
Feature Selection via Mathematical Programming
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
Paul S. Bradley, Olvi L. Mangasarian, W. Nick Stre...
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
14 years 11 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales