732 search results - page 76 / 147 » Efficient Frequent Pattern Mining in Relational Databases |
KDD
2006
ACM
14 years 8 months ago
2006
ACM
Online stores providing subscription services need to extend user subscription periods as long as possible to increase their profits. Conventional recommendation methods recommend...
ICDE
2010
IEEE
14 years 7 months ago
2010
IEEE
Abstract-- Field-programmable gate arrays (FPGAs) can provide performance advantages with a lower resource consumption (e.g., energy) than conventional CPUs. In this paper, we show...
ICDM
2002
IEEE
14 years 22 days ago
2002
IEEE
Mining frequent patterns with an FP-tree avoids costly candidate generation and repeatedly occurrence frequency checking against the support threshold. It therefore achieves bette...
KDD
2007
ACM
14 years 8 months ago
2007
ACM
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
SIGMOD
2008
ACM
14 years 8 months ago
2008
ACM
With ever-increasing amounts of graph data from disparate sources, there has been a strong need for exploiting significant graph patterns with user-specified objective functions. ...