Sciweavers

1989 search results - page 111 / 398
» Learning to Select Useful Landmarks
Sort
View
ICML
1998
IEEE
16 years 7 months ago
Feature Selection via Concave Minimization and Support Vector Machines
Computational comparison is made between two feature selection approaches for nding a separating plane that discriminates between two point sets in an n-dimensional feature space ...
Paul S. Bradley, Olvi L. Mangasarian
KDD
2012
ACM
178views Data Mining» more  KDD 2012»
13 years 8 months ago
Mining emerging patterns by streaming feature selection
Building an accurate emerging pattern classifier with a highdimensional dataset is a challenging issue. The problem becomes even more difficult if the whole feature space is unava...
Kui Yu, Wei Ding 0003, Dan A. Simovici, Xindong Wu
IJCNN
2007
IEEE
16 years 19 days ago
A Wrapper for Projection Pursuit Learning
– Constructive algorithms are effective methods for designing Artificial Neural Networks (ANN) with good accuracy and generalization capability, yet with parsimonious network str...
Leonardo M. Holschuh, Clodoaldo Ap. M. Lima, Ferna...
CHI
1994
ACM
15 years 10 months ago
User learning and performance with marking menus
A marking menu is designed to allow a user to perform a menu selection by either popping-up a radial (or pie) menu, or by making a straight mark in the direction of the desired me...
Gordon Kurtenbach, William Buxton
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
16 years 6 months ago
Selection, combination, and evaluation of effective software sensors for detecting abnormal computer usage
We present and empirically analyze a machine-learning approach for detecting intrusions on individual computers. Our Winnowbased algorithm continually monitors user and system beh...
Jude W. Shavlik, Mark Shavlik