Institution
Amazon.com
Company•Seattle, Washington, United States•
About: Amazon.com is a company organization based out in Seattle, Washington, United States. It is known for research contribution in the topics: Computer science & Service (business). The organization has 13363 authors who have published 17317 publications receiving 266589 citations.
Topics: Computer science, Service (business), Service provider, Context (language use), Virtual machine
Papers published on a yearly basis
Papers
More filters
•
22 May 2007TL;DR: In this paper, a probabilistic scoring method is used to increase the likelihood that at least some of the items recommended over a sequence of visits will be useful to the target user.
Abstract: A recommendations system (100) uses probabilistic methods to select, from a candidate set of items, a set of items to recommend to a target user. Some embodiments of the methods effectively introduce noise into the recommendations process, causing the recommendations presented to the target user to vary in a controlled manner from one visit to the next. The methods may increase the likelihood that at least some of the items recommended over a sequence of visits will be useful to the target user The methods may be implemented by using a probabilistic scorer (110) to probabilistically vary the rankings of candidate items selected by a recommendation engine (106). and by using a filter (114) to filter the probabilistically varied item set.
96 citations
••
01 Mar 2005TL;DR: This work addresses evaluation algorithms, comparing the applicability of various algorithms to the temporal join operators and describing a performance study involving algorithms for one important operator, the temporal equijoin.
Abstract: Joins are arguably the most important relational operators. Poor implementations are tantamount to computing the Cartesian product of the input relations. In a temporal database, the problem is more acute for two reasons. First, conventional techniques are designed for the evaluation of joins with equality predicates rather than the inequality predicates prevalent in valid-time queries. Second, the presence of temporally varying data dramatically increases the size of a database. These factors indicate that specialized techniques are needed to efficiently evaluate temporal joins.We address this need for efficient join evaluation in temporal databases. Our purpose is twofold. We first survey all previously proposed temporal join operators. While many temporal join operators have been defined in previous work, this work has been done largely in isolation from competing proposals, with little, if any, comparison of the various operators. We then address evaluation algorithms, comparing the applicability of various algorithms to the temporal join operators and describing a performance study involving algorithms for one important operator, the temporal equijoin. Our focus, with respect to implementation, is on non-index-based join algorithms. Such algorithms do not rely on auxiliary access paths but may exploit sort orderings to achieve efficiency.
96 citations
•
30 Mar 2007TL;DR: In this paper, computer-implemented processes for clustering items and improving the utility of item recommendations are disclosed. But, they do not describe how to apply these techniques to the real world.
Abstract: Computer-implemented processes are disclosed for clustering items and improving the utility of item recommendations. One process involves applying a clustering algorithm to a user's collection of items. Information about the resulting clusters is then used to select items to use as recommendation sources. Another process involves displaying the clusters of items to the user via a collection management interface that enables the user to attach cluster-level metadata, such as by rating or tagging entire clusters of items. The resulting metadata may be used to improve the recommendations generated by a recommendation engine. Another process involves forming clusters of items in which a user has indicated a lack of interest, and using these clusters to filter the output of a recommendation engine. Yet another process involves applying a clustering algorithm to the output of a recommendation engine to arrange the recommended items into cluster-based categories for presentation to the user.
96 citations
•
11 Dec 2008TL;DR: In this paper, techniques for delivering digital content to be rendered on electronic book (eBook) reader devices have been described, which provide for ways to efficiently and effectively deliver content to various types of reader devices, and to control presentation of that content on individual devices.
Abstract: Techniques for delivering digital content to be rendered on electronic book (“eBook”) reader devices are described. The eBook reader devices have different technical features, particularly in terms of display capabilities and navigational capabilities. For instance, eBook reader devices may have differing screen sizes, use different types of display technologies, and have varying browser functionality. The techniques described in this disclosure provide for ways to efficiently and effectively deliver content to various types of reader devices, and to control presentation of that content on individual devices.
96 citations
•
TL;DR: This paper collects the first three releases of the MOTChallenge and provides a categorization of state-of-the-art trackers and a broad error analysis, to help newcomers understand the related work and research trends in the MOT community, and hopefully shed some light into potential future research directions.
Abstract: Standardized benchmarks have been crucial in pushing the performance of computer vision algorithms, especially since the advent of deep learning. Although leaderboards should not be over-claimed, they often provide the most objective measure of performance and are therefore important guides for research. We present MOTChallenge, a benchmark for single-camera Multiple Object Tracking (MOT) launched in late 2014, to collect existing and new data, and create a framework for the standardized evaluation of multiple object tracking methods. The benchmark is focused on multiple people tracking, since pedestrians are by far the most studied object in the tracking community, with applications ranging from robot navigation to self-driving cars. This paper collects the first three releases of the benchmark: (i) MOT15, along with numerous state-of-the-art results that were submitted in the last years, (ii) MOT16, which contains new challenging videos, and (iii) MOT17, that extends MOT16 sequences with more precise labels and evaluates tracking performance on three different object detectors. The second and third release not only offers a significant increase in the number of labeled boxes but also provide labels for multiple object classes beside pedestrians, as well as the level of visibility for every single object of interest. We finally provide a categorization of state-of-the-art trackers and a broad error analysis. This will help newcomers understand the related work and research trends in the MOT community, and hopefully shed some light on potential future research directions.
96 citations
Authors
Showing all 13498 results
Name | H-index | Papers | Citations |
---|---|---|---|
Jiawei Han | 168 | 1233 | 143427 |
Bernhard Schölkopf | 148 | 1092 | 149492 |
Christos Faloutsos | 127 | 789 | 77746 |
Alexander J. Smola | 122 | 434 | 110222 |
Rama Chellappa | 120 | 1031 | 62865 |
William F. Laurance | 118 | 470 | 56464 |
Andrew McCallum | 113 | 472 | 78240 |
Michael J. Black | 112 | 429 | 51810 |
David Heckerman | 109 | 483 | 62668 |
Larry S. Davis | 107 | 693 | 49714 |
Chris M. Wood | 102 | 795 | 43076 |
Pietro Perona | 102 | 414 | 94870 |
Guido W. Imbens | 97 | 352 | 64430 |
W. Bruce Croft | 97 | 426 | 39918 |
Chunhua Shen | 93 | 681 | 37468 |