680 search results - page 70 / 136 » Mining Frequent Itemsets Using Genetic Algorithm |
IFIP12
2007
14 years 11 months ago
2007
Mining frequent subgraphs is an area of research where we have a given set of graphs, and where we search for (connected) subgraphs contained in many of these graphs. Each graph ca...
KES
2007
Springer
14 years 9 months ago
2007
Springer
This paper describes a practical dynamic route planning method using real road maps in a wide area. The maps include traffic signals, road classes, and the number of lanes. The pr...
ICDM
2006
IEEE
15 years 3 months ago
2006
IEEE
This paper presents a novel algorithm to cluster emails according to their contents and the sentence styles of their subject lines. In our algorithm, natural language processing t...
131
click to vote
PKDD
2004
Springer
15 years 3 months ago
2004
Springer
The problem of discovering frequent subgraphs of graph data can be solved by constructing a candidate set of subgraphs first, and then, identifying within this candidate set those...
CEC
2007
IEEE
2007
IEEE
Mining association rules from databases with continuous attributes using genetic network programming
15 years 1 months ago
Most association rule mining algorithms make use of discretization algorithms for handling continuous attributes. Discretization is a process of transforming a continuous attribute...