91 search results - page 6 / 19 » A quickstart in frequent structure mining can make a differe... |
CIKM
2008
Springer
14 years 11 months ago
2008
Springer
In the past, quite a few fast algorithms have been developed to mine frequent patterns over graph data, with the large spectrum covering many variants of the problem. However, the...
67
Voted
FIMI
2003
14 years 11 months ago
2003
The efficiency of frequent itemset mining algorithms is determined mainly by three factors: the way candidates are generated, the data structure that is used and the implementati...
107
click to vote
SP
2008
IEEE
14 years 9 months ago
2008
IEEE
Abstract. Understanding the functioning of a neural system in terms of its underlying circuitry is an important problem in neuroscience. Recent developments in electrophysiology an...
63
Voted
FIMI
2004
14 years 11 months ago
2004
Trie is a popular data structure in frequent itemset mining (FIM) algorithms. It is memory-efficient, and allows fast construction and information retrieval. Many trie-related tec...
ICDM
2006
IEEE
15 years 3 months ago
2006
IEEE
Due to their capability for expressing semantics and relationships among data objects, semi-structured documents have become a common way of representing domain knowledge. Compari...