252 search results - page 12 / 51 » Mining Frequent Patterns without Candidate Generation |
JDWM
2010
13 years 6 months ago
2010
The Web is a continuously evolving environment, since its content is updated on a regular basis. As a result, the traditional usagebased approach to generate recommendations that ...
JISE
2008
13 years 7 months ago
2008
Mining frequent patterns in databases is a fundamental and essential problem in data mining research. A continuity is a kind of causal relationship which describes a definite temp...
CIKM
2006
Springer
13 years 11 months ago
2006
Springer
Recent research in data mining has progressed from mining frequent itemsets to more general and structured patterns like trees and graphs. In this paper, we address the problem of...
PKDD
2004
Springer
14 years 1 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...
TKDE
2008
13 years 7 months ago
2008
We study a new data mining problem concerning the discovery of frequent agreement subtrees (FASTs) from a set of phylogenetic trees. A phylogenetic tree, or phylogeny, is an unorde...