Abstract: Provided is a classification device capable of classifying time series data of location information into groups in which continuity of time is secured. The classification device (100) includes a data storage unit (110) that stores time-of-day information and location information corresponding to the time-of-day information, a sorting unit (120) that sorts the location information in order of time using the time-of-day information, a hidden Markov model storage unit (130) storing therein a left-to-right hidden Markov model containing a plurality of states and in which a parameter is undetermined, a Markov model output unit (140) that determines the parameter by inputting the location information sorted in order of time into the hidden Markov model, and a classification unit (150) that classifies each location information in one of the plurality of states by inputting the location information sorted in order of time into the hidden Markov model containing the determined parameter.

Abstract: Provided is a classification device capable of classifying time series data of location information into groups in which continuity of time is secured. The classification device (100) includes a data storage unit (110) that stores time-of-day information and location information corresponding to the time-of-day information, a sorting unit (120) that sorts the location information in order of time using the time-of-day information, a hidden Markov model storage unit (130) storing therein a left-to-right hidden Markov model containing a plurality of states and in which a parameter is undetermined, a Markov model output unit (140) that determines the parameter by inputting the location information sorted in order of time into the hidden Markov model, and a classification unit (150) that classifies each location information in one of the plurality of states by inputting the location information sorted in order of time into the hidden Markov model containing the determined parameter.

Abstract: A data sorting program that is capable of performing a data sorting process by using a small capacity of memory at a fast speed. A computer executing the data sorting program has the following functions. A concise ordered TRIE creator creates a root, sequentially reads the characters of each data, and when a prescribed number of data passed a certain node connected to the root before and a child node corresponding to a character next to a character associated with the certain node has not been created, creates the child node so that the child nodes of the certain node have a prescribed arrangement. A partition determination unit sets partitions between prescribed nodes. A data grouping unit groups the data into a plurality of data groups according to the partitions.

Abstract: A data sorting program that is capable of performing a data sorting process by using a small capacity of memory at a fast speed. A computer executing the data sorting program has the following functions. A concise ordered TRIE creator creates a root, sequentially reads the characters of each data, and when a prescribed number of data passed a certain node connected to the root before and a child node corresponding to a character next to a character associated with the certain node has not been created, creates the child node so that the child nodes of the certain node have a prescribed arrangement. A partition determination unit sets partitions between prescribed nodes. A data grouping unit groups the data into a plurality of data groups according to the partitions.