Sciweavers

2018 search results - page 278 / 404
» Magnitude-preserving ranking algorithms
Sort
View
VLDB
2004
ACM
98views Database» more  VLDB 2004»
15 years 11 months ago
Top-k Query Evaluation with Probabilistic Guarantees
Top-k queries based on ranking elements of multidimensional datasets are a fundamental building block for many kinds of information discovery. The best known general-purpose algor...
Martin Theobald, Gerhard Weikum, Ralf Schenkel
SODA
2003
ACM
158views Algorithms» more  SODA 2003»
15 years 7 months ago
Comparing top k lists
Motivated by several applications, we introduce various distance measures between “top k lists.” Some of these distance measures are metrics, while others are not. For each of...
Ronald Fagin, Ravi Kumar, D. Sivakumar
CSDA
2006
84views more  CSDA 2006»
15 years 6 months ago
Three-mode partitioning
The three-mode partitioning model is a clustering model for three-way three-mode data sets that implies a simultaneous partitioning of all three modes involved in the data. In the...
Jan Schepers, Iven Van Mechelen, Eva Ceulemans
ISM
2008
IEEE
136views Multimedia» more  ISM 2008»
15 years 6 months ago
Applying Aggregation Concepts for Image Search
Through the influx of information content on the Internet, a number of image search methodologies have been presented and implemented to increase the accuracy of image retrieval i...
Brandeis Marshall, Dale-Marie Wilson
TKDE
2008
117views more  TKDE 2008»
15 years 6 months ago
Competitor Mining with the Web
This paper is concerned with the problem of mining competitors from the Web automatically. Nowadays, the fierce competition in the market necessitates every company to know not onl...
Shenghua Bao, Rui Li, Yong Yu, Yunbo Cao