14 search results - page 3 / 3 » Mining Top-K Frequent Closed Patterns without Minimum Suppor... |
ICDE
2008
IEEE
14 years 6 months ago
2008
IEEE
The application of frequent patterns in classification has demonstrated its power in recent studies. It often adopts a two-step approach: frequent pattern (or classification rule) ...
KDD
2010
ACM
13 years 9 months ago
2010
ACM
Classification is one of the most essential tasks in data mining. Unlike other methods, associative classification tries to find all the frequent patterns existing in the input...
EDBT
2009
ACM
14 years 8 days ago
2009
ACM
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...
PKDD
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. For a book, the title and abstract provide a good first impression of what to expect from it. For a database, getting a first impression is not so straightforward. Whil...