Sciweavers

4085 search results - page 124 / 817
» Benchmarking Data Mining Algorithms
Sort
View
CIKM
2005
Springer
14 years 3 months ago
Frequent pattern discovery with memory constraint
We explore in this paper a practicably interesting mining task to retrieve frequent itemsets with memory constraint. As opposed to most previous works that concentrate on improvin...
Kun-Ta Chuang, Ming-Syan Chen
PKDD
2005
Springer
89views Data Mining» more  PKDD 2005»
14 years 3 months ago
Numbers in Multi-relational Data Mining
Numeric data has traditionally received little attention in the field of Multi-Relational Data Mining (MRDM). It is often assumed that numeric data can simply be turned into symbol...
Arno J. Knobbe, Eric K. Y. Ho
CCGRID
2008
IEEE
14 years 4 months ago
A Performance Study of Secure Data Mining on the Cell Processor
— This paper examines the potential of the Cell processor as a platform for secure data mining on the future volunteer computing systems. Volunteer computing platforms have the p...
Hong Wang 0006, Hiroyuki Takizawa, Hiroaki Kobayas...
AUSDM
2007
Springer
107views Data Mining» more  AUSDM 2007»
14 years 4 months ago
A Discriminant Analysis for Undersampled Data
One of the inherent problems in pattern recognition is the undersampled data problem, also known as the curse of dimensionality reduction. In this paper a new algorithm called pai...
Matthew Robards, Junbin Gao, Philip Charlton
ICDM
2008
IEEE
102views Data Mining» more  ICDM 2008»
14 years 4 months ago
Mining Order-Preserving Submatrices from Data with Repeated Measurements
Order-preserving submatrices (OPSM’s) have been shown useful in capturing concurrent patterns in data when the relative magnitudes of data items are more important than their ab...
Chun Kit Chui, Ben Kao, Kevin Y. Yip, Sau Dan Lee