140 search results - page 2 / 28 » Discovery of Frequent DATALOG Patterns |
ICDM
2007
IEEE
13 years 9 months ago
2007
IEEE
We propose an efficient algorithm for mining frequent approximate sequential patterns under the Hamming distance model. Our algorithm gains its efficiency by adopting a "brea...
CIKM
2005
Springer
13 years 11 months ago
2005
Springer
We explore in this paper a practicably interesting mining task to retrieve frequent itemsets with memory constraint. As opposed to most previous works that concentrate on improvin...
ICDE
2005
IEEE
14 years 6 months ago
2005
IEEE
Benchmarking technical solutions is as important as the solutions themselves. Yet many fields still lack any type of rigorous evaluation. Performance benchmarking has always been ...
ICDM
2009
IEEE
13 years 3 months ago
2009
IEEE
In this paper, we focus on a single graph whose vertices contain a set of quantitative attributes. Several networks can be naturally represented in this complex graph. An example i...
CSE
2009
IEEE
14 years 7 days ago
2009
IEEE