Sciweavers

1989 search results - page 265 / 398
» Learning to Select Useful Landmarks
Sort
View
KDD
2007
ACM
276views Data Mining» more  KDD 2007»
16 years 6 months ago
Nonlinear adaptive distance metric learning for clustering
A good distance metric is crucial for many data mining tasks. To learn a metric in the unsupervised setting, most metric learning algorithms project observed data to a lowdimensio...
Jianhui Chen, Zheng Zhao, Jieping Ye, Huan Liu
GECCO
2006
Springer
171views Optimization» more  GECCO 2006»
15 years 10 months ago
Evolving ensemble of classifiers in random subspace
Various methods for ensemble selection and classifier combination have been designed to optimize the results of ensembles of classifiers. Genetic algorithm (GA) which uses the div...
Albert Hung-Ren Ko, Robert Sabourin, Alceu de Souz...
JMLR
2006
145views more  JMLR 2006»
15 years 6 months ago
Ensemble Pruning Via Semi-definite Programming
An ensemble is a group of learning models that jointly solve a problem. However, the ensembles generated by existing techniques are sometimes unnecessarily large, which can lead t...
Yi Zhang 0006, Samuel Burer, W. Nick Street
CCECE
2006
IEEE
16 years 10 days ago
A Dynamic Associative E-Learning Model based on a Spreading Activation Network
Presenting information to an e-learning environment is a challenge, mostly, because ofthe hypertextlhypermedia nature and the richness ofthe context and information provides. This...
Phongchai Nilas, Nilamit Nilas, Somsak Mitatha
WWW
2008
ACM
16 years 7 months ago
Floatcascade learning for fast imbalanced web mining
This paper is concerned with the problem of Imbalanced Classification (IC) in web mining, which often arises on the web due to the "Matthew Effect". As web IC applicatio...
Xiaoxun Zhang, Xueying Wang, Honglei Guo, Zhili Gu...