2635 search results - page 369 / 527 » Algorithms for the Database Layout Problem |
141
click to vote
KDD
2006
ACM
16 years 5 months ago
2006
ACM
In this paper, we study the problem of discovering interesting patterns through user's interactive feedback. We assume a set of candidate patterns (i.e., frequent patterns) h...
146
click to vote
KDD
2005
ACM
16 years 5 months ago
2005
ACM
One fundamental task in near-neighbor search as well as other similarity matching efforts is to find a distance function that can efficiently quantify the similarity between two o...
132
click to vote
KDD
2004
ACM
16 years 5 months ago
2004
ACM
Detection of near duplicate documents is an important problem in many data mining and information filtering applications. When faced with massive quantities of data, traditional d...
142
Voted
KDD
2004
ACM
16 years 5 months ago
2004
ACM
In many applications that track and analyze spatiotemporal data, movements obey periodic patterns; the objects follow the same routes (approximately) over regular time intervals. ...
135
Voted
KDD
2004
ACM
16 years 5 months ago
2004
ACM
For the discovery of similar patterns in 1D time-series, it is very typical to perform a normalization of the data (for example a transformation so that the data follow a zero mea...