Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
2,116
An Efficient Boosting Algorithm for Combining Preferences
, 1999
"... The problem of combining preferences arises in several applications, such as combining the results of different search engines. This work describes an efficient algorithm for combining multiple preferences. We first give a formal framework for the problem. We then describe and analyze a new boosting ..."
Abstract
-
Cited by 727 (18 self)
- Add to MetaCart
search strategies, each of which is a query expansion for a given domain. For this task, we compare the performance of RankBoost to the individual search strategies. The second experiment is a collaborative-filtering task for making movie recommendations. Here, we present results comparing Rank
Markov chain monte carlo convergence diagnostics
- JASA
, 1996
"... A critical issue for users of Markov Chain Monte Carlo (MCMC) methods in applications is how to determine when it is safe to stop sampling and use the samples to estimate characteristics of the distribution of interest. Research into methods of computing theoretical convergence bounds holds promise ..."
Abstract
-
Cited by 371 (6 self)
- Add to MetaCart
review of thirteen convergence diagnostics, describing the theoretical basis and practical implementation of each. We then compare their performance in two simple models and conclude that all the methods can fail to detect the sorts of convergence failure they were designed to identify. We thus recommend
Tuned models of peer assessment in MOOCs
, 2013
"... In massive open online courses (MOOCs), peer grading serves as a critical tool for scaling the grading of complex, open-ended assignments to courses with tens or hundreds of thou-sands of students. But despite promising initial trials, it does not always deliver accurate results compared to human ex ..."
Abstract
-
Cited by 25 (3 self)
- Add to MetaCart
In massive open online courses (MOOCs), peer grading serves as a critical tool for scaling the grading of complex, open-ended assignments to courses with tens or hundreds of thou-sands of students. But despite promising initial trials, it does not always deliver accurate results compared to human
Super-Peer-Based Routing and Clustering Strategies for RDF-Based Peer-to-Peer Networks
, 2002
"... RDF-based P2P networks have a number of advantages compared with simpler P2P networks such as Napster, Gnutella or with approaches based on distributed indices such as CAN and CHORD. RDF-based P2P networks allow complex and extendable descriptions of resources instead of fixed and limited ones, and ..."
Abstract
-
Cited by 139 (23 self)
- Add to MetaCart
RDF-based P2P networks have a number of advantages compared with simpler P2P networks such as Napster, Gnutella or with approaches based on distributed indices such as CAN and CHORD. RDF-based P2P networks allow complex and extendable descriptions of resources instead of fixed and limited ones
A Contextual-Bandit Approach to Personalized News Article Recommendation
"... Personalized web services strive to adapt their services (advertisements, news articles, etc.) to individual users by making use of both content and user information. Despite a few recent advances, this problem remains challenging for at least two reasons. First, web service is featured with dynamic ..."
Abstract
-
Cited by 178 (16 self)
- Add to MetaCart
with dynamically changing pools of content, rendering traditional collaborative filtering methods inapplicable. Second, the scale of most web services of practical interest calls for solutions that are both fast in learning and computation. In this work, we model personalized recommendation of news articles as a
Object Replication Strategies in Content Distribution Networks
- Computer Communications
, 2001
"... content distribution networks (CDNs). In this paper we study the problem of optimally replicating objects in CDN servers. In our model, each Internet Au- tonomous System (AS) is a node with finite storage ca- pacity for replicating objects. The optimization problem is to replicate objects so that wh ..."
Abstract
-
Cited by 178 (0 self)
- Add to MetaCart
that when clients fetch objects from the nearest CDN server with the requested object, the average number of ASs traversed is minimized. We formulate this problem as a combinatorial optimization problem. We show that this optimization problem is NP complete. We develop four natural heuristics and compare
Tag recommendations in folksonomies
- In PKDD
, 2007
"... Abstract. Collaborative tagging systems allow users to assign keywords—so called “tags”—to resources. Tags are used for navigation, finding resources and serendipitous browsing and thus provide an immediate benefit for users. These systems usually include tag recommendation mechanisms easing the pro ..."
Abstract
-
Cited by 123 (11 self)
- Add to MetaCart
the process of finding good tags for a resource, but also consolidating the tag vocabulary across users. In practice, however, only very basic recommendation strategies are applied. In this paper we evaluate and compare two recommendation algorithms on large-scale real life datasets: an adaptation of user
Peer Grading in a MOOC: Reliability, Validity, and Perceived Effects Peer Grading in a MOOC: Reliability, Validity, and Perceived Effects
"... Peer grading offers a scalable and sustainable way of providing assessment and feedback to a massive student population. However, currently there is little empirical evidence to support the credentials of peer grading as a learning assessment method in the MOOC context. To address this research need ..."
Abstract
- Add to MetaCart
of student graders can provide peer grading scores fairly consistent and highly similar to instructor grading scores. Student survey responses also indicate peer grading activities to be well received by a majority of MOOC students, who believe it was fair, useful, beneficial, and would recommend
Using the correct statistical test for the equality of regression coefficients. Criminology
, 1998
"... Criminologists are ofren interested in examining interactive effects within a regression context. For example, “holding other relevant fac-tors constant, is the effect of delinquent peers on one’s own delinquent conduct the same for males and females? ” or “is the effect of a given treatment program ..."
Abstract
-
Cited by 178 (4 self)
- Add to MetaCart
program comparable between first-time and repeat offend-ers? ” A frequent strategy in examining such interactive effects is to test for the difference between two regression coeficients across independ-ent samples. That is, does b, = b,? Traditionally, criminologists have employed a t or z test
Replication Strategies for Highly Available Peer-to-Peer Storage
, 2002
"... implement highly reliable peer-to-peer systems. In particular, we are comparing the use of whole object and blocking replication, and pursuing the use of erasure codes with blocking replication as a novel technique for achieving high reliability even for systems primarily composed of hosts with poor ..."
Abstract
-
Cited by 73 (4 self)
- Add to MetaCart
implement highly reliable peer-to-peer systems. In particular, we are comparing the use of whole object and blocking replication, and pursuing the use of erasure codes with blocking replication as a novel technique for achieving high reliability even for systems primarily composed of hosts
Results 1 - 10
of
2,116
