1728 search results - page 325 / 346 » Advanced empirical testing |
98
Voted
KDD
2004
ACM
16 years 2 months ago
2004
ACM
Most data mining algorithms require the setting of many input parameters. Two main dangers of working with parameter-laden algorithms are the following. First, incorrect settings ...
90
Voted
KDD
2003
ACM
16 years 2 months ago
2003
ACM
Distance function computation is a key subtask in many data mining algorithms and applications. The most effective form of the distance function can only be expressed in the conte...
106
Voted
KDD
2002
ACM
16 years 2 months ago
2002
ACM
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
109
click to vote
KDD
2001
ACM
16 years 2 months ago
2001
ACM
In this paper, we focus on mining surprising periodic patterns in a sequence of events. In many applications, e.g., computational biology, an infrequent pattern is still considere...
97
Voted
CHI
2008
ACM
16 years 2 months ago
2008
ACM
We present an empirical analysis of crossing-based dialog boxes. First, we study the spatial constraints required for efficient crossing-based interactions in the case of a simple...