322 search results - page 35 / 65 » Mining Frequent Tree-Like Patterns in Large Datasets |
KDD
1999
ACM
14 years 1 months ago
1999
ACM
We introduce a new kind of patterns, called emerging patterns (EPs), for knowledge discovery from databases. EPs are defined as itemsets whose supports increase significantly from...
CIKM
2008
Springer
13 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...
PKDD
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Most real-world datasets are, to a certain degree, skewed. When considered that they are also large, they become the pinnacle challenge in data analysis. More importantly...
SAC
2004
ACM
14 years 2 months ago
2004
ACM
Most of the complexity of common data mining tasks is due to the unknown amount of information contained in the data being mined. The more patterns and correlations are contained ...
FIMI
2004
13 years 10 months ago
2004
In this paper, we present an ongoing work to discover maximal frequent itemsets in a transactional database. We propose an algorithm called ABS for Adaptive Borders Search, which ...