Abstract:
Contact recommendations based on purchase history are described. A system creates a directed graph of nodes in which at least some of the nodes are connected by directed arcs, wherein a directed arc from a first node to a second node represents a conditional probability that previous users who purchased a first contact also purchased a second contact. The system identifies a set of contacts purchased by a current user. The system estimates a prospective purchase probability based on a historical probability that previous users purchased a specific contact and a related probability that previous users who purchased the specific contact also purchased a contact in the set of contacts, for each candidate contact. The system outputs a recommendation for the current user to purchase a recommended candidate contact based on a corresponding prospective purchase probability.
Abstract:
Some embodiments of the present invention include determining if updates performed by a second user include a systematic change such as a reversal of an update previously performed by a first user within a time window. The reversal is associated with a record of data used by a gamification application executing in a computer system. A time delay is introduced between the update performed by the second user and rewarding the second user if the update performed by the second user includes the reversal within the time window. An update history of the first user and the second user is evaluated to identify pattern of reversals associated with similar records within the time window. The second user is prevented from being rewarded based on identifying that there are patterns of reversals from the update history occurring within the time window.
Abstract:
A method of managing crowdsourced data includes storing contact information regarding a plurality of contacts within a community-updateable repository accessible by a plurality of users, receiving a plurality of discrepancy reports associated with a selected contact of the plurality of contacts, extracting fact data regarding the selected contact from the plurality of discrepancy reports, determining an action to be taken based on the fact data and a fact model applied to the fact data, and performing the action to modify the community-updateable repository.
Abstract:
A system receives a character sequence entered in a search box, identifies a first item that includes the character sequence and a second item that includes the character sequence, identifies a first item set that includes the first item and a second item set that includes the second item; and outputs the first item set and the second item set to a location associated with the search box. The system receives a selection of a third item from the first item set, identifies a third item set that includes the third item and a fourth item set that includes the third item, and outputs the third item set and the fourth item set to the location associated with the search box. The system receives a selection of any item set from the location associated with the search box, and executes a search based on the selected item set.
Abstract:
Contact recommendations based on purchase history are described. A system creates a directed graph of nodes in which at least some of the nodes are connected by directed arcs, wherein a directed arc from a first node to a second node represents a conditional probability that previous users who purchased a first contact also purchased a second contact. The system identifies a set of contacts purchased by a current user. The system estimates a prospective purchase probability based on a historical probability that previous users purchased a specific contact and a related probability that previous users who purchased the specific contact also purchased a contact in the set of contacts, for each candidate contact. The system outputs a recommendation for the current user to purchase a recommended candidate contact based on a corresponding prospective purchase probability.
Abstract:
The technology disclosed describes systems and methods for generating feature vectors from resource description framework (RDF) graphs. Machine learning tasks frequently operate on vectors of features. Available systems for parsing multiple documents often generate RDF graphs. Once a set of interesting features to be considered has been established, the disclosed technology describes systems and methods for generating feature vectors from the RDF graphs for the documents. In one example setting, a machine learning system can use generated feature vectors to determine how interesting a news article might be, or to learn information-of-interest about a specific subject reported in multiple articles. In another example setting, viable interview candidates for a particular job opening can be identified using feature vectors generated from a resume database, using the disclosed systems and methods for generating feature vectors from RDF graphs.
Abstract:
A combined directed graph is created having a corresponding node for each node in a first directed graph lacking a corresponding node in a second directed graph, each node in the second graph lacking a corresponding node in the first graph, and each node in the first graph having a corresponding node in the second graph. A corresponding directed arc is created in the combined directed graph for each arc in the first graph lacking a corresponding arc in the second directed graph, each arc in the second graph lacking a corresponding arc in the first graph, and each arc in the first graph having a corresponding arc in the second graph. A recommendation is output for a user to interact with a recommended object based on an object interaction and a conditional probability, in the combined graph, which corresponds to the recommended object and the object interaction.
Abstract:
User scores based on bulk record updates is described. A system receives record updates submitted by a user. The system subtracts a penalty debit from a user score, which corresponds to the user, for each record which corresponds to at least one of the record updates and which is removed from purchasing availability. The system adds a full credit to the user score for each record which corresponds to at least one of the record updates and which is purchased. The system adds a partial credit to the user score for each record which corresponds to at least one of the record updates and which is yet to be purchased and which is yet to be removed from purchasing availability, wherein the partial credit is a positive value that is less than the full credit. The system enables the user to access records, based on the user score.
Abstract:
An error checking technique for database records. A record is selected and its entities are compared with the entities of other records stored in the database to determine a likelihood that the labels associated with the entities of the selected record are correct. The likelihood for each entity of the selected record being correctly labeled can be determined by comparing the number of times that the entity appears in the database records with that label to the number of times that the entity appears in the database records with any other label. If the likelihood does not exceed a threshold, then an error is likely, and action can be taken to correct the record.
Abstract:
The technology described uses a Naïve Bayes Classifier with Active-Feature Ordering to identify contributors to a contact database who are likely to be able to update an arbitrary contact. The technology disclosed further relates to identifying the n most likely records with a number of features, with each feature having a specific finite number of different possible values. The disclosed technology also describes using a Naïve Bayes Classifier with Active-Feature Ordering for diagnostic screening, to evaluate a patient's symptoms against a compendium of diseases to choose the diseases with the greatest posterior likelihood given the vector of observed symptoms of the patient. The disclosed technology additionally describes using a Naïve Bayes Classifier with Active-Feature Ordering for crowd sourcing tasks, using a sample data set that includes thousands of workers, to identify a worker, who is experienced, to complete a featured task.