Sciweavers

7163 search results - page 194 / 1433
» Privacy-Preserving Data Mining
Sort
View
KDD
2005
ACM
139views Data Mining» more  KDD 2005»
16 years 5 months ago
Reasoning about sets using redescription mining
Redescription mining is a newly introduced data mining problem that seeks to find subsets of data that afford multiple definitions. It can be viewed as a generalization of associa...
Mohammed Javeed Zaki, Naren Ramakrishnan
KDD
2004
ACM
207views Data Mining» more  KDD 2004»
16 years 5 months ago
SPIN: mining maximal frequent subgraphs from graph databases
One fundamental challenge for mining recurring subgraphs from semi-structured data sets is the overwhelming abundance of such patterns. In large graph databases, the total number ...
Jun Huan, Wei Wang 0010, Jan Prins, Jiong Yang
KDD
2009
ACM
347views Data Mining» more  KDD 2009»
15 years 11 months ago
FpViz: a visualizer for frequent pattern mining
Over the past 15 years, numerous algorithms have been proposed for frequent pattern mining as it plays an essential role in many knowledge discovery and data mining (KDD) tasks. M...
Carson Kai-Sang Leung, Christopher L. Carmichael
170
Voted
PKDD
1999
Springer
272views Data Mining» more  PKDD 1999»
15 years 9 months ago
Handling Missing Data in Trees: Surrogate Splits or Statistical Imputation
Abstract. In many applications of data mining a - sometimes considerable - part of the data values is missing. This may occur because the data values were simply never entered into...
A. J. Feelders
SDM
2012
SIAM
304views Data Mining» more  SDM 2012»
13 years 7 months ago
Fast Random Walk Graph Kernel
Random walk graph kernel has been used as an important tool for various data mining tasks including classification and similarity computation. Despite its usefulness, however, it...
U. Kang, Hanghang Tong, Jimeng Sun