Abstract:
An observation information processing apparatus calculates, for each mesh, a support and a confidence. The observation information processing apparatus generates an adjacent mesh set by merging adjacent ones of the meshes. The observation information processing apparatus calculates, based on a support and a confidence of each mesh included in the adjacent mesh set, a confidence for each adjacent mesh, and sets the smallest one of the confidences calculated as a new confidence threshold value. The observation information processing apparatus detects and excludes meshes to be excluded from meshes included in the adjacent mesh set, based on the confidences and supports of the meshes included in the adjacent mesh set and the confidence threshold value.
Abstract:
When a second pattern is to be generated by adding an event to a first pattern including events, an extraction program causes a computer to execute the following process based on combinations of events. That is, the extraction program causes the computer to generate the second pattern when the number of occurrence, in the second pattern, of each of the events included in the combinations is not more than a threshold. The extraction program causes the computer to calculate, based on data including a plurality of events, a frequency at which one or more of the generated second patterns occur in the data. The extraction program causes the computer to extract the second pattern having the frequency satisfying a predetermined condition. The extraction program causes the computer to add a new event to the extracted second pattern.
Abstract:
An analysis method includes: acquiring first path information indicating a first movement path, first velocity information of a first moving body on the first movement path, second path information indicating a second movement path, and second velocity information of a second moving body on the second movement path; calculating, based on a specific rule, a similarity between the first velocity information and the second velocity information when the first path information and the second path information are extracted as candidates to be integrated; determining, based on the similarity, whether the first path information and second path information are to be integrated; and generating graph information to draw at least a part of the first path information and at least a part of the second path information as a single path when it is determined that the first path information and the second path information are to be integrated.
Abstract:
According to one aspect, a computer-readable recording medium stores therein an extracting program 330a causing a computer to execute a process. The process includes based on event data obtained by associating a plurality of events stored in a storage unit and an occurrence time of each event, sequentially adding an event to a first pattern obtained by associating the plurality of events and the occurrence order of each event, and sequentially generating a second pattern which includes the first pattern and occurs in the event data; and extracting a pattern which satisfies a predetermined condition from the generated second pattern.
Abstract:
A non-transitory computer-readable recording medium stores therein a learning data selection program that causes a computer to execute a process including: extracting a first input data group relating to first input data in correspondence with designation of the first input data included in an input data group input to a machine learning model, the machine learning model classifying or determining transformed data that is transformed from input data; acquiring a first transformed data group of the machine learning model and a first output data group of the machine learning model, respectively, the first transformed data group being input to the machine learning model and corresponding to the first input data group, the first output data group corresponding to the first transformed data group; and selecting learning target data of an estimation model from the first input data group.
Abstract:
An initializable array has a plurality of blocks each having an address word and a data word, a boundary indicative of a two-division position where the plurality of blocks is divided into two divided areas and an initial value for each element of the array is stored, the boundary is a position where a ratio for the number of unwritten blocks in a first area and the number of written blocks in a second area is an integer ratio. An array control program causes a computer to execute shifting the boundary to extend the first area and generating an initialized written block in the first area; in a case where a write destination block is an unwritten block in the second area, forming a link between the initialized written block in the first area and the write destination block; and writing a write value to the write destination block.
Abstract:
An apparatus acquires a first piece of trajectory information from among plural pieces of trajectory information, and acquires a first planar graph from among one or more planar graphs. The apparatus generates a second planar graph, based on the first planar graph and plural pieces of position information included in the first piece of trajectory information, and extracts, from among the plural pieces of trajectory information, second pieces of trajectory information indicating trajectories passing a difference portion between the first and second planar graphs. For each of candidate graphs each obtained by excluding a reduction set of edges from the second planar graph, the apparatus calculates optimality of the each candidate graph with which an addition set of trajectories indicated by the first and second pieces of trajectory information are associated, and outputs one of the candidate graphs determined based on the calculated optimality.
Abstract:
A computer-readable storage medium storing an update program that causes a computer to execute a process includes: acquiring an automaton performing matching of data in an input stream hierarchized by tags to a keyword in a query, the automaton in which an initial state, a start state indicating a start tag symbol, an end state indicating an end tag symbol, a transition between the initial state and the start state, a transition between the initial state and the end state, and a transition from the initial state to the initial state are defined; generating a path identifying the position of a start tag based on a hierarchy in the input stream when the start tag is read from the input stream; judging whether or not the generated path meets a condition corresponding to the keyword in the query; generating, when the generated path is judged to meet a condition.
Abstract:
A method of providing destination information includes storing route information in which location information identifying locations, coordinate points information, and information of locations adjacent to the locations are associated with each other; storing probability information in which current locations, destinations, and probabilities of moving from the current locations to the corresponding destinations are associated with each other; receiving information indicating a current position of a terminal apparatus; determining a current location corresponding to the current position; determining one or more first destination candidates based on the probability information; determining one or more second destination candidates among the one or more first destination candidates, when a next destination is not uniquely identifiable; determining a nearby location indicating a location adjacent to each second destination candidate and the current location; and determining the next destination among the one or more second destination candidates, by assuming the nearby location as the current location.
Abstract:
A matching circuit includes pattern circuits, and a signal path in which the pattern circuits are series-connected, wherein each of the pattern circuits connected to a preceding-stage pattern circuit through the signal path is settable in a first operation mode and in a second operation mode, wherein each of the pattern circuits in the first operation mode generates a result of matching in response to both a result of matching supplied from a preceding-stage pattern circuit and a result obtained by matching data supplied from the preceding-stage pattern circuit against part of a regular expression pattern, and wherein each of the pattern circuits in the second operation mode generates a result of matching in response to a result obtained by matching the data supplied from the preceding-stage pattern circuit against part of a regular expression pattern, without relying on a result of matching supplied from the preceding-stage pattern circuit.