185 search results - page 3 / 37 » Probing Knowledge in Distributed Data Mining |
PAKDD
2010
ACM
13 years 5 months ago
2010
ACM
Data mining tasks results are usually improved by reducing the dimensionality of data. This improvement however is achieved harder in the case that data lay on a non linear manifol...
IMC
2010
ACM
13 years 5 months ago
2010
ACM
Current large-scale topology mapping systems require multiple days to characterize the Internet due to the large amount of probing traffic they incur. The accuracy of maps from ex...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
XCS is a flexible system for data mining due to its ability to deal with environmental changes, learn online with little prior knowledge and evolve accurate and maximally general...
PAKDD
2000
ACM
13 years 11 months ago
2000
ACM
The objective of data reduction is to obtain a compact representation of a large data set to facilitate repeated use of non-redundant information with complex and slow learning alg...
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
The knowledge discovery process is interactive in nature and therefore minimizing query response time is imperative. The compute and memory intensive nature of data mining algorit...