Abstract:
[Problem to be Solved] To efficiently determine the type, location, and cause of an abnormality in a complex system or support the determination. [Solution] A method applied to a computer that determines a situation of a system includes the steps of: receiving measurement data from each of a plurality of measurement targets in the system; computing a plurality of sets of anomaly values based on the measurement data and a predetermined computation algorithm according to a plurality of classifications corresponding to a plurality of properties of each measurement target; and determining the situation of the system based on the sets of anomaly values and a predetermined determination algorithm.
Abstract:
PROBLEM TO BE SOLVED: To provide a technique for predicting a road link-categorized travel time with as high accuracy as possible even with respect to an edge in which the observed value of costs is insufficient.SOLUTION: Disclosed is a technology of, when the observed value of a certain probability variable is given to the edge of a part of a graph showing a road or the like, estimating the probability distribution of variables in an arbitrary edge in accordance with a probability density function capable of coping with arbitrary distribution. The probability density function is a formula of mixing a basic function estimated from edge-categorized data with an inter-edge similarity scalar and the significance scalar of each edge. That is, the probability density function is a form of interpolating the basic function with similar edges. According to one aspect, it is possible to quickly and stably optimize a parameter in the probability density function from finite data.
Abstract:
PROBLEM TO BE SOLVED: To obtain probabilistic measures to minimize the risks of cumulative remuneration to be obtained from a plurality of objects undergoing status transition. SOLUTION: The transition probability of the status transition of an agent and a parameter showing the probability distribution of remuneration to be obtained in each status transition as the result of action taken by a user to a plurality of agents in each status are stored. Then, the input of measures to determine action probability for taking an action to each agent in each status is accepted. Then, a recurrence expression for searching the parameter showing the probability distribution of cumulative remuneration to be obtained in current and following terms from the plurality of agents based on the parameter showing the probability distribution of the cumulative remuneration to be obtained in the next and following terms is generated, and the parameter of the probability distribution is calculated by solving such an equation that the parameter of the probability distribution of the cumulative remuneration is converged into the same valve when the initial statuses are the same in the current and following terms and in the next and following terms in the recurrence expression. COPYRIGHT: (C)2008,JPO&INPIT
Abstract:
PROBLEM TO BE SOLVED: To provide a clustering technique which is efficiently in computational complexity, while guaranteeing global optimality of cluster.SOLUTION: A number of kernel elements are prepared each of which has a fixed center and a fixed bandwidth calculated on the basis of a distribution giving similarity between data of an input data group. A non-negative mixed weight is allocated to each kernel element. Next, a given kernel element and a kernel element having a fixed center and a fixed bandwidth closer thereto are selected and on the basis of a determination of monotonousness in a log-likelihood function of the mixed weight, trimming of an array element corresponding to one kernel element, trimming of an active array element corresponding to the other kernel element, or one-way optimization to one kernel element is executed. When processing to a pair of kernel elements is completed for overall array elements, at that time point, convergence of the mixed weight is determined and if converged, on the basis of the mixed weight, data of the input data group are clustered.
Abstract:
PROBLEM TO BE SOLVED: To estimate a location, with high accuracy, based on the strengths of the radio waves received from a plurality of access points. SOLUTION: A label propagation method is used for estimating position. In particular, this high-accuracy position estimation method robust against the fluctuations of the radio wave intensity is attained, by using a q norm (0
Abstract:
PROBLEM TO BE SOLVED: To provide a method and system for accurately predicting data for explained variables.SOLUTION: This method includes: receiving explanatory variables as input data; searching training data for elements whose discrete variables match those of each element of sets contained in the input data; applying a function weighted by a scaling variable to each element in the input data and to each of one or more elements found for the element in the input data in order to calculate each function value; calculating the sum of the function values for every element in the input data; and applying every calculated sum to a prediction equation in order to calculate a prediction value of the explained variable.
Abstract:
PROBLEM TO BE SOLVED: To solve the problems of conventional techniques being unable to define customer states in consideration of marketing actions and to obtain, as parameters of customer state, information on what kinds of effects marketing actions produce in the short and long terms. SOLUTION: In order to obtain customer state transition probabilities and short-term rewards conditioned by actions, customer behaviors are modeled with a hidden Markov model (HMM) using composite states each composed of a pair of a customer sate and a marketing action. Parameters of the estimated hidden Markov model (the composite state transition probabilities and a reward distribution for each composite state) are further transformed into the customer state transition probabilities and the distribution of rewards for each customer state conditioned by marketing actions. In order to model purchase properties in more detail, an inter-purchase time is always included as an element in the customer state vector, thereby allowing the customer state to have information on the probability distribution of the inter-purchase time. COPYRIGHT: (C)2008,JPO&INPIT