1789 search results - page 150 / 358 » Genetic Algorithms for Component Analysis |
130
Voted
TACAS
2010
Springer
15 years 10 months ago
2010
Springer
Many algorithms on data structures such as terms (finitely branching trees) are naturally implemented by second-order recursion: A first-order procedure f passes itself as an arg...
127
Voted
CORR
2012
Springer
13 years 11 months ago
2012
Springer
The problem of finding locally dense components of a graph is an important primitive in data analysis, with wide-ranging applications from community mining to spam detection and ...
138
Voted
ICA
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. The recovery of the mixture of an N-dimensional signal generated by N independent processes is a well studied problem (see e.g. [1,10]) and robust algorithms that solve t...
138
click to vote
PKDD
2004
Springer
15 years 9 months ago
2004
Springer
Ideally, a multi-strategy learning algorithm performs better than its component approaches. RISE is a multi-strategy algorithm that combines rule induction and instance-based learn...
108
Voted
ICMCS
2006
IEEE
15 years 9 months ago
2006
IEEE
EM algorithm is an important unsupervised clustering algorithm, but the algorithm has several limitations. In this paper, we propose a fast EM algorithm (FEMA) to address the limi...