4085 search results - page 31 / 817 » Benchmarking Data Mining Algorithms |
CINQ
2004
Springer
14 years 1 months ago
2004
Springer
Frequent Pattern Mining (FPM) is a very powerful paradigm for mining informative and useful patterns in massive, complex datasets. In this paper we propose the Data Mining Templat...
SEMWEB
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We present a method for rapid development of benchmarks for Semantic Web knowledge base systems. At the core, we have a synthetic data generation approach for OWL that is...
VLDB
2008
ACM
14 years 7 months ago
2008
ACM
In this paper we present extended definitions of k-anonymity and use them to prove that a given data mining model does not violate the k-anonymity of the individuals represented in...
ICDE
2008
IEEE
14 years 9 months ago
2008
IEEE
Mining frequent itemsets from data streams has proved to be very difficult because of computational complexity and the need for real-time response. In this paper, we introduce a no...
ICAI
2004
13 years 9 months ago
2004
This paper centers on the discussion of k-medoid-style clustering algorithms for supervised summary generation. This task requires clustering techniques that identify class-unifor...