Abstract:
A hierarchical latent structure setting unit 81 sets a hierarchical latent structure that is a structure in which latent variables are represented by a tree structure and components representing probability models are located at nodes of a lowest level of the tree structure. A variational probability computation unit 82 computes a variational probability of a path latent variable that is a latent variable included in a path linking a root node to a target node in the hierarchical latent structure. A component optimization unit 83 optimizes each of the components for the computed variational probability. A gating function optimization unit 84 optimizes a gating function model that is a model for determining a branch direction according to the multivariate data in a node of the hierarchical latent structure, based on the variational probability of the latent variable in the node.
Abstract:
An optimality degree computation unit computes an optimality degree in the case where a first variable included in a variable set is a candidate for an addition variable, using an objective function. An addition threshold computation unit computes an addition threshold based on the computed optimality degree, the addition threshold being a threshold of the optimality degree and indicating a criterion for determining whether or not the first variable is to be set as the candidate for the addition variable. An objective function value computation unit computes an objective function value which is a difference between a value of the objective function computed using variables to be optimized and a value of the objective function computed using the variables to be optimized from which a second variable included in a nonzero variable set is excluded.
Abstract:
A negotiation candidate generation unit 82 generates a negotiation candidate of a receiving side for an assumed order from an ordering side and makes store the negotiation candidate in a negotiation candidate storage unit 81. A negotiation condition receiving unit 83 receives negotiation conditions from the ordering side. A negotiation candidate sending unit 84 sends a corresponding negotiation candidate stored in the negotiation candidate storage unit 81 to the ordering side in response to the received negotiation conditions. The negotiation candidate generation unit 82 includes a planning unit 85 which plans an order plan for execution conditions according to the assumed order from the ordering side, a utility calculation unit 86 which calculates a utility based on the order plan, and a negotiation candidate registration unit 87 which registers the execution conditions, which are a premise of the order plan, as the negotiation candidate in the negotiation candidate storage unit 81, corresponding to the utility calculated based on the order plan. The negotiation candidate sending unit 84 sends the negotiation candidate with the highest utility to the ordering side in priority.
Abstract:
The target setting unit 7 sets a target state of the self-driving vehicle 10. The planned route creating unit 3 creates a planned route of the self-driving vehicle 10 for realizing the target state. The transmission unit 6 transmits the planned route to another vehicle. The response receiving unit 9 receives, from another vehicle, a notification indicating agreement with the planned route or disagreement with the planned route as a response to the planned route. The traveling control unit 8 controls the self-driving vehicle 10 so as to cause the self-driving vehicle 10 to travel along the planned route when the response receiving unit 9 has received the notification indicating agreement with the planned route.
Abstract:
An information processing system for learning new probabilistic rules even if only one training sample is given. A learning system (100) includes a KB (knowledge base) storage (110), a rule generator (130), and a weight calculator (140). The KB storage (110) stores a KB including a knowledge storage for storing rules between events among a plurality of events. The rule generator (130) generates one or more new rules based on the rules and an implication score between the events. The weight calculator (140) calculates a weight of the one or more new rules for probabilistic reasoning based on the implication score.
Abstract:
An explanatory variable display means 81 extracts an explanatory variable used as a condition from a classification model classified by the condition for selecting a component used for prediction and displays the explanatory variable in association with any of dimensional axes of a multi-dimensional space in which a prediction value is displayed. A prediction value display means 82 specifies the component that corresponds to a position in the multi-dimensional space specified by each of the explanatory variables associated with the dimensional axis, and then, displays the prediction value calculated on the basis of the specified component, on the same position. A space display means 83 displays the multi-dimensional space that corresponds to the position in which the prediction value is displayed, in a mode that corresponds to the component used for calculating the prediction value.
Abstract:
A prediction data input unit 91 inputs prediction data that is one or more explanatory variables that are information likely to affect future sales. An exposure pattern generation unit 92 generates an exposure pattern which is an explanatory variable indicating the content of a commercial message scheduled to be performed during a period from predicted time to future prediction target time. A component determination unit 93 determines the component used for predicting the sales, on the basis of a hierarchical latent structure that is a structure in which latent variables are represented by a tree structure and components representing probability models are located at nodes of a lowest level of the tree structure, gating functions for determining a branch direction in the nodes of the hierarchical latent structure, and the prediction data and the exposure pattern. A sales prediction unit 94 predicts the sales on the basis of the component determined by the component determination unit 93 and of the prediction data and the exposure pattern.
Abstract:
A multidimensional data visualization apparatus capable of visualizing a data distribution in an input space of high-dimensional data so as to enable understanding of relationships between input dimensions is provided. Low-dimensional parallel coordinates plot creation element 71 creates, from input multidimensional data, a plurality of low-dimensional parallel coordinates plots that are each a graph in which data relating to part of dimensions in the multidimensional data is represented by a parallel coordinates plot. Feature value computation element 72 computes, for each pair of low-dimensional parallel coordinates plots, a feature value indicating a relationship between the low-dimensional parallel coordinates plots forming the pair. Coordinate computation element 73 computes coordinates at which each low-dimensional parallel coordinates plot is arranged, based on the feature value computed by the feature value computation element 72.
Abstract:
This invention discloses a shipment-volume prediction device that predicts the shipment volumes of products at a new store. A classification unit (90) classifies a plurality of existing stores into a plurality of clusters. On the basis of information regarding the new store, a cluster estimation unit (91) estimates which cluster the new store will belong to. A shipment-volume prediction unit (92) estimates the shipment volumes of products at the new store by computing predicted shipment volumes for said products at existing stores that belong to the same cluster as the new store.