Abstract: A system for training a learning machine accesses a training database of reference metadata that describes reference plans that include reference first-type plans and reference second-type plans. Such plans may be travel plans or other plans. The system trains the learning machine to distinguish candidate first-type plans from candidate second-type plans. The training of the learning machine is based on a set of decision trees generated from randomly selected subsets of the reference metadata, and the randomly selected subsets each describe a corresponding randomly selected portion of the reference plans. The system then modifies the trained learning machine based on asymmetrical penalties for incorrectly distinguishing candidate first-type plans from candidate second-type plans. The system then provides the modified learning machine for run-time use in classifying plans.

Abstract: A system for training a learning machine accesses a training database of reference metadata that describes reference plans that include reference first-type plans and reference second-type plans. Such plans may be travel plans or other plans. The system trains the learning machine to distinguish candidate first-type plans from candidate second-type plans. The training of the learning machine is based on a set of decision trees generated from randomly selected subsets of the reference metadata, and the randomly selected subsets each describe a corresponding randomly selected portion of the reference plans. The system then modifies the trained learning machine based on asymmetrical penalties for incorrectly distinguishing candidate first-type plans from candidate second-type plans. The system then provides the modified learning machine for run-time use in classifying plans.

Abstract: A system for training a learning machine accesses a training database of reference metadata that describes reference plans that include reference first-type plans and reference second-type plans. Such plans may be travel plans or other plans. The system trains the learning machine to distinguish candidate first-type plans from candidate second-type plans. The training of the learning machine is based on a set of decision trees generated from randomly selected subsets of the reference metadata, and the randomly selected subsets each describe a corresponding randomly selected portion of the reference plans. The system then modifies the trained learning machine based on asymmetrical penalties for incorrectly distinguishing candidate first-type plans from candidate second-type plans. The system then provides the modified learning machine for run-time use in classifying plans.

Abstract: An item sharing machine accesses requests to share the same shareable item. Such requests are submitted by requesters and specify numerical values accorded to the shareable item by the requesters. The item sharing machine determines a target extremum share, such as a target maximum share, that will be allocated to the requester that submitted an extremum value, such as the maximum value, for the shareable item. The item sharing machine determines a single common exponent based on each of the submitted values and based on the target extremum share. Having determined the common exponent, the item sharing machine exponentiates each submitted value to the common exponent and allocates shares of the shareable item to the corresponding requesters based on their corresponding exponentiated values.