Sciweavers

25 search results - page 5 / 5
» Learning Semantic Correspondences with Less Supervision
Sort
View
KDD
2005
ACM
118views Data Mining» more  KDD 2005»
14 years 5 months ago
On the use of linear programming for unsupervised text classification
We propose a new algorithm for dimensionality reduction and unsupervised text classification. We use mixture models as underlying process of generating corpus and utilize a novel,...
Mark Sandler
JMLR
2008
230views more  JMLR 2008»
13 years 5 months ago
Exponentiated Gradient Algorithms for Conditional Random Fields and Max-Margin Markov Networks
Log-linear and maximum-margin models are two commonly-used methods in supervised machine learning, and are frequently used in structured prediction problems. Efficient learning of...
Michael Collins, Amir Globerson, Terry Koo, Xavier...
ISMIS
2009
Springer
13 years 11 months ago
Fuzzy Clustering for Categorical Spaces
Abstract. A multi-relational clustering method is presented which can be applied to complex knowledge bases storing resources expressed in the standard Semantic Web languages. It a...
Nicola Fanizzi, Claudia d'Amato, Floriana Esposito
WWW
2004
ACM
14 years 5 months ago
Authoring of learning styles in adaptive hypermedia: problems and solutions
Learning styles, as well as the best ways of responding with corresponding instructional strategies, have been intensively studied in the classical educational (classroom) setting...
Natalia Stash, Alexandra I. Cristea, Paul De Bra
CIKM
2010
Springer
13 years 3 months ago
Collaborative Dual-PLSA: mining distinction and commonality across multiple domains for text classification
:  Collaborative Dual-PLSA: Mining Distinction and Commonality across Multiple Domains for Text Classification Fuzhen Zhuang, Ping Luo, Zhiyong Shen, Qing He, Yuhong Xiong, Zhon...
Fuzhen Zhuang, Ping Luo, Zhiyong Shen, Qing He, Yu...