Sciweavers

1888 search results - page 204 / 378
» The Learning Power of Evolution
Sort
View
COLT
2008
Springer
15 years 12 days ago
More Efficient Internal-Regret-Minimizing Algorithms
Standard no-internal-regret (NIR) algorithms compute a fixed point of a matrix, and hence typically require O(n3 ) run time per round of learning, where n is the dimensionality of...
Amy R. Greenwald, Zheng Li, Warren Schudy
NECO
2008
101views more  NECO 2008»
14 years 10 months ago
On the Classification Capability of Sign-Constrained Perceptrons
The perceptron (also referred to as McCulloch-Pitts neuron, or linear threshold gate) is commonly used as a simplified model for the discrimination and learning capability of a bi...
Robert A. Legenstein, Wolfgang Maass
IEEEVAST
2010
14 years 5 months ago
Anomaly detection in GPS data based on visual analytics
Modern machine learning techniques provide robust approaches for data-driven modeling and critical information extraction, while human experts hold the advantage of possessing hig...
Zicheng Liao, Yizhou Yu, Baoquan Chen
WWW
2009
ACM
15 years 11 months ago
Unsupervised query categorization using automatically-built concept graphs
Automatic categorization of user queries is an important component of general purpose (Web) search engines, particularly for triggering rich, query-specific content and sponsored ...
Eustache Diemert, Gilles Vandelle
ICML
2002
IEEE
15 years 11 months ago
Learning the Kernel Matrix with Semi-Definite Programming
Kernel-based learning algorithms work by embedding the data into a Euclidean space, and then searching for linear relations among the embedded data points. The embedding is perfor...
Gert R. G. Lanckriet, Nello Cristianini, Peter L. ...