Sciweavers

2229 search results - page 31 / 446
» Comparative analysis of biclustering algorithms
Sort
View
CEC
2005
IEEE
13 years 11 months ago
A new approach to dynamics analysis of genetic algorithms without selection
Abstract- Theoretical analysis of the dynamics of evolutionary algorithms is believed to be very important to understand the search behavior of evolutionary algorithms and to devel...
Tatsuya Okabe, Yaochu Jin, Bernhard Sendhoff
SAC
2006
ACM
14 years 2 months ago
A probability analysis for candidate-based frequent itemset algorithms
This paper explores the generation of candidates, which is an important step in frequent itemset mining algorithms, from a theoretical point of view. Important notions in our prob...
Nele Dexters, Paul W. Purdom, Dirk Van Gucht
SIAMSC
2010
137views more  SIAMSC 2010»
13 years 3 months ago
Accuracy Measures and Fourier Analysis for the Full Multigrid Algorithm
Abstract. The full multigrid (FMG) algorithm is often claimed to achieve so-called discretizationlevel accuracy. In this paper, this notion is formalized by defining a worst-case r...
Carmen Rodrigo, Francisco J. Gaspar, Cornelis W. O...
ICML
1997
IEEE
14 years 9 months ago
A Probabilistic Analysis of the Rocchio Algorithm with TFIDF for Text Categorization
The Rocchio relevance feedback algorithm is one of the most popular and widely applied learning methods from information retrieval. Here, a probabilistic analysis of this algorith...
Thorsten Joachims
ICA
2007
Springer
14 years 3 months ago
Sparse Component Analysis in Presence of Noise Using an Iterative EM-MAP Algorithm
Abstract. In this paper, a new algorithm for source recovery in underdetermined Sparse Component Analysis (SCA) or atomic decomposition on over-complete dictionaries is presented i...
Hadi Zayyani, Massoud Babaie-Zadeh, G. Hosein Mohi...