Sciweavers

467 search results - page 4 / 94
» Processing top k queries from samples
Sort
View
JCIT
2010
174views more  JCIT 2010»
13 years 24 days ago
Efficient Ming of Top-K Closed Sequences
Sequence mining is an important data mining task. In order to retrieve interesting sequences from a large database, a minimum support threshold is needed to be specified. Unfortun...
Panida Songram
EDBT
2008
ACM
169views Database» more  EDBT 2008»
14 years 6 months ago
Efficient online top-K retrieval with arbitrary similarity measures
The top-k retrieval problem requires finding k objects most similar to a given query object. Similarities between objects are most often computed as aggregated similarities of the...
Prasad M. Deshpande, Deepak P, Krishna Kummamuru
VLDB
2007
ACM
179views Database» more  VLDB 2007»
14 years 6 months ago
Mining Approximate Top-K Subspace Anomalies in Multi-Dimensional Time-Series Data
Market analysis is a representative data analysis process with many applications. In such an analysis, critical numerical measures, such as profit and sales, fluctuate over time a...
Xiaolei Li, Jiawei Han
WEBDB
2005
Springer
129views Database» more  WEBDB 2005»
13 years 11 months ago
Processing Top-N Queries in P2P-based Web Integration Systems with Probabilistic Guarantees
Efficient query processing in P2P-based Web integration systems poses a variety of challenges resulting from the strict decentralization and limited knowledge. As a special probl...
Katja Hose, Marcel Karnstedt, Kai-Uwe Sattler, Dan...
MDM
2005
Springer
118views Communications» more  MDM 2005»
13 years 11 months ago
kNR-tree: a novel R-tree-based index for facilitating spatial window queries on any k relations among N spatial relations in mob
The ever-increasing popularity of mobile applications coupled with the prevalence of spatial data has created the need for efficient processing of spatial queries in mobile enviro...
Anirban Mondal, Anthony K. H. Tung, Masaru Kitsure...