Sciweavers

298 search results - page 48 / 60
» Sparse Latent Semantic Analysis
Sort
View
NLPRS
2001
Springer
15 years 2 months ago
Ensembling based on Feature Space Restructuring with Application to WSD
We propose a new ensembling method of Support Vector Machines (SVMs) based on Feature Space Restructuring. In the proposed method, the weighted majority voting method is applied f...
Hiroya Takamura, Hiroyasu Yamada, Taku Kudo, Kaoru...
APVIS
2010
14 years 11 months ago
Motion track: Visualizing variations of human motion data
This paper proposes a novel visualization approach, which can depict the variations between different human motion data. This is achieved by representing the time dimension of eac...
Yueqi Hu, Shuangyuan Wu, Shihong Xia, Jinghua Fu, ...
SNPD
2010
14 years 8 months ago
Ambiguous Arabic Words Disambiguation
In this paper we propose an hybrid system of Arabic words disambiguation. To achieve this goal we use the methods employed in the domain of information retrieval: Latent semantic ...
Laroussi Merhbene, Anis Zouaghi, Mounir Zrigui
ICPR
2010
IEEE
14 years 7 months ago
Word Clustering Using PLSA Enhanced with Long Distance Bigrams
Probabilistic latent semantic analysis is enhanced with long distance bigram models in order to improve word clustering. The long distance bigram probabilities and the interpolate...
Nikoletta Bassiou, Constantine Kotropoulos
CORR
2011
Springer
157views Education» more  CORR 2011»
14 years 4 months ago
Fast and Faster: A Comparison of Two Streamed Matrix Decomposition Algorithms
With the explosion of the size of digital dataset, the limiting factor for decomposition algorithms is the number of passes over the input, as the input is often stored out-of-cor...
Radim Rehurek