322 search results - page 26 / 65 » Mining Frequent Tree-Like Patterns in Large Datasets |
IEAAIE
2009
Springer
14 years 2 months ago
2009
Springer
Data mining refers to the process of revealing unknown and potentially useful information from a large database. Frequent itemsets mining is one of the foundational problems in dat...
DIS
2004
Springer
13 years 11 months ago
2004
Springer
: The class of closed patterns is a well known condensed representations of frequent patterns, and have recently attracted considerable interest. In this paper, we propose an effic...
KDD
2004
ACM
14 years 8 months ago
2004
ACM
Many real life sequence databases, such as customer shopping sequences, medical treatment sequences, etc., grow incrementally. It is undesirable to mine sequential patterns from s...
IDEAL
2004
Springer
14 years 1 months ago
2004
Springer
AURA (Advanced Uncertain Reasoning Architecture) is a parallel pattern matching technology intended for high-speed approximate search and match operations on large unstructured dat...
ICTAI
2003
IEEE
14 years 1 months ago
2003
IEEE
In this paper, we propose a parallel algorithm for mining maximal frequent itemsets from databases. A frequent itemset is maximal if none of its supersets is frequent. The new par...