101 search results - page 19 / 21 » Set-Oriented Indexes for Data Mining Queries |
189
click to vote
SIGMOD
2008
ACM
16 years 16 days ago
2008
ACM
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...
WSDM
2009
ACM
15 years 7 months ago
2009
ACM
There has been considerable past work on efficiently computing top k objects by aggregating information from multiple ranked lists of these objects. An important instance of this...
121
click to vote
HICSS
2002
IEEE
15 years 5 months ago
2002
IEEE
Abstract— Recent advances in graph-based search techniques derived from Kleinberg’s work [1] have been impressive. This paper further improves the graph-based search algorithm ...
108
click to vote
TKDE
2008
15 years 8 days ago
2008
Similarity-based search has been a key factor for many applications such as multimedia retrieval, data mining, Web search and retrieval, and so on. There are two important issues r...
128
Voted
PETRA
2009
ACM
15 years 6 months ago
2009
ACM
Event search is the problem of identifying events or activity of interest in a large database storing long sequences of activity. In this paper, our topic is the problem of identi...