Sciweavers

4085 search results - page 189 / 817
» Benchmarking Data Mining Algorithms
Sort
View
159
Voted
KDD
2006
ACM
149views Data Mining» more  KDD 2006»
16 years 3 months ago
Regularized discriminant analysis for high dimensional, low sample size data
Linear and Quadratic Discriminant Analysis have been used widely in many areas of data mining, machine learning, and bioinformatics. Friedman proposed a compromise between Linear ...
Jieping Ye, Tie Wang
140
Voted
ICDM
2007
IEEE
169views Data Mining» more  ICDM 2007»
15 years 7 months ago
Efficient Discovery of Frequent Approximate Sequential Patterns
We propose an efficient algorithm for mining frequent approximate sequential patterns under the Hamming distance model. Our algorithm gains its efficiency by adopting a "brea...
Feida Zhu, Xifeng Yan, Jiawei Han, Philip S. Yu
ISCA
1998
IEEE
135views Hardware» more  ISCA 1998»
15 years 7 months ago
Branch Prediction Based on Universal Data Compression Algorithms
Data compression and prediction are closely related. Thus prediction methods based on data compression algorithms have been suggested for the branch prediction problem. In this wo...
Eitan Federovsky, Meir Feder, Shlomo Weiss
131
Voted
VLSID
2000
IEEE
94views VLSI» more  VLSID 2000»
15 years 7 months ago
A Genetic Algorithm for the Synthesis of Structured Data Paths
The technique presented here achieves simultaneous optimization of schedule time and data path component cost within a structured data path architecture, using a genetic algorithm...
Chittaranjan A. Mandal, R. M. Zimmer
ICDM
2009
IEEE
174views Data Mining» more  ICDM 2009»
15 years 10 months ago
Non-sparse Multiple Kernel Learning for Fisher Discriminant Analysis
—We consider the problem of learning a linear combination of pre-specified kernel matrices in the Fisher discriminant analysis setting. Existing methods for such a task impose a...
Fei Yan, Josef Kittler, Krystian Mikolajczyk, Muha...