387 search results - page 32 / 78 » Mining Approximative Descriptions of Sets Using Rough Sets |
PAKDD
2005
ACM
14 years 1 months ago
2005
ACM
In many modern application ranges high-dimensional feature vectors are used to model complex real-world objects. Often these objects reside on different local sites. In this paper,...
RSCTC
2000
Springer
13 years 11 months ago
2000
Springer
: In the paper nine different approaches to missing attribute values are presented and compared. Ten input data files were used to investigate the performance of the nine methods t...
CSC
2009
13 years 8 months ago
2009
- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...
DBA
2006
13 years 9 months ago
2006
This paper presents an approach to produce generalization candidates for a concept hierarchy without the necessity of being an expert in the domain to be generalized and ...
PKDD
2010
Springer
13 years 5 months ago
2010
Springer
Partially observable Markov decision processes (POMDPs) are widely used for planning under uncertainty. In many applications, the huge size of the POMDP state space makes straightf...