Sciweavers

1405 search results - page 71 / 281
» Anytime Algorithm for Feature Selection
Sort
View
TIP
2008
125views more  TIP 2008»
15 years 1 months ago
Integrating Color and Shape-Texture Features for Adaptive Real-Time Object Tracking
We extend the standard mean-shift tracking algorithm to an adaptive tracker by selecting reliable features from color and shape-texture cues according to their descriptive ability....
Junqiu Wang, Yasushi Yagi
IBPRIA
2005
Springer
15 years 7 months ago
Extended Bi-gram Features in Text Categorization
Usually, in traditional text categorization systems based on Vector Space Model, there is no context information in a feature vector, which limited the performance of the system. T...
Xian Zhang, Xiaoyan Zhu
ICML
1999
IEEE
16 years 2 months ago
Monte Carlo Hidden Markov Models: Learning Non-Parametric Models of Partially Observable Stochastic Processes
We present a learning algorithm for non-parametric hidden Markov models with continuous state and observation spaces. All necessary probability densities are approximated using sa...
Sebastian Thrun, John Langford, Dieter Fox
DCC
2006
IEEE
16 years 1 months ago
Compression and Machine Learning: A New Perspective on Feature Space Vectors
The use of compression algorithms in machine learning tasks such as clustering and classification has appeared in a variety of fields, sometimes with the promise of reducing probl...
D. Sculley, Carla E. Brodley
GECCO
2007
Springer
172views Optimization» more  GECCO 2007»
15 years 8 months ago
Improving the human readability of features constructed by genetic programming
The use of machine learning techniques to automatically analyse data for information is becoming increasingly widespread. In this paper we examine the use of Genetic Programming a...
Matthew Smith, Larry Bull