Sciweavers

1403 search results - page 37 / 281
» Set cover algorithms for very large datasets
Sort
View
EUSFLAT
2007
126views Fuzzy Logic» more  EUSFLAT 2007»
13 years 10 months ago
Selecting the Optimal Rule Set Using a Bacterial Evolutionary Algorithm
In many regression learning algorithms for fuzzy rule bases it is not possible to define the error measure to be optimized freely. A possible alternative is the usage of global o...
Mario Drobics, János Botzheim, Klaus-Peter ...
BCB
2010
138views Bioinformatics» more  BCB 2010»
13 years 3 months ago
Comparative analysis of biclustering algorithms
Biclustering is a very popular method to identify hidden co-regulation patterns among genes. There are numerous biclustering algorithms designed to undertake this challenging task...
Doruk Bozdag, Ashwin S. Kumar, Ümit V. &Ccedi...
SDM
2011
SIAM
241views Data Mining» more  SDM 2011»
12 years 11 months ago
A Fast Algorithm for Sparse PCA and a New Sparsity Control Criteria
Sparse principal component analysis (PCA) imposes extra constraints or penalty terms to the standard PCA to achieve sparsity. In this paper, we first introduce an efficient algor...
Yunlong He, Renato Monteiro, Haesun Park
NIPS
1997
13 years 9 months ago
EM Algorithms for PCA and SPCA
I present an expectation-maximization (EM) algorithm for principal component analysis (PCA). The algorithm allows a few eigenvectors and eigenvalues to be extracted from large col...
Sam T. Roweis
ICDE
2006
IEEE
222views Database» more  ICDE 2006»
14 years 9 months ago
CLAN: An Algorithm for Mining Closed Cliques from Large Dense Graph Databases
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
Jianyong Wang, Zhiping Zeng, Lizhu Zhou