Matches in ScholarlyData for { ?s ?p ?o. }
- model-characterization-curves-for-federated-search isPartOf proceedings.
- model-characterization-curves-for-federated-search title "Model Characterization Curves for Federated Search Using Click-Logs: Predicting User Engagement Metrics for the Span of Feasible Operating Points".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasItem item-4.
- authorList hasLastItem item-4.
- item-1 type ListItem.
- item-1 hasContent ashok-kumar-ponnuswami.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent kumaresh-pattabiraman.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent desmond-brand.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent tapas-kanungo.
- item-4 previous item-3.
- modeling-the-temporal-dynamics-of-social-rating-ne creator gholamreza-haffari.
- modeling-the-temporal-dynamics-of-social-rating-ne creator martin-ester.
- modeling-the-temporal-dynamics-of-social-rating-ne creator mohsen-jamali.
- modeling-the-temporal-dynamics-of-social-rating-ne type InProceedings.
- modeling-the-temporal-dynamics-of-social-rating-ne label "Modeling the Temporal Dynamics of Social Rating Networks Using Bidirectional Effects of Social Relations and Rating Patterns".
- modeling-the-temporal-dynamics-of-social-rating-ne sameAs modeling-the-temporal-dynamics-of-social-rating-ne.
- modeling-the-temporal-dynamics-of-social-rating-ne abstract "A social rating network (SRN) is a social network in which edges represent social relationships and users (nodes) express ratings on some of the given items. Such networks play an increasingly important role in reviewing websites such as Epinions.com or online sharing websites like Flickr.com. In this paper, we first observe and analyze the temporal behavior of users in a social rating network, who express ratings and create social relations. Then, we model the temporal dynamics of an SRN based on our observations, using the bidirectional effects of ratings and social relations. While existing models for other types of social networks have captured some of the effects, our model is the first one to represent all four effects, i.e. social relations-on-ratings (social influence), social relations-on-social relations (transitivity), ratings-on-social relations (selection), and ratings-on-ratings (correlational influence). Existing works consider these effects as static and constant throughout the evolution of an SRN, however our observations reveal that these effects are actually dynamic. We propose a probabilistic generative model for SRNs, which models the strength and dynamics of each effect throughout the network evolution. This model can serve for the prediction of future links, ratings or community structures. Due to the sensitive nature of SRNs, another motivation for our work is the generation of synthetic SRN data sets for research purposes. Our experimental studies on two real life datasets (Epinions and Flickr) demonstrate that the proposed model produces social rating networks that agree with real world data on a comprehensive set of evaluation criteria.".
- modeling-the-temporal-dynamics-of-social-rating-ne hasAuthorList authorList.
- modeling-the-temporal-dynamics-of-social-rating-ne hasTopic temporal-dynamics.
- modeling-the-temporal-dynamics-of-social-rating-ne hasTopic World_Wide_Web.
- modeling-the-temporal-dynamics-of-social-rating-ne isPartOf proceedings.
- modeling-the-temporal-dynamics-of-social-rating-ne title "Modeling the Temporal Dynamics of Social Rating Networks Using Bidirectional Effects of Social Relations and Rating Patterns".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasLastItem item-3.
- item-1 type ListItem.
- item-1 hasContent mohsen-jamali.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent gholamreza-haffari.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent martin-ester.
- item-3 previous item-2.
- network-bucket-testing creator jon-kleinberg.
- network-bucket-testing creator lars-backstrom.
- network-bucket-testing type InProceedings.
- network-bucket-testing label "Network Bucket Testing".
- network-bucket-testing sameAs network-bucket-testing.
- network-bucket-testing abstract "Bucket testing, also known as A/B testing, is a practice that is widely used by on-line sites with large audiences: in a simple version of the methodology, one evaluates a new feature on the site by exposing it to a very small fraction of the total user population and measuring its effect on this exposed group. For traditional uses of this technique, uniform independent sampling of the population is often enough to produce an exposed group that can serve as a statistical proxy for the full population. In on-line social network applications, however, one often wishes to perform a more complex test: evaluating a new social feature that will only produce an effect if a user and some number of his or her friends are exposed to it. In this case, independent uniform draws from the population will be unlikely to produce groups that contains users together with their friends, and so the construction of the sample must take the network structure into account. This leads quickly to challenging combinatorial problems, since there is an inherent tension between producing enough correlation to select users and their friends, but also enough uniformity and independence that the selected group is a reasonable sample of the full population. Here we develop an algorithmic framework for bucket testing in a network that addresses these challenges. First we describe a novel walk-based sampling method for producing samples of nodes that are internally well-connected but also approximately uniform over the population. Then we show how a collection of multiple independent subgraphs constructed this way can yield reasonable samples for testing. We demonstrate the effectiveness of our algorithms through computational experiments on large portions of the Facebook network.".
- network-bucket-testing hasAuthorList authorList.
- network-bucket-testing hasTopic social-network-algorithms.
- network-bucket-testing hasTopic World_Wide_Web.
- network-bucket-testing isPartOf proceedings.
- network-bucket-testing title "Network Bucket Testing".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasLastItem item-2.
- item-1 type ListItem.
- item-1 hasContent lars-backstrom.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent jon-kleinberg.
- item-2 previous item-1.
- on-the-informativeness-of-cascade-and-intent-aware creator azin-ashkan.
- on-the-informativeness-of-cascade-and-intent-aware creator charles-l-a-clarke.
- on-the-informativeness-of-cascade-and-intent-aware type InProceedings.
- on-the-informativeness-of-cascade-and-intent-aware label "On the Informativeness of Cascade and Intent-Aware Effectiveness Measures".
- on-the-informativeness-of-cascade-and-intent-aware sameAs on-the-informativeness-of-cascade-and-intent-aware.
- on-the-informativeness-of-cascade-and-intent-aware abstract "The Maximum Entropy Method provides one technique for validating search engine effectiveness measures. Under this method, the value of an effectiveness measure is used as a constraint to estimate the most likely distribution of relevant documents under a maximum entropy assumption. This inferred distribution may then be compared to the actual distribution to quantify the "informativeness" of the measure. The inferred distribution may also be used to estimate values for other effectiveness measures. Previous work focused on traditional effectiveness measures, such as average precision. In this paper, we extend the Maximum Entropy Method to the newer cascade and intent-aware effectiveness measures by considering the dependency of the documents ranked in a results list. These measures are intended to reflect the novelty and diversity of search results in addition to the traditional relevance. Our results indicate that intent-aware measures based on the cascade model are informative in terms of both inferring actual distribution and predicting the values of other retrieval measures.".
- on-the-informativeness-of-cascade-and-intent-aware hasAuthorList authorList.
- on-the-informativeness-of-cascade-and-intent-aware hasTopic evaluation.
- on-the-informativeness-of-cascade-and-intent-aware hasTopic World_Wide_Web.
- on-the-informativeness-of-cascade-and-intent-aware isPartOf proceedings.
- on-the-informativeness-of-cascade-and-intent-aware title "On the Informativeness of Cascade and Intent-Aware Effectiveness Measures".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasLastItem item-2.
- item-1 type ListItem.
- item-1 hasContent azin-ashkan.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent charles-l-a-clarke.
- item-2 previous item-1.
- online-spelling-correction-for-query-completion creator bo-june.
- online-spelling-correction-for-query-completion creator huizhong-duan.
- online-spelling-correction-for-query-completion type InProceedings.
- online-spelling-correction-for-query-completion label "Online Spelling Correction for Query Completion".
- online-spelling-correction-for-query-completion sameAs online-spelling-correction-for-query-completion.