Sciweavers

4085 search results - page 353 / 817
» Benchmarking Data Mining Algorithms
Sort
View
PAKDD
2000
ACM
140views Data Mining» more  PAKDD 2000»
15 years 8 months ago
Performance Controlled Data Reduction for Knowledge Discovery in Distributed Databases
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...
Slobodan Vucetic, Zoran Obradovic
182
Voted
KDD
2008
ACM
202views Data Mining» more  KDD 2008»
16 years 5 months ago
Data and Structural k-Anonymity in Social Networks
The advent of social network sites in the last years seems to be a trend that will likely continue. What naive technology users may not realize is that the information they provide...
Alina Campan, Traian Marius Truta
KDD
2005
ACM
166views Data Mining» more  KDD 2005»
16 years 5 months ago
A general model for clustering binary data
Clustering is the problem of identifying the distribution of patterns and intrinsic correlations in large data sets by partitioning the data points into similarity classes. This p...
Tao Li
136
Voted
KDD
2009
ACM
174views Data Mining» more  KDD 2009»
15 years 11 months ago
Visual exploration of categorical and mixed data sets
For categorical data there does not exist any similarity measure which is as straight forward and general as the numerical distance between numerical items. Due to this it is ofte...
Sara Johansson
KDD
2006
ACM
222views Data Mining» more  KDD 2006»
16 years 5 months ago
A component-based framework for knowledge discovery in bioinformatics
Motivation: In the field of bioinformatics there is an emerging need to integrate all knowledge discovery steps into a standardized modular framework. Indeed, component-based deve...
Julien Etienne, Bernd Wachmann, Lei Zhang