Sciweavers

4085 search results - page 89 / 817
» Benchmarking Data Mining Algorithms
Sort
View
DAWAK
2004
Springer
14 years 3 months ago
Algorithms for Discovery of Frequent Superset, Rather than Frequent Subset
Abstract. In this paper, we propose a novel mining task: mining frequent superset from the database of itemsets that is useful in bioinformatics, e-learning systems, jobshop schedu...
Zhung-Xun Liao, Man-Kwan Shan
IDA
2005
Springer
14 years 3 months ago
From Local Pattern Mining to Relevant Bi-cluster Characterization
Clustering or bi-clustering techniques have been proved quite useful in many application domains. A weakness of these techniques remains the poor support for grouping characterizat...
Ruggero G. Pensa, Jean-François Boulicaut
AIED
2005
Springer
14 years 3 months ago
Educational Data Mining: a Case Study
In this paper, we show how using data mining algorithms can help discovering pedagogically relevant knowledge contained in databases obtained from Web-based educational systems. Th...
Agathe Merceron, Kalina Yacef
SDM
2008
SIAM
177views Data Mining» more  SDM 2008»
13 years 11 months ago
Practical Private Computation and Zero-Knowledge Tools for Privacy-Preserving Distributed Data Mining
In this paper we explore private computation built on vector addition and its applications in privacypreserving data mining. Vector addition is a surprisingly general tool for imp...
Yitao Duan, John F. Canny
ICDM
2009
IEEE
130views Data Mining» more  ICDM 2009»
13 years 7 months ago
Efficient Anonymizations with Enhanced Utility
The k-anonymization method is a commonly used privacy-preserving technique. Previous studies used various measures of utility that aim at enhancing the correlation between the orig...
Jacob Goldberger, Tamir Tassa