Sciweavers

412 search results - page 65 / 83
» Algorithmic Complexity Bounds on Future Prediction Errors
Sort
View
ICML
2010
IEEE
15 years 23 days ago
Multi-Class Pegasos on a Budget
When equipped with kernel functions, online learning algorithms are susceptible to the "curse of kernelization" that causes unbounded growth in the model size. To addres...
Zhuang Wang, Koby Crammer, Slobodan Vucetic
FSS
2007
117views more  FSS 2007»
14 years 11 months ago
Multiple regression with fuzzy data
In this paper, we propose an iterative algorithm for multiple regression with fuzzy variables.While using the standard least-squares criterion as a performance index, we pose the ...
Andrzej Bargiela, Witold Pedrycz, Tomoharu Nakashi...
ICDM
2010
IEEE
150views Data Mining» more  ICDM 2010»
14 years 9 months ago
Probabilistic Inference Protection on Anonymized Data
Background knowledge is an important factor in privacy preserving data publishing. Probabilistic distributionbased background knowledge is a powerful kind of background knowledge w...
Raymond Chi-Wing Wong, Ada Wai-Chee Fu, Ke Wang, Y...
TWC
2010
14 years 6 months ago
Optimized Training Sequences for Spatially Correlated MIMO-OFDM
In this paper, the training sequence design for multiple-input multiple-output (MIMO) orthogonal frequencydivision multiplexing (OFDM) systems under the minimum mean square error (...
Hoang Duong Tuan, Ha Hoang Kha, Ha H. Nguyen, Viet...
SDM
2007
SIAM
171views Data Mining» more  SDM 2007»
15 years 1 months ago
A Better Alternative to Piecewise Linear Time Series Segmentation
Time series are difficult to monitor, summarize and predict. Segmentation organizes time series into few intervals having uniform characteristics (flatness, linearity, modality,...
Daniel Lemire