42,729 research outputs found
Hierarchical Exploration for Accelerating Contextual Bandits
Contextual bandit learning is an increasingly popular approach to optimizing
recommender systems via user feedback, but can be slow to converge in practice
due to the need for exploring a large feature space. In this paper, we propose
a coarse-to-fine hierarchical approach for encoding prior knowledge that
drastically reduces the amount of exploration required. Intuitively, user
preferences can be reasonably embedded in a coarse low-dimensional feature
space that can be explored efficiently, requiring exploration in the
high-dimensional space only as necessary. We introduce a bandit algorithm that
explores within this coarse-to-fine spectrum, and prove performance guarantees
that depend on how well the coarse space captures the user's preferences. We
demonstrate substantial improvement over conventional bandit algorithms through
extensive simulation as well as a live user study in the setting of
personalized news recommendation.Comment: Appears in Proceedings of the 29th International Conference on
Machine Learning (ICML 2012
Enhancing Web-Based Configuration with Recommendations and Cluster-Based Help
In a collaborative project with Tacton AB, we have investigated new ways of assisting the user in the process of on-line product configuration. A web-based prototype, RIND, was built for ephemeral users in the domain of PC configuration
eBay users form stable groups of common interest
Market segmentation of an online auction site is studied by analyzing the
users' bidding behavior. The distribution of user activity is investigated and
a network of bidders connected by common interest in individual articles is
constructed. The network's cluster structure corresponds to the main user
groups according to common interest, exhibiting hierarchy and overlap. Key
feature of the analysis is its independence of any similarity measure between
the articles offered on eBay, as such a measure would only introduce bias in
the analysis. Results are compared to null models based on random networks and
clusters are validated and interpreted using the taxonomic classifications of
eBay categories. We find clear-cut and coherent interest profiles for the
bidders in each cluster. The interest profiles of bidder groups are compared to
the classification of articles actually bought by these users during the time
span 6-9 months after the initial grouping. The interest profiles discovered
remain stable, indicating typical interest profiles in society. Our results
show how network theory can be applied successfully to problems of market
segmentation and sociological milieu studies with sparse, high dimensional
data.Comment: Major revision of the manuscript. Methodological improvements and
inclusion of analysis of temporal development of user interests. 19 pages, 12
figures, 5 table
Organizing information on the next generation web - Design and implementation of a new bookmark structure
The next-generation Web will increase the need for a highly organized and ever evolving method to store references to Web objects. These requirements could be realized by the development of a new bookmark structure. This paper endeavors to identify the key requirements of such a bookmark, specifically in relation to Web documents, and sets out a suggested design through which these needs may be accomplished. A prototype developed offers such features as the sharing of bookmarks between users and groups of users. Bookmarks for Web documents in this prototype allow more specific information to be stored such as: URL, the document type, the document title, keywords, a summary, user annotations, date added, date last visited and date last modified. Individuals may access the service from anywhere on the Internet, as long as they have a Java-enabled Web browser
- …