Sciweavers

4911 search results - page 432 / 983
» Personal Learning Environments
Sort
View
KDD
2009
ACM
180views Data Mining» more  KDD 2009»
16 years 7 months ago
Using graph-based metrics with empirical risk minimization to speed up active learning on networked data
Active and semi-supervised learning are important techniques when labeled data are scarce. Recently a method was suggested for combining active learning with a semi-supervised lea...
Sofus A. Macskassy
KDD
2007
ACM
178views Data Mining» more  KDD 2007»
16 years 7 months ago
Practical learning from one-sided feedback
In many data mining applications, online labeling feedback is only available for examples which were predicted to belong to the positive class. Such applications include spam filt...
D. Sculley
KDD
2010
ACM
249views Data Mining» more  KDD 2010»
15 years 9 months ago
Semi-supervised sparse metric learning using alternating linearization optimization
In plenty of scenarios, data can be represented as vectors mathematically abstracted as points in a Euclidean space. Because a great number of machine learning and data mining app...
Wei Liu, Shiqian Ma, Dacheng Tao, Jianzhuang Liu, ...
WWW
2008
ACM
16 years 7 months ago
Why web 2.0 is good for learning and for research: principles and prototypes
The term "Web 2.0" is used to describe applications that distinguish themselves from previous generations of software by a number of principles. Existing work shows that...
Carsten Ullrich, Kerstin Borau, Heng Luo, Xiaohong...
KDD
2007
ACM
276views Data Mining» more  KDD 2007»
16 years 7 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