Matches in ScholarlyData for { ?s ?p ?o. }
- characterizing-search-intent-diversity-into-click- hasTopic World_Wide_Web.
- characterizing-search-intent-diversity-into-click- isPartOf proceedings.
- characterizing-search-intent-diversity-into-click- title "Characterizing Search Intent Diversity into Click Models".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasItem item-4.
- authorList hasItem item-5.
- authorList hasLastItem item-5.
- item-1 type ListItem.
- item-1 hasContent botao-hu.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent yuchen-zhang.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent weizhu-chen.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent gang-wang.
- item-4 next item-5.
- item-4 previous item-3.
- item-5 type ListItem.
- item-5 hasContent qiang-yang.
- item-5 previous item-4.
- choreography-conformance-via-synchronizability creator samik-basu.
- choreography-conformance-via-synchronizability creator tevfik-bultan.
- choreography-conformance-via-synchronizability type InProceedings.
- choreography-conformance-via-synchronizability label "Choreography Conformance via Synchronizability".
- choreography-conformance-via-synchronizability sameAs choreography-conformance-via-synchronizability.
- choreography-conformance-via-synchronizability abstract "Choreography analysis has been a crucial problem in service oriented computing. Interactions among services involve message exchanges across organizational boundaries in a distributed computing environment, and in order to build such systems in a reliable manner, it is necessary to develop techniques for analyzing such interactions. Choreography conformance involves verifying that a set of services behave according to a given choreography specification that characterizes their interactions. Unfortunately this is an undecidable problem when services interact with asynchronous communication. In this paper we present techniques that identify if the interaction behavior for a set of services remain the same when asynchronous communication is replaced with synchronous communication. This is called the synchronizability problem and determining the synchronizability of a set of services has been an open problem for several years. We solve this problem in this paper. Our results can be used to identify synchronizable services for which choreography conformance can be checked efficiently. Our results on synchronizability are applicable to any software infrastructure that supports message-based interactions.".
- choreography-conformance-via-synchronizability hasAuthorList authorList.
- choreography-conformance-via-synchronizability hasTopic web-applications.
- choreography-conformance-via-synchronizability hasTopic World_Wide_Web.
- choreography-conformance-via-synchronizability isPartOf proceedings.
- choreography-conformance-via-synchronizability title "Choreography Conformance via Synchronizability".
- 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 samik-basu.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent tevfik-bultan.
- item-2 previous item-1.
- consideration-set-generation-in-commerce-search creator kamesh-munagala.
- consideration-set-generation-in-commerce-search creator sayan-bhattacharya.
- consideration-set-generation-in-commerce-search creator sreenivas-gollapudi.
- consideration-set-generation-in-commerce-search type InProceedings.
- consideration-set-generation-in-commerce-search label "Consideration Set Generation in Commerce Search".
- consideration-set-generation-in-commerce-search sameAs consideration-set-generation-in-commerce-search.
- consideration-set-generation-in-commerce-search abstract "In commerce search, the set of products returned by a search engine often forms the basis for all user interactions leading up to a potential transaction on the web. Such a set of products is known as the consideration set. In this study, we consider the problem of generating consideration set of products in commerce search so as to maximize user satisfaction. One of the key features of commerce search that we exploit in our study is the association of a set of important attributes with the products and a set of specified attributes with the user queries. Those important attributes not used in the query are treated as unspecified. The attribute space admits a natural definition of user satisfaction via user preferences on the attributes and their values, viz. require that the surfaced products be close to the specified attribute values in the query, and diverse with respect to the unspecified attributes. We model this as a general Max-Sum Dispersion problem wherein we are given a set of n nodes in a metric space and the objective is to select a subset of nodes with total cost at most a given budget, and maximize the sum of the pairwise distances between the selected nodes. In our setting, each node denotes a product, the cost of a node being inversely proportional to its relevance with respect to specified attributes. The distance between two nodes quantifies the diversity with respect to the unspecified attributes. The problem is NP-hard and a 2-approximation was previously known only when all the nodes have unit cost. In our setting, we do not make any assumptions on the cost. We label this problem as the General Max-Sum Dispersion problem. We give the first constant factor approximation algorithm for this problem, achieving an approximation ratio of 2. Further, we perform extensive empirical analysis on real-world data to show the effectiveness of our algorithm.".
- consideration-set-generation-in-commerce-search hasAuthorList authorList.
- consideration-set-generation-in-commerce-search hasTopic e-commerce.
- consideration-set-generation-in-commerce-search hasTopic World_Wide_Web.
- consideration-set-generation-in-commerce-search isPartOf proceedings.
- consideration-set-generation-in-commerce-search title "Consideration Set Generation in Commerce Search".
- 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 sayan-bhattacharya.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent sreenivas-gollapudi.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent kamesh-munagala.
- item-3 previous item-2.
- context-sensitive-query-auto-completion creator naama-kraus.
- context-sensitive-query-auto-completion creator ziv-bar-yossef.
- context-sensitive-query-auto-completion type InProceedings.
- context-sensitive-query-auto-completion label "Context-Sensitive Query Auto-Completion".
- context-sensitive-query-auto-completion sameAs context-sensitive-query-auto-completion.
- context-sensitive-query-auto-completion abstract "Query auto completion is known to provide poor predictions of the user's query when her input prefix is very short (e.g., one or two characters). In this paper we show that context, such as the user's recent queries, can be used to improve the prediction quality considerably even for such short prefixes. We propose a context-sensitive query auto completion algorithm, NearestCompletion, which outputs the completions of the user's input that are most similar to the context queries. To measure similarity, we represent queries and contexts as high-dimensional term-weighted vectors and resort to cosine similarity. The mapping from queries to vectors is done through a new query expansion technique that we introduce, which expands a query by traversing the query recommendation tree rooted at the query. In order to evaluate our approach, we performed extensive experimentation over the public AOL query log. We demonstrate that when the recent user's queries are relevant to the current query she is typing, then after typing a single character, NearestCompletion's MRR is 48% higher relative to the MRR of the standard MostPopularCompletion algorithm on average. When the context is irrelevant, however, NearestCompletion's MRR is essentially zero. To mitigate this problem, we propose HybridCompletion, which is a hybrid of NearestCompletion with MostPopularCompletion. HybridCompletion is shown to dominate both NearestCompletion and MostPopularCompletion, achieving a total improvement of 31.5% in MRR relative to MostPopularCompletion on average.".
- context-sensitive-query-auto-completion hasAuthorList authorList.
- context-sensitive-query-auto-completion hasTopic query-analysis.
- context-sensitive-query-auto-completion hasTopic World_Wide_Web.
- context-sensitive-query-auto-completion isPartOf proceedings.
- context-sensitive-query-auto-completion title "Context-Sensitive Query Auto-Completion".
- 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 ziv-bar-yossef.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent naama-kraus.