4085 search results - page 198 / 817 » Benchmarking Data Mining Algorithms |
131
Voted
ICDM
2002
IEEE
15 years 8 months ago
2002
IEEE
In this paper, we propose a new mining task: mining top-k frequent closed patterns of length no less than min , where k is the desired number of frequent closed patterns to be min...
116
Voted
ICDM
2008
IEEE
15 years 10 months ago
2008
IEEE
Social interactions that occur regularly typically correspond to significant yet often infrequent and hard to detect interaction patterns. To identify such regular behavior, we p...
176
Voted
SDM
2012
SIAM
13 years 6 months ago
2012
SIAM
One practical inconvenience in frequent pattern mining is that it often yields a flood of common or uninformative patterns, and thus we should carefully adjust the minimum suppor...
138
Voted
KDD
2004
ACM
16 years 3 months ago
2004
ACM
Pattern ordering is an important task in data mining because the number of patterns extracted by standard data mining algorithms often exceeds our capacity to manually analyze the...
134
Voted
VLDB
1999
ACM
15 years 7 months ago
1999
ACM
Discovering sequential patterns is an important problem in data mining with a host of application domains including medicine, telecommunications, and the World Wide Web. Conventio...