873 search results - page 29 / 175 » Reducing the Frequent Pattern Set |
ICDE
2006
IEEE
14 years 9 months ago
2006
IEEE
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
KDD
2006
ACM
14 years 8 months ago
2006
ACM
We study the mining of interesting patterns in the presence of numerical attributes. Instead of the usual discretization methods, we propose the use of rank based measures to scor...
VTS
2007
IEEE
14 years 2 months ago
2007
IEEE
When a test set size is larger than desired, some patterns must be dropped. This paper presents a systematic method to reduce test set size; the method reorders a test set using t...
ECIR
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. Many tasks (e.g., search and summarization) result in an ordered list of items. In order to evaluate such an ordered list of items, we need to compare it with an ideal or...
IDEAS
2006
IEEE
14 years 1 months ago
2006
IEEE
Sequential pattern mining is very important because it is the basis of many applications. Yet how to efficiently implement the mining is difficult due to the inherent characteri...