Sciweavers

421 search results - page 15 / 85
» Reducing Label Complexity by Learning From Bags
Sort
View
ICPR
2004
IEEE
15 years 10 months ago
Relaxation Labeling Processes for Protein Secondary Structure Prediction
The prediction of protein secondary structure is a classical problem in bioinformatics, and in the past few years several machine learning techniques have been proposed to t. From...
Giacomo Colle, Marcello Pelillo
ECML
2006
Springer
15 years 1 months ago
Graph Based Semi-supervised Learning with Sharper Edges
In many graph-based semi-supervised learning algorithms, edge weights are assumed to be fixed and determined by the data points' (often symmetric) relationships in input space...
Hyunjung Shin, N. Jeremy Hill, Gunnar Rätsch
BIBE
2009
IEEE
131views Bioinformatics» more  BIBE 2009»
15 years 28 days ago
Learning Scaling Coefficient in Possibilistic Latent Variable Algorithm from Complex Diagnosis Data
—The Possibilistic Latent Variable (PLV) clustering algorithm is a powerful tool for the analysis of complex datasets due to its robustness toward data distributions of different...
Zong-Xian Yin
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
14 years 7 months ago
Complexity Bounds for Batch Active Learning in Classification
Active learning [1] is a branch of Machine Learning in which the learning algorithm, instead of being directly provided with pairs of problem instances and their solutions (their l...
Philippe Rolet, Olivier Teytaud
IPM
2008
139views more  IPM 2008»
14 years 9 months ago
Complex adaptive filtering user profile using graphical models
This article explores how to develop complex data driven user models that go beyond the bag of words model and topical relevance. We propose to learn from rich user specific info...
Yi Zhang 0001