Abstract:
병렬 처리를 이용한 닫힌 빈발 패턴 마이닝 방법 및 장치에 관한 것으로, 일 양상에 따른 닫힌 빈발 패턴 마이닝 방법은 데이터베이스에서 빈발 아이템을 접두 패턴으로 하는 투영 데이터를 생성하여 저장하는 단계, 상기 저장된 투영 데이터간의 우선 순위에 따라 상기 저장된 투영 데이터를 복수의 프로세싱 노드에 할당하는 단계, 상기 할당된 투영 데이터를 이용하여 빈발 패턴을 생성하는 단계, 상기 빈발 패턴을 닫힌 빈발 패턴 리스트와 비교하여 상기 닫힌 빈발 패턴 리스트를 갱신하는 단계 및 상기 빈발 패턴이 상기 닫힌 빈발 패턴 리스트에 추가된 경우, 상기 빈발 패턴을 접두 패턴으로 하는 투영 데이터를 생성하여 저장하는 단계를 포함할 수 있다.
Abstract:
The present invention relates to a method and device for searching for a pattern in sequence data. The method may comprise a step of determining an interest pattern model including the length, allowed inconsistent value, and minimum frequency of an interest pattern; a step of obtaining the frequency of similar patterns having an inconsistent value with a child pattern, which exceeds the allowed inconsistent value, by using inconsistent value information of the similar patterns of a mother pattern; and a step of determining whether the frequency of the child pattern satisfies at least one of the minimum frequencies by using the mother pattern and the frequency of similar patterns which exceeds the allowed inconsistent value.
Abstract:
PURPOSE: An efficient query processing method and a device thereof are provided to improve search performance by using a partial character string having an unfixed length. CONSTITUTION: A UI(User Interface)(105) receives a query character string and outputs a document including the character string. A database(165) stores information about various documents. A processor(135) generates an effective character string set composed of partial character strings having different lengths through the query character string. The processor determines one of subsets of the effective character string set as a candidate set based on costs of the subsets for accessing the database. The processor searches the database for the document including the query character string by using the candidate set. [Reference numerals] (105) User Interface; (110) Character string set generating unit; (120) Candidate set determining unit; (130) Document searching unit; (140) Index DB; (150) Inverted index DB; (160) Document DB
Abstract:
The present invention relates to a method and device of searching for a pattern in sequence data. The method may comprise a step of determining a plurality of interest pattern models including the length, allowed inconsistent value, and minimum frequency of an interest pattern; a step of obtaining the frequency of a candidate pattern which can be generated within the length of the interest pattern based on the allowed inconsistent value of the interest pattern models; and a step of determining whether the frequency of the candidate pattern satisfies at least one of the minimum frequencies of the interest pattern models.
Abstract:
An image search server, an image search service providing terminal, a system, and a method are disclosed. The image search server of the present invention comprises: a search request reception unit for receiving an image search request signal including identity information of neighboring objects and a search request image from the terminal; a search range determination unit for determining a search range in an object image stored based on the received terminal neighboring object identity information; a similar image searching unit for searching a similar object image with the search request image within the determined search range; and a search result transmission unit for transmitting a search result to the terminal.
Abstract:
PURPOSE: A query processing method based on N-gram and an apparatus thereof are provided to improve query processing performance even when the length of a query is long. CONSTITUTION: A query processor(710) selects some N-grams among total N-grams for a query based on a query processing cost and uses a posting list for the some N-grams to extract a candidate set of a document in which a query exists. The query processor determines, based on the candidate set, the document including the query.