Sciweavers

1601 search results - page 100 / 321
» Closed Sets for Labeled Data
Sort
View
COLING
2002
15 years 4 months ago
Recovering Latent Information in Treebanks
Many recent statistical parsers rely on a preprocessing step which uses hand-written, corpus-specific rules to augment the training data with extra information. For example, head-...
David Chiang, Daniel M. Bikel
ML
2010
ACM
15 years 3 months ago
Semi-supervised local Fisher discriminant analysis for dimensionality reduction
When only a small number of labeled samples are available, supervised dimensionality reduction methods tend to perform poorly due to overfitting. In such cases, unlabeled samples ...
Masashi Sugiyama, Tsuyoshi Idé, Shinichi Na...
ACL
2010
15 years 2 months ago
Sentiment Learning on Product Reviews via Sentiment Ontology Tree
Existing works on sentiment analysis on product reviews suffer from the following limitations: (1) The knowledge of hierarchical relationships of products attributes is not fully ...
Wei Wei, Jon Atle Gulla
CVPR
2008
IEEE
16 years 6 months ago
Semi-Supervised Discriminant Analysis using robust path-based similarity
Linear Discriminant Analysis (LDA), which works by maximizing the within-class similarity and minimizing the between-class similarity simultaneously, is a popular dimensionality r...
Yu Zhang, Dit-Yan Yeung
ICDM
2005
IEEE
137views Data Mining» more  ICDM 2005»
15 years 10 months ago
Leveraging Relational Autocorrelation with Latent Group Models
The presence of autocorrelation provides a strong motivation for using relational learning and inference techniques. Autocorrelation is a statistical dependence between the values...
Jennifer Neville, David Jensen