74 search results - page 3 / 15 » The complexity of mining maximal frequent itemsets and maxim... |
ICDE
2001
IEEE
14 years 7 months ago
2001
IEEE
We present a new algorithm for mining maximal frequent itemsets from a transactional database. Our algorithm is especially efficient when the itemsets in the database are very lon...
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...
ICDM
2006
IEEE
14 years 2 days ago
2006
IEEE
In frequent geographic pattern mining a large amount of patterns is well known a priori. This paper presents a novel approach for mining frequent geographic patterns without assoc...
ACTA
2007
13 years 6 months ago
2007
Abstract Computing frequent itemsets is one of the most prominent problems in data mining. Recently, a new related problem, called FREQSAT, was introduced and studied: given some i...
DAWAK
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. Due to the dynamic nature of online information, XML documents typically evolve over time. The change of the data values or structures of an XML document may exhibit some...