322 search results - page 5 / 65 » Mining Frequent Tree-Like Patterns in Large Datasets |
KDD
2012
ACM
11 years 10 months ago
2012
ACM
We tackle the challenging problem of mining the simplest Boolean patterns from categorical datasets. Instead of complete enumeration, which is typically infeasible for this class ...
KDD
2005
ACM
14 years 8 months ago
2005
ACM
The problem of finding frequent patterns from graph-based datasets is an important one that finds applications in drug discovery, protein structure analysis, XML querying, and soc...
IDA
2011
Springer
13 years 2 months ago
2011
Springer
The amount of data produced by ubiquitous computing applications is quickly growing, due to the pervasive presence of small devices endowed with sensing, computing and communicatio...
ICDE
2008
IEEE
14 years 9 months ago
2008
IEEE
Mining frequent itemsets from data streams has proved to be very difficult because of computational complexity and the need for real-time response. In this paper, we introduce a no...
ICDM
2002
IEEE
14 years 18 days ago
2002
IEEE
In this paper, we propose a new framework for mining frequent patterns from large transactional databases. The core of the framework is of a novel coded prefix-path tree with two...