Sciweavers

184 search results - page 8 / 37
» Efficiently handling feature redundancy in high-dimensional ...
Sort
View
AIRS
2008
Springer
13 years 9 months ago
Efficient Feature Selection in the Presence of Outliers and Noises
Although regarded as one of the most successful algorithm to identify predictive features, Relief is quite vulnerable to outliers and noisy features. The recently proposed I-Relief...
Shuang-Hong Yang, Bao-Gang Hu
KDD
2003
ACM
195views Data Mining» more  KDD 2003»
14 years 8 months ago
Visualizing changes in the structure of data for exploratory feature selection
Using visualization techniques to explore and understand high-dimensional data is an efficient way to combine human intelligence with the immense brute force computation power ava...
Elias Pampalk, Werner Goebl, Gerhard Widmer
ICCSA
2003
Springer
14 years 27 days ago
Efficient Speaker Identification Based on Robust VQ-PCA
Abstract. In this paper, an efficient speaker identification based on robust vector quantization principal component analysis (VQ-PCA) is proposed to solve the problems from outlie...
Younjeong Lee, Joohun Lee, Ki Yong Lee
SDM
2008
SIAM
256views Data Mining» more  SDM 2008»
13 years 9 months ago
Graph Mining with Variational Dirichlet Process Mixture Models
Graph data such as chemical compounds and XML documents are getting more common in many application domains. A main difficulty of graph data processing lies in the intrinsic high ...
Koji Tsuda, Kenichi Kurihara
EWCBR
2006
Springer
13 years 11 months ago
Fast Case Retrieval Nets for Textual Data
Case Retrieval Networks (CRNs) facilitate flexible and efficient retrieval in Case-Based Reasoning (CBR) systems. While CRNs scale up well to handle large numbers of cases in the c...
Sutanu Chakraborti, Robert Lothian, Nirmalie Wirat...