DISCOVERING ROBUST EMBEDDINGS IN (DIS)SIMILARITY SPACE FOR HIGH-DIMENSIONAL LINGUISTIC FEATURES
From MaRDI portal
Publication:3462273
DOI10.1111/j.1467-8640.2012.00452.xzbMath1328.68257OpenAlexW2000273165MaRDI QIDQ3462273
Makoto Miwa, Sophia Ananiadou, Tingting Mu, Jun'ichi Tsujii
Publication date: 5 January 2016
Published in: Computational Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.1467-8640.2012.00452.x
classificationembeddingnatural language processingdimensionality reduction(dis)similarityrich feature representation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matrix multiplication via arithmetic progressions
- Enhanced graph-based dimensionality reduction with repulsion Laplaceans
- Fast low-rank modifications of the thin singular value decomposition
- Prototype selection for dissimilarity-based classifiers
- Multidimensional scaling. I: Theory and method
- 10.1162/153244303768966085
- Supporting the education evidence portal via text mining
- Structure Preserving Dimension Reduction for Clustered Text Data Based on the Generalized Singular Value Decomposition
- Dissimilarity representations allow for building good classifiers
- 10.1162/jmlr.2003.3.4-5.993
- Canonical Correlation Analysis: An Overview with Application to Learning Methods
- 10.1162/153244302760200687
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- 10.1162/153244303322753625
- 10.1162/153244303322753661
- Text categorization with support vector machines. How to represent texts in input space?
