Abstract: A system for displaying facets on a webpage includes a processor executing an algorithm for estimating a probability of a user selecting a particular facet and facet value for the search query, estimating a probability of the user selecting an item given the particular facet and facet value have been selected, filtering facets and facet values to remove duplicate and/or irrelevant facets and/or facet values, ranking facets and facet values such that mutual information between the item and facets and facet values is maximized, and establishing a dynamic expansion or a dynamic demotion for the plurality of facets and the plurality of facet values. A method and one or more non-transitory computer-readable storage media for displaying an optimal arrangement of facets and facet values for a search query on a webpage are also disclosed.

Abstract: A system, method and computer product for displaying product information is described herein. Facet values that may cause bad customer experience(s) are identified and suppressed. The system, method, and computer product may use a randomization scheme to suppress and/or show “bad” facet values occasionally to gather recent data on the facet values have improved. The suppression process works as a robust noise filter on top of the search and browse faceting experience.

Abstract: A system, method and computer product for displaying product information is described herein. The system, for example, includes a memory device, a price bracketing module, and a price display module. The search engine module receives a product search request and search results data from the memory device associated with the product search request. The search results data include a plurality of product records. Each of the product records includes a price assigned with the associated product and an access number associated with the product. The access number being related to a number of times the product has been accessed by customers. The price bracketing module receives establishes a dynamic search result price range and a dynamic price multiple as a function of the search results data. The price display module responsively establishes a selectable list of price ranges associated with the product search request.

Abstract: A system, method and computer product for displaying product information is described herein. Facet values that may cause bad customer experience(s) are identified and suppressed. The system, method, and computer product may use a randomization scheme to suppress and/or show “bad” facet values occasionally to gather recent data on the facet values have improved. The suppression process works as a robust noise filter on top of the search and browse faceting experience.

Abstract: A system for displaying product information to a customer is described herein. The system includes a processor that is programmed to receive search data in response to a product search request received from the customer and retrieve product records associated with the search data from a database. Each product record is associated with a corresponding product and includes a product description and a plurality of item attributes having corresponding attribute values. The processor selects a set of the item attributes and generates a product summary for each of the products as a function of the selected set of item attributes. Each product summary includes corresponding attribute values associated with the selected set of item attributes. The processor generates and displays product information associated with each of the products being included in the search data. The associated product information includes a corresponding product summary and a corresponding product description.

Abstract: A system for displaying facets on a webpage includes a processor executing an algorithm for estimating a probability of a user selecting a particular facet and facet value for the search query, estimating a probability of the user selecting an item given the particular facet and facet value have been selected, filtering facets and facet values to remove duplicate and/or irrelevant facets and/or facet values, ranking facets and facet values such that mutual information between the item and facets and facet values is maximized, and establishing a dynamic expansion or a dynamic demotion for the plurality of facets and the plurality of facet values. A method and one or more non-transitory computer-readable storage media for displaying an optimal arrangement of facets and facet values for a search query on a webpage are also disclosed.

Abstract: A system, method and computer product for displaying product information is described herein. The system, for example, includes a memory device, a price bracketing module, and a price display module. The search engine module receives a product search request and search results data from the memory device associated with the product search request. The search results data include a plurality of product records. Each of the product records includes a price assigned with the associated product and an access number associated with the product. The access number being related to a number of times the product has been accessed by customers. The price bracketing module receives establishes a dynamic search result price range and a dynamic price multiple as a function of the search results data. The price display module responsively establishes a selectable list of price ranges associated with the product search request.

Abstract: A system for displaying product information to a customer is described herein. The system includes a processor that is programmed to receive search data in response to a product search request received from the customer and retrieve product records associated with the search data from a database. Each product record is associated with a corresponding product and includes a product description and a plurality of item attributes having corresponding attribute values. The processor selects a set of the item attributes and generates a product summary for each of the products as a function of the selected set of item attributes. Each product summary includes corresponding attribute values associated with the selected set of item attributes. The processor generates and displays product information associated with each of the products being included in the search data. The associated product information includes a corresponding product summary and a corresponding product description.

Abstract: A probability of an observation sequence stored at a client is evaluated securely with respect to a hidden Markov model (HMM) stored at a server. The server determines, for each state of the HMM, an encryption of a log-probability of a current element of the observation sequence. Determines, for each state of the HMM, an encryption of a log-summation of a product of a likelihood of the observation sequence based on a previous element of the observation sequence and a transition probability to the state of the HMM. Determines an encryption of a log-likelihood of the observation sequence for each state as a product of the encryption of a log-summation and an encryption of a corresponding log-probability of the current element of the observation sequence; and determines an encryption of the log-probability of the observation sequence based on the log-likelihood of the observation sequence for each state.

Abstract: Embodiments of the invention disclose a system and a method for determining a differentially private aggregate classifier for a set of databases, wherein each database in the set of databases is associated with a classifier and a noise value, wherein the classifier and the noise value are determined locally for each database, such that a combination of the classifier and the noise value ensure a differential data privacy of the database, and wherein the differentially private aggregate classifier preserves the differential data privacy of each database. The differentially private aggregate classifier is a combination of the classifiers of the set of databases modified with the noise value corresponding to a smallest database in the set of databases.

Abstract: A probability of an observation sequence stored at a client is evaluated securely with respect to a hidden Markov model (HMM) stored at a server. The server determines, for each state of the HMM, an encryption of a log-probability of a current element of the observation sequence. Determines, for each state of the HMM, an encryption of a log-summation of a product of a likelihood of the observation sequence based on a previous element of the observation sequence and a transition probability to the state of the HMM. Determines an encryption of a log-likelihood of the observation sequence for each state as a product of the encryption of a log-summation and an encryption of a corresponding log-probability of the current element of the observation sequence; and determines an encryption of the log-probability of the observation sequence based on the log-likelihood of the observation sequence for each state.

Abstract: Embodiments of the invention disclose a system and a method for determining a differentially private aggregate classifier for a set of databases, wherein each database in the set of databases is associated with a classifier and a noise value, wherein the classifier and the noise value are determined locally for each database, such that a combination of the classifier and the noise value ensure a differential data privacy of the database, and wherein the differentially private aggregate classifier preserves the differential data privacy of each database. The differentially private aggregate classifier is a combination of the classifiers of the set of databases modified with the noise value corresponding to a smallest database in the set of databases.