209 search results - page 14 / 42 » Evaluating Feature Selection for SVMs in High Dimensions |
101
click to vote
CIKM
2008
Springer
15 years 2 months ago
2008
Springer
Finding latent patterns in high dimensional data is an important research problem with numerous applications. The most well known approaches for high dimensional data analysis are...
114
click to vote
DEXA
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. Bitmap indices are popular multi-dimensional data structures for accessing read-mostly data such as data warehouse (DW) applications, decision support systems (DSS) and o...
80
Voted
PR
2007
14 years 12 months ago
2007
Classical clustering algorithms are based on the concept that a cluster center is a single point. Clusters which are not compact around a single point are not candidates for class...
114
click to vote
CIARP
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. A major characteristic of text document categorization problems is the extremely high dimensionality of text data. In this paper we explore the usability of the Oscillati...
ICADL
2005
Springer
15 years 6 months ago
2005
Springer
This paper proposes a method for creating a high quality collection of researchers’ homepages. The proposed method consists of three phases: rough filtering of the possible web p...