Sciweavers

184 search results - page 10 / 37
» Efficiently handling feature redundancy in high-dimensional ...
Sort
View
SAC
2008
ACM
13 years 7 months ago
An efficient feature ranking measure for text categorization
A major obstacle that decreases the performance of text classifiers is the extremely high dimensionality of text data. To reduce the dimension, a number of approaches based on rou...
Songbo Tan, Yuefen Wang, Xueqi Cheng
JCIT
2010
190views more  JCIT 2010»
13 years 2 months ago
Application of Feature Extraction Method in Customer Churn Prediction Based on Random Forest and Transduction
With the development of telecom business, customer churn prediction becomes more and more important. An outstanding issue in customer churn prediction is high dimensional problem....
Yihui Qiu, Hong Li
JMLR
2010
144views more  JMLR 2010»
13 years 2 months ago
Practical Approaches to Principal Component Analysis in the Presence of Missing Values
Principal component analysis (PCA) is a classical data analysis technique that finds linear transformations of data that retain the maximal amount of variance. We study a case whe...
Alexander Ilin, Tapani Raiko
CGF
2010
171views more  CGF 2010»
13 years 4 months ago
Efficient Mean-shift Clustering Using Gaussian KD-Tree
Mean shift is a popular approach for data clustering, however, the high computational complexity of the mean shift procedure limits its practical applications in high dimensional ...
Chunxia Xiao, Meng Liu
CVPR
2003
IEEE
14 years 9 months ago
Nearest Neighbor Search for Relevance Feedback
We introduce the problem of repetitive nearest neighbor search in relevance feedback and propose an efficient search scheme for high dimensional feature spaces. Relevance feedback...
Jelena Tesic, B. S. Manjunath