Today Internet systems commonly use a total ranking to present search results. These rankings are typically cut off at arbitrary points which are hard to understand. In this paper we present a new approach for rankings based on partial orders, which model personal preferences. It naturally groups large result sets according to the quality of results and presents only the top ones. It is possible for the user to expand these result sets selectively along chains of the partial order. We expect a considerable gain in comprehensibility, clarity and user friendliness. A pilot application is being implemented and first encouraging evaluation results are reported
Web search has become a part of everyday life for hundreds of millions of users around the world. Ho...
Web searching is one of the most frequent activities among the Internet community, but perhaps the m...
Abstract. This paper examines in detail an alternative ranking prob-lem for search engines, movie re...
Today Internet systems commonly use a total ranking to present search results. These rankings are ty...
There are many applications in which it is desirable to order rather than classify instances. Here w...
We introduce personalized PageRank vectors to improve PageRank ranking method. We include the user p...
We developed an algorithm for generating total orders from partial orders based on a variant of Quic...
This paper is to investigate rank aggregation based on multiple user-centered measures in the contex...
Abstract. We introduce a tool which is an application of personalized pagerank vectors such as perso...
In this thesis, the author designed three sets of preference based ranking algorithms for informatio...
Recent web search techniques augment traditional text matching with a global notion of “importance” ...
Rankings or ratings are popular methods for structuring large information sets in search engines, e-...
This paper studies how to enable an effective ranked retrieval over data with categorical attributes...
As data of an unprecedented scale are becoming accessible on the Web, personalization, of narrowing ...
In this article, we present a new approach to page ranking. The page rank of a collection of Web pag...
Web search has become a part of everyday life for hundreds of millions of users around the world. Ho...
Web searching is one of the most frequent activities among the Internet community, but perhaps the m...
Abstract. This paper examines in detail an alternative ranking prob-lem for search engines, movie re...
Today Internet systems commonly use a total ranking to present search results. These rankings are ty...
There are many applications in which it is desirable to order rather than classify instances. Here w...
We introduce personalized PageRank vectors to improve PageRank ranking method. We include the user p...
We developed an algorithm for generating total orders from partial orders based on a variant of Quic...
This paper is to investigate rank aggregation based on multiple user-centered measures in the contex...
Abstract. We introduce a tool which is an application of personalized pagerank vectors such as perso...
In this thesis, the author designed three sets of preference based ranking algorithms for informatio...
Recent web search techniques augment traditional text matching with a global notion of “importance” ...
Rankings or ratings are popular methods for structuring large information sets in search engines, e-...
This paper studies how to enable an effective ranked retrieval over data with categorical attributes...
As data of an unprecedented scale are becoming accessible on the Web, personalization, of narrowing ...
In this article, we present a new approach to page ranking. The page rank of a collection of Web pag...
Web search has become a part of everyday life for hundreds of millions of users around the world. Ho...
Web searching is one of the most frequent activities among the Internet community, but perhaps the m...
Abstract. This paper examines in detail an alternative ranking prob-lem for search engines, movie re...