Sciweavers

222 search results - page 20 / 45
» Learning Optimal Parameters in Decision-Theoretic Rough Sets
Sort
View
ICML
2009
IEEE
14 years 9 months ago
Proximal regularization for online and batch learning
Many learning algorithms rely on the curvature (in particular, strong convexity) of regularized objective functions to provide good theoretical performance guarantees. In practice...
Chuong B. Do, Quoc V. Le, Chuan-Sheng Foo
CP
2006
Springer
14 years 10 days ago
Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...
Frank Hutter, Youssef Hamadi, Holger H. Hoos, Kevi...
MIR
2005
ACM
129views Multimedia» more  MIR 2005»
14 years 2 months ago
Tracking concept drifting with an online-optimized incremental learning framework
Concept drifting is an important and challenging research issue in the field of machine learning. This paper mainly addresses the issue of semantic concept drifting in time series...
Jun Wu, Dayong Ding, Xian-Sheng Hua, Bo Zhang
ISF
2010
164views more  ISF 2010»
13 years 5 months ago
An SVM-based machine learning method for accurate internet traffic classification
Accurate and timely traffic classification is critical in network security monitoring and traffic engineering. Traditional methods based on port numbers and protocols have proven t...
Ruixi Yuan, Zhu Li, Xiaohong Guan, Li Xu
LWA
2004
13 years 10 months ago
Modeling Rule Precision
This paper reports first results of an empirical study of the precision of classification rules on an independent test set. We generated a large number of rules using a general co...
Johannes Fürnkranz