5 search results - page 1 / 1 » Accelerating genetic programming by frequent subtree mining |
GECCO
2008
Springer
13 years 5 months ago
2008
Springer
One crucial issue in genetic programming (GP) is how to acquire promising building blocks efficiently. In this paper, we propose a GP method (called GPTM, GP with Tree Mining) whi...
PKDD
2004
Springer
13 years 9 months ago
2004
Springer
Abstract In this paper we propose a novel parallel algorithm for frequent itemset mining. The algorithm is based on the filter-stream programming model, in which the frequent item...
CEC
2010
IEEE
13 years 4 months ago
2010
IEEE
— This paper presents the G3PARM algorithm for mining representative association rules. G3PARM is an evolutionary algorithm that uses G3P (Grammar Guided Genetic Programming) and...
WAIM
2010
Springer
13 years 2 months ago
2010
Springer
Finding relational expressions which exist frequently in one class of data while not in the other class of data is an interesting work. In this paper, a relational expression of th...
CIDM
2009
IEEE
13 years 11 months ago
2009
IEEE
—Some data mining problems require predictive models to be not only accurate but also comprehensible. Comprehensibility enables human inspection and understanding of the model, m...