1284 search results - page 171 / 257 » Data Structures for Mergeable Trees |
ICDM
2002
IEEE
15 years 3 months ago
2002
IEEE
Mining frequent patterns with an FP-tree avoids costly candidate generation and repeatedly occurrence frequency checking against the support threshold. It therefore achieves bette...
ICWE
2004
Springer
15 years 3 months ago
2004
Springer
Data mining includes four steps: data preparation, pattern mining, and pattern analysis and pattern application. But in web environment, the user activities become much more comple...
ICDM
2003
IEEE
15 years 3 months ago
2003
IEEE
We propose two algorithms for grouping and summarizing association rules. The first algorithm recursively groups rules according to the structure of the rules and generates a tre...
ANCS
2009
ACM
14 years 8 months ago
2009
ACM
In this paper we introduce the Range Trie, a new multiway tree data structure for address lookup. Each Range Trie node maps to an address range [Na, Nb) and performs multiple comp...
102
click to vote
KDD
2004
ACM
15 years 10 months ago
2004
ACM
One fundamental challenge for mining recurring subgraphs from semi-structured data sets is the overwhelming abundance of such patterns. In large graph databases, the total number ...