<--- Back to Details
First PageDocument Content
Science / Artificial intelligence / Latent semantic analysis / Grammatical aspect / Statistical classification / Relevance / Trigonometric functions / K-nearest neighbor algorithm / Information science / Natural language processing / Information retrieval
Date: 2014-07-19 18:51:50
Science
Artificial intelligence
Latent semantic analysis
Grammatical aspect
Statistical classification
Relevance
Trigonometric functions
K-nearest neighbor algorithm
Information science
Natural language processing
Information retrieval

English and Chinese Bilingual Topic Aspect Classification: Exploring Similarity Measures, Optimal LSA Dimensions, and Centroid Correction of Translated Training Examples Yejun Wu School of Library and Information Science

Add to Reading List

Source URL: www.asis.org

Download Document from Source Website

File Size: 557,97 KB

Share Document on Facebook

Similar Documents

MEMOCODE 2014 Design Contest: k-Nearest Neighbors with Mahalanobis Distance Metric Peter Milder Department of Electrical and Computer Engineering Stony Brook University Stony Brook, NY 11794–2350

MEMOCODE 2014 Design Contest: k-Nearest Neighbors with Mahalanobis Distance Metric Peter Milder Department of Electrical and Computer Engineering Stony Brook University Stony Brook, NY 11794–2350

DocID: 1rmvj - View Document

A Collaborative Filtering Approach to Real-Time Hand Pose Estimation Chiho Choi, Ayan Sinha, Joon Hee Choi, Sujin Jang, Karthik Ramani Purdue University West Lafayette, IN 47907, USA {chihochoi, sinha12, choi240, jang64,

A Collaborative Filtering Approach to Real-Time Hand Pose Estimation Chiho Choi, Ayan Sinha, Joon Hee Choi, Sujin Jang, Karthik Ramani Purdue University West Lafayette, IN 47907, USA {chihochoi, sinha12, choi240, jang64,

DocID: 1rkoE - View Document

Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions David Eppstein Department of Information and Computer Science University of California, Irvine, CA 92717

Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions David Eppstein Department of Information and Computer Science University of California, Irvine, CA 92717

DocID: 1qXBI - View Document

Mach Learn DOIs10994Visualizing non-metric similarities in multiple maps Laurens van der Maaten · Geoffrey Hinton

Mach Learn DOIs10994Visualizing non-metric similarities in multiple maps Laurens van der Maaten · Geoffrey Hinton

DocID: 1qSlY - View Document

Selective Hashing: Closing the Gap between Radius Search and k-NN Search Jinyang Gao‡ H. V. Jagadish§

Selective Hashing: Closing the Gap between Radius Search and k-NN Search Jinyang Gao‡ H. V. Jagadish§

DocID: 1qNhe - View Document