Sciweavers

881 search results - page 147 / 177
» Spectral Algorithms for Supervised Learning
Sort
View
WWW
2011
ACM
14 years 4 months ago
From actors, politicians, to CEOs: domain adaptation of relational extractors using a latent relational mapping
We propose a method to adapt an existing relation extraction system to extract new relation types with minimum supervision. Our proposed method comprises two stages: learning a lo...
Danushka Bollegala, Yutaka Matsuo, Mitsuru Ishizuk...
JCIT
2010
148views more  JCIT 2010»
14 years 4 months ago
Investigating the Performance of Naive- Bayes Classifiers and K- Nearest Neighbor Classifiers
Probability theory is the framework for making decision under uncertainty. In classification, Bayes' rule is used to calculate the probabilities of the classes and it is a bi...
Mohammed J. Islam, Q. M. Jonathan Wu, Majid Ahmadi...
AIIA
2007
Springer
15 years 3 months ago
A Hierarchical Clustering Procedure for Semantically Annotated Resources
Abstract. A clustering method is presented which can be applied to relational knowledge bases. It can be used to discover interesting groupings of resources through their (semantic...
Nicola Fanizzi, Claudia d'Amato, Floriana Esposito
PRL
2010
158views more  PRL 2010»
14 years 8 months ago
Data clustering: 50 years beyond K-means
: Organizing data into sensible groupings is one of the most fundamental modes of understanding and learning. As an example, a common scheme of scientific classification puts organ...
Anil K. Jain
98
Voted
KDD
2005
ACM
118views Data Mining» more  KDD 2005»
15 years 10 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