4 search results - page 1 / 1 » An Efficient Polynomial Delay Algorithm for Pseudo Frequent ... |
DIS
2007
Springer
13 years 9 months ago
2007
Springer
KDD
2005
ACM
14 years 5 months ago
2005
ACM
Frequent-pattern mining has been studied extensively on scalable methods for mining various kinds of patterns including itemsets, sequences, and graphs. However, the bottleneck of...
DIS
2007
Springer
13 years 9 months ago
2007
Springer
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...
KDD
2008
ACM
14 years 5 months ago
2008
ACM
Transactional data are ubiquitous. Several methods, including frequent itemsets mining and co-clustering, have been proposed to analyze transactional databases. In this work, we p...