Hamideh Afsarmanesh

Hamideh Afsarmanesh

Auto-generated profile, based on publicly available information

Hamideh Afsarmanesh

University of Amsterdam

Research Focus & Metrics

Academic Career Length

38Years (1989-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 October 2005 in Journal of Intelligent Manufacturing
Verified
Journal Article
Closed access
PDF file
Luis M. Camarinha-MatosLuis M. Camarinha-Matos
Luis M. Camarinha-Matos
HAHamideh Afsarmanesh
Hamideh Afsarmanesh

1 August 2009 in Computers & Industrial Engineering
Verified
Journal Article
Closed access
Luis M. Camarinha-MatosLuis M. Camarinha-Matos
Luis M. Camarinha-Matos
HAHamideh Afsarmanesh
Hamideh Afsarmanesh
NGNathalie Galeano
Nathalie Galeano
AMArturo Molina
Arturo Molina

24 January 2015 in International Journal of Machine Learning and Cybernetics
Verified
Journal Article
Open access
PDF file
JTJafar Tanha
Jafar Tanha
MSMaarten van Someren
Maarten van Someren
HAHamideh Afsarmanesh
Hamideh Afsarmanesh
We consider semi-supervised learning, learning task from both labeled and unlabeled instances and in particular, self-training with decision tree learners as base learners. We show that standard decision tree learning as the base learner cannot be effective in a self-training algorithm to semi-supervised learning. The main reason is that the basic decision tree learner does not produce reliable probability estimation to its predictions. Therefore, it cannot be a proper selection criterion in self-training. We consider the effect of several modifications to the basic decision tree learner that produce better probability estimation than using the distributions at the leaves of the tree. We show that these modifications do not produce better performance when used on the labeled data only, but they do benefit more from the unlabeled data in self-training. The modifications that we consider are Naive Bayes Tree, a combination of No-pruning and Laplace correction, grafting, and using a distance-based measure. We then extend this improvement to algorithms for ensembles of decision trees and we show that the ensemble learner gives an extra improvement over the adapted decision tree learners.

14 June 2003 in Computers in Industry
Verified
Journal Article
Closed access
Luis M. Camarinha-MatosLuis M. Camarinha-Matos
Luis M. Camarinha-Matos
HAHamideh Afsarmanesh
Hamideh Afsarmanesh

3 July 2007 in Journal of Intelligent Manufacturing
Verified
Journal Article
Closed access
PDF file
Luis M. Camarinha-MatosLuis M. Camarinha-Matos
Luis M. Camarinha-Matos
HAHamideh Afsarmanesh
Hamideh Afsarmanesh