KR20080065521A - Method and system for patent information service - Google Patents

Abstract

A patent information service system for hierarchically integrating assignee-based and inventor-based patent information service systems, and a method thereof are provided to automatically extract domestic/foreign patent information related to an assignee and/or an inventor by automatically constructing/integrating the assignee-based and inventor-based patent information service systems. Assignee information including an assignee is checked from a patent information database, and patents applied or registered by the checked assignee are searched from the patent information database(S1620). A hierarchically integrated assignee-based patent information service system is constructed when the patent documents are searched(S1630). Inventor information registered as an inventor of the patent documents is extracted(S1660), and a hierarchically integrated inventor-based patent information service system is constructed by using the extracted inventor information(S1670). The inventor-based patent information service system manages patent information registered by the inventor by using an application number as a key value. The patent information includes at least one of bibliographic information of the patent information corresponding to the application number.

Description

Patent information service method and system therein hierarchically integrated patent information system of applicant's name and patent information system of inventor's unit {Method and System for patent information service}

1 is an exemplary diagram of the entire system of the present invention.

2 is an exemplary diagram of an engine for generating an individual unit patent information system of the present invention.

3 is a diagram illustrating an internal configuration of a patent information preprocessing module according to the present invention.

4 is an exemplary diagram of a weight preprocessing module of the present invention.

5 is an exemplary diagram of a citation information preprocessing module of the present invention.

6 is an exemplary diagram of a patent classification code preprocessing module according to the present invention.

7 is an exemplary diagram of the representative representative preprocessing module of the present invention.

8 is an exemplary diagram of a representative phrase extraction pretreatment module of the present invention.

9 is an exemplary diagram of a family information preprocessing module of the present invention.

10 is an exemplary diagram of a plurality of patent classification code relationship preprocessing module of the present invention.

11 is a diagram illustrating an exemplary embodiment of a statistical preprocessing module for each patent classification code according to the present invention.

12 is an exemplary diagram of a patent information intelligence module of the present invention.

13 is an exemplary diagram of an analysis module of the present invention.

14 is an exemplary diagram of a patent information system batch generation engine of the present invention.

15 is a diagram illustrating the configuration of an integrated management module of the present invention.

FIG. 16 illustrates a unit patent information service system of an inventor for each inventor included in a patent document set that generates one applicant name unit patent information service system in the entire patent information database 2300 and constitutes the applicant patent unit service information system. One embodiment of the method is shown.

FIG. 17 obtains a list of applicant names, generates a unit patent information service system of the applicant name by the number of applicants listed in the entire patent information database 2300 for each list, and generates the unit patent information service of the applicant name. An embodiment of a method for generating a unit patent information service system for each inventor included in a patent document set constituting the system is shown.

FIG. 18 obtains a list of applicant names from the set of obtained documents, and generates a unit patent information service system of the applicant name by the number of applicants listed in the entire patent information database 2300 for each list, and each of the generated applicants An embodiment of a method for generating a unit patent information service system for each inventor included in a patent document set constituting the unit patent information service system for a title is shown.

19 is a patent document for creating a unit patent information service system of one applicant name from the entire patent information database 2300 and configuring the unit patent information service system of the applicant name when an order for generation of the applicant patent unit patent information service system is ordered. An embodiment of a method for generating a unit patent information service system for each inventor included in a set is shown.

20 relates to a method for generating a unit patent information service system of the applicant name on a national basis. Generating the unit patent information service system of the applicant's name in the unit of the country is the nature of generating the unit patent information service system of the applicant's name and the unit patent information service system of the inventor's name in the national unit for the patent information database 2300 of the national unit. Shall be. Therefore, all of the methods of FIGS. 16 to 19 may be applied.

FIG. 21 illustrates an embodiment of a process of generating a unit patent information service system of an applicant and a unit patent information service system of an inventor name by using family information.

FIG. 22 illustrates an embodiment of a process of generating a unit patent information service system of an applicant name and a unit patent information service system of an inventor name by using a priority claim number.

FIG. 23 illustrates an embodiment of a process of generating a unit patent information service system of an applicant name and a unit patent information service system of an inventor name by using family information.

FIG. 24 illustrates an embodiment of a process of generating a unit patent information service system of an applicant name and a unit patent information service system of an inventor name by using family information and priority claim information in a country unit.

FIG. 25 shows an exemplary process of what the applicant's unit patent information service system generation engine and the inventor's name unit patent information service system generation engine perform when a new document is added.

FIG. 26 is a diagram of one embodiment of the present invention. FIG.

FIG. 27 illustrates an exemplary process of a process of performing a CRUD on a document set managed by an inventor in a unit patent information service system administrator.

28 is a diagram illustrating one embodiment of the present invention.

FIG. 29 is an exemplary diagram of a method for processing weights by the costing perspective weighting preprocessing module 3311 of the present invention.

30 is an exemplary diagram of how the citation perspective weight preprocessing module 3313 of the present invention preprocesses the weights from the citation perspective.

31 is a diagram illustrating an example of a method in which a dispute perspective weight preprocessing module 3315 processes weights.

32 is a diagram for one example of a method of processing the weight by the centralized viewpoint weighting preprocessing module 3317 of the present invention.

33 is a diagram illustrating an embodiment of a method for processing weights in the inventor unit of the present invention.

34 is a diagram for one example of a method in which the applicant unit weight preprocessing module 3331 processes weights.

35 is a diagram for one example of a method in which the inventor unit weight preprocessing module 3333 processes a weight.

36 is a diagram for one example of a method by which the agent unit weight preprocessing module 3335 of the present invention processes weights.

37 is a diagram illustrating a method of processing family information by the family information preprocessing engine 3810 of the present invention.

38 is an exemplary diagram of a citation information preprocessing method representative of a citation number of the present invention.

FIG. 39 is a diagram for one embodiment of a method for including the back-cited document information in the document information of the specific document after obtaining the back-cited document information, which is information on a post-application document citing a specific document of the present invention. .

40 is an exemplary diagram of a citation information preprocessing method of the present invention.

Fig. 41 is an exemplary view of a processing method of a patent classification code preprocessing engine for processing a modified patent classification code of the present invention.

42 is a diagram illustrating a method for generating a modified patent classification code database by the hierarchical modified patent classification code database generating module of the present invention.

FIG. 43 is a diagram of one embodiment method of creating a tree structure from USPC patent classification codes. FIG.

FIG. 44 is a diagram illustrating an exemplary method for allocating a modified patent classification code corresponding to a tree structure with the USPC patent classification code of FIG. 43.

45 is a diagram for one embodiment of a tree structure composed of modified patent classification symbols having the same structure as the tree structure created from the USPC patent classification symbol of FIG. 43.

46 shows Index to U.S. Patent Classification (a.k.a., Classification Index File) file) is an exemplary view showing that a tree structure of a patent classification code as shown in FIG.

47 is a diagram illustrating an exemplary patent classification code preprocessing method of the present invention.

48 is an exemplary diagram of a method for performing an applicant representative name in the representative name preprocessing module according to the present invention.

FIG. 49 illustrates an exemplary representation method using the priority claim number of the present invention. FIG.

50 is a diagram illustrating a method of preprocessing a statistical value for each patent classification code of the present invention.

FIG. 51 is an exemplary diagram for a method for automatically including a lower patent classification code for generating a statistical value, parameter, or calculated value for a given patent classification code of the present invention.

FIG. 52 relates to a method for generating a statistical value, a parameter value, or a calculated value for each patent classification symbol from the viewpoint of including a lower patent classification symbol for citation or citation information for a document subset of a specific document set of the present invention; FIG. Example drawing.

53 is a diagram illustrating an exemplary embodiment of a plurality of patent classification code relationship preprocessing methods of the present invention.

54 is a diagram illustrating an embodiment of a plurality of patent classification code relationship pretreatment methods in a comparative aspect of the present invention.

55 is a diagram illustrating an exemplary phrase information preprocessing method of the present invention.

56 is a diagram illustrating a representative phrase information preprocessing method of the present invention.

57 is a diagram illustrating a representative phrase information preprocessing method of the present invention.

58 is a diagram illustrating an analysis index calculation method according to the present invention.

59 is a view illustrating an embodiment of a method for obtaining an analysis target patent document set according to the present invention.

60 is a diagram illustrating a trend analysis method of the present invention.

61 is a view showing an embodiment of a simplified analysis method of the present invention.

62 is an exemplary diagram of a citation analysis method of the present invention.

63 is an exemplary view of a citation analysis method of the present invention.

64 is a diagram showing an example of a method for analyzing citations according to the present invention.

65 is a diagram illustrating an embodiment of a method for analyzing multiple patent classification codes according to the present invention.

66 is a diagram illustrating an example of a method for analyzing a plurality of patent classification codes according to the present invention.

67 is a diagram illustrating an embodiment of a method for analyzing multiple patent classification codes according to the present invention.

68 is a view showing an embodiment of a method for operating an individual unit patent information system multi-stage grouping module of the present invention.

69 is a diagram illustrating a method for generating a patent information system batch according to the present invention.

The present invention relates to a patent information service method and a system in which the patent information system of the applicant unit and the patent information system of the inventor unit are hierarchically integrated, and more specifically, based on the patent information database, each company automatically The patent of the applicant's name serviced by constructing a patent information service system and further extracting inventor information belonging to a company included in the patent information and automatically generating a hierarchically integrated patent information service system of the inventor unit. A patent information service method and a system in which an information system and a patent information system of an inventor unit are hierarchically integrated.

Patent information has the characteristics of technical information, rights information and management information, and its importance is increasing in the global international competition. As the technical information, it is possible to know the trend of technology development and technical ideas applied to individual patents, and as the right information, it is possible to grasp the scope of rights of individual patents and the degree of nationalization of domestic and foreign rights.

There are many ways to obtain patent information, but there are largely 1) the use of patent information system provided by each country's patent office, 2) the use of patent information system developed by private companies, and 3) the individual company's purpose. It can be classified into using a patent information system that is properly constructed. A representative example of the method of 1) is a patent information system provided by the Korean Intellectual Property Office (www.kipo.go.kr) and the Korean Patent Information Service (www.kipris.or.kr), and 2) a representative example of the US www.delphion .com, www.patolis.co.jp in Japan, www.wips.co.kr in Korea and www.wisdomain.com.

Private companies in each country, such as Thomson Scientific, the operator of www.delphion.com, have established a database of patent information and provide search results in a variety of ways for search expressions entered through a patent search engine. In addition, various types of analysis software have been developed based on this patent information, and the software distributed under the trade name AUREKA developed by the operator of www.micropatent.com (acquired and acquired by Thomson Scientific) is famous. And, it is known that the technology giants around the world have built and operated patent retrieval and patent management systems inside, but it is difficult to access their patent retrieval and patent management systems from outside.

It is common to spend more than billions of dollars to construct such a patent search and patent management system, and most domestic and foreign mid-sized and small venture companies do not have their own patent search and patent management system. Many of these mid- to small- and mid-sized startups have a patent-only organization, which manages their patents and collects patent information for them. However, companies that are small in size or do not have high awareness of patents often do not have a dedicated patent organization. These companies are in charge of managing their patents by requesting patent law firms or law firms.

These patent organizations use externally accessible free online patent information service companies such as www.delphion.com to collect and manage patent information on the platform they provide. In addition, most of the patent applications in the name of the company is made by the inventors belonging to the company, the inventors of the global trend to collect domestic and foreign patent information related to their invention. The reason for this is that despite the existence of the patent publication period, more than 70% of the world's new technology information is disclosed in the form of patent information, and the patent information is more commercially available than the paper information. However, many of these inventors, even if they are not used to patent search or are familiar with the search, have access to external patent information service providers such as www.deljphion.com to obtain patent information.

It is common for the inventors to continuously study the specific technical field for several years to several decades, so that the technical field of the invention of the present invention is not greatly changed. Therefore, the patent technical information of the country or foreign countries about the field directly or indirectly related to the technical field invented by him will be useful information to the inventor. Therefore, it has been requested to supply a differentiated patent information service system for a specific inventor, which is operated by the inventor unit of the company as well as an individual company unit, and optimized to the inventor unit. Such a patent information service system has been developed by itself. It will greatly improve access to patent information for medium and small venture companies that cannot be maintained and will be a new platform for in-house patent information distribution for companies that can develop and maintain their own.

In addition, the company or inventors automatically analyze the patents that they manage, and the analysis information about competitors and competition technologies related to them, and the monitoring information about competitors and competition technologies are automatically arranged and directly sent to the companies or inventors. If provided, it would be convenient for the enterprise or inventor.

The first technical problem to be achieved by the present invention is to build a patent information service system for each company automatically based on the patent information database, and further extract the inventor information included in the patent information, and automatically obtain the patent information of the inventor unit. The present invention provides a method and system for constructing a service system and generating a patent information system in which both systems are hierarchically integrated.

The second technical problem to be achieved by the present invention is a method for automatically collecting domestic and foreign patent information related to the enterprise and / or the inventor in at least one or more of the patent information system of the applicant name unit and the inventor information patent system To present.

The third technical problem to be achieved by the present invention is to automatically perform patent analysis on domestic and / or patent information related to the company and / or inventor in at least one or more of the patent information system of the applicant's name and the patent information system of the inventor's unit. Is to present a way.

The fourth technical problem to be achieved by the present invention is a method for automatically analyzing patent information related to the enterprise and / or the inventor itself in at least one or more systems of the patent information system of the applicant unit and the patent information system of the inventor unit generated To present.

The fifth technical problem to be achieved by the present invention is to propose various preprocessing methods for patent document information and a method of performing various patent analyzes based on preprocessed patent information.

The sixth technical problem to be achieved by the present invention is to provide a method for providing a patent information service from the first technical task to the fifth technical task online in a plurality of applicant names, and to be operated in an internal system of individual applicants. It is to suggest a way to do it.

A detailed explanation follows below with reference to the drawings.

Patent information published

Patent information disclosed is basically included two kinds of information as follows. Basic information is bibliographic information and patent text.

Information on bibliographic matters includes: information on the country where the patent document was issued, name of the invention, information on the applicant (including assignee, hereinafter) / patent (including assignee, hereinafter), information on inventor, patent classification code Information on (any one or more selected from IPC, USPC, FI, FT, and ECLA, which is the same below), information on various dates such as the filing date, and information on various numbers such as the application number are essentially included. In addition, abstract information, information on representation when there is a representation, information on references (referrence information on prior art disclosed by the applicant, documents examined or investigated by the examiner, or information on patent classification symbols) One or more), information about priorities, information about examiners, etc. may optionally be present. The World Intellectual Property Organization (WIPO) sets out standards for labeling each bibliography, and these standards are adopted in many countries.

Second is information about the text. The main text contains information about the technical content of the patent. The body of a typical patent document includes information on the name of the invention, information on the composition of the invention, and information on the claims. In addition to these, effects of the invention, industrial applicability, technical problems to be achieved by the invention, Description of the drawings, any one or more of the prior art is included. In addition, according to the inventor's selection or the type of patent technology, essential or optional information about the drawings is further included. Essentially present is the name of the invention, the composition of the invention and the third claim is information on administrative matters.

In addition to the bibliographic information and the main text, there is more information available, the most representative of which is administrative information. Of course, each country also provides additional information that is not provided by other patent offices. Such is the case with Field of Search provided by the US Patent and Trademark Office.

Information on administrative matters refers to information on various administrative matters of the relevant patent office or patent institute for each patent document. Such administrative processing information is typical of information about events occurring within the agency in charge, such as undertaking an examination, and / or information about events occurring in the interaction with the applicant or the person using the agency, such as the applicant's name change application.

In addition, primary processing information may be generated based on the information on the bibliographic matter, the information on the main text, and / or the information on administrative matters, and such information may also be stored in a patent information database. The primary processing information includes count information such as the number of applicants, the number of inventors, the number of drawings, the number of specification pages, the number of families, the number of patent classification symbols, the number of references (number of citations, number of citations), and the like. Can be mentioned.

Patent Information Preprocessing Module (3000)

When at least one document set is determined, various things may be calculated, extracted, and generated for the document set based on information in the document set and / or information in the patent information database 2300. . The calculation, extraction, and generation are performed by the patent information preprocessing module 3000 of the present invention, and the patent information preprocessing module 3000 may include a lower preprocessing module according to patent information calculated, extracted, generated, or processed. Can be.

Counting Pretreatment Module (3100)

The counting preprocessing module 3100 will be described. The counting preprocessing module 3100 includes an individual document unit counting preprocessing module 3110 for performing counting processing in individual document units and a plurality of document unit counting preprocessing module 3130 for performing counting processing in two or more document units.

Individual Document Unit Counting Pretreatment Module (3110)

The individual document unit counting preprocessing module 3110 may include 1) the number of applicants and / or patentees, 2) the number of inventors, 3) the number of claims in each step, such as the number of applications or registrations, and 4) the number of specification pages, as described in the individual patent documents. 5) number of drawings, 6) number of patent classification symbols, 7) number of patent classification symbols of each kind, 8) number of references, 9) number of examination citations, 10) number of patent classification symbols examined by the examiner , 11) Number of priority claims, 12) Number of family patents by country, 13) Number of family patents, 14) Number of independent terms, 15) Number of dependent terms, 16) Number of patents at national level among references, 17) Total number of patent documents among references , 18) At least one or more numerical information among the non-patent documents among the references may be calculated.

In addition, the individual document unit counting preprocessing module 3110 may include 1) a period from an application date to a registration date, 2) a priority date to an application date, and the like from administrative processing information such as an individual patent document or a patent office that issues the individual patent document. At least one or more of the period information, 3) the period from the filing date to the request for examination, and 4) the period information from the notification notice submission date to the submission date of the opinion can be calculated.

In addition, the individual document unit counting preprocessing module 3110 may obtain information on whether to use or apply a specific system for each country in the individual patent document or administrative information. Whether to apply, 2) use of divided applications, 3) use of partial applications, 4) use of reissued patent system, 5) whether to apply for priority examination, 5) use of decision-making referees, 6) non-party litigation It is possible to find out one or more of them, and if there is utilization or application of the above system, the counting value may be set to 1, otherwise it may be set to 0.

In addition, the individual document unit counting preprocessing module 3110 examines the patent information database 2300 in association with the individual patent document (by using a search engine 7000 or a DBMS 2100). Information related to the individual patent documents in two countries may be obtained and counted. The above information can be obtained by counting at least one or more of: 1) number of applicants, 2) number of registered countries, 3) international application, 4) number of families in each country, and 5) total number of families. Can be.

In addition, the individual document unit counting preprocessing module 3110 may include 1) forward citation (other domestic and foreign patent documents citing me) and 2) backward citation (through the search engine 7000 or the DBMS 2100). One or more of the previous documents), 3) collateral citation, and counting.

In addition, the individual document unit counting preprocessing module 3110 may obtain information on the document, such as 1) objection, 2) information provision, 3) party judgment. Information regarding the above 1) to 3) can be obtained directly from the Korean Intellectual Property Office or the Patent Judge in the case of the Republic of Korea or inquiries.

The value counted by the individual document unit counting preprocessing module 3110 is preferably stored in the patent information database 2300. In addition, the counted value is more preferably stored in a manner of including the patent document in the index generated when the search engine 7000 indexes. The counting value is included in the index. 1) When the search engine 7000 indexes, the individual document unit counting preprocessing module 3110 is operated to obtain a counting value, or 2) the patent information is used. Any one or more of a method of obtaining a counting value stored in the database 2300 may be used.

The manner in which the counting preprocessing module 3100 processes the counting is illustrated in FIG. 28. First, a counting preprocessing module 3100 obtains at least one or more patent document information (S2820), and calls at least one or more individual document unit counting preprocessing module 3110 for each patent document obtained (S2830), and the individual document unit The counting preprocessing module 3110 performs a counting process on the patent document information (S2840), and stores the counting result in the patent DB or search index together with the document unique number of the patent document information (S2850).

Multi-Document Unit Counting Preprocessing Module (3130)

Hereinafter, a module for obtaining a score calculated in the plurality of document units, that is, a plurality of document unit counting preprocessing module 3130 will be described. The plurality of document unit counting preprocessing module 3130 obtains a score by collecting information counted by the individual document unit counting preprocessing module 3110 from a plurality of documents which become the target set. That is, the multi-document unit counting preprocessing module 3130 generates counting data for at least two document sets.

Weight Preprocessing Module (3300)

Document Unit Weight Preprocessing Module (3310)

It is impossible to accurately and systematically measure the value of the inventive idea contained in one patent document. However, it may be unreasonable to treat all patent documents equally because the impossibility of measuring them accurately. Therefore, the present invention discloses a method for assigning a weight to a patent document based on information that the system can grasp as data. The weighting function of the patent document is handled by the document unit weight preprocessing module 3310 of the present invention.

The weight preprocessing module 3300 of the present invention includes a document unit weight preprocessing module 3310 and a subject unit weight preprocessing module 3330. The document unit weight preprocessing module 3310 may include a cost expenditure perspective weighting preprocessing module 3311, a citation perspective weighting preprocessing module 3313, a dispute perspective weighting preprocessing module 3315, and / or an intensive perspective weighting preprocessing module 3317. It may include. The subject unit weight preprocessing module 3330 may include an applicant unit weight preprocessing module 3331, an inventor unit weight preprocessing module 3333, and / or an agent unit weight preprocessing module 3335.

Expenditure Perspective Weight Preprocessing Module (3311)

From a probabilistic, statistical or social point of view, the more paid patent will likely be the more important one. From the point of view of the rational distribution of costs in the same subject, this assumption is likely to hold, and this assumption is likely to be made between other competing actors. Considering the structure in which the cost is paid for one patent, the following weighting factor can be considered.

1) In terms of quantity (1) Number of claims, number of independent claims, number of specifications (number of pages), number of families or number of patent classification symbols 2) Patents, registered patents, and patents pending from a state of view In the case of a patent or abandoned patent, 3) whether it is a request for examination, whether or not to use the priority examination, whether to request a judgment, whether to claim a domestic priority or a divided application, 4) the number of applicants or the number of inventors from a subjective point of view, 5 From a foreign perspective, factors such as the availability of international applications and the number of countries entering the domestic and overseas phases may affect the value of patent documents. These weighting elements may be obtained from bibliographic information, specification content information, or administrative processing information of individual documents.

In general, a large number of claims or a large amount of specification are likely to make the invention broad and diverse, and therefore, it is likely that the invention is time-consuming and expensive, and agents are likely to charge more. In addition, the greater the number of families or the greater the number of patent classification symbols, the higher the possibility of comprehensiveness of the invention. In addition, registered patents are more likely to have a greater weight than patents pending, and a patent application for which an examination is requested or an application for which a priority examination is requested is more likely to be more important than a patent application that is not. If two or more applicants are joint applications, it is a result of cooperative work between two or more other subjects. Therefore, there is a possibility that they are statistically more important than otherwise. It is likely to be important. In addition, foreign patent applications are usually much more expensive than domestic ones, so if the applicant has an overseas application or a large number of foreign applications, the applicant will have significant financial expenditure, so at least the patent is relatively important to the applicant. It is reasonable to judge high.

From the above point of view, the existence of the weighting factor and the number of the weighting factors for a single document are identified. (If only the problem is present, the number will be 0 if it does not exist and the number will be 1 if it exists. The above numerical value will be obtained.) A weighted score may be assigned to each weighting factor according to its presence and / or numerical value. Grasping the existence and the numerical value of the detailed weighting elements constituting each aspect of the above 1) to 5) for each document, and assigning the weighting score to each weighting element is the cost expenditure perspective weighting preprocessing module of the present invention ( 3311).

The method for processing the weights by the expense aspect weight preprocessing module 3311 is well illustrated in FIG. 29. The cost expenditure perspective weighting preprocessing module 3311 obtains at least one patent document information (S2920), and uses the counting preprocessing module 3100 or relevance to the expense in patent document information obtained through a patent DB or a search index. At least one counting result value for each of the predetermined counting criteria is obtained (S2930), and the patent information processing policy database 2330 obtains the weight for the counting criteria (S2940). In this case, the information about the predetermined counting criteria refers to the patent information processing policy stored in the patent information processing policy database 2330. For example, in terms of the claims of the patent information processing policy database 2330 in view of the cost expenditure, a policy for processing weights for each object in each aspect such as (the number of claims * 0.1 + the number of independent terms * 0.3) is stored. Doing. In addition, the cost expenditure perspective weight preprocessing module 3311 generates a cost perspective weight value as a weighting result for each counting criterion and a counting result for each counting criterion (S2940), and generates the generated weight value as a unique document number of patent document information. Together with the patent DB or stored in the search index (S2950).

Citation Perspective Weight Preprocessing Module (3313)

Like papers, many patents cited by many are likely to be important. The module that processes the weight of individual documents in this citation view is referred to as citation view weight preprocessing module 3313. Breaking down the citation's perspective in detail: 1) From the perspective of forward citation, the total number of back citations, the number of back citations, the number of first-level back citations, the average duration of back citations, the concentration of backward citations over time, 2) There may be weighting factors, such as whether the examiner cites, in terms of examiner citations. That is, the more citations to your patents, either directly or indirectly (that other patents cite those patents that you cite), the more one-step citations that you cite directly, and the average duration of back citations within the appropriate range, The more time a person citing his patent is focused on a recent podium, the more likely it is that the patent is of great importance. In addition, the patent cited by the examiner in the examination process may be more important than the patent that is not. The manner in which the citation perspective weight preprocessing module 3313 preprocesses the weights in citation perspective is similar to the method in which the expense expenditure perspective weighting preprocessing module 3311 processes and is illustrated in FIG. 30.

The citation viewpoint weight preprocessing module 3313 obtains at least one or more patent document information (S3020), and forward citations and / or from patent document information obtained using a counting preprocessing module 3100 or through a patent DB or a search index. Obtain a counting result value according to at least one predetermined counting criterion related to a back citation or a review citation (S3030), and obtain a weight for each counting criterion with reference to the patent information processing policy database 2330 (S3040). ), And generate a citation viewpoint weight value as a weighting value by counting criteria and a counting result value by counting criteria (S3050), and stores the generated weighting value together with the unique document number of patent document information in patent DB or search index (S3060). At this time, the information about the predetermined counting criteria for the citation is patent information processing policy database 2330 See Patent stored information handling policy. For example, the patent information processing policy database 2330 of the citation point of view stores a policy for processing a weight for each object in each point of view such as "rear citation counting number * 0.3".

Dispute Perspective Weight Preprocessing Module (3315)

The more disputes a patent document has, the more likely that patent is of importance. Dispute elements that may be identified in patent information may include 1) invalidity trials, 2) appeals, 3) provision of information, and 4) passive or active coverage checks. The existence of the weighting element and the numerical value of the weighting factor in the conflicting point of view and assigning the weighting score to each weighting element are performed by the disputed point of view weighting preprocessing module 3315 of the present invention.

The method of processing the weights by the contention perspective weighting preprocessing module 3315 is illustrated in FIG. 31, and corresponds to the method of processing the weights by the cost expenditure viewpoint weighting preprocessing module 3311 and the citation viewpoint weighting preprocessing module 3313. Soy.

The dispute perspective weight preprocessing module 3315 obtains at least one or more patent document information (S3120), and at least dispute-related in patent document information obtained using a counting preprocessing module 3100 or through a patent DB or a search index. Obtain a counting result value for each of one or more predetermined counting criteria (S3130), obtain a weight for each counting reference with reference to the patent information processing policy database 2330 (S3140), and count for each counting criterion and for each counting criterion A dispute perspective weight value is generated as a counting result value (S3150), and the generated weight value is stored in a patent DB or a search index along with a unique document number of patent document information (S3160).

That is, the method of processing the weights by the dispute viewpoint weighting preprocessing module 3315 performs counting on the number of disputes, and obtains the weight for each counting number from the patent information processing policy database 2330 to determine the dispute viewpoint weighting value. It is essential to generate.

Intensive Perspective Weighted Preprocessing Module (3317)

At a certain point in time, it is likely that the technical field, which is concentrated by several actors, is an important technical field. It is rare for an applicant to apply evenly to various technical fields, and apply for a large number of places where he considers important and where technology investment is concentrated, and defensively a small number of places where it is considered to be less important. Most of them are. Therefore, in the technical field to which one application belongs, many applicants file a lot more than 1) the number of applications, the rate of increase or the rate of increase of the application, 3) the number of applicants, 4 If the market share fluctuates outside the preset range, the technical field is likely to be an important technical field. The field of focus of several applicants will be measurable by such analytical factors as technology attractiveness, rate of increase, rate of increase, change in market share, and the like. At this time, it is preferable that the technical field of this paragraph grasp the layered patent classification code included in patent documents such as IPC, USPC, FI, FT, ECLA, etc. in each hierarchical unit. Of course, it would be more desirable to automatically include the lower patent classification code to calculate the numerical value for each analysis element. That is, when H04B 7/26 is an IPC, numerical values for various analysis elements for this IPC may be calculated, and numerical values for various analysis elements may be calculated in view of H04B 7/00. In this case, it may be more preferable that other patent classification codes belonging to the lower patent classification code of H04B 7/26 are also included in the calculation. The concentration and weight pretreatment module 3317 according to the present invention performs grasping the existence and the numerical value of the weighting elements from the viewpoint of concentration and assigning the weight score to each weighting element.

The manner in which the concentrated viewpoint weight preprocessing module 3317 processes the weight is similar to the manner in which the expense aspect weight preprocessing module 3311 and the citation viewpoint weight preprocessing module 3313 process weights. That is, the bibliographic information on each individual document is used to measure the value of the patent information analysis index including the meaning of concentration such as the degree of concentration, activity, and occupancy of the applicant / patent in the technical field, and the weight of each value is assigned to the patent information. Obtained from the processing policy database 2330, the concentration perspective weight value is generated.

A method of processing the weights by the centralized viewpoint weighted preprocessing module 3317 is illustrated in FIG. 32. Soy.

The concentrated perspective weight preprocessing module 3317 obtains at least one or more patent document information (S3220), obtains applicant information and patent technology classification information from the patent document database 2310 (S3230), and obtains the applicant information and patent At least one criterion of the applicant's concentration / activity / occupation rate of the patent technology classification obtained on the patent technology classification code system or at least one or more higher patent technology classification codes by referring to the technology description code DB with the technology classification information as a value. The value is calculated as (S3240), and weight information on concentration / activity / occupancy rate for each criterion is obtained from the patent information processing policy database 2330 (S3250), and the weight and concentration for each criterion are concentrated. A viewpoint weight value is generated (S3260), and the generated weight value is combined with a unique document number of patent document information. Save the DB and the search index (S3270).

The centralized viewpoint weighting preprocessing module 3317 may process weights in inventor units other than the applicant, and a method of processing the weights is illustrated in FIG. 33. The centralized viewpoint weighting preprocessing module 3317 obtains at least one or more patent document information (3320), obtains inventor information and patent technology classification information from the patent document information (S3330), and obtains the inventor information and the patent technology classification information. The concentration of the inventor with respect to the patent technology classification or at least one or more higher patent technology classification symbols obtained on the patent technology classification symbol system with reference to the patent technology classification symbol DB is calculated as a value (S3340), and each Obtain weighting information on the concentration of each reference (S3350), generate a weighted viewpoint weight value with the weight of each reference and the concentration result (S3360), and generate the weighted value with the unique document number of the patent document information patent DB or It is stored in the search index (S3370).

Subject Unit Weight Preprocessing Module (3330)

When there is a patent document, if the subject involved in the patent document is an important subject, the patent filed by the subject is most likely an important patent. The key is to determine which subject can be more important. Subjects included in one patent document may be an applicant, an inventor, and an agent. Performing a function of preprocessing the weight of the document with respect to one patent document from the viewpoint of the subject is called subject unit weight preprocessing module 3330. As shown in FIG. 4, the subject unit weight preprocessing module 3330 includes the applicant unit weight preprocessing module 3331, the inventor unit weight preprocessing module 3333, and the agent unit weight preprocessing module 3335 according to the type of the subject.

Applicant Unit Weight Preprocessing Module (3331)

If the technical field included in a specific document is a technical field focused by the applicant of the document, the importance of the application will be high. The field of focus for the applicant of a particular document may be measured by analysis factors such as concentration rate, market share, and AI. Applicant unit weight preprocessing module 3331 of the present invention determines the numerical value of the weighting element from the viewpoint of the analysis element as described above, and assigns a weight score to each weighting element.

Applicant unit weight preprocessing module 3331 is shown in Figure 34 the way the weight is processed. The applicant unit weight preprocessing module 3331 obtains reference information for processing weights in the applicant unit (S3420), and at least one document unit weight preprocessing module 3310 is applied to documents in the applicant's name that meet the criteria. Obtain the calculated result value (S3430), and obtain weight information for each document unit weight preprocessing module 3310 from the patent information processing policy database 2330 (S3440), and the weight of each document unit weight preprocessing module 3310 And the applicant unit weight value for each criterion obtained as each result value (S3450), and the generated weight value is stored in the patent DB or search index together with the unique document number of the patent document information together with the reference or independently (S3460). ).

Inventor Unit Weight Preprocessing Module 3333

If the technical field included in a specific document is a technical field focused by the inventor of the document, the application is likely to be important. The field of focus for the inventor of a particular document will be measurable by such factors as the concentration rate, share, and AI (formula is the same as when replacing the inventor in the applicant's formula) with that inventor's criterion. The inventor unit weight preprocessing module 3333 of the present invention performs the identification of the numerical value of the weighting element from the viewpoint of the analysis element as described above and assigning the weighting score to each weighting element.

The inventors' weight preprocessing module 3333 processes weights is illustrated in FIG. 35. The inventor unit weight preprocessing module 3333 obtains reference information for processing the weight in inventor units (S3520), and at least one document unit weight preprocessing module 3310 is applied to documents in the inventor's name that meet the criteria. Obtain the calculated result value (S3530), and obtain weight information for each document unit weight preprocessing module 3310 from the patent information processing policy database 2330 (S3540), and the weight of each document unit weight preprocessing module 3310 And the inventor unit weight value for each criterion obtained as each result value is generated (S3550), and the generated weight value is stored in a patent DB or a search index together with the unique document number of patent document information together with the criteria or independently (S3560). ). The weight information may include a policy such as "registration rate of the previous total application * 0.1 + number of foreign application families * 0.5".

Deputy Unit Weight Preprocessing Module (3335)

If the technical field included in a particular document is a technical field focused on the agent of the document, the completeness of the patent specification will be higher than that of the agent. Therefore, the area of focus for a particular document's agent may be measurable by analytical factors such as concentration rate, share, and AI (formula is the same as when replacing an agent in an applicant-based formula). will be. Determining the numerical value of the weighting element from the viewpoint of the analysis element as described above, and assigning the weight score to each weighting element is performed by the agent unit weight preprocessing module 3335 of the present invention. The weight of the agent unit may be less important than the weight of the applicant unit or the weight of the inventor unit.

The manner in which the agent unit weight preprocessing module 3335 processes the weight is illustrated in FIG. 36. The agent unit weight preprocessing module 3335 obtains reference information for processing the weight in agent units (S3620), and at least one document unit weight preprocessing module 3310 is applied to documents in the name of an agent meeting the criteria. Obtain the calculated result value (S3630), and obtain weight information for each document unit weight preprocessing module 3310 from the patent information processing policy database 2330 (S3640), and the weight of each document unit weight preprocessing module 3310 And generate the agent unit weight value for each criterion obtained as each result value (S3650), and store the generated weight value in the patent DB or search index together with the unique document number of the patent document information together with the criteria or independently (S3660). ). The weight information may include a policy such as "Registration Per Application * 0.3".

The document unit weight preprocessing module 3310 and the subject unit weight preprocessing module 3330 of the present invention may assign a predetermined weight to the weighting elements obtained by the at least one or more weight preprocessing modules 3300 as described above. Calculate the weight of. In this case, each weighting module of each viewpoint or each weighting module for each subject may calculate a weight of a document unit in its own viewpoint by assigning a predetermined weight to the weighting factor obtained by the subject. Each of the above weights may be given differently according to the input of the administrator or the user.

Family Information Preprocessing Module (3800)

A patent family is a collection of document information consisting of documents that are directly related to a specific patent document, either domestically or internationally. Usually within one country, there are conditions that define the scope of the family in each country, such as 1) a split application, 2) a change application or a dual application, and 3) a national priority claim application (some continuing applications in the US, a reissued patent, etc.). May be slightly different), etc. form a domestic patent family. Each country's application and 3), when 1) an international application (PCT), 2) a treaty priority application, or 3) said 1) or 2) are filed with a patent office in a particular country, usually based on a single application. (1) Split application, (2) Modified or double application, (3) Domestic priority claim application (some continuing patent applications in the United States, reissued patents, etc.). Etc.) form an international patent family. The configuration of the family information preprocessing module 3800 for preprocessing the patent family information of the present invention is well illustrated in FIG. In order to process the family information, a family information preprocessing engine 3810 that processes the information is required, and various DBs for obtaining the family information are required. Examples of necessary DBs may include treaty priority information DB 3671, PAJ DB 3673, KPA DB 3675, Inpadoc DB 3677, and other family information DB 3830. In particular, Inpadoc DB 3677 plays an important role.

The family information preprocessing module 3800 is closely related to the processing and updating of the patent information database 2300. The reason is that the patent information is 1) new documents are continuously published, 2) most of them are obtained at the national level, and new documents are continuously issued for each of the countries, so the family information is described in 1) and //. Or it may change at any time according to 2). That is, the family information needs to be updated when the documents of 1) or 2) are obtained, and updating of the family information when the documents of 1) or 2) is obtained is performed by the family information preprocessing module 3800 of the present invention. do. The family information can be discovered through the existence of a specific application number in original application information or priority information for an existing document or a new document.

37 illustrates a method in which the family information preprocessing engine 3810 of the family information preprocessing module 3800 processes family information. The family information preprocessing module 3800 obtains at least one or more patent document information (S3720), and determines whether the patent document information includes family information such as a priority claim number, a division application, a change application, or a partial continuing application (S3720). S3730), if there is family information, the information of the patent document is stored in the patent DB or search index in association with the unique document number of the family patent document corresponding to the family information (S3740), and the country of the selectively obtained patent document The number of pieces of family information is counted and stored, or when there is information on the number of family information in the unique document number of the family patent document, it is added to the number (S3750).

Citation Information Preprocessing Module (3400)

The types of patent citation information may include 1) prior art citation information that the applicant cites other patents as prior art and 2) verifiable citation information that cites the patent as citation reference cited by the examiner when examining a particular patent document. have. Of course, the citation will naturally occur at home and abroad. In general, citation of another patent as the first prior art is in prior art document information in Korea or Japan, and in reference information in the United States. Such prior art citation information can be obtained from the bibliography or text of the patent document. In addition, many countries publish verifiable citations, which can be found in public information published by the Office. In the present specification, the prior art citation information will be mainly described, but if the obtained true citation information can be treated like the prior art citation information, the above description may be equally applicable.

Preprocessing the prior art citation information and the reference citation information is performed by the citation information preprocessing module 3400 of the present invention, and as shown in FIG. 5, the citation information preprocessing module 3400 preprocesses the prior art citation information. Prior art citation information preprocessing engine 3410 and a proof citation information preprocessing module 3430 for preprocessing the citation information. Since a citation or text of a specific document generally includes forward citation, the document information about the forward citation is stored in the search index or the specific document information of the specific document. However, the forward citation of the specific document is not stored in the specific document information, but is stored in the search index of the document citing the specific document or the document information citing. Therefore, there is a need to find and store back citations for the particular document in association with the particular document, and this function is performed by the prior art citation information preprocessing engine 3410.

The prior art citation information preprocessing engine 3410 queries the search index or the DBMS 2100 with the application number of the specific document or the unique number value of the specific document, so as to be rearward of the specific document quoting the specific document. Citation information can be obtained. The prior art citation information preprocessing engine 3410 may include the obtained back citation information of the specific document in the index during the indexing of the specific document, and the patent information database 2300 may include the specific document. It can be stored as backward citation information. Forward citation information is almost unchanged (it is written at the time of the applicant's departure, and there may be occasional additions, but the addition of forward citations is rare). Back citation information is always updated when patent information is updated. Information to be monitored. Therefore, when a new patent document occurs and the search index is updated or the patent information database 2300 is updated, the prior art citation information preprocessing engine 3410 has an updated patent document citing the specific document. To update the back citation information.

However, in the case of updating the back-quote information by querying the search index update or the patent information database 2300 as described above, a huge number of queries must be performed at each update. The application number or the unique number of all the specific documents should be queried.) Therefore, the prior art citation information preprocessing engine 3410 may update a new patent document regarding the specific document. If citation information (front citation) is found, the new patent document information is added as the back citation information to the information related to the specific document. Preferably, the information relating to the specific document is a search index relating to the specific document or a record relating to the specific document on the patent information database 2300. That is, the prior art citation information preprocessing engine 3410 obtains forward citation information included in the new patent document when obtaining a new patent document, and searches for a document number citing based on the document number being cited. The document information regarding the document number being cited in the index or patent information database 2300 is stored. When the method described in this paragraph is taken, the forward citation information included in the new patent document information is utilized, so that the consumption of computational resources can be drastically reduced.

In this case, the citation information may be different in the notation method such as the application number, registration number, or publication number for each person who displays the citation information. In other words, even if the same document (document unique number # 1) is cited with the application number in the A document, the publication number in the B document, and the registration number in the C document, there is an error in the processing of the citation information. Is more likely to occur. In order to find other document information quoting the document unique number # 1, a problem arises in which a different document number of all attributes related to the document unique number # 1 must be inquired once.

Therefore, the prior art citation information preprocessing engine 3410 of the present invention will need to map the obtained citation information to one document unique number independently of the attribute of the citation information obtained, and the document number as the citation information. It is necessary to represent. That is, when the document unique number is an application number, the application number is separately cited as the representative information for obtaining the application number having the publication number or registration number, regardless of whether the cited information obtained is a publication number or a registration number. Information can be managed, and accordingly, citation analysis and counting can be processed based on the cited representative number. That is, the representative name of the citation information can be managed. This is especially important because the United States has introduced patent publications. Process the same document internally for the citation information in some form. For this purpose the application number is most preferred.

In this case, the representative citation information may be represented by a publication number or "country name + publication number", but may be represented by an application number or "country name + application number", or is preferable. In the case of a registration number, there is a possibility that an unregistered document may occur, and a publication number (document issue number) also has a problem that a publication number occurs whenever an application publication number or a registration publication number or other publication occurs.

The manner in which the prior art citation information preprocessing engine 3410 and the reference citation information preprocessing module 3430 operate is almost the same. The reference citation information preprocessing module 3430 also records information related to the specific document (a search index or a record for the specific document information in the patent information database 2300) when a specific document is cited as a reference citation in a new patent document. ) Stores the application number or the unique number of the new patent document.

A citation information preprocessing method representing a citation number is described in detail in FIG. 38. The citation information preprocessing module 3400 receives at least one citation number existing in a specific document (S3820), obtains a citation number whose attribute of the citation number is not a preset citation number attribute (S3830), and obtains the citation number. Query the acquired citation number to the search engine 7000 or the DBMS 2100 to obtain a citation number of the predetermined attribute (S3840), and represent the obtained citation number to the obtained citation number of the preset attribute. (S3850).

After acquiring the back-cited document information, which is information on the post-application document citing a specific document, it is necessary to include the back-cited document information in the document information of the specific document, and an exemplary method of this process is illustrated in FIG. 39. Is shown.

The citation information preprocessing module 3400 obtains specific document data (S3920), obtains at least one or more of an application number, a registration number, and a publication number included in the specific document data (S3940). Query the citation field of the search engine 7000, or query by defining the citation field with the DBMS 2100 (S3950), obtain back citation information as the query result (S3960), and document the back citation information. Include in the bibliographic data (S3970).

Patent classification code preprocessing module (3500)

The patent classification code information and the title information of the above-described patent classification information correspond to 1: 1, and in the case of IPC, the upper and lower hierarchical information, which cannot be represented by the patent classification code, is represented by the number of dots in the subgroup or less. . In the case of IPC, it is difficult to know the upper and lower relations only by the patent classification code information below the subgroup. Therefore, the upper and lower hierarchical information is grasped by using the dots included in the title information corresponding to the patent classification code information. That is, below the subgroup, by identifying the dot structure included in the title, the upper and lower hierarchical structures between the patent classification symbols below the subgroup are identified. The upper and lower hierarchies between the patent classification codes have the form of a tree structure.

In the present invention, a tree structure between the patent classification symbols will be described using the IPC 7th edition standard main group H04B 7/00 (the title is a wireless transmission system) and the patent classification symbols corresponding to the lower part thereof. And the description is not limited to the present embodiment, and is applied equally or equally to the entire IPC area, as well as other patent categorization system including the upper and lower levels of the hierarchy as a dot structure in the title (for example, For example, USPC, FI, FT, or ECLA) may be applied in the same or equivalent manner.

The patent classification code and its title corresponding to the main group H04B 7/00 and the lower part thereof have the following configuration as of May 5, 2006 based on the IPC 7th edition.

H04B 7/00 Radio transmission systems, ie using radiated electromagnetic fields

H04B 7/005 Control of transmissions; Equalization

H04B 7/01 .Reduction of phase shift

H04B 7/015 .Reduction of echo effects

H04B 7/02 Diversity System

H04B 7/04 .. using plural independent aerial lines

H04B 7/06 ... in the sending country

H04B 7/08 ... in the receiving country

H04B 7/10 .. using single airborne systems characterized by polarization or directional characteristics

H04B 7/12 ..Frequency diversity system

H04B 7/14 relay system

H04B 7/145 ..Manual relay system

H04B 7/15 ..Active relay system

H04B 7/155 ... groundbased stations

H04B 7/165 using angle modulation

H04B 7/17 .... using pulse modulation

H04B 7/185 ... space-based or airborne stations

H04B 7/19 .... earthsynchrenons stations

H04B 7/195 .... asynchronous station

H04B 7/204 ... multiple access

H04B 7/208 .... Frequency division multiple access

H04B 7/212 .... Time division multiple access

H04B 7/216 .... Code Division or Spread-Spectrum Multiple Access

H04B 7/22 .Scattered wave propagation system

H04B 7/24. For communication between two or more points

H04B 7/26. At least one point being moved

When the tree hierarchical structure is made easier based on the dot, it can be expressed as shown in the following table.

Main group 1-dot subgroup 2-dot subgroup 3-dot subgroup 4-dot subgroup title H04B 7/00 Wireless transmission system H04B 7/005 Control of transmission; Equalization H04B 7/01 Reduction of phase shift H04B 7/015 .Reduction of echo effects H04B 7/02 Diversity system H04B 7/04 .. using multiple independent aerial lines H04B 7/06 ... in the sending country H04B 7/08 ... in the receiving country H04B 7/10 Using single airborne systems characterized by polarization or directional characteristics H04B 7/12 Frequency Diversity System H04B 7/14 Relay system H04B 7/145 ..Manual relay system H04B 7/15 ..Active relay system H04B 7/155 ... groundbased stations H04B 7/165 Using angle modulation H04B 7/17 Using pulse modulation H04B 7/185 Space or Aircraft Bureau H04B 7/19 .... Earth Station H04B 7/195 .... asynchronous station H04B 7/204 ... multi-access H04B 7/208 Frequency Division Multiple Access H04B 7/212 .... Time Division Multiple Access H04B 7/216 Code Division or Spread-Spectrum Multiple Access H04B 7/22 Scattered wave propagation system H04B 7/24 For communication between two or more points H04B 7/26 .. at least one point being moved

The patent classification code preprocessing module 3500 of the present invention includes a patent classification code preprocessing engine 3510 and a preprocessed hierarchical patent classification code database 10000 processed by the patent classification code preprocessing engine 3510. Of course, the patent classification code preprocessing engine 3510 of the present invention preprocesses at least one or more types of patent classification codes by utilizing the patent classification code database 10000 of the present invention. The kind of patent classification code preprocessing of this invention is largely different. First, a hierarchical patent classification code database having a hierarchically integrated structure for all patent classification codes belonging to a specific patent classification code system by reflecting a dot structure included in title information corresponding to a patent classification code ( 10000). (The hierarchical integrated structure means that when a given patent classification symbol is given, the lower patent classification symbols of the patent classification symbol can be automatically extracted.) If the search expression or DB query (query) for the search engine 7000 includes a patent classification code, a modified search expression or a modification query (query) including all patent classification codes below the patent classification code. To generate. Third, the patent classification code system is modified to support a range search in order to speed up the search or query response, and the present invention includes the modified patent classification code system for searching, query response, analysis, and monitoring. A method of creating, managing and utilizing a modified patent classification code system for using the modified patent classification code wherever the patent classification code is used.

The patent classification code preprocessing engine 3510 of the present invention is a hierarchical patent classification code database generation module, wherein the module includes patent classification code information and title information containing technical contents corresponding to the patent classification code information. For the classification information data, a hierarchical patent classification code database including a tree structure between patent classification codes is generated. The hierarchical patent classification code database may be an example of a hierarchical patent classification code database because it is generated by reflecting a hierarchical structure between patent classification codes.

The hierarchical patent classification code database generation module may include a patent classification code except for the highest patent classification code (eg, section display patent classification code in the case of IPC and class display patent classification code in the case of USPC). The upper patent classification code to which the patent classification code belongs is matched (1: 1) or the lower patent classification code corresponding to the lower part of the classification code with respect to the one patent classification code (1: n) Perform the function you have set. While both are computationally feasible, the electronic method of creating a parent 1: 1 relationship corresponding to one patent classification child is more reasonable. All of the patent classification codes establish a relationship with each other in the tree structure by the above correspondence.

The former is a method of mapping a parent to a child, and the latter is a method of mapping a parent to children belonging to the parent. Both can be used to find the children belonging to the parent. The first is to find the child pointing to the parent when the parent is given, and the latter is stored directly because the children belonging to the parent are stored directly. You can use Therefore, the former saves the child-parent relationship 1: 1 based on the child, and the latter directly stores the immediate children belonging to the parent around the parent.

The method of generating the hierarchical patent classification code database by the hierarchical patent classification code database will be described below based on IPC classification.

1) From the section to the main group, a hierarchical patent classification code database is created according to the classification code system, and its own parent information is stored for itself, its own upper and lower patent classification codes, or its own child information is stored. Save it.

2) For the main group patent classification code, for all patent classification codes before the next main group patent classification code is found, the patent classification code for which the title corresponding to the patent classification code has one dot is found. The main group patent classification code is usually easy to find because 00 is combined after the slash (^ / ^). In the case of child-> parent (the way the child points to its only parent), each patent classification symbol in the 1-dot subgroup with one dot stores the patent classification symbol of the main group which is its only immediate parent. . In the case of parent-> child (a method of storing all children under the child), the patent classification code of the 1-dot subgroup having one dot belonging to the main group is associated with the patent classification code representing the main group. Save it.

At this time, the main group itself, its own subordinate patent classification code is stored its parent information, or its own child information.

3) For a patent classification code having one dot, a patent classification code having two dots in the title is searched for all the patent classification symbols belonging to the same main group and before the patent classification symbol having one dot. If there is no other patent classification code that belongs to the same main group and has one dot in the title (one subgroup in the main group or the last subgroup in the subgroups), the title has one dot in the title. A patent classification code having two dots in the title is found among all the patent classification symbols before the patent classification symbol and the patent classification symbol indicating the next main group. The way to save its parent and child is the same as in 2) above.

4) With respect to the patent classification code having two dots in the title, a patent classification code having three dots in the title is found by the same logic as in the above 3), and processed in the same manner as in the above 3).

Another hierarchical patent classification code database generating module provides a method for generating the hierarchical patent classification code database as follows.

You can do the following by looking up its parent, as the IPC moves up from the bottom of the table in order (record number): 1) The number of dots in the title information corresponding to the bottom patent classification code is checked, and the number of dots in the title of the patent classification code in the record number (just above IPC) with its own record number -1 is checked. If the number of dots is one, it is its own parent. If the number of dots is the same, it is at the same level as itself. If the number of dots is more than its own, it is determined that it is not directly above or below it, and it is stored only for its own parent. If a patent classification code of a subgroup or more is encountered, the patent classification code of the sub group or more is stored as its parent.

2) If the number of dots in the title of the patent classification code in the record number of the own record number -1 is equal to or greater than itself or the patent classification code is more than the subgroup, the parent relationship is ignored, and the self record number -1 2) is performed on the patent classification code of the record number.

In the above two embodiments, a method of generating a hierarchical patent classification code database has been presented. However, this is only an example, and includes parent information or child of own IPC for all IPCs. Generating information will be readily available to those skilled in the art of developing computational systems.

The hierarchical patent classification code database generation module generates a hierarchical patent classification code database when a given patent classification code exists, and one embodiment thereof is as follows.

For the patent classification code below H04B7 / 00, an embodiment of the implemented results of both methods is presented.

First, a result is obtained by matching a child patent classification code with parent (child-> parent), which is the immediate classification code to which the classification code belongs.

Child Parent (his parent) H04B 7/005 7/00 H04B 7/01 7/00 H04B 7/015 7/00 H04B 7/02 7/00 H04B 7/04 H04B 7/02 H04B 7/06 H04B 7/04 H04B 7/08 H04B 7/04 H04B 7/10 H04B 7/02 H04B 7/12 H04B 7/02 H04B 7/14 7/00 H04B 7/145 H04B 7/14 H04B 7/15 H04B 7/14 H04B 7/155 H04B 7/15 H04B 7/165 H04B 7/155 H04B 7/17 H04B 7/155 H04B 7/185 H04B 7/15 H04B 7/19 H04B 7/185 H04B 7/195 H04B 7/185 H04B 7/204 H04B 7/15 H04B 7/208 H04B 7/204 H04B 7/212 H04B 7/204 H04B 7/216 H04B 7/204 H04B 7/22 7/00 H04B 7/24 7/00 H04B 7/26 H04B 7/24

Next, an example of the result of a method of having all child information about its own child (parent-> child) is presented.

Parent Child (own child) H04B 7/00 H04B 7/005 H04B 7/01 H04B 7/015 H04B 7/02 H04B 7/14 H04B 7/22 H04B 7/24 H04B 7/005 null H04B 7/01 null H04B 7/015 null H04B 7/02 H04B 7/04 H04B 7/10 H04B 7/12 H04B 7/04 H04B 7/06 H04B 7/08 H04B 7/06 null H04B 7/08 null H04B 7/10 null H04B 7/12 null H04B 7/14 H04B 7/145 H04B 7/15 H04B 7/145 null H04B 7/15 H04B 7/155 H04B 7/185 H04B 7/204 H04B 7/155 H04B 7/165 H04B 7/17 H04B 7/165 null H04B 7/17 null H04B 7/185 H04B 7/19 H04B 7/195 H04B 7/19 null H04B 7/195 null H04B 7/204 H04B 7/208 H04B 7/212 H04B 7/216 H04B 7/208 null H04B 7/212 null H04B 7/216 null  H04B 7/22 null H04B 7/24 H04B 7/26 H04B 7/26 null

Second, the lower layer patent classification code processing module, for the patent classification code obtained through a search expression input by a user, the lower hierarchy patent classification code dependent on the obtained patent classification code through the hierarchical patent classification code database. It is responsible for finding out.

In order for a patent document corresponding to a lower patent classification code to be included in a search result, at least one of the following three methods is required, and the lower layer patent classification code processing module performs the above operation. To perform.

First, the hierarchical patent classification code database finds all of the lower hierarchy patent classification codes of the patent classification code obtained on the basis of the acquisition time point. Patent classification symbols in a hierarchical patent classification symbol database have a tree structure, which makes it possible to find them. If the received search expression includes a specific patent classification code, it is possible to find all patent classification codes of the lower layer of the patent classification code along the tree structure, and transmit the result to the modified search expression generation module. , The modified search expression generation module may generate a new search expression reflecting all received patent classification codes and query the search engine 7000.

Second, the lower layer patent classification symbols are found, matched (stored in a matching table) for all patent classification symbols in advance, and when a specific patent classification symbol is found in the search expression obtained, the specific patent classification symbol is matched with the specific patent classification symbol. Lower layer patent classification codes may be immediately sent to the modified search expression generation module.

There may be two broad ranges of the lower layer patent classification code extracted by the lower layer patent classification code extraction module. One is a method of extracting only the patent classification code immediately below the obtained patent classification code, and the other is a method of extracting all lower patent classification codes that depend on the obtained patent classification code. At this time, even when extracting only the subordinate patent classification symbols, the subordinate patent classification symbols are extracted again for each of the extracted subordinate patent classification symbols, and the method is subordinated to the patent classification symbols obtained by repeating such a method. All subpatent classification symbols can be extracted.

For example, when the patent classification code included in the search expression is H04B 7/15, the subordinate patent classification code is H04B 7/155, H04B 7/185, and H04B 7/204, and all subordinate patent classifications. Symbols H04B 7/155, H04B 7/165, H04B 7/17, H04B 7/185, H04B 7/19, H04B 7/195, H04B 7/204, H04B 7/208, H04B 7/212, H04B 7 / 216.

It will be apparent to those skilled in the art that the above-described direct patent classification code and all lower patent classification codes can be easily extracted directly or recursively from the child-> parent correspondence or from the parent-> child correspondence. Of course it will.

The lower layer patent classification code extracting module combines and stores the extracted lower layer patent classification code. When the patent classification code included in the above search expression is H04B 7/15, ^ H04B 7/15, H04B 7/155, H04B 7/185, and H04B 7/204 ^ are stored when only the lower patent classification code is stored. And save all lower patent classification symbols ^ H04B 7/15, H04B 7/155, H04B 7/165, H04B 7/17, H04B 7/185, H04B 7/19, H04B 7 / 195, H04B 7/204, H04B 7/208, H04B 7/212, H04B 7/216 ^ will be stored together.

Third, the modified search expression generation module generates the modified search expression by integrating the associated patent classification code with the original existing search expression. The integration is slightly different in the case of range search and in some other cases. First, the case of non-range search will be described.

In the existing search formula including the patent classification code, at the position where the patent classification code was located, the patent classification code and the extracted lower layer patent classification code are grouped in an OR relationship, and the bundled patent classification code is used. It can be done in a way that replaces the patent classification symbol positions of the original existing search expression. In this case, if two or more patent classification codes are included in the original existing search expression, it is natural that the above patent classification codes may be integrated for each patent classification code.

For example, if the given search expressions are ^ {keyword = wireless and active} and {applicant = Samsung Electronics} and {IPC = H04B 7/15}, the modified search expression generation module may perform IPC H04B 7 / In search of 15, obtain and coalesce the immediate or all sub-patent classification symbols, ^ {Keyword = Wireless and Active} and {Applicant = Samsung Electronics} and {IPC = H04B 7/15 OR H04B 7/155 OR H04B 7 / 185 OR H04B 7/204} or ^ {Keyword = Wireless and Active} and {Applicant = Samsung} and {IPC = H04B 7/15 OR H04B 7/155 OR H04B 7/165 OR H04B 7/17 OR H04B 7 / 185 OR H04B 7/19 OR H04B 7/195 OR H04B 7/204 OR H04B 7/208 OR H04B 7/212 OR H04B 7/216} Preferably the latter search equation is good.

Summarizing the role played by the lower layer patent classification code processing module, when the patent classification code is included in the obtained search expression, the information related to the lower layer patent classification code of the patent classification code is found and the modified search expression generation module is processed. Let me do it. Of course, if the patent classification code of the search expression obtained can be processed by a truncator such as in the case of IPC or more than the main group, the lower layer patent classification code processing module does not need to find the lower patent classification code. For example, when only H04B7 / 00 or H04B is obtained, it is possible to process H04B7 / * or H04B *.) Therefore, in the case of IPC, the lower layer patent classification code processing module has a dot in the subgroup, that is, in the title information. It is more useful when there is one, and it can also be useful when determining the position on the classification system by the number of dots in other classification system.)

The search engine 7000 receives a search expression including a patent classification code from a user's computer. When the patent classification code included in the obtained search expression includes a dot in title information, the patent classification code is included. The lower patent classification code is acquired on the patent classification code system through the preprocessing engine 3510, the obtained patent classification code is ORed, the modified search expression including the lower patent classification code enclosed by OR is generated, and the modified search is performed. Perform a search like this. Each step is as described above.

If there is an insertion, deletion, or relocation in the patent taxonomy, the insertion can be treated similarly to the concept of adding a new word at a specific place in the dictionary, and the deletion can be handled by removing the word. In the case of relocation, it can be treated as a combination of insertion and deletion. Of course, whenever there is an insertion, deletion or relocation, the entire database can be updated or recreated for the entire changed patent taxonomy.

In the above, the description has been focused on generating a modified search expression by enclosing the lower patent classification codes in OR. Meanwhile, the conventional search engine 7000 supports range searching. Next, a method of processing a patent classification code for supporting a range search, rather than a method of finding and grouping the lower patent classification codes by an OR, will be described. The method does not find each of the lower layer patent classification symbols of the acquired patent classification code separately but in the form of a range on the patent classification code system of the lower hierarchy patent classification codes. In particular, the range retrieval ensures even greater retrieval speed for retrieval of materials in dictionary order.

The reason for finding ranges on the patent classification code system of lower layer patent classification codes is that conventional search engines support range search, which is much faster than finding each one within that range. . For example, in the case of H04B 7/15, H04B 7/15 and H04B 7/155, H04B 7/165, H04B 7/17, H04B 7/185, H04B 7/19, H04B 7/195, It is better to query H04B 7/204, H04B 7/208, H04B 7/212, H04B 7/216 from H04B 7/15 to H04B 7/216 than to query the search engine (7000). You can get search results returned much faster. In particular, the more sub-layer patent classification codes, the greater the difference in search speed.

However, the representative requirements of the preconditions necessary for the range search should be arranged in alphabetical order of the patent classification symbols in the search index found by the search engine 7000. Therefore, if the patent classification symbols are arranged in alphabetical order, the classification symbols may be put in the search index as they are. Otherwise, a separate classification system should be made in which the classification symbols are arranged in the alphabetical order and put into the search index. The former is called direct injection type and the latter is called deformation input type. The representative patent classification code system of the direct input type is IPC, and the representative patent classification code system to be modified and input is USPC. Of course, the IPC can be made into a modified input with a slight modification. The separate classification system is called a modified patent classification code system.

FIG. 41 is a patent classification code preprocessing engine 3510 for processing a modified patent classification code, and displays symbols on the patent classification code system for at least one patent classification code system selected from among IPC, USPC, FI, FT, and ECLA. Instead of using it as it is, it is characterized by utilizing a modified patent classification code to support a range search.

The modified patent classification code preprocessing engine 3510 of the present embodiment generates the modified patent classification code system, processes the lower patent classification code by using the modified patent classification code system, and modifies and retrieves the search expression that is obtained. Function to generate an expression. The modified patent classification code preprocessing engine 3510 includes a modified patent classification code database generation module, a modified patent classification code utilization lower layer patent classification code processing module, and a modified patent classification code utilization modified search expression generation module.

In order to support the range search more smoothly, even in the case of the direct input type, the matching table can be used to transform the modified input type. For example, the IPCs such as H04B 7/005, H04B 7/01, and H04B 7/185 may be modified as H04B70000050, H04B70000100, H04B70000185 and the like, respectively. Modification rules may vary, but according to the present exemplary embodiment, four digits are allocated to a group and four digits are assigned to a sub group. It is preferable to accept the classification system related to the class as it is.) Of course, the modified input patent classification symbol can be generated by allocating the corresponding digit when there is an expansion symbol or the like under the sub group such as FI. . Therefore, in the case of having a direct input patent classification code system, the matching table can generate a modified patent classification code system even with a very simple rule.

On the other hand, even if it does not have a direct input patent classification code system like the USPC, it is possible to generate a matching table. A method of generating a matching table for the USPC will be described later. Generating the modified patent classification code system as described above is the modified patent classification code database generation module This is in charge. The modified patent classification code system generated by the modified patent classification code database generation module is stored in the modified patent classification code database.

The modified patent classification code preprocessing engine 3510 correspondingly assigns the classification symbols on the modified patent classification code system 1: 1 by one to the classification symbols on a given classification system, and assigns the modified patent classification code system to which the indexer is assigned. To build a search index. When a search expression is inputted into the given patent classification code system of the user, the modified search expression generation module finds a modified patent classification code corresponding to the input patent classification code, and conducts a search to derive a search result. Serve It is not necessary that the modified patent classification code appear in the search results.

Hereinafter, a process of performing a range search will be described in more detail. This range search is applied not only to IPC but also to other patent classification codes such as USPC. It is important to find the next silbing on the tree structure of a given patent classification code in order to automatically find the subordinate patent classification code dependent on the given patent classification code and perform a range search. That is, the range of the patent classification code to be searched is greater than or equal to the given patent classification code and becomes the next silbiing. The same applies to the modified patent classification code.

The IPC classification system can be regarded as a representative patent classification system of direct input type when the subgroup notation is treated as a string rather than a number. Thinking like a dictionary, H04B 7/005 is followed by H04B 7/01, H04B 7/02 is followed by H04B 7/12, and H04B 7/185 is followed by H04B 7/19. In this case, if there is H04B 7/02 in the search expression obtained, H04B 7/04, H04B 7/06, H04B 7/08, H04B 7/10 below it in the hierarchical patent taxonomy database containing the tree structure. , Find H04B 7/12. The finding method can be used recursively until the next sibling. An example of this method is described in more detail: when there is a specific patent classification code, it finds its parent in the tree structure, the parent has children, and finds the next child among them. More specifically, the next sibling of H04B 7/02 becomes H04B 7/15. At this time, to find the lower patent classification code of H04B 7/02, first find H04B 7/15 that becomes the next sibling, and then ask all patent classification codes that are larger than H04B 7/02 and smaller than H04B 7/15. .

In this case, if next silbing is on a node / layer other than its parent parent / layer (for example, next sibling of H04B 7/15 (two dots) is H04B 7 /) H04B 7/22 (1 dot), which is not a descendant of 14, but a descendant of the parent of the parent, next sibling is null, in this case when the parent node / hierarchy is not null recursively. Just look for the next sibling of the parent hierarchy / node.

Next, the USPC will be described in more detail. USPC, USPTO's patent technology classification system, has no dot structure and makes it difficult to grasp the relationship between the subclasses and the correlations only by the number of subclasses. In other words, unlike the IPC, the USPC is arranged irrespective of the alphabetical order, and requires a more systematic transformation. USPC or USPC Patent Classification System (http: //www.uspto.gov/web/patents/classification / ... or Classification Index to US Patent Classification (aka) published by the US www.uspto.gov as of June 2006. , The Classification Index File) file can be viewed as a variant input. In this case, the visually understood USPC code is not in alphabetical order as IPC, so modifications are necessary.

The following two methods can be modified.

First, a tree structure is created based on title information including a dot structure for the entire USPC. The tree structure should be arranged such that the USPC forms nodes of the tree structure, reflecting parent-child relationships between USPCs. A depth-first search of the USPC tree structure is followed by a modified patent classification code including an alphabetical arrangement for each node. Of course, it would be natural to match the USPC of each node with the modified patent classification code corresponding to the USPC and store it in the modified patent classification database.

Second, the Index to US Patent Classification file provided by the US Patent and Trademark Office (this file contains information about the USPC, description, and number of dots for each title (depth information based on root) and its parent. The tree structure of the entire USPC, and then using the search method such as the depth-first search method, each node is appended with the modified patent classification symbol and modified for each title. Match the patent classification code with the corresponding USPC and save it.

The above two examples are just an embodiment, and another method for mapping the modified patent classification code to each individual USPC by using title information including the dot structure of the USPC, and arranging the system of the modified patent classification code in alphabetical order. There may be many depending on the variant algorithm. One such example is presented in the above table of IPCs reflecting title information, and in the form of modified patent classification symbols arranged in alphabetical order through the table. Therefore, not only it is impossible to describe all such modification methods, but such modifications will be apparent to those skilled in the art such as computerized experts. It will be obvious that the modified patent classification code system modified by the above-described algorithm is included in the present invention.

Hereinafter, it demonstrates in detail through the following example.

The following is for the first part of subclasses of US class 002 apparel. This is a copy from http://www.uspto.gov/web/patents/classification/uspc002/sched002.htm. Class numbers 002 are omitted before the numbers below, but all numbers should be considered to have 002 before them.

1 MISCELLANEOUS

455 GUARD OR PROTECTOR

456 .Body cover

457 ..Hazardous material body cover

458 ..Thermal body cover

2.11 .. Astronaut's body cover

2.12 ... Having relatively rotatable coaxial coupling component

2.13 ... Having convoluted component

2.14 ..Aviator's body cover

2.15 ..Underwater diver's body cover

2.16 ... Having an insulation layer

2.17 ... Having a garment closure

459 .Shoulder protector

It can be seen from the dot structure that there are 457, 458, 2.11, 2.14, 2.15 directly below the 456 body cover, and 2.12 and 2.13 are directly below the 2.11 body cover. It is obvious that the above table can be made by reflecting the dot structure, and since the above description is provided in the description of the IPC, the description of this USPC will be omitted.

43 shows a tree structure reflecting the dot structure. FIG. 44 shows that the modified patent classification code may correspond to each node of the USPC tree in FIG. 43. 45 shows that the modified patent classification code can form a tree structure that is structurally equivalent to the USPC tree structure. As described above, each of the USPCs can be stored in correspondence with the modified patent classification code. An example of the storage may be as shown in the following table. The table below may be an embodiment of the modified patent classification database of the present invention.

Subclass before transformation Dots Modified patent classification code (including class number) title One 002001000 MISCELLANEOUS 455 002002000 GUARD OR PROTECTOR 456 One 002002100 Body cover 457 2 002002110 Hazardous material body cover 458 2 002002120 Thermal body cover 2.11 2 002002130 Astronaut's body cover 2.12 3 002002131 Having relatively rotatable coaxial coupling component 2.13 3 002002132 Having convoluted component 2.14 2 002002140 Aviator's body cover 2.15 2 002002150 Underwater diver's body cover 2.16 3 002002151 Having an insulation layer 2.17 3 002002152 Having a garment closure 459 One 002002200 Shoulder protector

And the Index to U.S. The Patent Classification file is expressed as follows.

002000000 0 1 APPAREL

002001000 1 2 000 000 MISCELLANEOUS

002455000 1 3 000 000 GUARD OR PROTECTOR

002456000 2 4 45 5000 Body cover

002457000 3 5 45 6000 Hazardous material body cover

002458000 3 6 456000 Thermal body cover

002002110 3 7 456000 Astronaut's body cover

002002120 4 8 002110 Having relatively rotatable coaxial coupling component

002002130 4 9 002110 Having convoluted component

002002140 3 10 456000 Aviator's body cover

002002150 3 11 456000 Underwater diver's body cover

002002160 4 12 002 150 Having an insulation layer

002002170 4 13 002 150 Having a garment closure

002459000 2 14 455000 Shoulder protector

Index to U.S. Patent Classification is described. The first three digits of the first nine digits are the class number, and the last six digits represent the subclass number. On the Internet, there is a decimal point or a point like 2.11, but it can be seen that it is represented by 002110. The next digit represents the relative depth from the root. Apparel of class 002 is 0 depth, MISCELLANEOUS without dot represents 1depth directly below apparel, and thermal body cover with 2 dots represents 3 depth. The column after depth is the serial number, and the next column is the number representing its parent. That is, 455000 attached immediately before the body cover, such as ^ 455000 body cover ^, indicates that the parent has 455000 and that the GUARD OR PROTECTOR is its parent. This can be seen as a representation corresponding to the dot structure. For example, in more detail, in the ^ 456000 Aviator's body cover ^, the parent of Aviator's body cover is a body cover using 456000.

Since the USPC classification symbols are not arranged in alphabetical order, range retrieval is impossible unless reprocessed.

Index to U.S. It would be easy to make a tree structure as shown in FIG. 46 by using the information about the parent and the relative depth information in each USPC in the Patent Classification file. It is easy to assign the modified patent classification code to the tree structure as shown in FIG. 8 as shown in FIG. 44. A tree structure of the modified patent classification code as shown in FIG. 45 can be created using the modified patent classification code. Of course I will. As described above, each of the USPCs can be stored in correspondence with the modified patent classification code. An example of the storage may be as shown in the following table. The table below may be an embodiment of the modified patent classification database of the present invention.

Class + subclass before transformation depth Subclass of pre-modification parent Variant Patent Classification Symbol Subclass of variant patent taxonomy parent Title 002000000 0 002000000 APPAREL 002001000 One 000000 002001000 000000 MISCELLANEOUS 002455000 One 000000 002002000 000000 GUARD OR PROTECTOR 002456000 2 455000 002002100 002002000 Body cover 002457000 3 456000 002002110 002002100 Hazardous material body cover 002458000 3 456000 002002120 002002100 Thermal body cover 002002110 3 456000 002002130 002002100 Astronaut's body cover 002002120 4 002110 002002131 002002130 Having relatively rotatable coaxial coupling component 002002130 4 002110 002002132 002002130 Having convoluted component 002002140 3 456000 002002140 002002100 Aviator's body cover 002002150 3 456000 002002150 002002100 Underwater diver's body cover 002002160 4 002150 002002151 002002150 Having an insulation layer 002002170 4 002150 002002152 002002150 Having a garment closure 002004590 2 455000 002002200 002002000 Shoulder protector

Of course, the modified patent classification code having the alphabetical order may be corresponded to the USPC system including the given title information through an algorithm different from the above, which is stored as a matching table of the modified patent classification code corresponding to the USPC as described above. Of course it can be.

42 is a flowchart illustrating an embodiment in which the hierarchical modified patent classification code database generation module generates the modified patent classification code database.

The modified patent classification code database generation module obtains all patent classification codes on the patent classification code system (S4220), arranges all the acquired patent classification codes in a tree structure with reference to dot information of a title (S4230), and the tree The modified patent classification code is corresponded to each patent classification code node while searching using the depth classification search technique in the structure of the patent classification code arranged in a structure (S4240), and the relationship between the patent classification code and the corresponding modified patent classification code is recalled. The modified patent classification code database is stored (S4250).

Subsequently, in order to generate a modified search expression based on the range search, the modified patent classification code utilization lower layer patent classification code processing module of the present invention obtains information for generating a modified search expression by processing a patent classification code obtained. Explain if you do.

In the above case, if the input search expression is obtained by USPC as ^ 002/456 ^, to be a subcategory search, 002/456, 002/457, 002/458, 002 / 2.11, 002 / 2.12, 002 /2.13, 002 / 2.14, 002 / 2.15, 002 / 2.16, 002 / 2.17 should be searched. At this time, as shown in the tree structure of FIG. 43, the next sibling of 002/456 is 002/459. Therefore, when the corresponding modified patent classification code is matched in the above table, if the instruction to search for all modified patent classification codes larger than or equal to 002002100 corresponding to 002/456 and smaller than 002002200 corresponding to 002/459, which is the next sibling, is searched for, The search will include a subcategory.

More specifically, there are two ways to do this: The first method finds 002002100 as the corresponding modified patent classification code when ^ 002/456 ^ is obtained, then finds 002/459, the next sibling of 002/456, and the modified patent classification code corresponding to 002/459. Looking for 002002200 which is, how to bind these 002002100 and 002002200 in range. The range can be greater than or equal to 002002100 and less than 002002200. A feature of the present method is a method of first finding a next sibling of patent classification symbols obtained in a tree structure before modification, and finding a modified patent classification symbol corresponding to each of the obtained patent classification symbols and the next sibling. In the present method, since the modified patent classification code system and the corresponding patent classification code system correspond to 1: 1 in terms of structure, the next silbing of the patent classification code input by the user is first found, and the patent classification code and the A method of finding each modified patent classification code corresponding to the next sibling of the patent classification code.

The patent search engine 7000 receives a search expression including a patent classification code. Subsequently, when the obtained patent classification code includes a dot in the title information, the modified patent classification code utilization lower layer patent classification code processing module (or the lower layer patent classification code processing module) is hierarchical patent classification code. The next sibling patent classification code of the obtained patent classification code is found in a tree structure reflecting the system. Subsequently, the modified patent classification code utilization lower layer patent classification code processing module performs the modified patent classification code and the next sibling modification patent corresponding to the obtained patent classification code and the next sibling patent classification code on the modified patent classification code database. Get the classification code. Subsequently, the modified patent classification code utilizing a modified search expression generation module generates a modified search expression including a range as the modified patent classification code and the next sibling modified patent classification code of the modified patent classification code, and the search engine 7000. Performing a search by the modified search formula through

The second method finds 002002100 as the corresponding modified patent classification code when ^ 002/456 ^ is obtained, and then finds 002002200, the next sibling corresponding to 002002100 in the modified patent classification code system, and replaces these 002002100 and 002002200. That's how you bind it with scope. The range can be greater than or equal to 002002100 and less than 002002200. A feature of this method is a method of finding a modified patent classification code corresponding to the acquired patent classification code and finding a next sibling corresponding to the modified patent classification code. That is, this method is a method of first finding a modified patent classification code for the input patent classification code, and then finding the next sibling of the found modified patent classification code in the modified patent classification code system. The second method has an advantage of reducing one act of searching than the first method.

Next, a flow of an embodiment of a search method using a modified search method using the second method will be described.

The search engine 7000 receives a search expression including a patent classification code. When the obtained patent classification code includes a dot in the title information, the modified patent classification code utilization lower layer patent classification code processing module is modified patent corresponding to the obtained patent classification code on the modified patent classification code database. Obtain a classification code, find a next sibling modified patent classification code of the modified patent classification code in a tree structure reflecting the modified patent classification code system, and then use the modified patent classification code utilizing a modified search expression generation module to generate the modified patent classification. A modified search formula including a range as a symbol and a next sibling modified patent classification code of the modified patent classification code, and through the search engine 7000

The search goes through a modified search.

Through the first or second method, the lower layer patent classification code processing module using the modified patent classification code may recognize two modified patent classification codes corresponding to both ends of the range for performing a range search on the obtained patent classification code. Will be.

Of course, the search index should include information on the modified patent classification code corresponding to each USPC. The modified patent classification code may be formed only of numbers having arbitrary digits, but may be formed including numbers and letters. At this time, when there is an addition in the USPC, it is possible to generate a modified patent classification code to reflect the dot structure so as to have a valid arrangement position when arranged in alphabetical order without overlapping. The method of generating such an alphabetical arrangement position is the same known technique as having a proper arrangement position in alphabetical order when a new word is added to the dictionary, and will be easily implemented by those skilled in the art. In addition, if more subdivisions are created when placed in alphabetical order, you can continue to expand the backseat. For example, when multiple patent classification symbols are generated in multiple stages at the bottom of 002 / 2.12, additional backseats such as 0020021310a, 0020021310b, etc., which are in alphabetical order below the modified patent classification symbol 002002131 corresponding to 002 / 2.12, and above 002002132 As you expand, you will continue to be able to generate variant patent classification symbols.

As described above, even in the case of having a patent classification code system which does not have an alphabetical order structure itself as in USPC, it has been described that a range search can be performed by introducing a modified patent classification code. Of course, even if it already has an alphabetical order structure, such as IPC, it will of course be able to match the new modified patent classification code. Therefore, the present invention can be applied to FI, ECLA, and FT patent classification codes which have the characteristics of IPC extension. That is, the modified patent classification code reflecting the dot structure of each classification code may be generated for the range search in IPC, FI, FT, ECLA, USPC, etc., and the modified patent classification code is arranged in alphabetical order. It can support range search.

The search index for the search engine 7000 preferably includes information in which the original patent classification code is processed and information in which the modified patent classification code is processed. If the user does not want a search result for the lower layer patent classification code, it is not necessary to use an index on which the modified patent classification code is processed.

Next, the modified search expression generation module and the modified patent classification code utilization modified search expression generation module of the present invention will be described. Use of Modified Search Expression Generation Module and Modified Patent Classification Symbol The modified search expression generation module generates the modified search expression by integrating with the existing existing search expression with the obtained modified patent classification symbols.

For range searching, the modified search component generated slightly depends on whether the search engine 7000 supports heterogeneous range symbol processing for the range. Heterogeneous range symbol processing refers to handling cases where symbols on both sides of the range are different, such as greater than or equal to ^ A and less than B. In the case of supporting heterogeneous range symbol processing, for the acquired patent classification symbol, ^ (a range of patent classification symbols larger than or equal to the obtained patent classification symbol and smaller than next sibling of the obtained patent classification symbol) ^ Create a modified search component called. ^ ((Obtained classification symbol) or (patent classification symbols in a range greater than or equal to the obtained patent classification symbol and smaller than next sibling of the obtained patent classification symbol) when the heterogeneous range symbol processing is not supported. } Will be generated. Of course, in the case of using the modified patent classification code arranged in a dictionary, the modified patent classification code will be processed as described above.

If the search expression obtained is ^ {Keyword = Wireless and Active} and {Applicant = Samsung Electronics} and {IPC = H04B 7/15}, if the heterogeneous range symbol processing is performed, ^ {Keyword = Wireless and Active} and {Applicant = Samsung Electronics} and {IPC> = H04B 7/15 and IPC <H04B 7/22} ^ On the other hand, if the heterogeneous range symbol is not processed, ^ {Keyword = Wireless and Active} and {Applicant = Samsung Electronics} and {IPC = H04B 7/15 or (IPC> H04B 7/15 and IPC <H04B 7/22) } Will be.

The core of the patent classification code preprocessing engine 3510 of the present invention as described above, when there is a given patent classification code, automatically processes the lower patent classification in all children or lower layers of the patent classification code. It's a feature that allows it to be reflected in search results.

Hereinafter, the patent information of the present invention using the patent classification code preprocessing engine 3510 and the search engine 7000 are searched for patent information, and a patent information processing method based on the retrieved patent information is presented. .

First, a patent information retrieval method through the search engine 7000 of the present invention is presented. The core of the patent information retrieval method of the present invention is to provide patent information including a patent classification code under the patent classification code when the patent classification code is included in the search expression of the patent information.

As a first embodiment of patent information retrieval, an information processing method when a search classification includes a patent classification code of less than the main group is presented.

When there is a patent classification code less than the main group (For patent classification codes less than the main group, it is usual that at least one or more dots are included in the title information. Therefore, the inventive idea of this embodiment likewise includes a dot structure. The patent classification code may be obtained by the patent classification code preprocessing engine 3510, and the hierarchical patent classification code database may be queried for the search expression. Find out information about all the patent classification symbols below the patent classification symbol given in the above, and based on this, integrate the obtained patent classification symbol with the obtained patent classification symbol to form a modified search expression, and perform a patent search with the modified search expression. Perform. Performing a patent search by a search formula including the modified patent classification code as described above is referred to herein as a search including a modified patent classification code.

Of course, if the patent classification symbol included in the search expression is the main group, the / 00 of the main group is cut out of / 00 and the searcher is used to search for all patent classifications below the main group. For example, given IPC = H04B 7/00, conducting a search for all patent classification symbols beginning with H04B 7 by converting => IPC = H04B 7 /? The present invention is importantly utilized at the patent classification symbol level (normally, the patent classification symbol level having a dot structure) whose upper, lower, and equivalent levels are not known in the patent classification symbol itself. .

When the search result is output by the modified search expression, the display of the search result may be provided by clustering according to the searcher's selection. Clustering is a method of grouping search results and expressing them in group units. When there is a clustering window that represents the clustered structure, or when a clustering level can be selected, the search results are displayed only in the search results of the dot subgroup and subgroups corresponding to the preset or preselected clustering level. When a lower or upper clustering level is selected (the dot level corresponds to the clustering level), a search result corresponding to the selected clustering level is expressed.

For example, if clustering at the 1-dot subgroup level is selected through the search result related to H04B 7/00, the clustering window corresponds to 7/005, H04B 7/01, H04B corresponding to the 1-dot subgroup. 7/015, H04B 7/02, H04B 7/14, H04B 7/22, H04B 7/24 appear in the form of a subdirectory folder of H04B 7/00, and the search results show all results corresponding to H04B 7/00 . At this time, when the searcher selects H04B 7/14, the subordinate H04B 7/145 and H04B 7/15 appear in the form of a sub-directory folder. In this case, the search result corresponds to H04B 7/14 and the lower patent classification code. Only search results are displayed. If the searcher selects H04B 7/15 again, the subordinates H04B 7/155, H04B 7/185, and H04B 7/204 are displayed, and the search result corresponds to H04B 7/15 and its HOWB patent classification code. Only the results are displayed.

At this time, for the convenience of the searcher, the number of patent classification symbols below and the number of all the sub-patent classification symbols, together with each of the clustering items (the folder name of the directory) in the clustering window, are displayed together or which Only one can be displayed. The number of patent documents corresponding to the patent classification code and all lower patent classification codes of the patent classification code may be displayed. At this time, both the number of applied documents and the number of registered documents may be displayed, or only the number of applied documents or one registered document may be displayed. For example, if the patent classification code is H04B 7/15, the subordinate patent classification code is H04B 7/155, H04B 7/185, and H04B 7/204, so that ^ 3 ^ is displayed or all lower patent classification codes are H04B 7/155, H04B 7/165, H04B 7/17, H04B 7/185, H04B 7/19, H04B 7/195, H04B 7/204, H04B 7/208, H04B 7/212, H04B 7/216 , So you can display ^ 10 ^. It is advisable to give both indications because there may be less classifications directly underneath, but there may be an enormous size classification underneath them. This is especially true in emerging emerging technologies, or in high-tech areas where technology divergence rates or subdivisions are increasing rapidly. If only the number of sub-categories is displayed, it is because there is a user who ignores the categorization because it is impossible to grasp the technical field when the numerical value is small although the importance of the technical field is actual.

The patent classification code information may be arranged in a directory manner, and the user may systematically access the lower patent classification code of the specific patent classification code by browsing the user. Currently, www.delphion.com provides this service. However, the site provides information on the number of subordinate patent classification symbols, but 1) does not provide the total number of subordinate patent classification symbols of the user, and 2) the number of patent documents for all patent classification symbols. And 3) it does not provide a patent document that contains all direct sub-patent classification symbols that correspond to that number when clicked. The present invention can solve this problem through a hierarchical patent classification code database and a modified patent classification code search method.

When the patent classification code information is arranged in a directory manner, a symbol such as a color or an icon may be displayed in each directory to improve accessibility of the user. In other words, if there are many sub-categories, all sub-categories, deep, deep patents, many patent documents, etc., different colors or preset icons are assigned to the user. The number of all subcategories, the depth of categorization, the number of patent documents, etc.). In particular, when the number of all sub-classifications of a specific patent classification code directory is large or the depth of classification is large, it is more important than the directory that is not because it has many patent applications to the area and proves that various technologies are applied. This is because it is often larger.

Next, a patent analysis method based on a patent classification code using a modified patent classification including search method of the present invention will be described. The patent analysis method is performed by a patent information analysis engine, that is, an analysis engine of the present invention.

First, the speed analysis method will be described. The engine for performing the speed analysis is called a "speed analysis engine".

Velocity analysis based on patent taxonomy is to obtain 1) numerical information and 2) subject information based on patent taxonomy from patent taxonomy system supported by patent information of each country for a specific country or several countries. I say something.

The numerical information may include 1) quantity, 2) increase rate of quantity, 3) increase rate, and 4) increase acceleration in a predetermined period. Knowing only the quantity information in the preset period, the rate of increase of quantity is calculated as {quantity of the period-quantity of the previous period} / {quantity of the period before}} 100, and the speed is {quantity of the period-quantity of the period before } / {Calculated length of period}, the acceleration may be calculated as the rate of change of the speed. Therefore, for the sake of convenience of explanation, the specification will describe the speed analysis based on the quantity, but it is assumed that 2), 3), and 4) above are naturally included in the description. The quantity may be any quantity that can be derived from the patent information, for example, 1) the amount related to the simple counting number, such as application amount, registration amount, 2) ratio amount such as registration rate, share, concentration rate, 3) the amount of the index, such as the patent activity index, 4) the amount of subjects, such as the number of applicants, inventors, agents, etc., 5) the number of countries involved in a particular patent document, or a number of patent documents in one country. The number of administrative agencies, such as the number of possible agencies (primary judging bodies such as the Patent Office and the Patent Tribunal, second higher judging bodies such as the Patent Court, and the Supreme Court, etc.), 6) the number of claims, the number of pages of the specification, Life cycle of a patent application such as number of citation documents, number of citation documents, number of citation documents, number of citation documents, etc. For example, the number of events occurring during the period and the amount of the result of the function value, such as a combination of each of them or an importance evaluation function using each of them as an input variable.

Subject information means: 1) applicant or owner, 2) inventor, 3) a patent document based on 1) quantity, 2) increase rate of quantity, 3) increase speed, 4) increase acceleration, subject to the analysis ) Information about the subject such as an agent.

As an example of a simple speed analysis, the number of applications or registrations can be calculated for each patent classification per year for the entire patent classification or for a specific hierarchy of patent classification (for example, H04B 7/00 group). Here, the IPC is described as an example, but other patent classification systems having a dot structure can achieve the desired purpose in a similar way. In addition, although the objective object of analysis is described more than an example using the number of applications as an example, the objective object can be achieved by the similar method also about another objective object of analysis.

First, the patent classification of a specific layer will be described. The entire patent classification will correspond to the entire technical area as the highest set of patent classifications of a particular hierarchy.

First, since the dot structure is obtained from a subgroup after receiving the specified information about the specific layer, when the obtained patent classification is subclass or higher, the patent classification of the subclass or higher is decomposed to the main group unit. For each of the decomposed main groups, one dot subgroup in the subgroup is found (the main group reference immediate hierarchy patent classification symbols), and from the one dot subgroup, the search containing the modified patent classification symbol of the present invention is performed. (Of course, since the range search is possible even from the main group and above, the search method including the modified patent classification code of the present invention is naturally applied, but it is also possible through the cutter cutting in this area, but in the sub-dot subgroup or less) Only by the method of the present invention.)

For example, if the obtained patent classification is H04B at the subclass level, the main group H04B 1/00, H04B 3/00, H04B 5/00, H04B 7/00, H04B 10/00, which are subclasses corresponding to H04B. Are divided into H04B 11/00, H04B 13/00, H04B 14/00, H04B 15/00, and H04B 17/00. Then, for each main group, one-dot subgroup belonging to the main group is found again. From the 1-dot subgroup, a search including the lower layer patent classification code of the 1-dot subgroup can be performed only when the search method including the modified patent classification code unique to the present invention is applied.

If the main class is H04B 7/00, then for each of the seven 1-dot subgroups, which are the lower-level hierarchies of the main class, out of all 25 sub-layer patent classification symbols belonging to the main class, all 2 belonging to the sub-class A search containing the modified patent classification code of the present invention is performed on the dot subgroup, the 3-dot subgroup, and / or the 4-dot subgroup.

As described above, the patent classification code group to be analyzed may be several, and the group may be at a level (for example, every subclass unit), and two or more different levels (some are subclasses, some other classes). May be a main group, some of which are class units).

By extending the patent classification code group as described above, the analysis engine can process the entire patent classification code system. That is, a search including the modified patent classification code of the present invention may be performed for every single patent classification code below the subgroup.

 Example of search results in a table (1 dot is represented by the total of 1 to 4 dots)

One example is to obtain IPCs of all subgroup units for H04B 7/00 and calculate the number of applications per year for each of them.

In this case, the search expressions obtained may not only include patent classification codes, but may further include keywords, applicant information, and the like. Therefore, the search expression can derive the search result through the ^ AND ^ operation of the keyword or the applicant information and the patent classification code. The search engine 7000 may transmit a combined search expression to a query for all fields placed in the index by the search engine 7000, and if the combined search expression has a patent classification code, the patent classification By applying the modified patent classification symbol search method, the modified search expression is transmitted to the query. The search engine 7000 derives a search result based on the modified search formula. In general, the search engine 7000 quickly outputs the number of search results corresponding to the search expression (in contrast, providing a list of the search results causes a relatively large load on the server or the network 300). For example, when counting for statistics or analysis, you can achieve what you want without spending a lot of time.

In the case where Samsung is inputted as an applicant, one example is to obtain IPCs of all subgroup units for H04B 7/00, and calculate the number of applications for each one by year.

It will be apparent that only the number of applications per year can be calculated by the analysis engine of the present invention. Analysis engines can easily find numerical information primarily. Such numerical information includes, in addition to basic numerical information such as the number of applications, registrations, and registration rates by year or by preset period, various numerical information that can be found by calculating directly or indirectly in the patent literature of that country. The various numerical information is 1) the search engine 7000 responds to the search engine 7000 directly or through simple processing without any special prior information processing by the combination of the search formula, 2) the special prior information processing, or 3) other There may be things that can be answered via the analysis engine.

The example of 1) corresponds to the information in most bibliographic details, and the number of applications or registrations by country is representative, and the registration rate can be calculated by calculating the number of registrations compared to the number of applications. However, the calculation of the registration rate is of the type 3) when it is determined whether an individual filed patent is registered, rather than the number of registrations / applications by year.

Representative example of the 3) may be the ranking information for each applicant subject to a specific search condition. In order to output the ranking information for each applicant, a list of search results is obtained, the list of applicants included in the result list is identified, the frequency of occurrence of a specific applicant is calculated, and the higher the frequency, the higher the ranking. Can be. In this case, the ranking calculation engine processes the ranking.

Representative examples of 2) may include the number of important patents. An important patent may have several criteria, but in one exemplary method, (1) a patent with many foreign applications, (2) a patent with many claims, (3) a patent with a large number of pages in a specification, and (4) a highly cited patent Assuming that patents are higher in importance, weights may be assigned to each of them, and the importance may be evaluated by calculating whether the patent patent document corresponds to the above item and calculating the sum of the weights. When these scores are calculated in advance for each reference for each patent document, the number of patent documents corresponding to the reference among the search results may also be grasped.

In the same manner as described above, the search engine 7000 performs a search on the received search expression and returns a search result including the number of search results.

Hereinafter, a method of finding meaningful information from patent information based on the number of search results through a method called speed analysis is disclosed. Speed analysis refers to analyzing a trend in which a search object changes in a predetermined time unit for each patent classification code constituting the group in a group including a patent classification code. The purpose of the search is an index that is the purpose of the search, such as the number of applications, the number of registrations, and the like, and the changing trend may be, for example, the number, the change (speed) of the number, the speed (acceleration) of the number change, and the like.

If the purpose of the search is the trend of application by technology field (patent classification code), the interpretation of the trend may be changed according to the following example.

1) There is a small number of applications in a particular technical field, but the rate of application growth is high and the application acceleration is likely to be a pioneering new technology area, and the applicants and technologies applied to the area are monitored. It needs to be great. In particular, if there is the same pattern abroad or the same pattern in some specific countries, it is likely that the pioneering competition is in the global competition zone.

2) Although a certain technical field has a small amount of applications and a relatively high rate of application growth, if the acceleration is negative, it is likely that the niche area is occupied or occupied by a few occupants.

3) If a certain technical field is low in application volume and the rate of application growth is negative, it may be far from market interest, or it may be a small market and a place where defensive application is already made to defend the technical area after important technology development is completed. This is high.

4) If a particular technology sector has a large volume of applications, a high rate of application growth, and a high acceleration of application growth, it is highly likely that the market is large and the companies are entering the market due to high profitability.

5) If a particular technical field has a large application volume and a relatively high application speed, and if the acceleration is negative, it may be a pattern when the market workers concentrate the application toward the applied technology rather than the right of the core technology.

6) If a specific technical field has a large application volume, but the application growth rate is low or negative, and the application increase acceleration is negative, the area for which the protection technology is applied for the right of the process technology or the improvement technology is applied. Likely to be

Therefore, various useful information can be known by measuring the number, the change (speed), and the speed (acceleration) of the number change for all patent classification codes corresponding to all technical areas. Through this, a distribution curve or a distribution map according to the application speed for a specific technical field or an entire technical field can be made.

Similarly, a pattern-wise analysis such as 1) to 6) above is possible for the number of applicants or the number of higher applicants through secondary processing instead of the application amount.

If the number of applicants is the same as 1) above, that is, if the number of applicants is small but the applicants increase rapidly and the applicants increase acceleration is positive, several leading technology companies are leading investments. Due to the prospects, the level of interest of participants is gradually increasing, which may be an area of technology development that is likely to be bright and profitable.

If the number of applicants is the same as above 4), the area is likely to be a region with strong red-oceanism that is becoming increasingly competitive.

Similarly, if the above speed analysis is performed on the entire technical domain or the specific technical domain (specific patent classification code) based on the specific applicant, the following results can be expected.

If a specific applicant has a small number of applications in a specific technical area, but the application growth rate is high and the increase acceleration is positive (+), the applicant considers the area as a future new business and develops intensive technology. Most likely.

If a specific applicant has a large standard deviation of the application amount in a specific technology area, it may mean that the technology development in that area is not effective. When technology development cruises toward a predetermined target value, a patent application also shows a steady increase pattern, and the standard deviation of the application amount tends to be small.

If a specific applicant has a large application volume in a specific technical area, a high application growth rate, and a small application acceleration, the technical area may be an area that is likely to have passed the high development period.

As such, when individual indicators such as application amount, registration amount, number of applicants, or two or more indicators are mixed, the individual indicators or mixed indicators can be reflected in the search expression (for example, (Applicant = Samsung E) and (IPC = H04B 7/15), meaningful results can be obtained when the search results are arranged on the time axis or output in a table or the like.

Through the above-mentioned speed analysis, 1) application trend information for each technical field, 2) application trend information for each specific technology field, 3) application trend information for each technical field of a specific applicant, and 4) application trend information for a specific technology field of a specific applicant In addition, it can be visualized in a graph or table, and furthermore, if the above 3) and 4) for two or more applicants are performed and compared to one table or graph, a comparison table or a comparison graph, and further, a comparison map (two-dimensional or 3D, one or more of the target subject of the comparison, the technical field and the year axis, and the height axis indicates the quantity).

In addition, if there is an item that is equal to or higher than a predetermined criterion for the result of the speed analysis corresponding to the whole or a specific technical area (a technical area or a technical area of a specific applicant unit), it can be reported to the outside. An example of the predetermined criteria is 1) filing of 50 or more applications annually, 30 or more annual application growth rates, 10 or more application growth accelerations, or 2) an application targeting a specific applicant and / or a specific technical domain (specific patent classification code). Quantity, application growth rate, and application growth acceleration may be obtained reference value for at least one or more. Reporting takes the form of reporting, which includes: 1) criteria satisfaction data for specific applicants and / or specific technical areas that satisfy the criteria; Any one or more of the list of search result patents corresponding to the criteria satisfaction may be included.

Such speed analysis can also be performed through a patent database of two or more countries. If more than one patent database is involved, there are largely the following series.

The first series analyzes the speed of a specific technology area by country. This is mainly to see what technology areas are concentrated in each country. In particular, when associated with the top applicants with a high share in each country for each particular technology area, which company in a country is leading in that technology area, there may be applicants with a high share in two or more countries. In that case, it is likely that the applicant is leading that particular technical area worldwide.

To this end, the speed analysis engine performs a search on a country-specific patent database by including the same patent classification code in a search expression to create a country search expression, and then querying the search engine 7000 using the country search expression. do. If there is a keyword or the like, it is natural to prepare a country search expression including the translation of the keyword into the corresponding language of each country.

The second series is a series that analyzes how many applications are filed in a particular second country to a particular second country. For this analysis, a search formula for a specific applicant's entire technical area or a specific technical area for a first country is created (in the case of the entire technical area, a patent classification symbol is not specified, and a specific technical area is searched for). The patent classification code corresponding to the technical area may be limited to the expression.) After performing a search, a first list of all or specific technical areas is generated, and the same search expression for the second country is applied. It would be natural to change a person's name to the language of a second country), perform a search and then generate a full or specific list of secondary technical areas, and either the secondary list and the secondary list in whole or Analysis of the second series can be accomplished by comparing by specific technical area.

Another method of achieving the analysis purpose of the second series is a method of utilizing priority information. After generating the primary list, it is checked whether the application number existing in the primary list is in the patent information of the second country. This is possible because the first country's application number is applied to the second country while claiming priority within the period in which the priority number can be claimed (one year from the best day of operation). Or compare by specific technical area. This method is particularly advantageous when the applicant's representative name is not sufficient, or when the applicant files in the name of another subject in the second country.

The third series is a cross-search series with different patent classification codes. To do this, a concordance table is essential. Www.uspto.gov, run by the US Patent and Trademark Office, operates a cross-conversion service between the USPC and IPC, and publishes a concordance table. It also sells FT themes and concordance tables for IPC in relation to Japanese patent information. If there is a concordance table, perform a rate analysis on the USPC in the United States, and then, for a particular applicant and / or a specific technical area that meets a predetermined criterion, the USPC is referred to the concordance table and the corresponding IPC or other After the patent classification code is changed, the modified patent classification code is included in a search expression for a second country other than the United States to perform a search for speed analysis and analysis of the search result. And the like, the translation of the applicant or keyword into a second language.)

Although the above examples have been described focusing on the application volume, a similar method can be applied to other analysis indicators. Other analytical indicators may include: 1) concentration, 2) activity index (AI), and 3) market share, and the number of registrations, registration rates, etc. corresponding to the number of applications may be an indicator. The inventor or agent may be an indicator. In the above, the degree of concentration is an indicator of how much a particular applicant is concentrating in which area, and the number of all applications filed for a specific patent classification code / all applications for that applicant * based on a specific year or a predetermined period of time for a specific country * Appears as 100 ^. A patent activity index is defined by a certain country on a specific year or for a predetermined period of time. ^ {(The number of applications filed by that applicant for a specific patent classification code / all applications for that applicant) / (all applications for a specific patent classification code) Number / all applications) * 100}.

On the other hand, the following matters should be considered when counting (counting) the number of times for speed analysis. What should be done when two or more 1) patent classification codes, 2) applicants, 3) inventors, and 4) agents correspond to one patent application? This is the case where the policy problems are all individually counted, when they are equalized by the corresponding number, and in the third case. Individual counting is a method of weighting each applicant by 1 if the applicant is 2, and equality is a method of counting the weight by 0.5 for the application. In the case of equality, the number information may have a value with a decimal point.

On the other hand, when two or more patent classification codes appear in view of the modified patent classification code containing search, which is the core of the present invention, the following methods may be considered in addition to the above two methods. Two or more patent classification symbols listed in the patent document can be grouped based on the patent classification symbols included in the search expression. For example, when five patent classification codes correspond to a specific patent document, the five patent classification codes are assigned to the first group belonging to the patent classification code itself or lower layer patent classification code included in the search expression and the search. It may be divided into a second group to which a patent classification code belonging to a separate or independent node / layer belongs to a higher layer patent classification code of a patent classification code included in an expression. In this case, there may be a method of varying the weight of the first group and the second group according to the number or distribution ratio of the constituent patent classification symbols belonging to the group. For example, if a patent document corresponds to H04B 7/005, H04B 7/01, H04B 7/145, H04B 7/204, H04B 5/00, the current search expression (the search expression at the time of analysis, the search H04B 7/14 in the formula contains a patent classification code), H04B 7/14 is H04B 7/145 and H04B 7/204 in the lower hierarchical information. Patent documents containing 7/145, H04B 7/204 will be included in the search results, and the weight of the patent document will be given 2/5, not 0, for the search formula H04B 7/14 criteria. Can be. In such a case, if the conventional method other than the search method including the modified patent classification code includes H04B 7/14 in the search expression, the patent document is not included in the search result.

In the case of applying the modified patent classification code search method, it may be usefully used not only for the analysis but also for monitoring and watching services. The monitoring service is to register a specific search expression, and if there is new patent information corresponding to the search expression, transmit the new patent information to a person who receives the monitoring service. In order to perform a monitoring service, 1) registering a search expression for monitoring; Since the purpose is to query the search engine 7000 in the predetermined time unit (find new documents when querying), the past 6 days are included in the time range (for example, the date of the search query based on the publication date). It is common to limit the search time to the search expression.) If there is a new patent document, it may be sent to the surveillance service recipient. In this case, when the patent classification code is included in the search expression, the monitoring service may be performed by adopting a search method including a modified patent classification code. In the monitoring service using the modified patent classification code containing retrieval method of the present invention, the patent classification code included in the search expression in the patent document although it exists logically and hierarchically under the patent classification code system included in the search expression. In the absence of a fault, faults excluded from monitoring can be prevented.

In addition, all of the parent node patent classification symbols may be obtained and stored for each of the patent classification symbols. When storing all the parent nodes, it is preferable to store the parent classification information including hierarchical information. The table below shows one embodiment of such a storage scheme.

    Level / number Myself section class Subclass group 1dot 2dot 3dot One A01B 13/02 A A01 A01B A01B 13/00 A01B 13/02 2 A01B 13/06 A A01 A01B A01B 13/00 A01B 13/04 A01B 13/06 3 A01B 13/04 A A01 A01B A01B 13/00 A01B 13/04 4 A01B 13/12 A A01 A01B A01B 13/00 A01B 13/08 A01B 13/10 A01B 13/12 5 A01B 13/10 A A01 A01B A01B 13/00 A01B 13/08 A01B 13/10 7 A01B 13/08 A A01 A01B A01B 13/00 A01B 13/08

47 illustrates step by step how the data structure as shown in the above table can be generated.

First, the patent classification code preprocessing module 3500 obtains the at least one patent classification code information (S4720), and obtains all of the parent node patent classification codes on the patent classification code system for the obtained patent classification code information. In operation S4730, the acquired parent node patent classification code is stored including the node hierarchy information based on the acquired patent classification code (S4740).

As shown in the table above, when all the parent nodes for themselves are stored for each hierarchical level, a method for facilitating a search including sub-classifications is derived. Briefly described as follows. If you do a search for A01B 13/04, you find yourself the number A01B 13/04 (here 3). In line 3, he finds himself at the 1 dot level, finds all the line numbers with A01B 13/04 at the 1 dot level (here 2 and 3), and finds his own IPC for each of the 2 and 3 lines. Look for A01B 13/06 and A01B 13/04. That is, if a given IPC is A01B 13/04, the subclassifier A01B 13/06 of A01B 13/04 can be found, and the subpatent classification containing search is summed up by adding all the subpatent classification symbols found together with oneself. And patent information including lower patent classification.

First, at a patent classification code level having at least one dot in title information describing a patent classification code, a hierarchical relationship may exist between patent classification codes having a patent classification code notation of the same type. In this case, the conventional search engine 7000 finds only patent documents matching the input patent classification code. However, if the present invention is applied, not only the patent documents matching the input patent classification code, but also the patent classification code system When there is a lower patent classification code that is dependent on the patent classification code, even a patent document matching the lower patent classification code may be found as a search result. Through this, it is possible to minimize the occurrence of patent documents included in the patent classification code logically input, but excluded because the patent classification code is different.

Second, the present invention may be applied to a patent surveillance for performing a search using a predetermined search expression for a new patent document or an updated patent document and a patent analysis for statistically analyzing the searched results. Through this, although the patent documents included in the logically input patent classification code, even the patent documents excluded because the patent classification code is different will be included in the monitoring and analysis target. In addition, the accuracy of monitoring and the set of analysis targets are increased, and thus the precise monitoring and analysis target set can be accurately analyzed.

Third, by applying the idea of the present invention, it is possible to accurately count the number of patent documents related to a specific patent classification code.

Fourth, there is an advantage that the search speed becomes faster when the range search is performed among the sub-class including search techniques of the present invention.

Applicant's representative name preprocessing module (3600)

Applicant names (including patentees, assignees) included in a patent document may be expressed in two or more different notations, despite the same subject. If the company's company name is changed, the company registration number or the business registration number, etc. are maintained after the change, but the applicant's name is changed, and the patent document with the name after the change is coexist. In addition, in the case of filing an overseas application from the first country to the second country, the applicant's notation in the first country and the applicant's notation in the second country are often different, and even in the second country, many notations are often expressed. As described above, solving the problem in which the same subject is expressed in a different notation is a function performed by the applicant representative preprocessing module 3600 of the present invention.

There are three main reasons for such a problem. The first type is when the applicant's notation changes substantially due to a change in company name or merger. In this case, it is necessary to reflect the information about the change of the applicant's name in the patent information database 2300 through the company information DB 2700. The second type is the case in which different companies use different names for their representatives. In particular, foreign companies often do not have a uniform representation. In this case, 1) unification in the country is relatively consistent, and 2) unification based on the applicant's notation in the country, taking into account that most of the incidents coming from abroad include priority claims. Can be set.

The configuration of the applicant representative preprocessing module 3600 is well illustrated in FIG. 7. Applicant representative name preprocessing engine 3610, which is a core engine including an algorithm for processing the representative name of the applicant, and representative name rule DB 3630 including rules for processing the representative name, and information on which the name of the applicant is changed. Applicant's history DB 3650 is included. In particular, the applicant's history DB 3650 may include patent change information (assignee change information), and may include company name change information due to a company name change, merger and division. In order to process the representative name, the representative name standard DB (3670), which is the standard of the representative name, is required, and these include the treaty priority information DB (3671), PAJ DB (3673), KPA DB (3675), and Inpadoc DB. (3677), there is a family information DB (3830), in particular, PAJ DB (3673), KPA DB (3675) is preferably fully utilized to solve problems such as notation. Representative applicant information is stored in the applicant representative name DB 3690.

Hereinafter, the applicant representative name preprocessing module 3600 will be described in detail how to perform the applicant name name.

An exemplary method for performing the representative representation by the representative justification preprocessing module is well illustrated in FIG. 48.

The representative name preprocessing module removes the non-identifiable elements from the applicant name information (S4820), obtains the company name change information (S4830), and performs all the documents in the name of the applicant before the change and the name after the applicant for a specific period of time. Find (S4840), obtain the address information for the mission before and after the change and compare its identity (S4850), and if the address information is the same, represent it with the same applicant, if the address information is not the same, (S4806), if the representative name is the same, if the representative name is the same, if not the same, if not the IPC main group is extracted from the application in the name before the change (S4870), the application in the name after the change Extract the IPC main group in (S4880), and if there is something common in both the extracted IPC main group, the representative name to the same applicant (S4890)

Hereinafter, the representative nameization process will be described in more detail. The company information DB 2700 of the present invention includes 1) company personal information such as company name, address, CEO, corporation registration number, business registration number, 2) financial information, 3) information on products or handling items, 4 A) change information such as company name change, merger, split, etc .; and 5) disclosure information. The representative representative preprocessing module 3600 may represent the name of the applicant of another notation based on the company name recognized as the identity based on at least one or more specific time points (for example, the current time point). Representative name of the applicant is preferably stored in a separate field rather than overwriting the patent information database (2300) consisting of information obtained from the patent publication. The first type of representative naming process is performed as follows.

First, it removes elements that are not discernible, such as Corporation, Kaishiki Gabur, Inc., ltd, co, etc.

Second, the company information DB (2700) obtains the change information of the company name. Assume that at some point in time A, the company name is a, the address is a1, the company name at another point in time b is b, and the address is b1. The patent information database 2300 or the search engine 7000 finds all documents in the application name a from the time point A to the time point B as period information. At this time, if the address information is a1 (or b1-address is more likely to be moved earlier. There are more than the change in the name of the company), all of them are identified as the same applicant.If the address information is c1 to cn, the tag is read. Paste and save. In the patent information database 2300 or the search engine 7000, all documents in the name B of the applicant are found from time A to time B as period information. In this case, if the address information is a1 or b1, all are identified by the same applicant. If the address information is c1 to cn, a tag is stored. At this time, even if the address information is different (c1 ~ cn), the name of the representative director is the same (the patent document filed in a specific period includes the representative director information), or the patent classification code of the patent document of b name is a If there is an identical document at the subclass and / or subgroup level identified in the patent application in the name, it is classified as the same applicant.

Third, the document information is obtained by querying the search engine 7000 or the patent information database 2300 for a (company name, address) set identified at each time point.

Fourth, a union operation is performed on the document sets identified in the second and third, and the representative name is performed based on the most recent company name. It is preferable that 1) the company name at each time point and / or 2) each corresponding patent document correspond to the representative company name. In case of obtaining public information on the patent document of the representative name of the company, the applicant representative name may be updated. (In the company disclosure information, the patent document is included, or in the company information DB 2700). An example is the case where patent information is included.)

Next, the second type of representative naming process will be described. The second type of representative name is characterized by using a priority claim number, as shown in FIG. 49. When there is treaty priority information in a patent document obtained from a first country, the representative nameization preprocessing module obtains a treaty priority number and information of the applicant's name of the obtained patent document (S4920), and retrieves the treaty priority information from a search engine ( 7000) or obtain the patent document information of the home country, which is the basis of the treaty priority through the DBMS 2100 (S4930), the applicant included in the patent document information of the home country and the applicant of the patent document obtained in the first country. The applicant's name will be representatively represented between countries in a manner of treating the name in the same manner (S4940).

If a priority is filed from a first country to a second country, the second country patent information database 2300 and the first country patent information database 2300 are the basis of the priority claim number and the claim of priority. Information regarding patent application numbers can be obtained. If the patent application number in the first country filed by the applicant whose company name is in the first country is present in the priority claim number of the second country, the second country patent application including the priority claim number Applicants may be considered to be substantially the same Applicants. (Of course, the transfer of priority in a second country may occur, but this is not common.) Of course, in the second country patent information database 2300, If there is a priority claim number originating in one country, the same principal in the first and second stations can be found by searching this first claim number in the first country. If the same subject is found, the notation with different names in the second country may unify the notation with any of them. That is, in the case where the notation of the e applicant is indicated as f, g, or h in the second country, f may be selected by selecting f from the f, g, or h.

For example, when a company based in Japan, SONY, is listed in Korea, it can be used in various ways, such as "Sony Kaishiki Kabusa" and "Sony Kaishiki Kabusha." ? Unified notation The same will be true in the United States, even when a US applicant is filed in Korea or Japan. In other words, in a patent application that crosses a border, priority claims can be used to identify and represent subjects in the first and second states.

Representative phrase extraction preprocessing module (3700)

Next, the representative phrase extraction module of the present invention will be described. First, the concept of representative phrases will be explained. Representing phrase refers to a phrase or phrase consisting of two or more words that can represent the entirety of a specific document or a part of the specific document through the representative phrase. A basic attribute of the representative phrase of the present invention is quite sparse in a given set of representative phrase extraction entire documents, while a predetermined representative phrase extraction target document set or a representative phrase extraction purpose document or a part of the representative phrase extraction purpose document is given. Extraction of established representative phrases Target phrases should be phrases that occur quite frequently in a common part of each document.

The representative phrase may include 1) a phrase consisting of only nouns, 2) a phrase consisting only of nouns and verbs, and 3) a phrase formed of an adjective or an adverb. The length of the representative phrase is preferably 1 to 5, more preferably 2 to 3 based on the number of words. Usually, the technical concept is generated by one word, but in many cases, the technical concept or technical action or effect is composed of two or three words.

For example, 1) a patent document set generated by a method of specifying a patent document set by a specific patent classification code on a specific patent classification code system in a specific country DB. A set of patent documents generated by a method of specifying a set of patent documents by a specific applicant's name in a country DB, and 3) the name of a specific inventor included in the patent document of a specific applicant in a specific country DB (ie, the name of the applicant and the name of the inventor) 4) a patent document set generated by a method of specifying a patent document set by 4) a patent document set generated by a method of specifying a patent document set by a specific agent name in a specific country DB, and 5) in a specific country DB. A set of patent documents by a specific patent classification code in a specific patent classification code system and a specific applicant name 6) Patent document set generated by a specific method; 6) Patent document generated by a method of specifying a patent document set by a specific patent classification code, a specific applicant name and a specific inventor name in a specific patent classification code system in a specific country database; A set of patent documents generated by a method of specifying a set of patent documents by a specific applicant name and a specific agent name in a specific country DB, 8) a set of all patent documents in a specific country, 9) a set of at least two countries For example, all patent document sets, and 10) patent document sets specified in units of periods set in 1) to 9) above will be examples.

The representative phrase extraction target document set is a concept relative to the representative phrase extraction whole document set, and a subset of the representative phrase extraction full document set is sufficient, but preferably the size of the subset is smaller. Examples of the representative phrase extraction target document set include: 1) one specific application, all applications of a specific company, a specific inventor's application, a specific inventor's application of a specific IPC, all applications of a specific IPC of a specific company, and a specific year of a specific IPC. All applications, etc. will be an example.

On the other hand, an example of a representative phrase document for extracting phrases may be, for example, the claims, the independent claims in the claims, the dependent claims in the claims, the effect or industrial applicability of the invention, and the like. On the other hand, a common part of each document of the predetermined representative phrase extraction target document set will be the aforementioned patent claims of all the documents constituting the representative phrase extraction target document set.

Next, the representative phrase extraction process will be described in detail. The representative phrase extraction is performed by the representative phrase extraction preprocessing module 3700 of the present invention. The representative phrase extraction preprocessing module 3700 of the present invention includes 1) a morphological analysis engine for each language, 2) a phrase generating engine, 3) a counting engine for each phrase, and 4) various dictionary databases including a thesaurus. Includes a representative phrase extraction engine. The configuration of the representative phrase extraction preprocessing module 3700 is well illustrated in FIG. 8. When the representative phrase extraction preprocessing engine 3710 including an algorithm for extracting the representative phrase, the representative phrase extraction policy DB 3730 including information on the policy that is the basis for extracting the representative phrase, and the representative phrase are extracted. Representative phrase-frequency-application number correspondence DB 3750 including various counting or calculation information such as the frequency value for each representative phrase and information on which position (field, etc.) of the representative phrase came from It is. On the other hand, using a thesaurus DB (3770) for the processing of synonyms or synonyms and a translation system for processing two or more languages, or using a pre-translated dictionary, representative phrase translation DB containing translation information about the representative phrase (3790) may be further included. Hereinafter, the representative phrase extraction preprocessing engine 3710 of the present invention will be described in more detail.

Morphology is the minimum language element that makes up a word. The easiest things to think about are "nouns", "pronouns", "investigations", "adjectives", "verbs" such as "proverbs", "adverbs", "adjectives", "interjections", "interjections", " There are functional words such as survey, mother, fresh ending, and affix. Morphology is divided into real morphemes that have practical meanings and functional morphemes that are in charge of functional elements, and the process of separating them comes first in morphological analysis for index word extraction. In a word, morphemes are no more than language elements that can no longer be separated into separate meanings or functions. The functions that the morphological analysis engine should have are the identification and characterization of string types, the search function of the electronic dictionary, the operation of various rules (eg, judgment, verb judgment, part-of-speech transition judgment, etc.), and compound noun processing. Since each language morpheme analysis engine is a well-known technique, the operation method thereof will be omitted. The morpheme analysis engine analyzes a given sentence or phrase by morpheme and outputs real morphemes.

The phrase generation engine of the present invention receives the output real morphemes, and generates 1-5 (preferably 2-3) real morpheme arrays in the real morpheme units. For example, when one sentence included in one patent document is input, the actual morphemes to be output are a b c d e f, g in order of morphemes. In this case, when the phrase generation unit of the phrase generation engine is three words, the phrase generation engine generates the actual morpheme-specific phrases abc, bcd, cde, def, and efg. The phrase generation engine generates phrases in units of sentences for a given document or part of a document. As an example of generating a phrase for a document part, the phrase may be generated by targeting sentences in a patent claim. The method of generating the array is a method of generating a phrase using nC2, nC3, nC4, nC5 for the n phrases when n is processed in one sentence unit but there are n real morphemes extracted from one sentence. (For example, when nC2 is applied, the globs are generated ab, ac, ad, ae, af, ag, bc, fg.), 2) If there are m real morphemes in the document unit, Method of applying the method of 1), 3) a method of arranging two to five real morphemes sequentially (for example, when two real morphemes are arranged sequentially, ab, bc, cd, de, ef, fg, and the three real morphemes are abc, bcd, cde, def, and efg. Of course, you can use both two and three real morphemes.)

On the other hand, the real morphemes that have passed through the morpheme analyzer are also termed term. The real shape or term may vary depending on the settings in the morphological analyzer. At this time, examples of the setting value may include 1) separating only the spoken word, 2) separating only the word, extracting only the representative type, and 3) extracting only the representative type in the case of adjectives or adverbs.

Subsequently, the phrase-specific counting engine essentially generates (phrase, counting value) information for each of the generated phrases, preferably generates (phrase, counting value, document number) information, and more preferably ( Phrase, counting value, document number, location field name on the document (for example, claims) information is generated. The phrase-specific counting engine stores the generated information in a representative phrase DB. The following table shows an example of data included in the representative phrase DB. The above example shows an example of data generated for a specific phrase by country.

Phrase ID Phrase Phrase word count Cumulative counting value in document (based on document number) country code Document number Phrase location ... "Document absolute ID" One abc 3 One KR 10-2003-0012345 Claims One One abc 3 2 KR 10-2003-0012345 Claims 2 One abc 3 3 KR 10-2003-0012345 Detailed description of the invention 3 One abc 3 4 KR 10-2003-0012345 Detailed description of the invention 4 One abc 3 5 KR 10-2003-0012345 Detailed description of the invention 5 One abc 3 6 KR 10-2003-0012345 Detailed description of the invention 6 One abc 3 7 KR 10-2003-0012345 Detailed description of the invention 7 2 bcd 3 One KR 10-2003-0012345 Claims 8 2 bcd 3 2 KR 10-2003-0012345 Claims 9 2 bcd 3 3 KR 10-2003-0012345 Claims 10 2 bcd 3 4 KR 10-2003-0012345 Detailed description of the invention 11 2 bcd 3 5 KR 10-2003-0012345 Detailed description of the invention 12 2 bcd 3 6 KR 10-2003-0012345 Detailed description of the invention 13 2 bcd 3 7 KR 10-2003-0012345 Detailed description of the invention 14 ... ... ... ... ... ... ... One abc 3 One KR 10-2003-0056789 Claims 150 One abc 3 2 KR 10-2003-0056789 Detailed description of the invention 151 One abc 3 3 KR 10-2003-0056789 Detailed description of the invention 152 ... ... ... ... ... ... ... ...

It can be seen that the data shown in the table is generated by the patent documents 10-2003-0012345 and 10-2003-0056789, and the phrase generation engine can be seen that the phrase is generated in three real morphological units. In addition, the phrase abc in 10-2003-0012345 can be seen that twice in the claims and five times in the detailed description of the invention. In addition, the phrase bcd can be seen that three times in the claims and four times in the detailed description of the invention. In addition, the phrase abc is found in the patent document 10-2003-0056789 once in the claims and two times in the detailed description of the invention. Therefore, the phrase-specific counting engine of the present invention can generate data as shown in the table above for all patent documents obtained either repeatedly or recursively. In addition, the phrase generation engine may generate phrases in units of two real morphemes, and for phrases generated in the two real morpheme units, the phrase-specific counting engine of the present invention may generate data as shown in the above table. It will be obvious. Furthermore, the phrase-specific counting engine may generate data as shown in the table even in one or four to five real morphological units.

In this case, it may be problematic to generate the phrase ID. The method of generating the phrase ID is obvious in a general DB technology, but some exemplary methods are provided. In the first method, IDs are sequentially assigned to the first generated phrases, and existing IDs are assigned to existing phrases if the existing phrases are searched for next generated phrases. This process is repeated or recursively performed for every phrase obtained. In the second method, a temporary ID is sequentially assigned to all phrases obtained without giving an ID to a phrase to generate data as shown in the above table, and then the same official ID is given to the same phrase while reading one for each phrase. The process is performed repeatedly or recursively for phrases that are not given all canonical IDs.

The phrase-specific counting engine of the present invention may generate a phrase absolute ID every time a phrase is generated and processed and assign it to every phrase.

In addition, the phrase counting engine for each phrase of the present invention may generate a cumulative counting value for each phrase based on a target document set. In the target document set, the cumulative counting value may be calculated based on a single document as shown in the above table, and it will be apparent that the cumulative counting is possible even in a specific field (for example, the claims) within a single document.

In addition, the phrase counting engine for each phrase of the present invention may generate a cumulative counting value for each phrase based on the entire document set. (In the above example, the entire document set is referred to as patent documents 10-2003-0012345 and 10-2003-0056789. A numerical value was entered based on the above table, and the present invention is applied to a much larger set of documents.

Phrase ID Phrase Cumulative Counting Value (Based on Entire Document Set) Related phrase absolute ID One abc 10 1, 2, 3, 4, 5, 6, 7, 150, 151, 152 2 bcd 7 8, 9, 10, 11, 12, 13, 14

In addition, the phrase-counting engine of the present invention may generate a cumulative counting value for each phrase based on a specific field (for example, claims) of the document.

Phrase ID Phrase Cumulative Counting Value (Based on Claim) Related phrase absolute ID One abc 3 1, 2, 150 2 bcd 3 8, 9, 10

Next, the representative phrase extraction engine of the present invention will be described. Representative phrase extraction When (phrase, counting value, document number) data as shown in the following table is generated in the entire document set, the representative phrase extraction engine of the present invention is based on 1) the frequency of appearance of all phrases, by phrase ID. Matches the probability value (= the number of occurrences of a specific phrase / the total number of phrases), selects phrases corresponding to a preset probability value range as candidate representative phrases, and refers to a predetermined phrase selection rule, and represents representative phrases for each target document set. Select. It will be apparent that the number of appearances can be calculated for each specific field. In the following example, a representative phrase is extracted by counting the number of occurrences of each phrase by document number.

Phrase Frequency of appearance in the document Document number Number of occurrences in total (T) Appearance / total appearance () Number of occurrences in total / Total number of phrases (billion) abc 40 #One 80000 0.05 0.008 abc 2 #2 80000 0.0025 0.008 abc 200 # 3 80000 0.25 0.008 bcd 8 #One 200 4 0.00002 bcd 100 #2 200 50 0.00002 bcd 2 #4 200 0.1 0.00002 cde 15 #One 3000 0.5 0.0003 cde 100 #4 3000 3.3 0.0003

As can be seen from the above table, every phrase has a phrase absolute ID, a phrase ID corresponds to each phrase absolute ID, a document number corresponding to the phrase phrase corresponds to each phrase absolute ID, and a bibliographic matter for each document number. It is corresponded. Therefore, obtaining the document number of the table and the number of occurrences of the phrase ID by the document number may be an example of the target document set as the document number. Similarly, a predetermined level of IPC may correspond to the document number digit, a specific applicant or a specific inventor may correspond, and in each case, the number of occurrences of the phrase ID for each target document set may be counted. Counting the number of occurrences per phrase ID by the target document set may be performed by a join command for each table in the DMMS.

In this case, for example, the representative phrase selection rule is 1) the total number (T) of the total number of phrases (for example, 1 billion) is less than 1/1000, and 2) the appearance of the desired document number. If the number is more than 1 / 1,000,000, and 3) the number of appearances / total appearances () is 10 to 1, it is examined whether each phrase can be a representative phrase of each document number. The phrase abc cannot be representative of any of document numbers # 1 to # 4 (condition 1), and the phrase bcd can be a phrase representing the document number only in document number # 2 (document number 1 And condition 2) in violation of document number 4), and the phrase cde may be a representative phrase only in document number # 4 (condition 3) in violation of document number 1). , cde is not included, the representative phrase of document number # 2 may include bcd, the phrase abc is not included in document number # 3, and the phrase cde may be included in document number # 4.

In this case, too many representative phrases may be assigned to a specific document number. That is, for a particular document, there may be 100 representative phrases satisfying the above-described conditions, in which case, 4) 10 to 30 representative phrases are presented in order of high frequency of occurrence calculated for each representative phrase. By applying the extraction rule, the number of representative phrases can be limited. On the other hand, a particular document may occur when there is no one or more representative phrases, in this case, by applying the condition 3) under the above-described conditions, the number of representative phrases may be maintained at ten to thirty. .

If the above process is repeated for all documents or all document sets, representative phrases of a predetermined number range (for example, 10 to 30) for all documents may be matched. Therefore, the representative phrase corresponding to the document number can be obtained through the above process. The representative phrase and the calculated value for the representative phrase (e.g., the number of appearances in the document of the document number, the number of appearances in the whole, etc.) are treated as one example of the bibliographic matter for the document number, and are used for various analysis. Can be utilized.

In the above embodiment, the appearance frequency is calculated in document units, and the appearance frequency is 1) a document set or 2) a field unit within a document (such as a claim) or 3) a field inside all documents in a document set. It may be calculated on the basis of the contents contained in (for example, paragraph 1 of the claims included in all documents in IPC H04B 7/02 of the Republic of Korea, filed from 2000 to 2005). At this time, in the case of one document, it may be treated as one document (corresponding point of document number). However, in the case of two or more document sets, the correspondence of document numbers may seem to disappear, but any one of the following three methods may be used to easily solve this problem. This method extracts representative phrases in units of individual documents belonging to a set of documents, performs a union operation on the representative phrases, and then limits the number of representative phrases to a predetermined range (for example, 10 to 30). 2) if a representative phrase is already extracted for each document number, a method of obtaining a representative phrase corresponding to the document number belonging to the document set, performing a union operation, and then limiting the number of representative phrases to a predetermined range; After all the documents belonging to the document set are processed, each phrase may be used to extract a representative phrase corresponding to the unique ID of the document set rather than the document number. 3) Even in the case of content units included in fields in all documents in the document set, the above 1) summing processing and 2) document set unique ID correspondence processing methods may be used. , 3) the summation treatment method after acquisition may be used.

For example, a set of documents to be extracted from the representative phrases includes, for example, 1) a patent document set generated by a method of specifying a patent document set by a specific patent classification code in a specific patent classification code system in a specific country DB, and 2) a specific country. A set of patent documents generated by a method of specifying a set of patent documents by a specific applicant's name in a DB, 3) the name of a specific inventor included in the patent document of a specific applicant in a specific country DB (ie, the name of the applicant and the name of an inventor) 4) A patent document set generated by a method of specifying a patent document set by 4) A patent document set generated by a method of specifying a patent document set by a specific agent name in a specific country DB, and 5) A specific country DB. A set of patent documents can be specified by a specific patent classification code in a patent classification code system and a specific applicant name. 6) A patent document set generated by a method; 6) A patent document set generated by a method of specifying a patent document set by a specific patent classification code, a specific applicant name, and a specific inventor name in a specific patent classification system in a specific country database. 7) a set of patent documents generated by a method of specifying a set of patent documents by a specific applicant name and a specific agent name in a specific country DB, 8) a set of all patent documents in a specific country, 9) all of at least two countries Patent document set, 10) Patent document set specified in units of time periods set in 1) to 9), 11) Patent document generated by combining specific conditions such as registration, request for examination and the like in 1) to 9). It may be one or more of a set.

Hereinafter, a method of extracting the representative phrase by using an indexer of the search engine 7000 connected to the morphological analysis engine will be described. The reason for using the search engine 7000 is that the search engine 7000 generally has an excellent performance in counting the number of search word values, and the data indexed by the indexer can be easily converted into data for DB. Because there is. The indexer stores the term from which the term was obtained and the document number from which the term appeared or, in some cases, the field name from which the term appeared. For example, (term 1, # 1) means that term 1 was obtained from document # 1, and (CL: term 1, # 1) means that term 1 is a patent claim (Claim, CL of document # 1). ) Is obtained from a field called). In the index of the search engine 7000, a lot of data such as (term 1, # 1) or (CL: term 1, # 1) are stored, and the term 1 is entered as a search term, or the search field is set as a claim. If you enter term 1 only, document number # 1 is output as a search result. The search engine 7000, on the other hand, handles very quickly how many terms 1 are in the entire document or how many are included in the claims. Return the count first, then show the first part of the total number first.)

In this case, the phrase generation engine of the present invention obtains n real morphemes / terms passing through the morpheme analysis engine, and combines the obtained n terms in a predetermined manner to combine the terms with the document number. Together with the indexer of search engine 7000. (If the document number is already known by the index, it is not necessary to transmit the document number. For convenience of understanding, the document number as the source of the combined term is transmitted.) In this case, the terms are transmitted. As described above, as described above, 1) processing by one sentence unit to combine and process all the terms obtained in one sentence by 2 to 5 terms in all possible ways, 2) the entire document unit A method of combining all the terms included in the term and processing them in every possible way by 2 to 5 terms (in this case, the combination of the terms is very large, which increases the processing time, but it is possible to generate the most precise phrase set. 3) Any one or more methods of sequentially combining 2 to 5 terms in one sentence may be used. Of course, in the processing method of the entire document unit, the processing method of the paragraph unit and the specific field unit (the claims, etc.) may also be treated in the corresponding manner as described above.

For example, as follows. The phrase generation engine of the present invention receives the output real morphemes, and generates 1-5 (preferably 2-3) real morpheme arrays in the real morpheme units. For example, when one sentence included in one patent document is input, the actual morphemes to be output are a b c d e f, g in order of morphemes. In this case, when the phrase generation unit of the phrase generation engine is three words, the phrase generation engine sequentially generates actual morphological phrases such as abc, bcd, cde, def, and efg or ab, ac, ad, ae, af, The phrase can be generated in two real morphological units such as ag, bc, ... fg (as described above). In this case, the phrase generation engine transmits phrases (= multiple terms) such as abc, bcd or ab, ac to the indexer. The indexer stores the received phrases (multiple terms) as (abc, # 1), (bcd, # 1), (ab, # 1), (ac, # 1), and so on. At this time. If the fields are limited, the phrase (pl: abc, # 1), (CL: bcd, # 1), (CL: ab, # 1), (CL: ac, # 1) Save as index including the specific field name. The following is a conceptual table showing an example of an index.

Phrase Document number field abc #One D abc #One D abc #One D abc #One C abc #One C bcd #One D bcd #One C ac #One D abc #2 D abc #2 D abc #2 C

D is the description of the invention, C is the claim.

In the index, the phrase abc appears three times in the detailed description of the invention of document # 1, two times in the claims, and the phrase bcd appears one time in the detailed description of the invention of document # 1. And appears once in the claims and the phrase ac shows once in the description of the invention in article 1. On the other hand, the phrase abc appears twice in the detailed description of the invention of document # 2, and shows that one appears in the claims.

At this time, the phrase counting engine for each phrase of the present invention receives the index data, and generates data about the number of phrases (a plurality of terms) and a document number as a source of the phrase. The generated data is the same as or corresponds to the data generated in the above-described manner, and may be as follows, for example, for the index.

Phrase ID Phrase Document number field Appearance One abc #One D 3 2 abc #One C 2 3 abc #2 D 2 4 abc #2 C One 5 bcd #One D One 6 bcd #One C One 7 ac #One D One

As described above, the representative phrase extraction preprocessing module 3700 of the present invention may generate counting data for each phrase by using the indexer of the search engine 7000 and the index, and based on the counting data for each phrase, In a manner as described above, representative phrases can be extracted from the content of each document, a predetermined document set, a content of a specific field, or all specific field content extracted from a predetermined document set.

The representative phrase information preprocessing method as described above is well illustrated in FIGS. 55 to 57.

A method of generating a combination of real morphemes for extracting representative phrases through the representative phrase extraction preprocessing module 3700 based on FIG. 55 will be briefly described.

The representative phrase extraction preprocessing module 3700 obtains a document set including at least two patent documents (S5520), and processes the entire individual patent documents extracted from the document set or contents of various fields by a morpheme analyzer to obtain two or more documents. A real morpheme (term) is extracted (S5530), and all possible combinations of two or more real morphemes in a predetermined manner according to a predetermined criterion with respect to the extracted real morphemes are generated (S5540), and the generated real morphemes The combination of the patent document information is stored in the DB, or transmitted to the search indexer (S5550) in a manner to generate a real morpheme for extracting the representative phrase.

A method of generating a combination of real morphemes for extracting representative phrases for each field / partial document set through the representative phrase extraction preprocessing module 3700 based on FIG. 56 and extracting a combination of real morphemes meeting a predetermined condition. Briefly explain.

The representative phrase extraction preprocessing module 3700 obtains a document set including at least two patent documents (S5620),

The individual patent documents extracted from the document set or contents of various fields are processed by a morpheme analyzer to extract two or more real morphemes (terms) (S5630), and two or more according to preset criteria for the extracted real morphemes. Generate all possible combinations of real morphemes (S5640), store the generated combinations of real morphemes in the DB including the patent document information, or send them to a search indexer (S5650), and each document constituting the document set. Obtain a bibliography of and generate a document subset based on at least one criterion (S5660), wherein the number of combinations of the real morphemes defined in the document subset and the real morphemes belonging to the document (whole) set By obtaining the number, a combination of real morphemes satisfying predetermined conditions for the entire document or various fields is extracted (S5670). ,

Referring to FIG. 57, a method of generating a combination of real morphemes for extracting representative phrases through the representative phrase extraction preprocessing module 3700 and comparing each document set will be briefly described.

The representative phrase extraction preprocessing module 3700 obtains a plurality of document sets including at least two patent documents (S5720),

For each document set, two or more real morphemes (terms) are extracted by processing with a morpheme analyzer on all individual patent documents extracted from the document set or contents of various fields (S5730), and generating a combination of the extracted real morphemes (S5730) In operation S5740, the generated combination of the actual morphemes is stored in a DB including the patent document information or transmitted to a search indexer (S5750), and the combination of the actual morphemes is compared for each of the plurality of document sets. (S5760)

Multiple Patent Classification Symbol Relational Preprocessing Module 3900

There are many documents in which two or more patent classification codes are assigned to one patent document. This trend is characterized by the fact that a plurality of patent classification codes are assigned to a single patent document according to 1) expansion of the scope of 1 patent application, 2) advancement of the invention, 3) trend of technology convergence, and 4) precision of patent classification code assignment. It's growing. The plurality of patent classification code relationship preprocessing module 3900 of the present invention aims to find and utilize a hidden relationship between the plurality of patent classification codes. The plurality of patent classification code relationship preprocessing module 3900 may be configured to display a hidden relationship between the same patent classification codes based on only one of IPC / UPC / FT (that is, based on the same type of patent classification code). A plurality of patent classification symbol relational preprocessing module 3910 of the same kind aimed at finding and generating information on the convergence of technology, and two or more patent classification symbols selected from among IPC, UPC, FT, etc. in one document And a heterogeneous plural patent classification code relation preprocessing module 3930 that grasps the relationship between the two or more patent classification codes. 10 shows the configuration of the plurality of patent classification code relational preprocessing module 3900, the configuration of the same kind patent classification symbol relational preprocessing module 3910 and the configuration of the heterogeneous plurality of patent classification symbol relational preprocessing module 3930. have.

Homogeneous Multiple Patent Classification Symbol Relationship Preprocessing Module 3910

Hereinafter, the same kind of patent classification code relation preprocessing module 3910 of this invention is demonstrated. Even if a document is assigned a plurality of patent classification codes of one kind or two or more types of patent classification codes, the processing of the plurality of patent classification codes on the selected one patent classification code system is performed. The classification code relational preprocessing module 3910 performs. The processing of the plurality of patent classification codes is performed by the same kind of patent classification code relational preprocessing engine 3911 of the present invention, and the result of the execution is the same or similar patent classification code relation DB 3913 of the present invention. Are stored in.

Theoretically, the explanation is given first, followed by concrete examples. First, as a simple model, a relationship processing method for a plurality of patent classification symbols in a case where two documents are included in one document is presented. Assume that a patent document is assigned a patent classification code A1 and a patent classification code B1. At this time, in the patent classification code system, the parent node (parent patent classification code) of A1 is A2, and the parent node of A2 is A3. When this rule continues, the parent node of A1 is A2, A3, A4,. ... can be An. Similarly, B1 can be assigned to B2, B3, B4, ... Bn. The highest of these An and Bn become sections. And above the section, let's just have a patent classification code name such as IPC. In this case, the An and the Bn have at least one or more common nodes under a section or patent classification system name of IPC (even if the sections are farthest from each other, such that they share the same classification system of IPC). Are identical at the lowest level on the patent classification code system of the common nodes. At this time, if the lowest common patent classification code of A1 and B1 is Ai + 1 and Bj + 1, respectively, Ai + 1 = Bj + 1. When A1 and B1 are present in the contents of one patent document given above, A1 and B1 are related to the patent document (i.e., the invention or inventions described in one patent document are equivalent to those of A1 and B1). In this case, A1 is related to all parent nodes of B1 (B2, B3, ... Bj +). Similarly, B1 has a relationship with all of A1's parent nodes A2, A3, ... A (i + 1). At this time, since the relationship between A1 and Bj + 1 is the same as Bj + 1 and Ai + 1, it is a parent node anyway, so it is not necessary to discuss the relationship, and that of all As and Bj + 1 (= Ai + 1) Relationships exist in the parent node anyway, so there is no need to discuss them. In other words, the lowest common parent node would not be considered in the relation calculation table.

In this case, when processing the plurality of patent document symbols, the same type of patent classification code relation preprocessing module 3910 may generate the following data with reference to the patent classification code system (tree structure) data. At this time, Ai + 1 and Bj + 1 are cells that are not needed in the actual table (only Ai and Bj are needed in the relational table) or for convenience of explanation (to show that there are no values in the cells). Display. That is, in an actual table, a table is comprised only by Ai and Bj.

A1 A2 Ai Ai + 1 B1 One One One One B2 One One One One One One One One Bj One One One One Bj + 1 = Ai + 1

That is, it can be said that all the crossing pairs (for example, (A1, B1), ... (Ai, Bj), etc.) between A1 to Ai and B1 to Bj are related through the given patent documents. .

Republic of Korea Patent Application No. 10-2005-0111868 as of January 2006 is assigned H04B 7/26 and H04B 7/15. This will be described by way of example. The parents of H04B 7/26 become H04B 7/24, H04B 7/00, H04B, H04, H in turn. The parents of H04B 7/15 are, in turn, H04B 7/14 and H04B 7/00. In this case, the lowest common patent classification code is H04B 7/00. Therefore, the table is as follows. The cell associated with H04B 7/00 has no cell value as described above.

H04B 7/26 H04B 7/24 H04B 7/00 H04B 7/15 One One H04B 7/14 One One H04B 7/00

Therefore, based on the Republic of Korea Patent Application No. 10-2005-0111868, a pair of association of nine crossed patent classification symbols will be generated. At this time, when two or more patent classification codes exist for one document, the first one is referred to as the main patent classification code. Therefore, in this document, H04B 726 becomes the main patent classification code and is located at the parent node of the main patent classification code. Other higher patent classification symbols are also treated as the main patent classification symbol in a given patent document. The problem of the main patent classification code plays an important role in relation to handling when there are three or more patent classification codes in a document. When there are three or more patent classification codes, the patent classification codes can be processed as follows.

First, all patent classification codes are treated equally. When there are n patent classification codes, the method of taking a combination of two patent classification codes among the n patent classification codes is nC2 pieces mathematically according to the combination theory. For each combination of these nC2 patent classification codes, a process is performed when the patent classification codes are two, and as a result, nC2 tables are obtained, and each table has information about all crossing pairs. have.

Next, the main patent classification code is determined, the main patent classification code is taken, the other one is taken from n-1 sub-patent classification codes, n-1 combinations are taken, and then n-1 tables for each combination. In each table, first, all patent classification codes are treated equally. When there are n patent classification codes, the method of taking a combination of two patent classification codes among the n patent classification codes is nC2 pieces mathematically according to the combination theory. For each combination of these nC2 patent classification codes, a process is performed when the patent classification codes are two, and as a result, nC2 tables are obtained, and each table has information about all crossing pairs. have. In this case, a weight associated with the main patent classification code may be given to the crossing pairs related to the main patent classification code. Then, n-1C2 combinations are obtained for n-1 subpatent classification codes, and the above processing is performed for each combination to obtain information on all intersecting pairs. In this case, a weight associated with the subpatent classification code may be given to the crossing pairs related to the subpatent classification code.

Korean Patent Application No. 10-2006-0012606 has H04B 7/04, H04B 7/155, and H04Q 7/30 patent classification code assigned as of January 2006. The parent nodes of H04B 7/04 are H04B 7/02, H04B 7/00, H04B, H04 and H, respectively, and the parent nodes of H04B 7/155 are H04B 7/15, H04B 7/14 and H04B 7 /, respectively. 00, H04B, H04 and H, and the parent nodes of H04Q 7/30 are H04Q 7/20, H04Q 7/00, H04Q, H04 and H, respectively. At this time, the lowest common patent classification code is H04B 7/00 for the combination of H04B 7/04 and H04B 7/155, H04 for the combination of H04B 7/155 and H04Q 7/30, and H04B 7/04 and H04Q 7 It becomes H04 about / 30.

At this time, if all patent classification codes are handled equally, the following table of 3C2 numbers appears. First, there is a relation table of H04B 7/04 and H04B 7/155.

H04B 7/04 H04B 7/02 H04B 7/00 H04B 7/155 One One H04B 7/15 One One H04B 7/14 One One H04B 7/00

Next is the relation table of H04B 7/04 and H04Q 7/30.

H04B 7/04 H04B 7/02 H04B 7/00 H04B H04 H04Q 7/30 One One One One H04Q 7/20 One One One One H04Q 7/00 One One One One H04Q One One One One H04

Next, it is a relation table of H04B 7/155 and H04Q 7/30.

H04B 7/155 H04B 7/15 H04B 7/14 H04B 7/00 H04B H04 H04Q 7/30 One One One One One H04Q 7/20 One One One One One H04Q 7/00 One One One One One H04Q One One One One One H04

At this time, a method of giving a weight will be described. There are two main weights. First, there is a method of giving a greater weight to the relevance table with the main patent classification code described above, and less weighting the relevance table between the sub-patent classification codes. For example, there may be a method of giving 1 to the relevance table with the main patent classification code and 0.5 to the relevance table with the subpatent classification code.

Then, the relation table of H04B 7/155 and H04Q 7/30 will be as follows.

H04B 7/155 H04B 7/15 H04B 7/14 H04B 7/00 H04B H04 H04Q 7/30 0.5 0.5 0.5 0.5 0.5 H04Q 7/20 0.5 0.5 0.5 0.5 0.5 H04Q 7/00 0.5 0.5 0.5 0.5 0.5 H04Q 0.5 0.5 0.5 0.5 0.5 H04

Secondly, there will be a method of equally weighting a patent document having a plurality of patent classification codes. For example, when two patent classification symbols have a pair of patent classification symbols, the value of the association pair is 1, and for a pair of patent classification symbols having n patent classification symbols, the pair value of the relation is given. You can evenly allocate the number of possible combinations of nC2. That is, the weight may be 1 / (nC2). For example, when doing so, the relation table of H04B 7/155 and H04Q 7/30 is as follows.

H04B 7/155 H04B 7/15 H04B 7/14 H04B 7/00 H04B H04 H04Q 7/30 1/3 1/3 1/3 1/3 1/3 H04Q 7/20 1/3 1/3 1/3 1/3 1/3 H04Q 7/00 1/3 1/3 1/3 1/3 1/3 H04Q 1/3 1/3 1/3 1/3 1/3 H04

Third, there may be a method of assigning different weights to the pair associated with the main patent classification code and the pair associated with the subpatent classification code for a document having three or more patent classification codes. For example, when there are n patent classification codes, the number of combinations related to the main classification code becomes (n-1), so that the total of 75 is assigned to the relevant combination with the main classification code, A weight of 0.75 * 1 / (n-1) can be given. When assigning a weight of 25 to all combinations associated with subpatent classification symbols, all pairs associated with subpatent classification symbols may be weighted 0.25 * 1 / ((n-1) C2). At this time, the distribution of may be adjusted to a predetermined value. For example, if n> 5, 50 would be allocated to those related to the major patent classification code, 50 to those related to the subpatent classification code, 60 to 40 for n = 4, and n = 3 days. We can allot 75 to 25. That is, when the number of IPCs is greater than 3, (sub IPC, Sub IPC) patent classification symbol combination pairs are generated. Therefore, (main IPC, Sub IPC) patent classification symbol combination pairs and (Sub IPC, Sub IPC) patent classification symbol combination pairs. You can give different weights for.

When n = 3, allocating 75 to 25 can produce the following table. First, there is a relation table of H04B 7/04 and H04B 7/155.

H04B 7/04 H04B 7/02 H04B 7/00 H04B 7/155 0.75 / 2 0.75 / 2 H04B 7/15 0.75 / 2 0.75 / 2 H04B 7/14 0.75 / 2 0.75 / 2 H04Q 7/00

Next is the relation table of H04B 7/04 and H04Q 7/30.

H04B 7/04 H04B 7/02 H04B 7/00 H04B H04 H04Q 7/30 0.75 / 2 0.75 / 2 0.75 / 2 0.75 / 2 H04Q 7/20 0.75 / 2 0.75 / 2 0.75 / 2 0.75 / 2 H04Q 7/00 0.75 / 2 0.75 / 2 0.75 / 2 0.75 / 2 H04Q 0.75 / 2 0.75 / 2 0.75 / 2 0.75 / 2 H04

Next, it is a relation table of H04B 7/155 and H04Q 7/30.

H04B 7/155 H04B 7/15 H04B 7/14 H04B 7/00 H04B H04 H04Q 7/30 0.25 / 1 0.25 / 1 0.25 / 1 0.25 / 1 0.25 / 1 H04Q 7/20 0.25 / 1 0.25 / 1 0.25 / 1 0.25 / 1 0.25 / 1 H04Q 7/00 0.25 / 1 0.25 / 1 0.25 / 1 0.25 / 1 0.25 / 1 H04Q 0.25 / 1 0.25 / 1 0.25 / 1 0.25 / 1 0.25 / 1 H04

On the other hand, when the contribution of individual documents having a plurality of patent classification codes is the same (for example, 1) in document units, the following weighting method can be considered. As an extreme example, Korean Patent Application No. 10-2005-0042032 discloses two patent classification symbols, such as H04B 7/02 and H04B 7/14, and when they are in a next sibling relationship (i.e., H04B 7/02). And H04B 7/14, the parent node is the same as H04B 7/00, and the parent node is the parent patent classification code.) There is only one relationship table of H04B 7/02 and H04B 7/14. There is also one cell. The table for the Korean Patent Application No. 10-2005-0042032 document is as follows.

H04B 7/02 H04B 7/00 H04B 7/14 One H04B 7/00

At this time, it can be seen that H04B 7/02 and H04B 7/14 are strongly related to the specific patent document. On the other hand, based on the Republic of Korea Patent Application No. 10-2006-0012606, it has three, each table has six, 16 and 20 cells for each table. At this time, based on the combination of the patent classification code (H04B 7/02, H04B 7/14), the contribution of the document of Korean Patent Application No. 10-2005-0042032 and the Republic of Korea Patent Application No. 10-2006 The question arises how to assess the contribution of -0012606. The weighting process of the contribution may be as follows.

First, a combination of specific patent classification symbols (Ai, Bj) in any document, regardless of the existence or occurrence of a relationship, regardless of the number of cells occurring in the table or the table (e.g. (H04B 7/02, H04B) 7/14) can be treated as the contribution weight of the same value (e.g. 1).

Second, in consideration of the number of tables and the number of cells, the contribution weight of each patent document for a combination (Ai, Bj) of a specific patent classification code may be given differently. At this time, the contribution weight for the combination (Ai, Bj) of the specific patent classification code may be divided by the total number of all cells present in all tables generated in each patent document. For example, for (H04B 7/02, H04B 7/14), the contribution weight according to Korean Patent Application No. 10-2005-0042032 is 1 (= 1 table, 1 total number of cells), and Korea The contribution weight of patent application 10-2006-0012606 is 1 / (6 + 16 + 20) (= number of all cells in three tables).

Third, the weight of the contribution may be divided by the total number of cells in the table in which the combination (Ai, Bj) of the specific patent classification code appears. For example, for (H04B 7/02, H04B 7/14), the contribution weight according to Korean Patent Application No. 10-2005-0042032 is also 1 (= 1 table, total number of cells 1). And the contribution weight of Korean Patent Application No. 10-2006-0012606 is 1 / (6) (= number of all cells in three tables).

Fourth, there is a method of inversely calculating the contribution weight of the second or third. That is, the weight of the contribution may be multiplied by the total number of cells in the table in which the combination (Ai, Bj) of the specific patent classification code appears. For example, for (H04B 7/02, H04B 7/14), the contribution weight according to Korean Patent Application No. 10-2005-0042032 is also 1 (= 1 table, total number of cells 1). And the contribution weight of Korean Patent Application No. 10-2006-0012606 is 6 (= number of all cells in three tables). This contribution weighting method will be more promising in calculating the degree of convergence of heterogeneous techniques. In other words, if the number of cells in the table is small, the technology may be grouped as a highly related technology in the technology classification system itself. Because it's a distant technology.

By the above method, the following information about the patent classification code combination Ai and Bj may be obtained.

First, it is counting information about (H04B 7/02, H04B 7/14) (Ai, Bj). When the counting refers to the present invention or assigns a weight corresponding to the present invention, weighting counting information to which at least one or more weights are applied to the patent classification code combination Ai and Bj may be obtained.

Second, all patent classification code combinations store information on which document the combination was generated when the combination was created. That is, the combination of the patent classification symbols (H04B 7/02, H04B 7/14) is generated by Korean Patent Application No. 10-2006-0012606, and Korean Patent Application No. 10-2005-0042032, ( H04B 7/15, H04B 7/24) is a combination of patent classification code generated by the document of Korean Patent Application No. 10-2005-0111868. Therefore, the document unique number corresponds to the patent classification code combination Ai, Bj, and the document unique number may correspond to all the information about the document including all the bibliographic details of the document having the document unique number. . There are two related patent classification symbol combinations in all the tables, and a patent document from which the patent classification symbol combinations are found corresponds, and the bibliography of the patent document may correspond to the patent document. That is, Korean Patent Application No. 10-2005-0111868 corresponds to a document unique number for all patent classification code combinations Ai and Bj present in the relationship tables H04B 7/155 and H04Q 7/30. In addition, in the bibliographic matters of the document corresponding to the document unique number, the application number is 10-2006-0012606 for the document, the applicant is Samsung Electronics, the inventors are Choi Do-in and Hwang Sung-taek, and the application date is February 09, 2006. As such, the bibliographic information and all information about the document corresponding to the document unique number can be mapped. Of course, the document unique number may be an application number, and if the patent application is filed in the United States or the like, the result of the operation may be mapped (mapping) in the bibliography of the United States application.

The correspondence between the patent classification code combinations Ai and Bj and the document number may be stored in the DB together with the counting value upon generation of the patent classification code combinations Ai and Bj.

When the same kind of patent classification code relation preprocessing module 3910 has two or more patent classification codes for the patent documents obtained, the patent classification code system (tree structure) data is referred to for each combination of patent classification codes. Creates a predetermined number of tables for each combination of patent classification codes. In this case, the numerical value entered in each table may be a value reflecting a weight based on a predetermined criterion. Subsequently, the same plurality of patent classification code relation preprocessing module 3910 applies a predetermined contribution weight value to the combinations Ai and Bj of the patent classification symbols extracted from the respective tables, thereby applying a combination of patent classification symbols Ai, Relevance result data for each combination (Ai, Bj) of the patent classification code, such as the following table Bj) can be generated.

To illustrate this model, assume that there are only three patent documents: Korean Patent Application No. 10-2005-0111868, Korean Patent Application No. 10-2006-0012606, and Korean Patent Application No. 10-2005-0042032. Of course, iterative processing of all the documents obtained will enable generation of the following data for all patent classification code combinations (Ai, Bj) based on all document sets. , Bj) would create the following table:

Patent Classification Symbol Combination (Ai, Bj) Document number Frequency (simple frequency) 1 / nC2 equal allocation (M, S), (S, S) differential allocation (H04B 7/15, H04B 7/26) 10-2005-0111868 One One One (H04B 7/15, H04B 7/24) 10-2005-0111868 One One One (H04B 7/14, H04B 7/26) 10-2005-0111868 One One One (H04B 7/14, H04B 7/24) 10-2005-0111868 One One One (H04B 7/155, H04B 7/04) 10-2006-0012606 One 1/3 0.75 / 2 (H04B 7/155, H04B 7/02) 10-2006-0012606 One 1/3 0.75 / 2 (H04B 7/15, H04B 7/04) 10-2006-0012606 One 1/3 0.75 / 2 (H04B 7/15, H04B 7/02) 10-2006-0012606 One 1/3 0.75 / 2 (H04B 7/14, H04B 7/04) 10-2006-0012606 One 1/3 0.75 / 2 (H04B 7/14, H04B 7/02) 10-2006-0012606 2 1/3 0.75 / 2 (H04B 7/14, H04B 7/02) 10-2005-0042032 2 One One One 1/3 .. One 1/3 .. (H04Q 7/00, H04B 7/00) 10-2006-0012606 One 1/3 0.25 / 1 (H04Q 7/00, H04B) 10-2006-0012606 One 1/3 0.25 / 1 (H04Q, H04B) 10-2006-0012606 One 1/3 0.25 / 1

(n is the number of patent classification symbols), (M, S) refers to (main IPC, Sub IPC) and (S, S) refers to (sub IPC, Sub IPC), and if n> 2 or more, (M, S) , (S, S) The differential allocation weighted 75 / (n-1) for (M, S) and 25 / (n-1) C2 for (S, S). When n = 2, we just gave it 1.

At this time, when paying attention to the (H04B 7/14, H04B 7/02) patent classification code combination pair, it can be seen that two document numbers correspond. That is, the (H04B 7/14, H04B 7/02) patent classification code combination pair means that they appeared simultaneously in two documents, and the value of Frequency is 2. A weighting factor or contribution weight of a predetermined method such as 1 / nC2 equal allocation and (M, S) and (S, S) differential allocation may be assigned.

The table shows a combination of patent classification symbols for three patent documents of Korean Patent Application No. 10-2005-0111868, Korean Patent Application No. 10-2006-0012606, and Korean Patent Application No. 10-2005-0042032 (Ai , Bj). It will be apparent to those skilled in the art that the above method can be applied recursively or recursively to all documents obtained, and based on any one or more of the predetermined weight or the contribution weight, the combination of each patent classification code (Ai, Bj It will also be apparent that the relational data can be generated for.

Naturally, the method for processing the plurality of patent classification codes by the same type of patent classification code relation preprocessing module 3910 is not limited to the IPC. That is, a plurality of patent classification symbols may be processed for USPC for US patent documents, and for FT, FI, and ECLA for Japanese patent documents, in the same manner as the IPC.

In this case, the following information may be calculated, obtained or extracted with respect to the combination (Ai, Bj) of the patent classification code.

First, the same plurality of patent classification code relationship preprocessing module 3910 may obtain the number of occurrences of each patent classification code pair. For example, (H04B 7/26, H04B 7/15) appeared once in Korean Patent Application No. 10-2005-0111868, while H04B 7/14, H04B 7/02) was found in 10-2006-0012606. 10-2005-0042032 both appear in both patent publications. (When not the main patent classification code, or when all the patent classification code is treated equally, it can be treated as (Ai, Bj) = (Bj, Ai). If either is the main patent classification code, (Ai, Bj) And (Bj, Ai) may be treated differently, or may be treated the same.) Therefore, the homogeneous plural patent classification code relational preprocessing module 3910 calculates the number of times the pair has been generated for every pair of patent classifications. You can record it. In addition, it is possible to store patent document numbers for the patent documents issued by the pair.

Second, the same kind of patent classification code relation preprocessing module 3910 may find a patent classification code that is most frequently combined with the specific patent classification code when the specific patent classification code is given. This may be readily obtained by counting all pairs containing the given specific patent classification code and the number of times they come out. In this case, a patent classification code that is most frequently combined with the specific patent classification code may be found by applying a predetermined weight or a contribution weight, and with reference to the patent classification code system (tree structure), a predetermined level may be found. You will find patent classification symbols that bind most frequently in the unit. That is, for example, the homogeneous plural patent classification code relational preprocessing module 3910 may find a patent classification code that is most frequently combined with H04B 7/26, and the IPC sub class, IPC main group, or IPC. At the subgroup level you will find patent classification symbols that most frequently combine with H04B 7/26.

Third, the homogeneous plurality of patent classification code relation preprocessing module 3910 maps the bibliographic matter corresponding to the patent classification code pair and the patent document number through a corresponding relationship between the patent classification code pair and the patent document number. Various analysis results can be generated. The analysis result may obtain an analysis result of the patent classification code pair and at least one combination selected from 1) country, 2) period, 3) applicant, 4) inventor and 5) agent. For example, Samsung Electronics' Korean patent applications from 2000 to 2005 will show the most combined pairs of patent classification symbols. Furthermore, when the patent classification code is given, the homogeneous plurality of patent classification code relationship preprocessing module 3910 may find a patent classification code that best combines with the patent classification code. Furthermore, when the patent classification code is given, at least one combination selected from among 1) country, 2) period, 3) applicant, 4) inventor and 5) agent is the patent classification code that best combines with the patent classification code. You can also find it in a set of documents. For example, the homogeneous plural patent classification code relational preprocessing module 3910 may find each step patent classification code on the patent classification code system in which H04B 7/26 and the majority are combined, and in H04B 7/26. The US patent application of Samsung Electronics Co., Ltd. can be found from 2003 to 2005. Through this, it will be possible to grasp the degree of technology convergence shown in the patent specification for a particular subject during the specific period.

Fourth, the homogeneous plural patent classification code relational preprocessing module 3910, for a given combination of patent classification symbols Ai, Bj, generates a set of special patent documents related to the combination (Ai, Bj) of the patent classification symbols. You can match it. In this case, when the same plurality of patent classification code relationship preprocessing module 3910 performs various types of analysis on the corresponding set of patent documents, the analysis result is analyzed for the combination (Ai, Bj) of the patent classification code. Result. The special patent document set includes, for example, 1) a patent document set generated by a method of specifying a patent document set by a specific patent classification code on a specific patent classification code system in a specific country DB, and 2) the name of a specific applicant in a specific country DB. A set of patent documents generated by a method of specifying a set of patent documents by 3) a set of patent documents by a specific inventor name (ie, applicant name and inventor name) included in the patent document of a specific applicant in a specific country DB 4) A patent document set generated by a method of specifying a patent document; 4) A patent document set generated by a method of specifying a patent document set by a specific agent name in a specific country database; By a method of specifying a patent document set by a specific patent classification code and a specific applicant name Set of patent documents generated; 6) set of patent documents generated by a method of specifying a set of patent documents by a specific patent classification code on a specific patent classification code system, a specific applicant name, and a specific inventor name in a specific country database; A set of patent documents generated by a method of specifying a set of patent documents by a specific applicant name and a specific agent name in a specific country DB, 8) a set of all patent documents in a specific country, 9) a set of all patent documents in at least two countries, 10) A patent document set specified in units of time periods set in 1) to 9) above; 11) A dictionary for a patent document set generated by combining specific conditions such as registration status, request for examination, etc. in 1) to 9); You can count on. Of course, the above calculation may be performed for a document set specified or generated by the user.

In addition, the same kind of plurality of patent classification code relation preprocessing module 3910 has two or more patent classification codes among the patent documents constituting the document set with respect to any one or more document sets specified by the above 1) to 11). Only the assigned documents can be extracted, and the combination (Ai, Bj) of the above patent classification symbols can be obtained only for the extracted document set. Regarding the obtained combination of patent classification symbols Ai and Bj, the relation data as shown in the table is generated, and the generated relation data is sorted or analyzed (frequency, mode, maximum, minimum, year number). For example, the analysis of the number of subjects, such as the applicant and the inventor, is an example. After the above analysis, the technology convergence can be identified from the viewpoint of the combination of the patent classification symbols (Ai, Bj) according to any one or more document sets or the extracted document set objects specified in 1) to 11). Information can be obtained.

The above-described repeated execution method performed by the homogeneous patent classification code relation preprocessing module 3910 will only be one embodiment for finding a value generated as a result of this execution, and a person skilled in the art will appreciate the present invention using computational techniques. You can try various calculation methods for the mapping. Tables having the results (for example, including weighting or non-weighting) for each patent classification symbol pair for all patent classification symbols of all patent documents to which the patent classification symbol is assigned two or more. ) May be stored in a DB or provided as a view or a materialized view generated in real time.

An exemplary process of implementing the above process is shown in FIG. 53. A description with reference to FIG. 53 is as follows. The homogeneous patent classification code relation preprocessing module 3910 obtains a document set including at least one patent document (S5320), and includes a plurality of patent classification symbols having two or more patent classification symbols among patent documents included in the document set. Extracts a document including a symbol (S5330), generates a combination of a plurality of patent classification symbols included in the plurality of patent document symbol documents according to a predetermined criterion for the classification processing of the main patent classification symbol and the subpatent classification symbol (S5340). Obtain information about a parent node on a patent classification code system for each patent classification code included in the combination for each combination (S5350), obtain the lowest common patent classification code for the parent node (S5360), Generating a pair of each parent node patent classification code including itself until immediately before the lowest common patent classification code (S5370), and Stores the weighting applied to a pair of standard or equivalent pre-set, and (S5380), and generates the statistical values, parameters or values calculated according to predetermined criteria to the destination for each pair of the stored (S5390)

Next, a method of preprocessing and comparing a plurality of patent classification codes for at least two document sets through the same plurality of patent classification code relation preprocessing module 3910 will be described with reference to FIG. 54.

The homogeneous plurality of patent classification code relation preprocessing module 3910 obtains two or more document sets including at least one patent document (S5410), and includes a patent classification code among patent documents included in the document set for each document set. Extracts a document including a plurality of patent classification symbols of two or more (S5430), and extracts a document including a plurality of patent classification symbols included in the plurality of patent document symbol documents according to a predetermined criterion for the classification processing of the main patent classification symbol and the subpatent classification symbol. Generate a combination (S5440), obtain information about a parent node on a patent classification code system for each patent classification code included in the combination for each combination (S5450), and generate the lowest common patent classification for the parent node; Obtaining a symbol (S5460), each parent node patent classification symbol including itself until immediately before the lowest common patent classification symbol Pairs are generated (S5470), each pair is weighted by applying an equal or predetermined criterion, and stored (S5480), and statistical values, parameters, or calculated values according to preset criteria are stored for each of the stored pairs. In operation S5490, the statistical value, parameter, or calculated value is compared for each document set (S5495).

65 to 67 show an exemplary embodiment of a method for analyzing a plurality of patent classification codes.

65 is an exemplary method of obtaining a patent classification code and presenting analysis information on the least fused patent classification codes based on the obtained patent classification code.

The homogeneous plural patent classification code relation preprocessing module 3910 obtains at least one or more patent classification codes (S6520), and obtains the least frequently fused patent classification code information on the obtained patent classification symbols (S6530), and the least fusion patent The classification code may be displayed by reflecting the patent classification code system in at least one or more steps, or at least one predetermined analysis may be performed on a set of patent documents corresponding to the least fused patent classification code (S6540).

FIG. 66 is an exemplary method of obtaining a document set, extracting the most frequent patent classification code from the obtained document set, and presenting analysis information on the least fused patent classification codes based on the extracted patent classification code. .

The homogeneous plural patent classification code relation preprocessing module 3910 receives at least one or more document sets (S6620), obtains a patent classification code for each document constituting the document set (S6630), and obtains patents for individual documents. The classification code is given a ranking based on the mode value at the document set level (S6640), and the information about the most frequent fusion patent classification symbol is obtained for each individual patent classification symbol to which the ranking is given (S6650), and the patent classification is performed on the least fusion patent classification symbol. The display may be displayed in at least one or more steps by reflecting a preference system, or at least one preset analysis is performed on a set of patent documents corresponding to the least frequently fused patent classification code (S6660).

67 is a method of obtaining document sets, extracting the least common fusion patent classification symbols based on the patent classification symbols extracted from individual document units in the obtained document set, and analyzing the analysis information by integrating the extracted least fusion patent classification symbols. It is an exemplary method to present.

The homogeneous plural patent classification code relation preprocessing module 3910 obtains at least one or more document sets (S670), obtains a patent classification code for each document constituting the document set (S670), and obtains patents for each document. Obtaining the least frequently fused patent classification code information based on the classification code (S670), integrating the least frequently fused patent classification code information obtained by individual documents (S670), and forming a patent classification code system for the unified least fusion patent classification code. At least one analysis is performed on the set of patent documents corresponding to the integrated fusion patent classification code, which is reflected or displayed in at least one or more steps (S670).

Heterogeneous Multiple Patent Classification Symbol Relational Preprocessing Module 3930

The same type of patent classification code relation preprocessing module 3910 has described the processing for the same type of patent classification code. Next, the heterogeneous plural patent classification code relation preprocessing module 3930 will be described. The heterogeneous plural patent classification code relational preprocessing module 3930 is completely similar to an operation of the homogeneous plural patent classification symbol relational preprocessing module 3910. Almost all patent documents issued in the United States combine IPC and USPC in one patent document, and IPC and FT are simultaneously granted in patent documents issued in Japan. Assume that a patent document is assigned IPC1, IPCn, USPC1, ... USPCm.

In this case, from the viewpoint of the heterogeneous plural patent classification code relation processing, a combination of four kinds of relations is generated between the IPC1, ... IPCn, USPC1, ... USPCm. First, the relationship between IPC1 and USPC1, which is a pair of main IPC and main USPC, respectively. Then, a pair of IPC1, USPC2, ... USPCm, which is a pair of main IPC and sub USPC. Then, as a pair of IPC2, IPCn and USPC1, this is a pair of sub IPC and main USPC. And pairs for IPC1, IPC2, ... IPCn and USPC2, ... USPCm, respectively, which are pairs of sub IPC and sub USPC.

The heterogeneous plural patent classification code relational preprocessing module 3930 is the same as that performed by the homogeneous plural patent classification code relational preprocessing module 3910 among the heterogeneous plural patent classification symbols under each kind. You can do it. At this time, since the heterologous patent classification code is targeted, there is no minimum common patent classification code so that it can be limited to a predetermined value. That is, in case of IPC, the upper patent classification code may be defined for a given IPC and a given USPC pair, targeting only subclasses and classes in USPCs. That is, the homogeneous plural patent classification code relation preprocessing module 3910 has the relation table as described above for a given patent classification code combination Ai, Bj (where Ai and Bj are patent classification codes of the same system). As described above, the heterogeneous plural patent classification code relational preprocessing module 3930 is the same as described above for the patent classification code combination Ai, Bj (where Ai and Bj are patent classification codes of different systems). You can create a relationship table. A weight or contribution weight may be given to the generated relation table. Further, a patent document number can be associated with each of the heterogeneous patent classification code combinations Ai and Bj (where Ai and Bj are patent classification codes of different systems), and the bibliography obtained from the patent document number. It will also be obvious that the counting and calculations reflecting the matter can be performed. In addition, it is possible to obtain heterogeneous patent classification symbol combinations Ai and Bj for a specific document set, and to perform analysis equivalent to the homogeneous patent classification symbol relational preprocessing module 3910 for these combinations. will be.

Statistical preprocessing module for each patent classification code (3200) = Special application

Multilevel of patent classification code

The statistical preprocessing module 3200 for each patent classification code of the present invention performs preprocessing for finding a predetermined statistical value for at least one country-specific patent DB for at least one patent classification code on the at least one patent classification code system.

Fig. 11 illustrates the structure of the special energization. The special communication includes a patent pre-processing engine 3210 for each patent classification code that preprocesses the statistical value for each patent classification code, and a view, table, or information organization for storing the statistical values for each pre-processed patent classification code. As a preprocessed patent classification code statistics DB 3230.

The patent classification code handled in the special application is at least one of IPC, USPC, FT, FI, and ECLA. It is apparent that the country-specific patent DB includes the patent DB issued by the Republic of Korea, the United States, Japan, and Europe (EPO), and may include the patent DB issued by the Patent Office of other countries. Each country has a common IPC, and each country has a special classification scheme (USPC or UPC for the US Patent Office, FT, FI for the Japan Patent Office, ECLA for the European Patent Office, etc.). It is desirable to find predetermined statistical values for patent DBs of countries having two or more patent classification systems independently for each of the two or more classification systems. That is, in the US, it is necessary to preprocess IPC and USPC separately. In addition, each patent classification code system has a level for each system. In the case of IPC, there are a section, a subsection, a class, a subclass, a group, and a subgroup, and subclasses below the subgroup express the hierarchical structure as the number of dots in title information corresponding to the patent classification code. An example of such a hierarchy is described in detail in patent classification code preprocessing module 3500. Therefore, the level of the patent classification code in the present invention can be divided into levels by IPC section, class, subclass, main group, 1 dot subgroup, 2 dot subgroup, ... n dot subgroup. The level can identify the upper and lower hierarchical structure in the classification symbol system up to the main group, but can determine the upper and lower hierarchical structure only by using dot information included in the title from the subgroup. Checking the hierarchical structure by the number of dots as described above is from the subclass in the case of USPC, and after all seven digits ("theme code + two alphabetic characters") in the entire FT symbol.

An example of the method of preprocessing the statistical value for each patent classification code is shown in FIG. 50. In the special application, the patent classification code is readjusted and stored in the DB using a tree structure of the patent classification code so that a lower classification code of a given patent classification code can be automatically included for a specific patent classification code system in the first country. (S5020), obtain a search expression or a search query including a patent classification code (S5030), convert to a patent classification code readjusted for a given patent classification code included in the search expression or a search query (S5040), and readjustment. Perform a search by a search engine 7000 or a DBMS 2100 for a search expression or a search query including the patent classification code (S5050), obtain and quantify the patent document information as the search result (S5060), Pre-set statistical values and parameters for subjects such as applicants, inventors, or agents in predetermined time units or integrated time units for the search results. Or calculates the ranking information based on the calculated value.

In addition, the specific energization may automatically include lower patent classification codes for a given patent classification code to generate statistical values, parameters, or calculated values, and an exemplary method thereof is shown in FIG. 51.

The special application obtains a search expression including a patent classification code (S5120), and obtains related patent document information including patent information about a lower patent classification code with respect to the patent classification code included in the search expression. In operation S5130, the citation information and the citation information included in the patent document process predetermined statistical values, parameters, or calculated values (S5140).

In addition, the special communication may generate statistical values, parameter values, or calculation values for each patent classification symbol in terms of including the lower patent classification symbol for citation or citation information for a document subset of a specific document set. One exemplary method for this is shown in FIG. 52.

The special application obtains at least one document set (S5220), extracts an applicant, an inventor, an agent, at least one patent technology classification code for all documents included in the document set (S5230), and Generate a document subset by applying any one or more of the extracted criteria to the document (S5240), and obtain all the documents of the documents cited by the document (S5250) for all documents constituting the document subset at all times (S5250); For all documents constituting a subset of documents, information about post-application documents quoting the documents is obtained (S5260), and the predetermined citations and citations related to the obtained pre-application documents and / or the obtained post-application documents. Statistical values, parameters or calculated values may be generated (S5270).

Hereinafter, the specific energization of the present invention will be described in more detail from the viewpoint of the statistical preprocessing engine 3210 for each patent classification code.

Option

When the special energization processes the predetermined statistical value, the following options are considered, and cross selection for each option may be possible.

First, when each patent classification code is given, the question is whether to automatically include information on the lower classification code of the patent classification code. This is especially true at the level where the hierarchical structure should be checked from the number of dots in the title information. For example, up to levels H, H04, H04B, and H04B 7/00, extensions can be used to easily find patent documents containing patent classification symbols under a given level of IPC. The search method with subclasses can be used to find patent documents that contain patent classification symbols belonging to the subclasses. For example, when there is an IPC of H04B 7/15, and a statistical value is generated without including a lower classification symbol, a patent document including H04B 7/15 is obtained from the patent documents of each country. However, H04B 7/15 and H04B 7/155, H04B 7/165, H04B 7/17, H04B 7/185, and H04B 7/19 are used to generate statistics with subclassifiers. Also, patent documents containing H04B 7/195, H04B 7/204, H04B 7/208, H04B 7/212 and H04B 7/216 should also be obtained. The same applies to USPC, FT, etc., and common description is omitted.

In the case of automatically processing the statistical value by including the lower classification code, the method of the range search of the present invention (both using the search engine 7000 or the DBMS 2100) may be used. On the other hand, in order to achieve the present object, even when the range is not searched, when processing a given patent classification code, all the patent classification codes below it are stored, and when processing statistical values for the patent classification code, the patent classification is performed. In addition to the statistical processing for symbols only, the statistical value may be processed for all patent classification symbols below. For example, through H04B 7/15 above, H04B 7/155, H04B 7/165, H04B 7/17, H04B 7/185, H04B 7/19, H04B 7/195, H04B 7/204, H04B 7/208, H04B 7/212, H04B 7/216 were obtained from the patent classification code hierarchy information, and then H04B 7/155, H04B 7/165, H04B at the bottom of H04B 7/15. Store 7/17, H04B 7/185, H04B 7/19, H04B 7/195, H04B 7/204, H04B 7/208, H04B 7/212, H04B 7/216, and then save to H04B 7/15 H04B 7/155, H04B 7/165, H04B 7/17, H04B 7/185, H04B 7/19, H04B 7/195, It is also possible to employ a method of obtaining preset statistical values, including H04B 7/204, H04B 7/208, H04B 7/212, and H04B 7/216. The same is true of other patent classification code systems such as USPC and FT.

When there is a patent classification code of a given level, the predetermined statistical value is automatically included by including the sub-patent classification code of the patent classification code, rather than simply generating the predetermined statistical value for a document including the patent classification code. It is desirable to produce it.

Second, when there are a plurality of patent classification codes, how to deal with them is a problem. In this case, 1) only the main patent classification code (usually the first one is the main patent classification code) is subjected to statistical processing, and 2) the main patent classification code and the sub patent classification code. 3) how to process with equal weights, 3) by giving different weights to the main patent classification symbol and the sub-patent classification symbol (for example, when there are n + 1 patent classification symbols, the main patent classification symbol 50, The remaining species patent classification symbols may be weighted as 50 * 1 / n). Among the above 1) to 3), 1) and 3) are preferred, and 3) will be more preferable.

Third, there is a processing method when there are a plurality of applicants and inventors. In this case, there are 1) a method of giving a weight of 100 to each source of revenue or inventors, and 2) a method of equalizing the number of applicants or inventors (when there are n inventors, each inventor deals with 100 * 1 / n). will be. In the case of the applicant, the weight of 100 is applied to each applicant from the standpoint of the implementation independence. In the case of the agent, the above-described applicant or inventor's processing method may be employed, and it is preferable to set the number to 100 for each agent.

Information to be precalculated

Information about the structure of the classification itself

The special application may count the number of its direct sub-patent classification symbols on the patent classification code system for a given patent classification code, and may count the number of all its lower patent classification codes. For example, in the case of H04B 7/15, the number of subordinate patent classification symbols is 3, such as H04B 7/155, H04B 7/185, H04B 7/204, and the number of all patent classification symbols is the subordinate patent classification symbol. H04B 7/165, H04B 7/17, H04B 7/19, H04B 7/195, H04B 7/208, H04B 7/212 and H04B 7/216 added to the three are 10. As the number of subordinate patent classification symbols and the number of all lower patent classification symbols increases, the patent classification symbols can be said to have a relatively high level of technical differentiation, so that they are relatively important at the same (dot) level on the patent classification system. Most likely.

Quantitative distribution

The special application may calculate the following information based on the application criteria and / or the registration criteria for a predetermined period of time, targeting a national patent DB designated for a given specific patent classification code. The above calculation is performed because a set of patent documents satisfying conditions such as the patent classification code, a designated country, a set time, whether to apply or register is determined. Counting on the determined patent document set enables the calculation of various parameters as follows.

For example, the number of applications per year or quarter, application increase rate, application increase rate, application increase acceleration may be calculated as application criteria. The number of applications per year may be calculated by obtaining the total number of patent documents filed in a particular year. The increase rate is calculated as {(current period number-past period number) / past period number} * 100, and the increase rate is calculated as {(current period number-past period number) / time interval}, and the increase acceleration is increased. It can be calculated as the rate of change over time intervals of speed.

In addition, the number of applicants per year can be obtained (in case of joint application, the above option can be applied), and when the number of applicants is calculated, the number of applicants can be calculated, and the average application per application Embroidery and average application growth rates can also be calculated. In addition, the number of inventors, the number of inventors, the average number of inventors, and the average number of inventors by year may be calculated based on the number of applicants by year.

In addition, since the number of application claims can be calculated for each individual application, it is possible to calculate the number of application claims per year, the application claim increase rate, the average application claim number per application, and the average application claim increase rate. In this case, if the application claims are divided into independent and dependent claims, the number of independent claims and dependent claims may be calculated, and thus, an increase rate thereof may be calculated.

In addition, since the number of patent classification symbols can be calculated for each application, the number of patent classification symbols and the number of patent classification symbols can be calculated by year, and the average number of patent classification symbols and the average patent classification symbol growth rate per application can be calculated. will be. In addition, in the case of a patent DB in which two or more patent classification codes are used, such as the United States or Japan, it may be calculated for each patent classification code. When there is family information about the application for each application, the number of families, the number of milligram growth, the average number of family countries per year, and the average family country growth rate may also be calculated based on the family information.

The above is calculated on the basis of application, and the same parameters may be calculated on the basis of registration. The parameters that can be calculated based on the registration criteria include the number of registrations, the number of registrations, the number of registrations, the number of registrations, the number of registrants, the number of registrants, the average number of registrants, the average number of registrants, the number of inventors, the number of inventors, the average number of inventors, the average number of inventors. Number of registered claims, number of registered claims, average number of registered claims, average number of registered claims, average number of registered claims, number of patent classification, number of patent classification, average number of patent classification, number of average patent classification, number of families, number of millimeters , Average family country growth, average family country growth rate, and so on.

Such parameters are exemplary, and various parameter values may also be calculated based on various numerical information included in application or registered patent information and pre-counted values of the present invention. The parameter values are essentially count values, rate of change and change of count values, statistics of the count values (average, standard deviation), function values for two or more count values (e.g. registration rate, etc.).

Quantitative subject discovery

The special application may calculate the following information based on the application criteria and / or the registration criteria for a predetermined period of time, targeting a national patent DB designated for a given specific patent classification code. The above calculation is performed because a patent document set that satisfies conditions such as the patent classification code, a designated country, a set time, and whether to apply or register is specified. Counting on the specified patent document set makes it possible to calculate various parameters as follows.

For example, by counting the specific patent document set, the number of applicants, inventors, and agents for each year or year integrated may be extracted and ranked for each applicant, inventor, or agent.

In addition, the concentration, activity index, etc. may be calculated for each applicant, inventor, or agent extracted above, and the ranking of the applicant, inventor, or agent based on the concentration may be obtained as a result of the calculation. The ranking of applicants, inventors, or agents based on their activity levels may be obtained. For reference, the concentration based on the number of applications may be obtained as {(all applications for a specific patent classification code of a specific subject during a specific period / all applications of a specific subject during a specific period) * 100}. In addition, the activity may be determined by: {{(all applications for a particular subject's patent classification symbol for a specific period / all applications for a specific subject's specific period)} / {(all applications for a specific patent classification symbol for a specific period of time / All applications for a particular period)} * 100]. At this time, 1) through the search engine 7000 or the DBMS 2100 1) all applications for a particular patent classification code of a specific subject for a specific period, 2) all applications of a specific subject for a specific period, 3) for a specific period 4) It is possible to calculate the concentration or activity of the above, since the number of all applications for a particular patent classification code of 4 and each of all applications for a specific period of time is available. On the other hand, the degree of concentration or activity is only an example of a patent indicator, the definition using the numerical value that can be obtained directly or indirectly through the pre-calculation to the search engine 7000 or the DBMS 2100 as an input value If there is a given function, the value of the function may be calculated, and the calculated function value may be used to calculate the ranking based on the function value of the applicant, inventor, or agent. In the function of the present invention, all the patents defined as values that can be obtained by the search engine 7000 or the DBMS 2100 based on the patent DB among all the conventional patent analysis indexes that can be defined as patent analysis indexes. Analytical indicators may be applicable.

In addition, although the ranking by the applicant, inventor or agent is calculated based on the number of applications, the ranking by the applicant, inventor or agent for the patent indicator or function based on other parameters such as the number of application growth rate and the number of application growth rates. You can calculate The parameters include the number of claims filed, the number of claims filed, the average number of claims per application, the average number of claims filed per application, the number of patent classifications, the number of patent classification numbers, the number of average patent classifications per application, There may be an average patent classification number growth rate per application, family number, millimeter growth rate, average family country number per application, average family country growth rate per application, and the like.

Although the various patent indices or functions have been described on the basis of application, it will be apparent that they can also be defined and calculated on the basis of registration. This is because the limitation of the application or registration is a matter of specifying or confirming the patent document set. Therefore, the patent document set may be specified or determined only for applications that have a request for examination at the application stage of the application. In addition, if a utility model system is introduced, whether to apply for a utility model registration or utility model registration to the application or registration, respectively, and also regarding the method of specifying or determining the patent document set, the method and criteria May be variously determined at the level of those skilled in the art.

Citation related

The special application is for a predetermined period of time, based on a national patent DB (for example, a patent DB constructed from a patent document issued by the US Patent Office) that includes citation information for a given specific patent classification code. As a registration criterion, the following citation related information may be generated. The above calculation is performed because a patent document set that satisfies conditions such as the patent classification code, a designated country, a set time, and whether to apply or register is specified. For example, given USPC = 002/456 (body cover among MISCELLANEOUS among Apparrel, GUARD OR PROTECTOR among Apparrel), a patent document set including USPC = 002/456 as a patent classification symbol of his patent document can be specified. It becomes possible. Counting on the specified patent document set makes it possible to calculate various parameters as follows.

Bibliographic statements in US patent documents contain citation information such as patents of others cited by their documents. That is, when document B refers to document A and a, document A and a are cited, that is, a cited patent, and document B is a patent citing A and a. At this time, Applicants (including asignee), inventors, agents, and patent classification symbols related to Document B become citation applicants, cited inventors, citation agents, and cited patent classification symbols, respectively. The inventor, the agent, and the patent classification symbol become the citation applicant, the citation inventor, the citation agent, and the citation patent classification symbol, respectively.

When document B is citing document A and document a, the bibliography of document B contains the number of document A and document a. When document B has a relationship to cite document A and document a, computationally, A-> B, a-> B mapping and C-> A, B-> a from a citation point of view With this mapping relationship, A <-> B and a <-> B can be established. Therefore, the document cited by B can be easily dataized in the bibliography of B. Through the above mapping, the set of documents cited by A and the set of documents cited by a can be easily specified. have. That is, both the document set in which the A document is cited and the document set in which the a document is cited will include the B document.

The process may be performed for all documents that are confirmed or specified. That is, when all the patent documents are handled one by one, or may be established in a computerized mapping relationship between all patent documents. When processed one by one, it will be clear that the documents that are the subject of each treatment are placed in the position of document B. In this case, if both documents A and a are included in the entire set of US patent DBs, information on document A and a may be recorded in the information related to document B, and one of the documents in another country's patent DB Even in the case of a managed document, the information on the mapping of the document B in the country's patent database may be recorded.

If a patent document set (document set with B) containing citation information is specified, the continuum is assigned to the cited patent document number (number of document A, which is included in each patent document in the patent document set). The number of document a) can be collected, and the collected citation patent document number has a corresponding citation patent document, and it is apparent that the citation patent document includes bibliographic matters. Accordingly, the cited patent document set cited by all patent documents constituting the specified patent document set is also specified on the basis of a specific calculation time point. Therefore, the specified cited patent document set can be analyzed, counted or calculated. At this time, redundant counting is naturally allowed. That is, when a cited document is cited by a number of documents in the set of patent documents containing the cited information, the cited document must have a weight or counting value by the number of times that the cited document is cited. That is, it would be reasonable to treat each cited document number as multiplied by the weight of the number of citations mentioned above. That is, when document A is cited five times and document a is cited three times, when the following parameter values, such as the number of cited applications, are calculated, a weight of 5 is assigned to document A and a weight of 3 is used for document a. It is preferable to calculate Based on the patent document set including the citation information, all calculations for the cited patent document set may be referred to as "quotation". When the counting is duplicated, it is possible to calculate the ranking of the cited document number cited the most times.

The special application may calculate the following information for the cited patent document set (document A, document set with document a), and then, based on a quantitative basis, the number of cited applications, the number of cited application increases, The rate of increase in the number of cited applications (these can be seen as the number of documents constituting the cited patent document set), the increase in the number of cited applications, the number of cited applicants, the rate of cited applicants, the average number of cited applicants, and cited Average number of applicants growing, Number of cited inventors, Number of cited inventors, Average number of cited inventors, Average number of cited applicants, Number of cited application claims, Number of cited application claims, Number of cited average applications, Number of cited average application claims, Citing Patent classification number, cited patent classification number growth rate, cited average patent classification symbol number, cited average patent classification symbol growth rate may also be calculated. Cited application number, cited application growth rate, cited application increase rate, cited application increase rate, cited application number, cited applicant increase rate, cited average applicant number, cited average applicant increase rate, cited inventor number, cited inventor increase rate Citation average inventors, citation average inventors growth rate, citation application claim number, citation application claim increase rate, citation average application claim number, citation average application claim increase rate, citation patent classification number, citation patent classification number growth rate, citation average patent The counting method such as classification code number and cited average patent classification code growth rate is the same as described in the above parameter calculation method. That is, for the set of cited patent documents, the number of applications, application growth rate, application growth rate, application application growth rate, number of applicants, number of applicants, average number of applicants, average number of applicants, number of inventors, number of inventors Increase rate, average number of inventors, average number of inventors, number of claims, number of claims, number of applications, average number of claims, number of claims, number of patents, number of patents, number of patents, average number of patents Calculate the value, the number of citations, number of citations, rate of citations, number of citations, number of citations, number of citations, average citations, average citations, Number of cited inventors, number of cited inventors, average number of cited inventors, average number of cited applicants, number of cited application claims, number of cited application claims, average cited application claims This, cited application claims average number rate, cited patent classifier lake, lake cited patent classifier growth, cited patent mean classifier lake, cited patent mean classifier lake growth is front ofa.

Similarly, the special application may calculate the ranking of the applicant, the inventor, the agent, or the patent classification code for each parameter of the cited patent document set. That is, it is possible to calculate the ranking by the largest number of cited applicants and the ranking by the largest number of cited inventors based on the number of applications. At this time, when calculating the ranking according to the patent classification code, it is possible to calculate the ranking of the most cited patent classification code for each step on each patent classification code system using the lower patent classification code system of the present invention. In this case, at least one patent classification code included in the cited patent document included in the cited patent document set will be included, and each of the higher patent classification codes (on the patent classification code system) of the included patent classification code is included. It would be reasonable to see them as quoted. Therefore, it would be desirable to include this aspect in the calculation of the languages of the most cited patent classification symbols for each step. When targeting US patent documents included in the cited patent document set, the patent classification code may be both USPC and IPC.

The special application is to obtain the applicant information for the patent document set (the document set with B) that includes the citation information, the patent document set for each applicant that includes the citation information ( The patent document set for each applicant may include the B document.), And the patent document set for the patentee may also be specified for the patent document set for each applicant. For the specified cited patent document set, various parameters such as the number of cited applications may be calculated. At this time, for each parameter, it will be possible to calculate the ranking for each applicant. For example, the applicants can be extracted from a set of patent documents specified by USPC = 002/456 (body cover among MISCELLANEOUS among GUARD OR PROTECTOR among Apparrel, etc.) by year, and the document set by the extracted applicant can be generated. (E.g., U.S. Pat.No. 06401262, assignee Benetton Group SpA, US Cl. 2/456; 2/411, if there is a document, the set of documents corresponding to the Benetton Group SpA, USPC = 002/456). The special communication may generate the cited document set in the same manner with respect to the document set generated for each applicant, and the various parameters of the cited document set may be generated. Can be calculated

In view of the above mapping, it is possible to generate a document set, ie, a cited document set, that cites each patent document included in the specified patent document set. For example, when document C is cited by document C and document c, the mappin relationship shows that document B is cited by document C and document c. In order to find such C documents and c documents, if a document number is entered in the citation document number field of the search engine 7000, the C document including the B document in the citation information is displayed as a search result. Of course, C documents and the like can be obtained as a search result even by querying a query such as select by specifying a quotation number field for the B document number in the DBMS 2100. If the mapping relationship of B-> C and B-> c is organized as data, it is possible to easily specify a document set including the C document citing the B document.

Therefore, the special communication is based on the cited document set citing the individual patent documents of the specified patent document set for the specified patent document set, the following cited information (quoted from the point of reference B). Documents containing a C are citation information).

When the patent document set (the document set with B) is specified, the special current application queries the search engine 7000 or the DBMS 2100, whereby the cited patent document number citing each patent document of the patent document set. (Number of document C, number of document c) can be collected. Since it is apparent that bibliographic matters correspond to the collected cited patent document numbers, the cited patent document sets citing all the patent documents constituting the specified patent document set are also specified on the basis of a specific calculation time point. Therefore, the set of cited patent documents specified above can be subject to analysis, counting or calculation.

In this case, it is preferable to allow duplicate counting. When the document B and the b document belong to the specified patent document set, the weight of the document C should be 2 when both the document B and the document b are cited by the document C. That is, the document C is included in the search result even if the document is searched as the document B, and the document C is included in the search result even if the document is searched as the document b.

Based on the specified patent document set, all calculations for the cited patent document set may be referred to as "cited". When the counting is duplicated, it is possible to calculate the ranking of the citation document number citing the patent documents most belonging to the specified patent document set.

The special application may calculate the following information for the cited patent document set (document C, document set with document c), and first, the rate of increase of the number of cited applications and the number of cited applications on a quantitative basis , The rate of increase in the number of cited applications (these can be seen as the number of documents constituting the cited patent document set), the number of increase in the number of cited applications, the number of cited applications, the increase rate of cited applications, the number of citations Average Number of Applicants, Average Number of Citations, Number of Citations, Number of Citations, Number of Citations, Number of Citations, Number of Citations, Number of Citations, Number of Citations, Citations Average number of claimed applications, average number of claimed applications, number of cited patents, number of cited patents cited, number of cited patents cited, average number of cited patents cited The rate can also be calculated. The number of citations, the number of citations, the number of citations, the number of citations, the number of citations, the average number of citations, the average number of citations, Citation Count, Citation Increase, Citation Average Inventions, Citation Average Inventions, Citation Requests, Citation Averages, Citation Averages, Citation Averages. The counting method such as the increase rate, the cited patent classification number, the cited patent classification number, the cited average patent classification number, and the cited average patent classification number increase rate is the same as described in the above parameter calculation method. That is, for the cited patent document set, the number of applications, application increase rate, application increase rate, application increase rate, number of applicants, applicant increase rate, average number of applicants, average number of applicants, number of inventors, number of inventors , Average number of inventors, average number of inventors, number of claims, number of claims, average number of claims, average number of claims, number of patents, number of patents, number of patents, average number of patents, average number of patents When calculating, the value is the cited application number, the cited application growth rate, the cited application growth rate, the cited application growth rate, the cited application number, the cited application growth rate, the average cited application number, Citation Average Applicant Growth Rate, Citation Inventor Number, Citation Inventor Growth Rate, Citation Average Inventor Number, Citation Average Invention Growth Rate, Citation Application Claim Number, Citation Application Claim Number Gayul, the front ofa this cited application claims average number, the average cited pending claims can increase, cited patent classifier lake, lake cited patent classifier growth, cited patent average classifiers lake, cited patent mean classifier lake growth.

The special coin may be similarly calculated for the applicant, the inventor, the agent, or the patent classification code for each parameter based on the cited patent document set. That is, the ranking of the most cited applicants and the ranking of the most cited inventors may be calculated based on the number of applications. At this time, when calculating the ranking according to the patent classification code, it is possible to calculate the ranking of the most cited patent classification code for each step on each patent classification code system using the lower patent classification code system of the present invention. In this case, at least one patent classification code included in the cited patent document included in the cited patent document set may be included, and each of the upper patent classification codes (on the patent classification code system) of the included patent classification code is also cited. It would be reasonable to see them as related. Therefore, it would be desirable to include this aspect in the calculation of the languages of the most cited patent classification symbols for each step. The patent classification code may be both USPC and IPC when targeting a US patent document included in the cited patent document set.

At this time, the special communication can analyze the specific patent document set (document set with B and b) itself. In this case, it is preferable that the duplicate counting is allowed and weighted by the number of duplicates to be handled. For example, when document B is cited five times and document b is cited three times, when calculating the following parameter values such as the number of citations, etc., for all the specified patent document sets, It is preferable to calculate the weight in such a manner that a weight of 3 is assigned to the b document. The special application may calculate the ranking of the most cited patent documents based on the specified patent document set by reflecting the weight. Furthermore, the special application is based on the specific patent document set (document B, document set with document b), and the citation count (B is cited by C on a quantitative basis). Citations can be used), the rate of increase in the number of cited applications, and the rate of increase in the number of cited applications (these are the number of documents that constitute the cited patent document set). Acceleration, Number of Citations, Number of Citations, Number of Citations, Average Number of Citations, Number of Citations, Number of Citations, Number of Citations, Average Number of Citations, Citations for Citations, Number of Citations for Citations, Citations for Average Citations, Citations for Average Citations, Citations for Citations, Citations for Citations, Citations for Average Citations Can symbol cited patent mean classifier lake growth also will be calculated. The number of citations, the number of citations, the number of citations, the number of citations, the number of citations, the average number of citations, the average number of citations, Citation Count, Citation Increase, Citation Average Inventions, Citation Average Inventions, Citation Requests, Citation Averages, Citation Averages, Citation Averages. The counting method such as the increase rate, the cited patent classification number, the cited patent classification number, the cited average patent classification number, and the cited average patent classification number increase rate is the same as described in the above parameter calculation method. That is, for the cited patent document set, the number of applications, application increase rate, application increase rate, application increase rate, number of applicants, number of applicants increase, average number of applicants, average number of applicants, number of inventors, number of inventors , Average number of inventors, average number of inventors, number of claims, number of claims, average number of claims, average number of claims, number of patents, number of patents, number of patents, average number of patents, average number of patents When calculating, the value is the cited application number, the cited application growth rate, the cited application growth rate, the cited application growth rate, the cited application number, the cited application growth rate, the average cited application number, Citation Average Applicant Growth Rate, Citation Inventor Number, Citation Inventor Growth Rate, Citation Average Inventor Number, Citation Average Invention Growth Rate, Citation Application Claim Number, Citation Application Claim Number Gayul, the front ofa this cited application claims average number, the average cited pending claims can increase, cited patent classifier lake, lake cited patent classifier growth, cited patent average classifiers lake, cited patent mean classifier lake growth. At this time, the special communication can be calculated for the ranking of the applicant, inventor, or agent for each of the parameters for the specified patent document set as described above. That is, it is possible to calculate the ranking by the largest number of cited applicants and the ranking by the largest number of cited inventors based on the number of applications.

The special application may obtain the applicant information for the specific patent document set (the document set with B), and the patent document set for each applicant (by the applicant of any one of the least frequent applicants). The patent document set may include the B document.), And the cited patent document set may be specified also for the applicant-specific patent document set, and for the specified cited patent document set. Various parameters such as the number of citations mentioned above may be calculated. At this time, for each parameter, it will be possible to calculate the ranking for each applicant. For example, the applicants can be extracted from a set of patent documents specified by USPC = 002/456 (body cover among MISCELLANEOUS among GUARD OR PROTECTOR among Apparrel, etc.) by year, and the document set by the extracted applicant can be generated. (E.g., U.S. Pat.No. 06401262, assignee Benetton Group SpA, US Cl. 2/456; 2/411, if there is a document, the set of documents corresponding to the Benetton Group SpA, USPC = 002/456). The special communication can generate the cited document set in the same manner with respect to the document set generated for each applicant, and can calculate the various parameters for the cited document set. have.

The method of calculating the various parameters by the specific energization of the present invention is characterized by generating a calculated value for each set of determined or specified patent documents. Therefore, from the standpoint of the special communication, the existence of a specific set of patent documents entered in the fraudulent special communication is important, and the nature and size of the patent document set are not a problem. (Citation information should be included in the specified patent document set.) Therefore, the special application may calculate at least one or more of all the parameter values in advance for the specified patent document set as follows. For example, 1) a patent document set generated by a method of specifying a patent document set by a specific patent classification code on a specific patent classification code system in a specific country DB, and 2) a patent document set by a specific applicant name in a specific country DB. A set of patent documents generated by a method of specifying; and 3) by a method of specifying a set of patent documents by a specific inventor name (ie, applicant name and inventor name) included in the patent document of a specific applicant in a specific country DB. Set of patent documents generated, 4) set of patent documents generated by a method of specifying a set of patent documents under a specific agent name in a specific country DB, 5) a specific patent classification code and a specific patent classification symbol on a specific patent classification code system in a specific country DB A patent document set generated by a method of specifying a patent document set by the applicant's name; A set of patent documents generated by a method of specifying a set of patent documents by a specific patent classification code on a specific patent classification code system, a specific applicant name, and a specific inventor name in a country DB, and 7) a specific applicant name and a specific name in the specific country DB. 8) A patent document set generated by a method of specifying a patent document set by an agent's name. 8) A patent document set specified for a period of time set in 1) to 6). 9) Request for examination in 1) to 8). At least one of a patent document set generated by a method of specifying a patent document set for each inclusion of a predetermined option included in a patent document of a specific country, such as whether or not it is the subject of the special transfer calculation of the present invention. It will be a set of patent documents. In addition, the special current communication of the present invention may calculate at least one or more of the parameters for a set of patent documents designated by a user using the special current communication.

Patent Information Intelligence Module (4000)

Hereinafter, the patent information intelligence module 4000 for patent information of this invention is demonstrated. The configuration of this particular person is well illustrated in FIG. The specific person includes 1) an analysis module 4100 targeting patent information obtained in the past, 2) a monitoring module 4300 targeting mainly updated patent information, and 3) a reporting module 4500 presenting a result. There is a ranking processing module 4700 that optionally calculates a ranking value to process the ranking. The configuration of the analysis module 4100 is described in detail with reference to FIG. 13.

Analysis Module (4100)

Analytical indicators

An analysis index for patent information and an analysis module 4100 for calculating the analysis index will be described. Types of analytical indices targeting patent information include numerical values, ratio values, equivalence values, and changes in these values.

Numerical value

First, an analysis index related to the numerical value is introduced.

As an analysis index related to the numerical value, the sum of the number of documents such as 1) the number of applications, the number of registrations, and the like, and the sum of the numerical values which the individual document unit counting preprocessing module 3110 recognizes in individual document units (for example, For example, if the sum of the number of patent claims is 10, the total number of claims of those ten applications is added when the number of patent applications is 10) or the average value thereof may be a numerical value. The numerical value includes 1) a predetermined period unit, 2) a preset country unit, 3) a preset patent technology classification unit, 4) a preset applicant unit (including an assignee), and 5) other bibliographic information. It is possible to form longitudinal (horizontal units) and lateral segmentation criteria such as one or more selected from content or attribute units. In this case, when a unit of time or period is included, changes such as 1) increase / decrease rate, 2) change rate, 3) acceleration rate of change, 4) average increase rate of change, 5) average change rate, and 6) average change acceleration rate are based on the unit. Get information about In addition, statistics such as an average value and a standard deviation can be obtained based on each period unit.

For example, the number of applications by year, the number of US applications by quarter, the number of patents registered by class in the United States by year, the number of patents registered by domestic companies in a particular patent technology classification field, and the like are examples.

Rate value

An analysis index related to the ratio value is introduced.

There may be several analysis indicators related to ratio values, including 1) occupancy rate, 2) concentration rate, 3) AI (Activity Index), and 4) other definitions. The ratio value includes 1) a predetermined period unit, 2) a preset country unit, 3) a preset patent technology classification unit, 4) a preset applicant unit (including an assignee), and 5) other bibliographic information. It is possible to form longitudinal (horizontal units) and lateral segmentation criteria such as one or more selected from content or attribute units. In this case, when a unit of time or period is included, changes such as 1) increase / decrease rate, 2) change rate, 3) acceleration rate of change, 4) average increase rate of change, 5) average change rate, and 6) average change acceleration rate are based on the unit. Get information about In addition, statistics such as an average value and a standard deviation can be obtained based on each period unit.

First, occupancy refers to a ratio value of a specific party to a specific area. For example, the applicant's share of application in the area of IPC = A04N in Korea over the last five years will be calculated for each year as follows:

Molecular = Number of all applications filed by APC to IPC = A04N

Denominator = number of all applications filed with the Korean Patent Office by IPC = A04N

Second, the concentration rate refers to the ratio of how much a specific subject concentrates in a specific area. Occupancy is the percentage value of a particular party in a certain area. For example, the applicant's application concentration rate in the area of IPC = A04N in Korea for the past five years will be calculated for each year as follows.

Molecular = Number of all applications filed by APC to IPC = A04N

Denominator = the number of applications filed by the Korean Patent Office by year

Third, AI is an indicator of relative activity in comparison with other companies in a specific technology field and can be calculated as follows.

For example, the applicant's filing AI in the area IPC = A04N in Korea for the last five years will be calculated for each year as follows:

Molecular = (All applications filed by IPA = A04N filed by the Korean Intellectual Property Office per year / All applications filed by the Korean Intellectual Property Office by the yearly Party)

Denominator = (All applications filed by the Korean Patent Office by year IPC = Number of applications filed by the Korean Patent Office by year / A04N)

Fourth, values generated by other definitions can be defined in various ways depending on the type of definition. For example, Technology Attractiveness in a particular country can be defined and used as follows.

Molecular = total number of applications in a certain period of time to a particular technical field in a specific country

Denominator = total number of applications in a given period of time in a particular country

As such, it is possible to generate various analysis indexes through various definitions, and the values input to the generated analysis indexes should be values that can be directly or processed in the patent information database 2300.

In the above, the ratio value is mainly exemplarily described using the number of applications as an example. It is obvious that numerical values, such as their mean values, can also be used to generate ratio values. The numerical value includes 1) a predetermined period unit, 2) a preset country unit, 3) a preset patent technology classification unit, 4) a preset applicant unit (including an assignee), and 5) other bibliographic information. It is possible to form longitudinal (horizontal units) and lateral segmentation criteria such as one or more selected from content or attribute units. For example

For example, the attractiveness of the amount of rights acquired in a specific technical field in a specific country may be defined and used as follows. In general, the more patent registration claims, the higher the maintenance costs, so the more registration claims, the more attractive the acquisition of rights.

Numerator = the sum of all registration claims of the total registration rights in a certain period of time in a particular technical field in a particular country.

Denominator = sum of all registrar clauses in total registration rights in a given period of time in a particular country.

Other Analytical Indicators

Then we introduce other analytical indicators.

1.Indicative analysis index of technological innovation activities

1) Revealed Technological Advantage The RTA is one of the most used indexes for understanding the status of technology specialization, and the subjects we are interested in are different. It provides information on what technology innovation activities are concentrated in comparison with The RTA index is generally known as the Activity Index (AI), and is characterized by a Specialization Index, a Technological Comparative Advantage (TCA), and a Technological Revealed Comparative Advantage (TRCA). It is used in various names.

RTA index is calculated by the following formula. In the formula below, the molecule

i represents the proportion of field i, and denominator refers to the proportion of field i of patents in all fields.

(Pij is the number of j patents for the field i)

2) Revealed Patent Advantage

The RPA is an indicator that shows the degree of concentration or specialization in a specific technology field, like the RTA index. The analytical meaning is the same as the RTA index, but it is designed to overcome skewness of the RTA index and to ensure the normality of the index.

The relationship between RPA and RTA and the formula for calculating the RPA value are as follows.

3) Concentration Ratio n (CRn)

The Concentration Index (CRn) is an indicator used to assess the level of monopoly in the original market.

to be. By applying this indicator to patent information, we can obtain information on technological monopoly in certain industry sectors, which can be used to gauge the strength of technological competition in that industry sector. The CRn index is also called the Cn index.

Originally, the CRn index is the sum of the market shares of the top n companies in one industry sector.

it means. Turning to the technology aspect from the market side, using patent share instead of market share to grasp the competitive strength of technology can be defined as follows.

(Si is i's patent share, Ni is i's patent, N is total patent)

4) Herfindahl Index (HHI)

Like the CRn Index, the Herfindal Index (HHI) was originally a market monopoly and competitive edge.

Is an indicator used to evaluate the degree. Using the patent data in the HHI analysis in the same way as the previous modification of the CRn index using the patent information, it is possible to obtain useful information on the monopoly situation and technical strength of the technical aspect. The Herfindal Index is also called the Herfindahl-Herschman Index (HHI).

The formula for calculating HHI using patent data is as follows.

(Si is i's patent share, m is the total number of companies in the industrial sector, Ni is the number of i's patents, N is the total number of patents)

2. Technical level analysis index

1) Patent Count Weighted by Citations

The number of weighted patents cited is an innovation in the number of patents showing the quantitative aspect of technological innovation activities.

By combining citations that relate to the importance or value of performance, they provide more meaningful information to assess the technical aspects of innovation performance. Various methods of weighting the cited information may be proposed. Hereinafter, the weighted patent counts (WPC) of M. Trajtenberg using the simplest weighting method will be introduced.

The weighted patent counts (WPC) used by M. Trajtenberg are:

This is calculated

(nt is the number of patents registered in year t, Ci is the number of citations of i patent)

2) Cites per Patent (CPP)

The number of citations per patent (CPP) is an indicator of how much the patents of the analysis target (country, company, etc.) have influenced subsequent technological innovation activities. This indicator allows us to examine the technical significance of individual patents, the level of technological innovation activity and the value of innovation performance of a particular country or company. The name CPP is a name commonly used by CHI Corporation43 in the United States, but is an index of the concept that has been used in various names for a long time, rather than an indicator developed by CHI Corporation.

CPP is calculated as follows.

(nt is the number of patents registered in year t, Ci is the number of citations of i patent)

After all, CPP refers to the number of times a patent registered in a particular year (or period) is averaged by subsequent patents.

3) Patent Impact Index (PII)

The Patent Impact Index (PII) is an indicator that can be used to assess the qualitative level of technological innovation performance of a particular country or company. We can use PII analysis to determine how important a particular country or company we are analyzing is performing relative to the average level of technology in the sector.

PII is specific to the number of times that all patents in the technology to be analyzed are cited on average.

It is calculated as the relative proportion of the number of times a patent of a country or corporation is cited.

(Ca is the number of citations of a patent, Na is the number of patents of a, Ct is the number of citations of all patents, Nt is the total number of patents)

4) Current Impact Index (CII)

The Current Impact Index (CII) provides information on the technical impact of the past five years' technological innovation performance of the particular subject we are interested in at the present time. This index provides a glimpse into the technical significance and technical capabilities of recent innovation innovation performances of specific actors.

CII is an index that expresses how much the patent of a specific subject (country or company, etc.) calculated in the previous five years from the present time is cited at the present time (year) as a relative value of the overall citation frequency. The CII is calculated as follows (in the equation below, we represent A as a specific country or company that we want to analyze.

t: past 5 years based on current year

rt: the number of times the year t patent in A is cited on average in the current year

Rt is the number of times the entire patent for year t is cited on average for the current year

ct: the total number of times the year t patent in A has been cited in the current year

nt: Number of patents in year t of A

Ct: the total number of times a patent in year t is cited in the current year

Nt: Total patents in year t

5) Technology Strength Index

The technology index (TS) is a table used to look at the technical capacity of a particular country or institution. The TS index allows us to be informed about the technical capacity of a particular country or institution, taking into account both the average level of individual technical performances and the quantitative aspects of technical performance.

TS for a particular year is defined as CII times the number of patents.

(CIIi is the CII value of i of the year, Ni is the number of patents of i of the year)

6) Technology Cycle Time (TCT)

The technology cycle cycle (TCT) index provides information about the pace of technological development, the rate of innovation activities.

Ball. It can be examined whether the speed of technological development in a specific field of technology or the basis of technological innovation activities of a specific subject is based on recent research results or long past research results. The TCT index is used under various names, such as the technology life cycle index.

The cycle of a technology can be measured in a variety of ways. In this case,

We will introduce a method to measure the cycle of technology around the TCT index. CHI

The TCT index is defined as follows.

"The middle of the difference between the publication year of the cited patent and the publication year of the cited patent.

Median age "

7) Science Linkage (SL)

The Science Linkage Index (SL) is a measure of how closely the patented technology is related to the scientific research achievements.

Show if you have a relationship. We can indirectly look at which countries or companies are leading in the industry and are focusing on basic research or development of original technologies.

SL is defined as the average of the number of scientific papers cited by the patents analyzed.

(nt is the number of patents registered in year t, Si is the number of scientific and technical papers cited by i-patent)

8) Average Claims per Patent

The number of claims is an indicator for measuring the breadth and scope of the invention for that patent.

Attracted attention. To date, however, there are not many attempts to measure the level of technology based on the number of claims, and mainly attempts to use it as a tool to measure the value of a patent or the likelihood of a dispute, along with other indicators (citation index, family index, etc.). Achieving.

The number of claims per patent is calculated as the average number of claims of the patents being analyzed.

(nt is the number of patents registered in year t, Ci is the number of claims of i patent)

9) Family Size

The size of a patent family directly indicates the regional protection scope of the patent, and indirectly provides information about the technical significance and innovation performance of the patent.

Methods of measuring the scale of a patent family can be defined in various ways. But here

Is defined as the number of countries in which the patent family is formed.

(N is the number of patents, Fi is the number of countries where the family of i patents is formed)

3. Indicators of Cooperation and Knowledge Flow Analysis

1) Number of patent applications with invention

co-applicants, with co-inventors)

The number of joint patents provides quantitative information on the status of cooperation among research subjects related to technological innovation activities.

to provide. The number of co-patents can be broadly divided into two. One is the cooperative relationship on ownership of innovation performance, that is, the number of patents whose ownership is shared and the cooperative relationship of actual technological innovation activities, that is, the number of patents made up of common inventions.

The number of co-patents can be defined in two ways.

Number of jointly owned (filed) patents

"Number of patents jointly owned (filed) by two or more subjects"

Number of joint invention patents

"Number of patents jointly invented by two or more inventors"

2) Salton's Index

The Salton's Index shows the strength of different types of partnerships, including cross-border, regional and institutional collaboration. Used to name Salton's measure, Salton's cosine formula, and Salton's cosine measure.

The Salton index is calculated as follows.

(Pij is the number of joint patents of i and j, Pi is the number of patents of i, Pj is the number of patents of j)

3) Brain Gain, Brain Drain

The analysis of labor inflow and outflow rates can be used to determine where the results of research activities are being attributed.

Used to grasp the status quo. It is an analysis to grasp the direction of knowledge flow by focusing on the human aspect in the process of technological innovation.

The workforce inflow rate and outflow rate can generally be defined as

Attraction rate

"A foreign resident (or foreign) of a patent owned by a resident (or national)

Percentage of Patents Including Inventor's Research Activities "

Personnel outflow rate

"A foreign patent of a patent containing research activities of the inventor (or native)

Proportion of patents owned by runners (or foreigners) "

4) Index for Knowledge Flow with Patent Citations

Analysis of knowledge flow using patent citation information can be based on "knowledge" or

It can be used to identify aspects of the spread of intangible "technical information". This analysis can be applied in various ways depending on the purpose of the analysis.

Citation index for identifying trend of knowledge flow is described as a standardized index

It is difficult to do. The following discussion focuses on analytical indicators and methods for identifying knowledge flows between countries.

Citation Relationship Index for Understanding Knowledge Inflow Status

"Country Share of Backward Citations Cited by Patents in Certain Countries"

Citation Relationship Index for Knowledge Transfer

"Country Share of Forward Citations Citing Patents of Certain Countries"

Next, this analysis index is introduced from the perspective of the patent portfolio.

1. Technology Attractiveness: Shows the attractiveness of a particular technology sector and whether it is a promising technology.

1) RGR (Relative Growth Rate): Relative growth rate (RGR) is a relative value of the growth rate of the number of patents applied in one technology field and the average growth rate of the number of patents applied for the whole technology within a specific period.

PA _{F ( t2 - t1 )} Is the number of patents filed between times t ₁ and t ₂ in the specific technical field F

d (PA _{F ( t2 - t1 )} ) represents the growth rate of the number of patents applied during this period

2) Relative Development of Growth Rate (RDGR): An indicator that takes into account changes in time in calculating growth rates. Two different time intervals t _{3 to} t _{4 for a} particular technical field Wow The t _{1 to} t ₂ are compared with each other and again measured relative to the entire technical field.

3) RCT (Relative Technology Cycle Time): It is the relative TCT value of a specific technology field with respect to the average TCT value of the entire technology field.

TCT (Technology Cycle Time): It is an index using patent citation information. As a median value of patent citation time, the smaller the TCT, the faster the technological development and the greater the technical attractiveness.

2. Technology Activity: Demonstrates the output side of an RD activity, showing the company's RD performance. Generally, it is measured by the number of patents filed by a company within a certain period or by the number of patents registered within a certain period.

1) Relative Patent Activity (RPA): Relative Patent Activity (RPA): The relative value of the number of patents applied by a company in a particular technical field and the average number of patents applied by all companies in the art.

PA _iF refers to the number of patents filed by company i in a particular technical field F.

2) Relative Patent Position (RPP): It is the relative value of a company's number of patents applied in a specific technical field and the most active competitor in this technical field.

3) Revealed Technology Advantage (RTA): Relative value relative to the share of patents filed by a company in a particular technology sector and the share of patents filed by the company in all technical fields. .

3. Technology Quality: Reflects the RD performance of the company, but can provide a qualitative evaluation of the economic value and effectiveness of the company's RD activities.

1) GR (Grant Rate): Indicates the share of registered patents among applied patents. The higher the ratio, the higher the Patent Quality.

2) TS (Technological Scope): It indicates the number of claims in the patent document of the applied patent. Also, the larger the TS, the higher the Patent Quality.

3) CR (Citation Ratio): One of the most frequently used indicators in the evaluation of patent value. It is an indicator that evaluates patent value by the number of times a patent is cited by a patent filed afterwards.

4. Technology Priority: Shows the importance of a particular technology sector in the various technology sectors in which the company is engaged, and can identify how important this technology is to the company.

Patent Index

1) Importance of Technological Field (ITF): The ratio of the number of patents applied in a specific technical field to the total number of patents filed by a company within a certain period of time.

5. Technology Collaboration: A measure of the degree of cooperation of a company, which consists of two parts: cooperation with other companies and cooperation among members of the company.

Patent Index

1) Internal Collaboration (IC): The degree of cooperation between members of an enterprise, which is expressed as the share of the total number of patents filed by members of a company located elsewhere in a particular technical field.

PA _iiF is the number of patents that Company i has filed with internal members in different locations in a certain technical field F.

2) External Collaboration (EC): The number of patents that a company co-files with other companies is calculated as the share of the total number of patents filed by the company in this technical field.

PA _ijF represents the number of _patents that company i and j jointly filed in the technical field R.

Analysis module by analysis indicator

The analysis module for analyzing the indicators is performed by the analysis module for the analysis indicator 4100. The analysis module for each analysis index refers to a module for calculating the value of each analysis index by using a calculation formula set for each analysis index for a target patent document set. The analysis indicator module 1) has a search or query expression for querying the search engine 7000 or the DBMS 2100 for each analysis indicator, or 2) has a formula for calculating the formula, Or you may have a conversion program that can convert it to a query expression. Either of 1) or 2) above, the calculated values that the analysis indicator calculation module 4110 should generate will be equivalent.

58 is a flowchart illustrating a method of operating an analysis module for each analysis indicator.

When the analysis module 4100 receives selection information on an analysis indicator (S5820), the analysis module 4100 calls an analysis module for each indicator, and the analysis module for each indicator configures the analysis indicator. Obtaining the component information (S5830), extracting the analysis indicator component information from the DB (S5840), and calculates the analysis indicator from the analysis indicator component information (S5850).

Patent document set acquisition method

There are three ways for the analysis index calculation module 4110 to obtain the patent document set. First, a method of obtaining a patent document set as a search result by inputting a search expression for a search engine 7000, and second, using a SQL query using a DBMS 2100 to obtain a patent document set as a result of the query. Third, a method of obtaining a list of patent document sets (a list of document unique numbers such as an application number list may be an example.). The document to be managed in the patent information service system of the applicant's name is determined, or the document to be managed in the unit patent information service system of the inventor's name is related to at least one of the above three.

Noise can occur when the first and second methods are simply used.

However, even in this case, the part corresponding to the noise may be reflected in a search expression or a query. For example, when the transfer of patent rights occurs, but the previous information is not reflected in the patent information database 2300, noise occurs, but at this time, it is possible to process the difference in the noise in a search expression or a query. will be. Of course, the above three methods are exemplary, and any disclosed technique that can be utilized to form a patent document set may be employed. Hereinafter, a method of obtaining a document set will not be repeatedly described, but may be any one or more of the above three methods.

59 is a flowchart illustrating one embodiment of a method of obtaining an analysis target patent document set.

The analysis indicator calculation module 4110 receives a predetermined document set, a document set determined through a search including a keyword, a document set that is a non-keyword type, and shares at least one or more criteria (S5920). Document identification number information, such as application number, is extracted for the set of received documents to determine an analysis target document set (S5930), and a join is performed on the extracted document unique number and the entire target patent DB (S5940). ), All the information necessary for analysis, such as bibliographic information for each document corresponding to the document's unique number, are obtained from the patent DB, and the preset analysis is performed as a preset analysis algorithm based on the analysis necessary information obtained for the joined patent documents. The analysis is performed (S5940).

Ranking Processing Module (4700)

Information regarding various kinds of rankings can be generated from the calculated values (including the numerical value, the ratio value, etc.) obtained from the target patent document set. Generating a ranking based on the calculated value is called ranking processing module 4700.

The analysis indicator information that is needed may be any one or more of 1) at least one or more modes, 2) at least one or more maximum values, 3) at least one or more predetermined reference outliers, and 4) at least one value closest to the at least one or more preset criterion. have. Each will be described below.

The module for obtaining the mode is called a mode obtaining module. For example, two or more applications of a particular applicant can obtain 1) the least common patent classification code such as the least IPC, 2) the least inventor, 3) the least frequently applied country, and 4) the least cited patent. With respect to 1) the least common patent classification code, such as the least IPC, and 2) the least cited patent can be obtained. For example, the method of obtaining the most frequent IPC may be obtained by obtaining information on all IPCs included in the target patent document set, and then obtaining their counting information. In this case, when a single patent document further includes sub patent classification symbols such as sub IPC in addition to the main patent classification symbol such as main IPC, counting only the main patent classification symbol or including all patent classification symbols It may be counted, or may be counted after giving different weights to the primary and secondary patent classification symbols. The mode obtaining module acquires at least one or more modes, and of course, may obtain two or more modes in the most frequent order. That is, in the above example, the value of H04B 7/26 as the first place and the value of H04Q 7/20 as the second place may be obtained as the IPC value.

The module for obtaining the maximum value is called a maximum value obtaining module. For example, acquiring information about the maximum / most applicant in a specific technical field (on a patent classification code), acquiring information about the maximum occupant, and the like may be an example of using the acquisition module. In the above example, the most applicants in H04B 7/26 will be able to obtain the values that Samsung is first and LG second.

The module for acquiring the preset reference outlier is called a reference outlier acquisition module. For example, finding a field in which application growth has averaged 10 or more annually in the whole or partial technical field (on a patent classification symbol) is an example of utilizing the acquisition module. The present embodiment will be described in more detail as follows.

The reference outlier obtaining module is configured for each subgroup of the patent classification code system included in the subclass patent classification code called H04N (groups and groups are represented by "subclass indication + number / 00" in the IPC system). Regarding the number of applications

After obtaining the information, the application growth rate in the unit of the last five years is calculated for the number of applications for each subgroup by year, and then the subgroup having an average of 10 or more may be found.

Of course, the application growth rate as described above may be calculated even for one dot subgroup unit under the group.

A module for obtaining a value closest to the predetermined criterion is called a proximity value obtaining module. The proximity may be a value or a range of values.

Analysis Module (4100) Detailed Description

An analysis service provided by the analysis module 4100 may be performed by executing an analysis algorithm for processing the preset analysis subject on a set of patent documents and at least one predetermined analysis subject to be analyzed, and generating an analysis result. Say something to do. The analysis result is preferably numerical information. The numerical information may be visualized in at least one table or graph through the reporting module 4500 of the present invention. The reporter module may include a table generation module 4510, a graph generation module 4530, a report generation module 4550, and the like.

The analysis algorithm for each analysis subject will be described for each analysis index.

Patent document set acquisition module

The analysis module 4100 of the present invention includes a document set acquisition module for obtaining a set of patent documents to be analyzed. The patent document set acquisition module may include: 1) receiving a preliminary document analysis target set by inputting a search expression into the search engine 7000 or querying the patent information database 2300 through a DBMS 2100; 2) receiving noise document information for the analysis target preliminary document set, and removing the noise document. At this time, in the step 1), the number of search expressions or queries may be plural, and a corresponding document set is provided for each of the plurality of search expressions or queries, and a union operation must be performed to remove duplicates. And 3) additionally obtaining a special document, further adding importance information to each of the documents, obtaining technical classification information to which the patent document belongs, or representative name information of the applicant's name. The obtaining step may be further roughened.

In addition, the patent document set acquisition module may be the entire document set managed by the applicant name unit patent information service system or the inventor name unit patent information service system, or a subset of clustering or grouping by patent classification code, country, year, or inventor. Of course, it can be obtained as a set of documents to be analyzed from. In addition, in the case of the multi-stage publication stage patent information service system, the entire document set managed by the manager of each stage or a subset of the entire document set grouped by the cluster on a predetermined basis may be obtained as an analysis target document set. will be.

Trend Analysis Module (4150)

The trend analysis refers to the analysis of various analysis indicators by time period for the analysis target document set, and the trend analysis module 4150 of the present invention performs this function. The trend analysis module 4150 includes 1) trend information on various numerical values or ratio values, such as application amount and registration amount, for a predetermined period of time by subject such as applicant or inventor, country or country integration, and 2) the above 1). 3) Analyze trend information on the amount of change such as increase and decrease rate, speed, etc., and 3) trends on statistics such as mean or standard deviation of 1) to 2). The content of each analysis indicator and the analysis algorithm of the analysis indicator are as described above. The result of the trend analysis may further include ranking information.

60 shows an exemplary process of the method of operating the trend analysis module 4150.

The trend analysis module 4150 obtains document information on a predetermined analysis topic (S6020) and based on at least one date information included in the document information based on any one or more of fields constituting the document information. The number of documents is counted based on the set time zone (S6030), and the information counted based on the preset time zone is converted into a table or a data format that can correspond to the table (S6040) or stored in a temporary or permanent manner. In addition, trend information can be sent to the requestor.

Technical Unit Analysis Module (4170)

The technical unit analysis refers to performing analysis for various analysis indexes based on multi-level patent classification symbols or technical classification information received from the patent documents. Analysis results analyzed by the analysis module for each technical unit include: 1) core applicants (at least one or more maximum applicants, at least one or more maximum concentrated applicants) by multi-level patent classification symbols (eg, IPC subclass units, group units, etc.); The ranking may be included in the analysis of the applicant unit, such as at least one or more most occupant applicants, the key inventors (at least one or more largest inventors, at least one or more most concentrated inventors, at least one or more most occupant inventors, etc.) Can be included), to analyze key agents or key countries. In addition, 2) information about the (1) numerical value, ratio value or equivalence value and (2) the variation value of the (1) value of the key applicant, inventor, agent or country is analyzed. The analysis of 1) to 2) may be analyzed by the applicant or the like by country or national unit of integration.

Subject Unit Analysis Module (4190)

The subject unit analysis refers to performing analysis by various applicants, inventors, or agents for each analysis index on a set of documents to be analyzed, by the applicant, inventor, or agent, and the subject unit analysis module 4190 of the present invention performs the function. do. The analysis result analyzed by the analysis module for each technical unit includes 1) the various analysis indicators for each subject, and 2) information on the change value of 1).

Subject Unit Comparison Analysis Module (4110)

The subject unit comparison analysis refers to performing analysis by comparing at least two or more applicants, inventors, or agents in the analysis target document set by the various analysis indicators in a unit of country or unit of nation, and comparing the unit of subject of the present invention. Module 4110 performs its function. The analysis result analyzed by the subject unit comparison analysis module 4110 includes 1) the various analysis indexes for each of two or more subjects, and 2) information on a change value of the 1).

For example, the results of the comparative analysis, 1) the number of applications or registrations, registration rate, concentration rate, occupancy rate by each multi-level patent classification code by country or country integration of Samsung Electronics and LG Electronics 2) above 1 And a comparison value with respect to a change value of the value of). In addition, 1) the number of applications or registrations, registration rate, concentration rate, and occupancy rate by key inventors for each multi-level patent classification code by country or country integration of Samsung Electronics and LG Electronics. A comparison value with respect to a change value etc. is mentioned as an example.

Citation Analysis Module (4130)

The citation analysis module 4130 of the present invention executes a citation analysis algorithm by executing a citation analysis algorithm according to a preset citation analysis criterion when a forward citation and a back citation occur according to a predetermined citation depth when there is an individual patent or a patent document set. Derive

Quotation depth

The citation depth refers to a direct citation relationship (if A cites B, A and B are citations directly) (when the citation information of document A includes information about document B as citation information. ), The citation depth is 1 for both forward citation (depth of A criterion B) and back citation (depth of B criterion A). In this case, if B is quoting C, A is considered to be indirectly quoting C, wherein the depth of citation is 2 for both forward citation (depth of A reference C) and backward citation (depth of C reference A).

Types of Citation Analysis Indicators

Next, the citation analysis index disclosed by this invention is demonstrated.

There are eight types of citation analysis indicators, which should be interpreted as illustrative. The first is an analysis index for performing various statistics and analysis on patent documents of another person who cites a specific applicant's patent as an index of analysis based on the applicant. The second is an index based on the applicant's citation analysis, which is an analysis index for performing various statistics and analysis on which other patents are cited by a specific applicant's patent document. Third, the comparative citation analysis index is an analysis index for performing statistics and analysis on citations and citations of at least two applicants. Fourth, the index of citation-citation ranking analysis by technical field is an analysis index for performing analysis to find the most citation-citation applicant and inventor by technical field. Fifth, an analysis index for analyzing applicants, inventors, and individual patent documents having a patent cited as the maximum cited analysis index of the technical field. Sixth is an analysis index for analyzing an applicant, an inventor, or an individual patent document which cites the most prior patents in the technical field as a technical reference citation analysis index. Seventh is an analysis index analyzing how many forward citations occur for each citation depth designated as a patent document-based forward citation analysis index. Eighth is an analysis index that analyzes how many backward citations occur for each citation depth designated as a specific patent document back citation analysis index.

Each will be described in more detail below.

Citation analysis algorithm

Next, a citation analysis index disclosed in the present invention and a citation analysis algorithm for finding the citation analysis index value will be described. First, the contents related to forward citation are explained. One exemplary method of forward citation analysis is shown in FIG. 62.

The citation analysis module 4130 obtains at least one or more document sets (S6220), and obtains forward citation information for each individual patent document constituting the document set (S6230), and forward citations related to the obtained forward citation information. A document set is formed (S6240), and at least one preset analysis is performed using the forward cited document set as the analysis target document set (S6250). Next, it demonstrates in more detail.

As mentioned above, patents cited directly by patent documents constituting the analysis document set based on the analysis document set including at least one document are included in the bibliography or text of the documents of the analysis document set. With. The information is stored in the patent information database 2300 in association with the documents of the analysis target document set, and is also stored in the search index (when the content of the bibliographic information is stored in the search index). It may be. Therefore, when the analysis target document set is determined, the cited patent documents cited by the documents of the analysis target document set are also determined.

In one embodiment, the method may include querying the patent information database 2300 for a document number (application number and / or registration number, etc.) of individual patent documents of the analysis target document set, and the other patents cited by the documents. It may be a way to command to obtain a document number. Meanwhile, the individual patent document number of the analysis target document set may be input in the application number or registration number field of the search engine 7000, and then the other patent document number may be obtained from bibliographic information included in the search index. will be. In this case, the number of the other patent document number may be counted for each document number, and the counting number may be stored together with each document number, and the other patent document number information may be stored together. If the stored counting information is analyzed, the other patent documents cited among the other patent documents cited by the patent documents belonging to the analysis target document set may be found, and a ranking may be generated based on the citation frequency.

When the other patent document number is obtained, another patent document set consisting of the other patent document number is generated, and various analyzes can be performed on the other patent document set. In this process, since the elements of the document set are one, that is, one patent document will be apparent, the description thereof will be omitted.

In this case, another set of patent documents for each depth including indirect citations for each depth may be obtained, which may be achieved by recursively performing the above method. That is, another document that is directly cited by another patent document of another patent document set generated above is obtained, and the other documents obtained are treated as one another patent document set.

Next, the contents related to the backward citation analysis will be described. Finding backward quoted information is slightly different in the way of finding the forward quoted information. The forward citation information is included in one's own document (stored in relation to his / her document information), while the back citation information is included in another's document information (is stored in another's document information). There is a characteristic. Therefore, in order to find backward citation information, a patent number (application number or registration number) is inputted in a citation field among several fields of the search engine 7000 to find a search result, or the patent is owned by the DBMS 2100. You can do this by entering a number and asking to find other patent documents that cite your patent number. In other words, forward citations are taken directly from the DB or search index, so there is no concept of search, while back citations are search (including queries for search). One exemplary method of back citation analysis is well illustrated in FIG. 63.

The citation analysis module 4130 obtains at least one document set (S6320), obtains back citation information for each individual patent document constituting the document set (S6330), and cites related to the obtained back citation information. A document set is formed (S6340), and the at least one predetermined analysis is performed using the back-cited document set as the document to be analyzed (S6350). Next, the back-cited analysis will be described in more detail.

In order to find other patents directly citing patent documents of the analysis target document set based on the analysis target document set including at least one document, the following process should be performed. First, a patent number (application number or registration number) is obtained from all patent documents constituting the analysis target document set. Subsequently, in the search engine 7000, the patent number is entered in a citation field (not an application number or a registration number field) (that is, the patent number is found in the citation field) and the other patent as the search result. You can get a document number. Meanwhile, the DBMS 2100 may be queried to find other patent documents including the patent number as citation information. Since the search engine 7000 uses an inverted file method, it may be relatively quick to find another patent document number with the search engine 7000 in the case of backward citation. When the other patent document number is obtained, another patent document set consisting of the other patent document number is generated, and various analyzes can be performed on the other patent document set. In this process, since the elements of the document set are one, that is, one patent document will be apparent, the description thereof will be omitted. In addition, obtaining a set of other patent documents for each depth including indirect citations is almost the same, and thus description thereof is omitted. In this case, the number of the other patent document number may be counted for each document number, and the counting number may be stored together with each document number, and the other patent document number information may be stored together. If the stored counting information is analyzed, the most cited documents may be found among patent documents belonging to the analysis target document set, and a ranking may be generated based on the citation frequency.

However, the degree of back citation of the individual patent documents constituting the analysis target document set will be different for each individual patent document, and the weight of the back citation will be different for each individual patent document. Therefore, when the importance of back cited a lot is statistically high, citation analysis of the document set to be analyzed may be necessary in relation to back citation. Hereinafter, the citation analysis of the analysis target document set of the present invention will be described.

It is possible to count the number of back citations for each of the individual patent documents constituting the analysis target document set, and obtain the patent number (application number, registration number, etc.) of the back citation patent documents citing the individual patent documents. You can do it. Since the counting of the search results or the number of query results is easily output from the search engine 7000 or the DBMS 2100, detailed descriptions are omitted. (In the case of the search engine 7000, if a search expression is queried, the search is prioritized. It is common to return the number of search results before the results themselves, and the DBMS 2100 can also use aggregate functions such as the count SQL command.) Also, the document number of the above cited patent document as a search result or query result. It is a natural function to obtain a patent number to the detailed description thereof will be omitted. As a result of the processing of this paragraph, the number of back-cited patent documents and the back-cited patent document number that quotes the individual patent document for each individual patent document constituting the analysis target document set are known.

And using the back cited patent document number, the back cited patent

Naturally, it is possible to obtain bibliographic information of the document. Therefore, a document having at least one or more maximum backward citation values may be found among the individual patent documents constituting the analysis target document set, and furthermore, 1) an applicant's name, and 2) each step criteria selected from each patent classification code. (E.g., USPC class criteria, IPC subclass criteria, USPC 1 dot level criteria, IPC group criteria, etc.), 3) inventor criteria, 4) country criteria, and 5) time zone criteria (year criteria would be preferred). It will be possible to find a document having a maximum backward citation value among individual patent documents constituting a partial document set belonging to the group for each group to which one or more criteria are applied. For example, "the patent document with the most backward citation of the inventor A's patent document is 0001, and the second most common is 0004."

Further, the individual patent documents constituting the analysis target document set are grouped by using at least one selected from the above 1) to 5) units, and the number of back-referenced patent documents is grouped as a result of the grouping. You will be able to count and which inventors have the most back citations. For example, individual patent documents constituting the analysis target document set may be grouped by inventors, and the number of back-quoted patent documents may be counted by the inventors, and the inventors may also count which back citations are the most. I will be able to make it. More specifically, when the inventor of the patent document constituting the analysis target document set consists of inventor A, inventor B, and inventor C, the back citation is counted for each patent document of the inventors, and then summed by inventors. By the inventor A, inventor B, inventor C will be able to find the inventor C is the maximum citation document for each. In this case, the average number of back-cited documents per number of applications or the number of registrations for each inventor can be calculated, and of course, the ranking can be given to them. Furthermore, the calculation and ranking of the average number of backward cited documents can be performed not only by the inventor but also by a group to which any one or more criteria selected from 1) to 5) are applied. Specific methods of grouping including grouping and ranking will be described later.

The analysis target document set may be obtained by 1) a search result in the search engine 7000 or a query result to the DBMS 2100, and 2) a preset patent document set (for example, a unit patent information service system of the applicant's name). The patent document set, the patent document set managed by the unit patent information service system of the inventor name, etc.), or 3) can be generated by inputting at least one patent number by the user. In addition, the analysis target document set may be obtained as a subset of the documents constituting the analysis target document set obtained in 1), 2) or 3).

As described above, the set of analysis target documents, the set of forward citation other patent documents related to the set of analysis target documents, and the set of back citation other patent documents related to the analysis target document set have been generated. The front citation other patent document set and the back citation other patent document set may be generated for each depth, or a depth integrated other patent document set may be generated through a union operation. In addition, the forward citation other patent document set and the backward citation other patent document set may be generated for each country, or through a union operation, a national integrated other patent document set may be generated.

Create subset

Subsequently, when acquiring the forward cited other patent document set or the backward cited other patent document set, another patent document set sharing a specific attribute may be generated with specific limitations. Such limitations may include: 1) specific applicant limitations, 2) specific inventor limitations, 3) specific patent classification symbol limitations, 4) restrictions to documents containing specific keywords, 5) limitations of at least one specific year or at least one specific period 6) Restriction to a specific country 7) There may be a restriction to simultaneously use any two or more selected from 1) to 6). The limitation may be said to perform a function of a kind of filter.

Examples of the above 1) to 7) are as follows.

As an example of 1), the applicant may acquire the set of other forward patent documents or the set of backward patent other patent documents of Samsung Electronics Co., Ltd. In addition, two or more applicants may be bound in an OR relationship to complete the limitation. For example, a plurality of affiliates selected from Samsung affiliates, such as Samsung Electronics Co., Samsung Electro-Mechanics Co., SDS, etc., may be input together to obtain the forward cited other patent documents set or the backward cited other patent documents set related to the Samsung affiliate company. You can do it.

As an example of 2), a specific inventor or two or more inventors may be grouped in an OR relationship to obtain the set of forward citation other patent documents or the set of back citation other patent documents by the inventor or inventor group.

As an example of 3), any one or more patent classification codes selected from IPC, USPC, FI, FT, and ECLA patent classification code systems having a hierarchical structure may be adopted to have patent classification codes set in the patent classification code system. The forward citation other patent document set or the back citation other patent document set may be obtained. For example, IPC can obtain the set of forward citation other patent documents or the set of backward citation other patent documents in which A04N or IPC is defined in (H04M 13/00 OR FO4B11 / 00 OR B22F01 / 00, H05K03 / 00). will be.

As an example of 4), the forward cited other patent document set or the back cited other patent document set satisfying the "biochip OR biochip" in the green field may be obtained.

As an example of 5), the forward cited other patent document set or the back cited other patent document set whose application date satisfies from 1995 to 2006 as year information may be obtained.

As an example of 6), it is possible to obtain the set of forward citation other patent documents or the set of back citation other patent documents satisfying US as the original filing country. The country may also be obtained through the country information included in the priority information or the applicant's address information.

In the above example 7, the applicant is Samsung Electronics Co., Ltd.

And include "CDMA OR Code Division Multiple Access" in the abstract field as a keyword, "Hybrid" in the claim field, and the set of forward cited patent documents or the back cited other patents that occurred between 1995 and 2006. You might be able to get a set of documents.

Next, a method of applying the above limitation will be described. The application of the limitation applies the limitation when obtaining the set of forward citation other patent documents or the set of back citation other patent documents. When acquiring the forward citation other patent document set or the backward citation other patent document set through the DBMS 2100, the constraint may be limited using a where clause or the like in an SQL query statement. When acquiring the set of other backward-cited patent documents through a search engine 7000, a method of inputting the constraint into each field of the search engine 7000 (so that only the one satisfying the constraint is obtained in each field). Method).

The above limitation may be used when obtaining a set of documents to be analyzed. That is, before proceeding with the citation analysis, the front citation other patent document set or the back citation other patent document set may be obtained using only the document set that satisfies a specific restriction condition as the analysis target document set. In addition, the forward citation other patent document set or the backward citation other patent document set having the restriction condition may be obtained for the analysis target document set that satisfies the restriction condition. In this example, Samsung Electronics Co., Ltd., a patent document filed after 2000 among US applications, is used as an analysis target set to generate a set of other forward-cited patent documents citing Qualcomm's patents. Could be In addition, a patent document filed and disclosed after 2000 among Samsung Electronics Co., Ltd. may be used as an analysis target set, so that another patent document set cited by Qualcomm after 2000 may be obtained.

Leverage subsets

Next, grouping including grouping and ranking of the forward cited other patent document set or the back cited other patent document set will be described. For example, as follows. Given a list of Korean companies that cite Qualcomm's patents in a particular technology sector in the order of the number of citations presented, the grouping is a list of Korean companies, which are listed in the order of the number of citations. This would be an example of grouping, including ranking.

Such grouping may be grouped using the "group by" command supported by the DBMS 2100 for the forward citation other patent document set or the backward citation other patent document set to be grouped. Each document set that is the object of the grouping may be natural as the forward citation other patent document set or the back citation other patent document set reflecting the limitation.

That is, the "group by" command is a reference element (by below, for example, the applicant) to the document set (strictly speaking, the patent document which is a constituent element of the document set) which is the target of the command. Field only, and documents such as the forward cited other patent document set or the backward cited other patent document set, which have a property (for example, a period and a patent classification code that are specifically limited in terms of the document set targeted by the command) Set is not subject to certain limitations).

As described above, when grouping the forward citation other patent document set or the backward citation other patent document set, the ranking (ranking) for each group becomes important. At this time, the ranking criteria may be reasonable to be a number or a predetermined score. That is, when the forward citation other patent document set or the backward citation other patent document set is output, grouping is performed on a predetermined basis, and the order in which the groups are arranged is arranged in order of high ranking. Would be more helpful. The ranking may be performed by the ranking processing module 4700 of the present invention, but may also be solved by an SQL query when the DBMS 2100 supports the ranking.

The grouping criteria may vary, but may include 1) the applicant's name, 2) each step based on each patent classification code (eg, USPC class, IPC subclass, USPC 1 dot level, IPC group Criteria, etc.), 3) inventor criteria, 4) national criteria, and 5) time zone criteria (the year criteria would be preferred). In this case, when two or more criteria are applied, the number of groups may be multiplied, thereby increasing the number of groups.

The grouping including the grouping and the ranking may be applied to the analysis target document set. For example, suppose that the front-end cited patent document set or the back-referenced other patent document set is shown for the US application of Samsung Electronics Co., Ltd. from 2000 to 2006. Group by year, patent classification code (IPC subclass or IPC group or subgroup unit would be preferred) or other group, and rank the group among the grouped groups to put the high ranking group in front Will be able to take The forward citation other patent document set or the back citation other patent document set may be obtained by using only the document set belonging to the specific group for each specific group in the grouped analysis target document set as the analysis target document set. In this case, the grouping including the grouping and the ranking may be applied to the obtained front citation other patent document set or the back citation other patent document set.

In the case of acquiring the forward citation other patent document set or the backward citation other patent document set through the grouped analysis target document set, the citation and citation relationship for various groups can be accurately grasped, and thus citation and citation information Can maximize the use of.

Comparative Citation Analysis

In the above, the first document set for analysis is searched for another patent document set or the other patent document set for backward citation, and the citation analysis is performed by performing grouping, grouping including ranking, and various restriction processes on the document set. The method was described. In addition, a method of performing citation analysis by performing grouping, grouping including ranking, and various restriction processes on the analysis document set itself, based on backward citation, has been described.

Next, comparative citation analysis targeting two or more applicants as a specific example of the citation analysis will be described. Comparative citation analysis refers to processing forward citation and back citation information only between each document set for a plurality of analysis target document sets sharing subject information such as applicants.

For example, as follows.

A patent document of the US Samsung Electronics Co., Ltd. generates a set of documents to be analyzed (in this example, referred to as a set A), and a patent document of the United States Sony generates a set of documents to be analyzed (in this example, a set B). At this time, a set A is set as an analysis target document set, and when a forward cited other patent document set or the back cited other patent document set is found with respect to the set A, only a patent document belonging to the set B is found. There are many ways to find out, but it can be solved by a search or query, filtering can be done by using a method, and even a variety of SQL statements supported by the DBMS 2100 can be used to set a desired document set. Can be found. That is, a set A is set as an analysis target document set, and among the patent documents belonging to the set B, a forward cited other patent document set related to the set A or the above cited other patent document set is found. Of course, various limitations, groupings, rankings, and the like described in the citation analysis section of the present invention may be performed on the set of other patent documents belonging to the set B and the set of other patent documents belonging to the set B. In addition, it is a matter of course that the citation analysis of the analysis target document set for the set A can be performed. On the other hand, by changing the direction, set the set B as the analysis target document set, and when finding the forward cited other patent document set or the backward cited other patent document set with respect to the set B, only the patent documents belonging to the set A can be found. In this paragraph, we will be able to perform all citation analysis on set A.

In the comparative citation analysis, the following extended configuration may be possible.

First, if the document set includes A, B, and C, several comparison combinations such as A vs B, B vs C, and C vs A can be generated, and then bilateral comparative citation analysis can be performed. If there are n applicants, the number of comparison combinations will be nC2.

Second, if in the above example, B and C have a special relationship such as an affiliated relationship, and B and C are bundled to perform a comparative citation analysis with A, then comparative citation analysis can be performed with A vs (B union C). will be. That is, when grouping a plurality of applicant sets of document sets (by performing a union operation, a group set of documents may be easily generated), comparative citation analysis may be performed for each of the grouped applicants.

Third, when presenting the comparative citation analysis results can be presented while comparing for each criterion. The criterion may be any combination of two or more selected from 1) at least one multi-tiered patent classification code, 2) inventors, 3) year or period, 4) country, 5) 1) to 4). For example, you can compare the number of citations by Sony and the number of citations by Sony and the number of citations by Samsung Electronics by IPC subclasses at Samsung Electronics and Sony's IPC subclasses. have. Also, by year, how much Samsung Electronics Co., Ltd. cites Sony's patent and how much Sony cites Samsung's patent, may be presented in graphs.

Performance results of the citation analysis and other analysis may be generated by year or by predetermined period. In this case, values such as increase / decrease rate, increase / decrease rate, increase / decrease acceleration, average, and standard deviation can be obtained.

Judging Citation Analysis

The following is an explanation of the audit citation analysis. Examination citation analysis is structurally the same as forward citation analysis, and it involves analyzing the examiner's citation documents included in the individual patent document information of the analysis target document set in the same way as the forward citation document set. If there is a precedent document used by the examiner in the examination process of the patent document, the preceding document can be treated as forward citation information, and thus the above-mentioned citation analysis is performed even when there is no citation information in the patent bibliographic information. This is useful because you can use citation analysis. Similarly, when a particular preceding document is cited in a review of a particular following document, the following document can be treated as a backward citation document of the preceding document, so that a backward citation analysis can be possible. That is, with respect to the individual patent documents constituting the analysis target document set, to find the trailing documents cited and cited each patent document, and to analyze the at least one or more of the present invention by configuring the analysis target document set from the following documents. It becomes possible. Therefore, both the forward citation analysis and the back citation analysis can be performed using the audit citation information.

64 illustrates an exemplary method for forward citation analysis of the audit citation analysis method.

Examination citation analysis module 4130 of the present invention performing the examination citation analysis obtains at least one or more document sets (S6420), and obtains the examination citation information for each individual patent document constituting the document set (S6430). In operation S6440, a forward citation document set related to the obtained audit citation information is formed (S6440), and at least one predetermined analysis is performed using the forward citation document set as an analysis target document set (S6450).

Next, the simple analysis method of this invention is demonstrated. The simplified analysis is a part of a document corresponding to the numerical value of the analysis result (for example, when there are analysis results such as 100 applicants in US, 120 in 2000, 140 in 2001, etc.). Performing all analyzes of the invention on a set (e.g., a set of documents corresponding to the value 120 (Applicant = A, Year 2000, Country = United States). It refers to performing various types of analysis using the document subset corresponding to the result of the analysis as the document set to be analyzed, and when two or more different values are used when generating an analysis result such as an increase rate, a share, etc. Is presented first, and the simplified analysis process can be performed for each of the other numerical values presented above.

61 shows an exemplary process of the simplified analysis method.

The analysis module 4100 of the present invention obtains selection information on a numerical value for a cell sharing a specific property as an analysis result (S6120), and when the numerical value is a combination of components of two or more different numerical values, Present the numerical value and obtain the selection information for the numerical value, and if the numerical value is a single component, obtain the selection information for the single numerical value (S6130), and identify the document unique number corresponding to the selected numerical value. Obtain (S6140), form a document set composed of document unique numbers (S6150), and perform predetermined information processing on the formed document set (S6160).

Surveillance Module (4300)

The monitoring service provided by the monitoring module 4300 registers a specific search expression and provides new patent information to a person who receives the monitoring service when there is new patent information corresponding to the search expression. The monitoring module 4300 performs monitoring in the present invention. The patent information monitoring module 4300 registers a search expression to be monitored and converts the search expression to the search engine 7000 or the DBMS 2100 at predetermined time units (daily, weekly, monthly, quarterly, and / or annually). Inquiries into the monitoring service user of the facts, the documents, or the facts or the information on the documents. do. In this case, the notification method may be any one or more of a method of transmitting by e-mail or other message transmission method to a person who will receive the monitoring result, or notifying when the monitoring service user accesses the monitoring service. The monitoring module monitoring module 4300 includes a monitoring search type registration module 4310 that receives a monitoring search, a periodic search type query module 4330 that periodically performs a monitoring search / query, and the monitoring result when the monitoring result is present. There may be a monitoring result reporting module 4350 to report the.

In order to perform a monitoring service, 1) registering a search expression for monitoring; Since the purpose is to query the search engine 7000 or DBMS 2100 for a predetermined time unit and to find a new document when querying, the time range (for example, a date including a search query based on a publication date). It is common to limit the past 6 days to the time range) to the search formula.) If there is a new patent document, it may be sent to the surveillance service recipient.

Characteristic

The monitoring search expression input to the monitoring module 4300 of the present invention is characterized in that the unit patent information service system of the applicant name and / or the unit patent information service system of the inventor name are set in advance. That is, when generating the unit patent information service system of the applicant's name or the unit patent information service system of the inventor's name, or without the user's intervention even after the generation, the surveillance search required by the applicant's name unit or the monitoring required by the inventor's name unit The search expression is automatically extracted and set in the monitoring service of the applicant's unit patent information service system or the inventor's unit patent information service system. The type of monitoring search formula to be set and the method of generating the monitoring search formula to be set may be as follows. First, the type and generation method of the monitoring search expression set in advance in the document set unit are explained. The information to be included in the monitoring search expression is often a result of analysis generated by the analysis module 4100 of the present invention. Examples such as the above include mode values such as the numerical value and the ratio value, maximum values, and the like. Specific examples are explained one by one.

Unit of Applicant's Name or Inventor's Unit

First, at least one or more of the most frequent patent classification symbols are ranked in the order of frequency and extracted from the document set that is the subject of management of the applicant patent unit patent information service system or the inventor's unit patent information service system. It may be registered as a search expression to be monitored for at least one or more countries selected from a set country or a country of origin of documents (including WIPO) obtained by the patent information database 2300. The patent classification code is preferably one or more selected from among IPC, USPC, FI, FT, and ECLA, and in the case of depth, IPC, section, subsection, class of the patent classification code, It is divided into class, subclass, group, and subgroup, and the depth is determined by the number of dots below the subgroup. 1) a method of determining in units of groups or subgroups, and 2) a method of performing in units below the subgroups, such as a 2-dot subgroup or a 3-dot subgroup. However, the depth of the patent classification code may be a subclass unit, but in this case, too many patent documents may be issued, resulting in severe noise.

Second, for at least one or more of the most frequent patent classification symbols derived from the first method, 1) those who file or register the largest number of patents at home and abroad; 3) The applicants whose patent application speed or patent registration speed is higher than or equal to a predetermined standard within a preset period of time set at home and abroad can be extracted, and the applicant can be a surveillance search formula.

Third, a patent classification code having a high rate of increase in the number of new documents within a preset recent period corresponding to the patent classification code and the lower patent classification code of the patent classification code for at least one or more poor patent classification code derived in the first method. Can be monitored search.

Fourth, at least one or more domestic and foreign inventors who apply for or register the most patents in at least one or more of the most frequent patent classification symbols derived in the first method may be extracted, and the inventors may be monitored and searched.

Fifth, extract citation information (backward citation, forward citation) from the set of documents that are subject to management of the applicant patent unit patent information service system or inventor name unit patent information service system, and obtain the most frequent citations at home and abroad. The child and / or the most frequently cited person can be extracted, and the least frequently cited person or the cited person may be a surveillance search expression.

Sixth, in order to monitor a person who cites any one or more individual patent documents of the document set (to find a person who cites the patent document), the application number or registration number of the entire patent documents constituting the document set is ORed. It can be bundled and watched.

Seventh, it is possible to generate a surveillance search formula by mixing two or more methods selected from the first to sixth methods. A search expression may be input for each field supported by the search engine 7000. For the same field, a search expression derived from each method may be generated using an operator such as and or or. Will be obvious to those skilled in the art.

It is preferable that the monitoring search expression of the entire document set unit managed by the applicant's unit patent information service system or the inventor's unit patent information service system is exposed to the user while being grouped by each monitoring subject and under the monitoring service. For example, it is preferable that the monitoring subject of the monitoring method of the first method is that a folder named "patent monitoring through the most frequent patent classification code" is created. It would be desirable to create a hierarchy. It is preferable that the result of monitoring by the monitoring search method of the entire document set unit is confirmed in the folder or hierarchy. Of course, it is a matter of course that the administrator or inventor of the unit patent information service system of the applicant name or the unit patent information service system of the inventor name can modify the search expression set in advance.

Individual document unit monitoring

Hereinafter, the type and generation method of the monitoring search expression set in advance in each document unit will be described. Since the individual document unit includes at least one patent classification code, the description will be mainly focused on the patent classification code.

First, the patent classification code itself may be generated by surveillance search. At this time, it would be more appropriate to automatically include the lower patent classification code of the patent classification code. In addition, when there are two or more patent classification codes, a plurality of search expressions generated by combining and calculating the patent classification codes may be possible. In this case, it would be natural to include the main patent classification code, and it would be preferable to include a supervisory search expression for and calculating all the patent classification codes obtained from the individual patent documents.

Second, the patent classification code for 1) those who apply or register the most patents at home and abroad, 2) those who apply more than a certain number at home and abroad, but have a high concentration rate in the least frequent patent classification code, and 3) preset at home and abroad. Applicants whose patent application speed or patent registration speed is equal to or greater than a predetermined standard within a recent period can be extracted and the applicant can be monitored and searched.

Third, the patent classification code with respect to the patent classification code and the patent classification code with a high rate of increase in the number of new documents within a preset recent period corresponding to the lower patent classification code of the patent classification code may be used as a monitoring search method.

Fourth, at least one or more domestic and foreign inventors who apply or register the most patents in the patent classification code may be extracted, and the inventors may be monitored and searched.

Fifth, in order to monitor a person who cites the individual patent document (to find a person who cites the patent document), the application number or registration number of the individual patent document may be monitored.

Sixth, the monitoring search equation may be generated by mixing two or more methods selected from the first to fifth methods. A search expression may be input for each field supported by the search engine 7000. For the same field, a search expression derived from each method may be generated using an operator such as and or or. Will be obvious to those skilled in the art.

Hereinafter, the type and generation method of the monitoring search expression set in advance in each document unit will be described. Since the individual document unit includes at least one patent classification code, the description will be mainly focused on the patent classification code.

The monitoring search expression of the individual document unit managed by the applicant patent unit patent information service system or the inventor name unit patent information service system is folder-folded for each monitoring subject, and is located and exposed on the bibliography or management screen of the individual document. It is preferable. For example, it is preferable that the monitoring subject of the monitoring method of the first method is a folder named "patent monitoring similar to this document through the most frequent patent classification code". It would be desirable to have a folder or hierarchy. It is preferable that the result of monitoring by the monitoring search method of the entire document set unit is confirmed in the folder or the hierarchical structure.

Applicant's Unit Patent Information Service System

The unit patent information service system of the applicant name of the present invention refers to a patent information system in units of individual applicant names, and the patent document information included in the unit patent information service system of the applicant name includes the applicant name in the applicant and / or patent holder field. Characterized in that it is included. The unit patent information service system of the inventor's name of the present invention refers to a patent information system in units of individual inventor's names. It features. At least one inventor name unit patent information service system may correspond to one applicant name unit patent information service system. In the lower part of the applicant patent unit patent information service system, the at least one inventor name unit patent information service system may be configured. In this case, the manager of the unit patent information service system of the originating name is the unit patent of the inventor of the specific inventor. Manage access rights to information service systems.

The detailed configuration of the unit patent information service system of the individual unit applicant of the present invention is shown in FIG. In the unit patent information service system of the applicant name of the individual unit, the unit patent information service system generation engine of the applicant name that generates the unit patent information service system of the applicant name, and the unit patent information service system of the inventor name that generates the patent information system of the inventor unit A management module for managing an engine, the unit patent information service system of the applicant's name, and / or the unit patent information service system of the inventor's name, the unit patent information database 2300 of the applicant's name managed in units of the applicant's name, and the inventor's name managed in the inventor's unit There is a unit patent information database 2300.

When the name of the applicant is determined, the patentee unit patent information service system generation engine 1100 obtains an applicant name document acquisition module 1110, which obtains documents to at least one or more countries whose applicant is the applicant / patent holder. Statistics, analysis, and The unit patent information intelligence generation module 1150 of the applicant name for generating the intelligence information of the present invention such as monitoring and reporting is included. At this time, the applicant's unit document set is strictly speaking, the applicant's unit document information data, the data may be stored in a physical DB, a physical table, a view (including a materialized view), Or any other type of data structure, referred to as a unit document set DB of the applicant name for convenience of description, and the same applies to the unit document set DB of the inventor name.

The inventor unit patent information service system generation engine 1300 of the present invention operates in the same way as the unit patent information service system generation engine of the applicant name, the inventor unit document acquisition module 1310, the inventor unit document set DB generation module beneath it 1330 and the inventor patent unit intelligence information generation module 1350.

The management module 1500 of the present invention includes a unit management module 1510 of an applicant name managing a unit patent information service system of an applicant and an inventor name unit management module 1530 of a unit patent information service system of an inventor name of an individual inventor unit. And a management information DB 1550 including management information. The applicant name unit management module includes an applicant name unit document set management module 1511 for managing a list of document sets in units of the applicant name, an applicant name unit patent information intelligence management module 1513 for managing patent information intelligence in units of the applicant name, and There is an inventor authority management module 1515 that manages the rights of individual inventors belonging to the unit of the applicant's name, and there is a multi-stage layer generation management module 1517 that manages the inventors in at least one or more stages. Meanwhile, the inventor unit management module 1530 includes an inventor name unit document set management module 1531 and an inventor name unit patent information intelligence management module 1533.

Meanwhile, the applicant's unit patent information database 1700 includes the applicant's unit patent document set DB 1710 and the applicant's unit patent information intelligence DB 1730, and the inventor's unit patent information database 1900 includes the inventor's unit patent. There is a document set DB 1910 and an inventor unit patent information intelligence DB 1930.

On the other hand, the individual applicant name unit patent information service system may have a unit patent information service system of at least one other applicant name, the method of having a unit patent information service system of the other applicant name to the unit patent information service system of the other applicant name There may be a method that has the link information of, or that the unit patent information service system of another applicant name is under its management authority. Thus, having the unit patent information service system of the other applicant's name is possible for the individual inventor who is the subject of the inventor unit patent information service system. That is, the unit patent information service system of an individual inventor's name as one subject may have link information on at least one unit patent information service system of another applicant's name, or have management authority on the unit patent information service system of another applicant's name. It may be.

The individual unit patent information service system generation engine of the present invention includes at least one of the applicant patent unit patent information service system generation engine and the inventor name unit patent information service system generation engine. The applicant name unit patent information service system generation engine includes an applicant name unit document set acquisition module and an applicant name unit document set management module 1511, and the inventor name unit patent information service system generation engine includes an inventor name extraction module and an inventor. The unit document set obtaining module and the inventor's unit document set managing module 1531 are included. Applicant's unit patent information service system generation engine and inventor's unit patent information service system generation engine of the present invention is obtained or registered in the applicant's name in the country-specific patent DB, at least one or more countries, when the applicant's name is obtained. Obtain all patent documents, automatically extract individual inventor names from the obtained patent documents, and automatically obtain patent documents for each individual inventor name to obtain a patent document set in the unit of the applicant's name and the individual inventor unit under the applicant's name Generate a patent document set of the document, and manage the unit document set of the applicant name and the inventor unit document set

Next, a method of generating a patent information system of the applicant's name in the patent information database will be described.

Applicant's Unit Patent Information Service System Generation Engine

Applicant's Unit Document Set Get Module

Applicant's name unit patent information service system of the present invention includes a set of patent documents associated with the applicant's name. The patent document set includes a set of unit documents of the applicant's name filed or registered in the applicant's name and a set of document units of the inventor's name for each inventor included in the set of documents of the unit of the applicant's name. The applicant's unit document set and the inventor's unit document set may be obtained from an entire patent DB including at least one country-specific patent DB, but preferably from a separate country-specific patent DB.

The method of obtaining the unit document set of the applicant's name may be obtained through a search engine 7000 and a method obtained through the DBMS 2100.

First, a method of obtaining through the search engine 7000 will be described. The search engine 7000 of the present invention indexes the patent document through an indexer in order to enable the patent document to be searchable through a search word input to a searcher or a search box. When the indexing is performed, a search index is generated. In the indexing process of generating the search index, an index may be generated for each field (applicant, inventor, patent classification code, agent, name of invention, etc.) included in the patent document. If a field to be searched is designated in the search engine 7000 and a search word is input, a search result limited to the field is provided. For example, if the name of the applicant is entered in the applicant field (for example, "Samsung Electronics Co., Ltd."), a patent document in the name of the applicant appears as a search result. At this time, if a country or a period is limited, a search result limited to the country or the period is displayed. Through such a query to the search engine 7000, a set of patent documents in the applicant's name is determined. In addition, the search results may allow access to a part (eg, bibliographic details) or all (eg, full text) contents of patent documents related to the search results. Of course, only a document unique number (for example, an application number, etc.) capable of specifying a document set of a specific applicant's name can be obtained through the search engine 7000, and the obtained document unique number is obtained through the DBMS 2100. By querying a patent DB, information on some or all of the contents of the patent document may be obtained.

Next, a method of generating a unit document set of the applicant's name filed or registered in the applicant's name by querying a patent DB through the DBMS 2100 will be described. The patent DB may have various fields (applicant, inventor, patent classification code, agent, name of invention, etc.), and the value of each record constituting the patent DB is input for each field. By specifying a field name in the patent DB and querying a query such as SQL such as select, a desired query result can be generated. That is, if a DB or table to be queried is specified, and a desired field and a field value (for example, "Samsung Electronics Co., Ltd." as the applicant's name) are specified in the DB or table, the DBMS 2100 receives an input. Outputs the query result corresponding to the query. In this way, a unit document set of the applicant's name is generated.

All patent documents may be assigned a document ID (ID) to identify the document, the application number or registration number, etc. may be the unique number, "country mark + application number", "country mark + Registration number may be a unique number, and other number systems such as a public number are also possible. Any numbering scheme that is independent of these numbers, or numbers utilizing these numbers, or which can specify a particular patent document can be a document unique number.

The generating of the applicant document unit document set is performed by the applicant document unit document set acquisition module included in the applicant patent unit patent information service system generation engine. The unit name acquisition module acquisition module of the applicant name obtains a patent document filed or registered under a specific applicant name in a search index or a patent DB using the applicant name as a search expression or a query. In this case, the documents obtained by the unit document set acquisition module of the applicant name may generate a temporary view or a materialized view in units of the applicant name, and the unit document of the applicant name under the unit of the applicant name. The document unique number, such as an application number or a registration number for specifying a set, may be stored.

That is, the automatic acquisition of patent documents is possible through the search engine 7000, but also through a DB query. The method of processing by the search engine 7000 may be processed by inputting an applicant or an applicant identification code into a search expression. Of course, in this case, the search index must include the applicant or applicant identification code in the index. The method of processing a DB query may be performed by querying the DBMS 2100 with the applicant or the applicant identification code using a standard SQL statement or other corresponding query statement. Of course, the patent information data should also include the applicant or applicant identification code. That is, the unit document set acquisition module of the applicant name receives the applicant or the applicant identification code, and inquires the obtained applicant or the applicant identification code to the search engine 7000 or the DBMS 2100 in a manner to query the applicant or the applicant identification code. Document unique numbers such as application numbers corresponding to corresponding patent documents are obtained. When the document unique number is determined, it is possible to obtain a patent document corresponding to the document unique number.

Get Documents by Country

It is preferable that the method for obtaining the patent document by the applicant's unit document set acquisition module is performed for each country. For this purpose, if the applicant identification code is unified for each country (not only the representative representative name of the applicant is based on at least one second country, but also the representative name of the applicant) If the applicants of the two countries are the same subject, the same applicant identification code can be assigned, and the applicant is preferably represented by at least one of the first country standard or the second country standard. Applicant representative names will also be described.) If representative names are given, the applicant identification code vs. applicant name in the first country vs. applicant name in the second country vs. applicant name in the n country Of course, there may be a plurality of display names of applicants in country i. Will be derived in the course of the extension of life of a representative, a plurality of the applicant had shown in the i-th station can be released to the extension of life represented as a unit in each country of the applicant had shown in a single i-th station.

Therefore, a patent corresponding to the applicant identification code in the search index of each country or the patent information data of each country or the entire patent information data only by inputting the applicant name or the applicant identification code into the search engine 7000 or the DBMS 2100. Documents will be available.

If the applicant's representative name has not been provided in the first and second countries, the method of obtaining a patent document for each country may include: 1) a method using a treaty priority number; and 2) the name of the applicant in a country-specific method. There may be a method using. In particular, in order to reduce the number of errors in the latter, it is preferable that the non-identifiable components such as Co., Ltd., Kaibushi Co., Ltd., ltd, etc. are excluded. This will be described in detail in the Applicant Representative Naming Method.

Through the above method, a set of patent documents to be managed at a specific applicant unit in each country unit or national unit of integration is determined first. The patent document set obtained by the applicant's unit document set acquisition module is managed in the form of the applicant's unit document set data. The unit document set data of the applicant name may be stored in the form of temporary data from the perspective of DBMS 2100, but may also be stored in a manner of storing a document unique number constituting the unit document set data of the applicant name under the applicant name. have. In this case, a method of storing data in a temporary data format may be stored in a general view. In addition, the applicant's unit document set data may be stored in a materialized view supported by the latest DBMS 2100, or may be stored in a table in a permanent manner. Regardless of the form in which the applicant document unit document set data is stored, by the join or the like supported by the DBMS 2100, the applicant document unit document set data provides a visual view including information required by the user. Can give The unit document set data of the applicant's name must include a document unique number for accessing each of the patent documents, and in addition to the document unique number, information selected from the entire data on the unit patent document of the applicant's name is further included. It may be included. The generated applicant's unit document set is managed by the applicant's unit document set management module 1511.

Document management

The management of the patent document of the applicant document unit document set management module 1511 includes CRUD (create create, read read, update update, delete delete). The management of creation, reading, updating, deleting, etc. is managed in such a manner that at least one or more of the four management functions are performed according to the access right to the document. Through the applicant name unit management module, the administrator of the applicant name unit patent information service system may delete a wrong record or document unique number that is different from the fact, and may add a specific record or document unique number, and may be unique to the document. Any change or modification of the content information corresponding to the number may reflect the change or correction. The reason why such deletion, addition, or update is necessary is that there may be a change in information on a specific patent document between the time of obtaining the patent document and the present time. Examples of such changes include: 1) name change through transfer of assignment during or after application; 2) modification of information of the inventor or applicant name (merger, change of company name, address change, addition or reduction of applicant or inventor, etc.) 3) revision of patent classification code, 4) revision of patent specification, etc., if any change in the contents of patent specification is reflected, and 5) increase or decrease of family such as foreign application or divisional application. have.

Through the above process, it is possible to extract a subset of patent documents belonging to a specific applicant name unit, it is possible to create a unit patent information service system of the applicant name using the patent document subset as a management target document.

FIG. 26 illustrates an exemplary process of a process of performing a CRUD on a document set managed by an applicant in a unit patent information service system administrator.

The management module allows the access of an administrator having the management authority for the applicant patent unit information service system (S2620), and if there is a change in the set of managed patent documents by the administrator, obtains the change (S2630). ), If there is a change to the inventor patent information service system by the administrator, the change is obtained (S2640), and if there is a change to the unit patent information service system of the second applicant name by the administrator, Obtain the changes (S2650), if there is a change in the service provided by the applicant's unit patent information service system, the change is obtained (S2660), and the obtained change is stored (S2670). .

FIG. 27 illustrates an exemplary process of a process of performing a CRUD on a document set managed by an inventor in a unit patent information service system administrator.

The management module allows access of an administrator having a management authority with respect to a unit patent information service system of an inventor's name (S2720), and if there is a change to a set of managed patent documents by an administrator, obtains the change (S2730). ), If there is a change in the unit patent information service system of the inventor's name by the manager, the change is obtained (S2740), and if there is a change in the unit patent information service system of the second applicant's name by the manager, Obtain the change (S2750), if there is a change in the service provided by the applicant's unit patent information service system, the change is obtained (S2760), and the obtained change is stored (S2770). .

Inventor Name Unit Patent Information Service System Generation Engine

Configuration

When the set of patent documents in the applicant's name unit is determined, at least one or more inventors included in the set of patent documents can be extracted, and the extracted inventors are managed as inventor list data. The inventor's extraction and the inventor list data generation and management are performed by the inventor's name extraction module.

It is possible to obtain a set of documents of at least one individual inventor unit based on the information of the applicant name and the inventor information of the inventor list data. Obtaining the inventor unit document set is performed by the inventor name unit document set acquisition module included in the inventor name unit patent information service system generation engine. The inventor name unit document set acquisition module utilizes the inventor list related to the patent document from the patent document set of the unit of the applicant name, and the inventor name unit patent document which is a subset of the unit patent document set of the applicant name in the inventor unit. Will create a set. The inventor's name unit document set is managed by the inventor's unit document set management module 1531.

Inventor List and Identification Code

When the patent document set in the unit of the applicant's name is specified / determined, all the bibliographic details of the patent document set are obtained, and then all the information of the inventor field among the bibliographic details can be obtained. In the process of obtaining the inventor information, a full list of inventors associated with the patent document set can be known, and an inventor identification code can be generated and assigned to each inventor included in the inventor full list.

Document extraction by inventor

If there is a list of inventors generated by the inventor name extraction module, the following three methods may be exemplarily employed as a specific method of extracting the inventor and the patent document subset registered by the inventor. First, the search engine 7000 is a method of searching for an "applicant's or applicant's identification code" and an "individual inventor's name" in the search expression. The second is to use the DBMS 2100 to query the SQL query statement with "applicant or applicant identification code" and "individual inventor name" with and conditions. Third, when the inventor list is generated from the unit document set of the applicant's name, the document's unique number such as the application number and the inventor's corresponding relationship (1: n relationship for each patent document) are generated. Conversely, it creates a "document unique number of a set of patent documents containing an inventor vs. an inventor" relationship. When the corresponding process is performed for the entire patent document set, at least one patent document subset corresponding to the inventor identification code can be extracted. Through any one or more of the above three methods, at least one or more patent document subsets in which a particular inventor is listed as an inventor are primarily determined, and the patent document subsets determined in the inventor unit are The inventor unit document DB is stored in the inventor unit document DB by the module.

FIG. 16 illustrates a unit patent information service system of an inventor for each inventor included in a patent document set that generates one applicant name unit patent information service system in the entire patent information database 2300 and constitutes the applicant patent unit service information system. One embodiment of the method is shown.

The patentee service system generation engine of the applicant's name acquires information on the applicant's name (S1620), and retrieves a patent document filed or registered in the name of the applicant's name through the search engine (7000) or DB query (S1630). In operation S1640, it is determined whether there is a document filed or registered under the name of the applicant (S1640). In operation S1650, a unit patent information service system of the name of the applicant is generated using the retrieved patent document as a set of documents to be managed. Subsequently, the inventor name unit patent information service system generation engine extracts the inventors from the searched patent document set, corresponds to patent documents for each inventor (S1660), and manages patent documents corresponding to inventors for each extracted inventor. The inventor's name unit patent information service system as a set is generated (S1670). If there is no document, the patent information service system of the applicant's name is not created.

FIG. 17 obtains a list of applicant names, generates a unit patent information service system of the applicant name by the number of applicants listed in the entire patent information database 2300 for each list, and generates the unit patent information service of the applicant name. An embodiment of a method for generating a unit patent information service system for each inventor included in a patent document set constituting the system is shown.

The patented unit patent information service system generation engine of the applicant obtains the list information of the applicant name (S1720), obtains the information of the individual application name on the list (S1730), and obtains a patent document filed or registered in the name of the individual applicant name obtained. Search (S1740), determine whether there is a document (S1750), and if there is, generate a unit patent information service system of the individual applicant name using the retrieved patent document as a management target document set (S1760), and then the unit patent of the inventor name The information service system generation engine extracts the inventors from the patent document set, corresponds to the patent documents for each inventor (S1770), and unit patent information service system of the inventor's name which sets the patent documents corresponding to the inventors for each extracted inventor as the management target document set. To generate (S1780), the list of the applicant name obtained the same process as above Determines whether there is application non-treated holder (S1790), and to the absence and then repeating the applicant who unit patent information service system and the inventors had produced unit patent information service system created.

FIG. 18 obtains a list of applicant names from the set of obtained documents, and generates a unit patent information service system of the applicant name by the number of applicants listed in the entire patent information database 2300 for each list, and each of the generated applicants An embodiment of a method for generating an inventor-specific unit patent information service system for each inventor included in a set of patent documents constituting the title unit patent information service system is shown.

The unit patent information service system generation engine of the applicant's name obtains a document set for generating the unit patent information service system of the applicant's name (S1820), extracts the applicant's name from the document set, and generates application name list information (S1830).

Subsequently, the applicant patent information service system generation engine of the applicant obtains the list information of the applicant name, obtains the information of the individual application name on the list (S1840), and searches for the patent documents filed or registered in the name of the individual applicant name obtained. (S1750), it is determined whether there is a document (S1860), and if there is, then creates a unit patent information service system of the individual applicant name using the retrieved patent document as a management target document set (S1870), and then the unit patent information service of the inventor name. The system generation engine extracts the inventors from the patent document set, corresponds to the patent documents for each inventor (S1880), and generates a unit patent information service system of the inventor's name which sets the patent documents corresponding to the inventors for each extracted inventor as the management target document set. (S1890), the same as the name of the application received the above process It is determined whether there is an application name not processed in the lock (S1891), and the unit patent information service system generation of the applicant name and generation of the unit patent information service system of the inventor name are repeated until there is no application name.

19 is a patent document for creating a unit patent information service system of one applicant name from the entire patent information database 2300 and configuring the unit patent information service system of the applicant name when an order for generation of the applicant patent unit patent information service system is ordered. An embodiment of a method for generating a unit patent information service system for each inventor included in a set is shown.

The unit patent information service system generation engine of the applicant's name obtains information on the applicant's name from an external third party (S1920), and retrieves a patent document filed or registered in the name of the applicant's name obtained from the search engine (7000) or DB query. Search (S1930), and determine whether there is a document filed or registered in the applicant's name (S1940), if there is, the unit patent information service system of the applicant's name to the searched document set management target document set (S1950). Subsequently, the inventor name unit patent information service system generation engine extracts the inventors from the searched patent document set, corresponds to patent documents for each inventor (S1960), and manages patent documents corresponding to inventors for each extracted inventor. The inventor's name unit patent information service system as a set is generated (S1970). If there is no document, the patent information service system of the applicant's name is not created.

The method of FIGS. 16 to 19 may not be applied to the individual countries, or may be applied to the case of specifying the individual countries. If no country is specified, it will be clear that the representative representation of the applicant should be assumed (especially if the language is of a different country).

20 relates to a method for generating a unit patent information service system of the applicant name on a national basis. Generating the unit patent information service system of the applicant's name in the unit of the country is the nature of generating the unit patent information service system of the applicant's name and the unit patent information service system of the inventor's name in the national unit for the patent information database 2300 of the national unit. Shall be. Therefore, all of the methods of FIGS. 16 to 19 may be applied.

The patent information service system generation engine of the applicant's name acquires information on the applicant's name (S2020), and obtains a list of countries (S2030), and a patent document filed or registered in the name of the applicant's name on an individual country basis from the list of obtained countries Search for (S2040), determine whether there is a document (S2050), if not complete at the national level, and if there is, the unit patent information service of the applicant name of the unit of the national unit that the patent documents retrieved from the national unit as a set of managed documents The system generates a system (S2060), and then the inventor patent unit service system generation engine extracts inventors from a set of patent documents at a national unit, and corresponds to patent documents by inventors (S2070), and responds to inventors by extracted inventors. The unit name of the inventor of the unit of the inventor of the national unit which makes the patent document the set of documents to be managed A patent is filed or registered in the name of the applicant in the individual country unit in the list of countries obtained if it is created (S2080) and whether there is an unprocessed country in the country list (S2090). The search for the document (S2040) is performed again.

FIG. 21 illustrates an embodiment of a process of generating a unit patent information service system of an applicant and a unit patent information service system of an inventor name by using family information.

The engine of the applicant patent information service system generation unit for obtaining the applicant name (S2120), retrieves the patent documents filed or registered in the name of the applicant name obtained in the first country (S2130), and determines whether there is a document ( S240) Next, if there is no completion in the first country, the patent information service system of the first country reference applicant that uses the patent documents retrieved from the first country as the management target document set is generated (S2150), and then the inventor name unit The patent information service system generation engine extracts an inventor from a set of patent documents retrieved from a first country, corresponds to a patent document for each inventor (S2160), and manages a patent document corresponding to an inventor for each inventor extracted from a first country. In operation S2170, a unit patent information service system of a first country reference inventor name as a set is generated. The unit patent information service system generation engine obtains the family patent number in the second country based on the patent application number of the patent document retrieved in the first country (S2180), and can be obtained as the family patent number in the second country. The unit patent information service system of the applicant's name in the second country having the patent document as the target document set is generated (S2190), and the inventor's unit patent information service system generating engine is then obtained from the second country. Unit patent information service system of the second country standard inventor name which extracts the inventors from the inventors, corresponds to the patent documents by the inventors (S2191), and sets the patent documents corresponding to the inventors by the inventors extracted from the second country as a management target document set. To generate (S2193),

FIG. 22 illustrates an embodiment of a process of generating a unit patent information service system of an applicant name and a unit patent information service system of an inventor name by using a priority claim number.

Wherein the applicant name patent information service system generation engine of the applicant acquires the information of the applicant name (S2220), searching for a patent document filed or registered in the name of the applicant name obtained in the first country (S2230),

It is determined that there is a document (S2240), if there is no completion in the first country, and if there is a unit patent information service system of the name of the applicant of the first country reference applicants using the patent documents retrieved from the first country as the management target document set (S2250) Then, the inventor name unit patent information service system generation engine extracts the inventors from the set of patent documents retrieved from the first country, and corresponds to the patent documents for each inventor (S2260), corresponding to each inventor by the inventors extracted in the first country In operation S2270, a unit patent information service system of a first country reference inventor name having a patent document as a management target document set is generated.

Subsequently, the unit patent information service system generation engine of the applicant name searches for the number of patent application numbers of the patent documents searched in the first country in the priority claim number in the second country (S2280), and the second country. In step S2290, the unit patent information service system of the applicant's name in the second country having the patent documents searched for as the target document set is generated (S2290), and the inventor's unit patent information service system generating engine is obtained in the second country. The unit patent of the second country's reference inventor name which extracts the inventors from the patent document set, maps the patent documents by the inventors (S2291), and sets the patent documents corresponding to the inventors by the inventors extracted in the second country as the management target document set. An information service system is generated (S2293).

FIG. 23 illustrates an embodiment of a process of generating a unit patent information service system of an applicant name and a unit patent information service system of an inventor name by using family information.

The unit name patent information service system generation engine of the applicant acquires the information of the applicant name (S2320), searches for patent documents registered or registered in the name of the applicant name obtained in the first country (S2330), and determines whether there is a document. In operation S2340, a unit patent information service system of a first country reference applicant name having a patent document retrieved from a first country as a management target document set is generated (S2350), and the unit patent information service system generation engine of the inventor name is then used. Based on the first country, the inventors are extracted from the set of patent documents searched in the first country, and the patent documents are corresponded by the inventors (S2360), and the first country standard for managing the patent documents corresponding to the inventors for each inventor by the inventors extracted in the first country is a management target document set. In operation S2370, a unit patent information service system of an inventor's name is generated.

The unit patent information service system generation engine of the applicant name obtains the family patent number in the second country based on the patent application number of the patent document retrieved in the first country (S2380), and returns to the family patent number in the second country. Create a patent information service system for the applicant's name in a second country that uses the patent documents that can be obtained as a set of documents to be managed (S2390), and obtains a patent document obtained in the second country through a family patent number. Integrating into the unit patent information service system of the first country reference inventor name based on the patent application number retrieved from the station (S2391), and the inventor patent of the unit patent information service system generation engine is obtained from the integrated second country patent document In operation S2393, a unit patent information service system of a second country reference inventor name is set as a management target document set.

FIG. 24 illustrates an embodiment of a process of generating a unit patent information service system of an applicant name and a unit patent information service system of an inventor name by using family information and priority claim information in a country unit.

The engine of the applicant patent information service system generation unit for obtaining the applicant name (S2420), and retrieves the patent documents filed or registered in the name of the applicant name obtained in the first country (S2403), and determines whether there is a document ( S2440) Next, if there is a patent document retrieved from the first country, the patent information service system of the first country reference applicant having the management target document set is generated (S2450). Based on the first country, the inventors are extracted from the set of patent documents retrieved from the first country, the patent documents are mapped to each inventor (S2460), and the first country standard is set to manage the set of patent documents corresponding to each inventor by the inventors extracted from the first country. The inventor's name unit patent information service system is generated (S2470).

Subsequently, the unit patent information service system generation engine of the applicant name searches for the number of patent application numbers of the patent documents retrieved in the first country and retrieves the numbers from the priority claim number in the second country (S2480). In step S2490, a unit patent information service system of an applicant's name in a second country having a patent document searched for as a target document set is generated (S2490), and the inventor's unit patent information service system generation engine is obtained from a second country. The patent document is incorporated into the unit patent information service system of the first country reference inventor name based on the patent application number retrieved in the first country through the priority claim number (S2491), and the patent document obtained from the integrated second country. In operation S2493, a unit patent information service system of a second country reference inventor name is set.

problem solving

If one applicant is a large company, there may be another inventor using the same name, in which case, address information may be used to distinguish the two. In addition, it is preferable that the method of obtaining the patent document of the inventor unit as described above proceeds for each country as in the case of obtaining the patent document of the applicant's name. At this time, the inventors can obtain patent documents for each country by 1) the applicant's representative name or the inventor's representative name through the representative name information for each country, and 2) the claim priority if the representative name is not provided. It is preferable to make it through the number. That is, the treaty priority claim number identifies the identity or correspondence of a second country's application related to the first country's application, and the inventors may adopt a method of treating the same in the applications of both countries where the identity or equivalence is recognized. Can be.

Document management

The management content of the patent document of the inventor's unit document set management module 1531 may be at least one of deletion, addition, or update (including reflecting or modifying changes). Through the inventor name unit document set management module 1531, an administrator of the inventor patent information service system (the manager may be the inventor itself or another third party) may have a wrong record or The document unique number can be deleted, a specific record or document unique number can be added, and the content information corresponding to the document unique number can be changed or modified to reflect the change or modification. The reason why such deletion, addition, or update is necessary is that there may be a change in information on a specific patent document between the time of obtaining the patent document and the present time. Examples of such changes include: 1) name change through transfer of assignment during or after application; 2) modification of information of the inventor or applicant name (merger, change of company name, address change, addition or reduction of applicant or inventor, etc.) 3) revision of the patent classification code, 4) revision of the patent specification, etc., if any change is made to the contents of the patent specification, and 5) increase or reduction of the family such as foreign application or divisional application. have.

Through the above process, it is possible to extract a subset of patent documents registered by the inventor as the inventors belonging to a specific inventor unit belonging to the unit of a specific applicant's name, and the inventor's name unit patent using the patent document subset as the management target document. An information service system can be created.

FIG. 25 illustrates an exemplary process of what the applicant's unit patent information service system generation engine and the inventor's unit patent information service system generation engine perform when a new document is added.

The unit patent information service system generation engine of the applicant's name acquires a new patent document (S2620), extracts applicant information from the new patent document (S2630), and determines whether there is a unit patent information service system of an existing applicant's name as applicant information. (S2640).

If there is a determination result, the new patent document information is added to the unit patent information service system of the existing applicant's name (S2650), and the inventor's unit patent information service system generation engine extracts the inventor information (S2660), and the unit of the existing applicant's name It is determined whether there is a unit patent information service system of an existing inventor name with inventor information under the patent information service system (S2680), and if there is a new patent document information is added to an existing inventor name unit patent information service system (S2690), An inventor's name unit patent information service system is generated based on the inventor's information, and the inventor's name unit patent information service system is used to set new patent document information as a management target document set (S2699).

On the other hand, if there is no patent information service system of the existing applicant name of the applicant information, the unit patent information service system generation engine of the applicant name generates a unit patent information service system of the applicant name whose new patent document is a management target document set (S2693). Then, the inventor name unit patent information service system generation engine extracts the inventors from the new patent documents, and corresponds to the patent documents by the inventors (S2695), the patent documents corresponding to the inventors by the extracted inventors for the management target document set The inventor's name unit patent information service system is generated (S2697).

Unit analysis of applicant name or inventor name

At least one or more analysis algorithms set in the analysis module 4100 of the present invention may be set in advance in the applicant's unit patent information service system and / or the inventor's unit patent information service system. That is, when generating the unit patent information service system of the applicant's name or the unit patent information service system of the inventor's name, or without the user's intervention even after the generation, the analysis algorithm required by the applicant name unit or the analysis algorithm required by the inventor name unit The automatic setting is made to constitute an analysis service of the applicant's unit patent information service system or the inventor's unit patent information service system. The execution of the analysis algorithm is executed when generating the unit patent information service system of the applicant name or the unit patent information service system of the inventor name, and the analysis result is applied to the unit patent information service system of the applicant name or the unit patent information service system of the inventor name. It is desirable to have in advance. However, if the analysis algorithm is executed at a high speed or fast enough to not wait for the user in real time, the analysis algorithm may be executed when there is external access to the analysis subject (such as a click of an administrator or a user). There will be. Therefore, when the analysis module 4100 is configured with at least two or more analysis algorithms, the analysis subject and corresponding analysis algorithm may be set in advance but the execution time may be different.

The analysis service is set in advance in the applicant's unit patent information service system or the inventor's unit patent information service system will be described in more detail. The analysis service is composed of a set of documents to be analyzed, selection of an analysis subject for which analysis to perform on the document set, and an analysis algorithm corresponding to the analysis subject. At this time, since the selection of the analysis subject and the analysis algorithm are prepared in the analysis system of the present invention, a specific analysis target document set to execute the analysis algorithm should be specified. However, since the document set is already specified in the step of generating the applicant patent unit patent information service system or the inventor name unit patent information service system, the applicant patent unit patent information service system or the inventor name unit patent information service system By managing the set of documents to be analyzed, the analysis can be performed automatically on at least one predetermined analysis subject.

In this case, when documents managed by the applicant's unit patent information service system or the inventor's unit patent information service system are clustered, a preset analysis algorithm for a predetermined analysis subject may be performed on the clustered partial document set. Can be.

In addition, the most frequent IPC (patent classification code, etc.), maximum concentration field, and AI maximum may be applied to the entire document set or the clustered partial document set managed by the applicant's unit patent information service system or the inventor's unit patent information service system. Various statistics or analytical results such as fields may be generated first or secondarily, and an analysis algorithm for each analysis subject may be set for the various statistics or analytical results. For example, the first IPC is first extracted from an IPC subclass or group based on a set of management documents of a unit patent information service system of a specific applicant's name, and secondly, the second IPC is targeted to the most frequent IPC. Extracts the largest number of applicants at home and abroad, and thirdly outputs the number of applicants per year by the applicant as an analysis result, and fourthly generates the results of the annual analysis of the concentration rate and share of the IPC by the applicant. Could be. As in the above example, two or more analyzes may be combined, and the results of the immediately preceding analysis may be used as the material for the immediately following analysis.

The result of the analysis may be generated in advance without a user's input in a unit of document set managed by the applicant's unit patent information service system or the inventor's unit patent information service system or in a partial document set unit of the document set. . Since the analysis execution time may vary according to the size of the document set to be analyzed and the analysis algorithm, the execution of the at least one analysis algorithm of the present invention is performed by the applicant's unit patent information service system or the inventor's unit patent information. It may be performed at the time of creation of the service system (when the analysis target document set is small or the analysis subject takes less time to perform the analysis algorithm) or after the creation of the patent information service system. At this time, since the patent information is updated every day or in a predetermined period, and new documents continue to occur, it is preferable that the performance of the analysis of the present invention is automatically performed in the predetermined period.

The patent document set managed by the applicant's name unit is largely divided into 1) a company-related patent document set and 2) a third-party related document set (for example, a manager of a unit patent information service system under one applicant's name is not himself or herself). It may have a unit patent information service system of the applicant's name of another company (competitor, etc.), 3) at least one subset of at least one set of patent documents managed by the administrator of the unit patent information service system of the applicant (the manager) It is possible to perform at least one or more analysis of all the above-described analysis for the patent document set clustered or grouped by the criteria of), and at least one or more again using the result of the analysis as an input value. Analysis can be performed.

Applicant's Unit vs. Inventor's Unit Patent Information Service System Relationship

Hereinafter, the relationship between the applicant's unit patent information service system and the inventor's unit patent information service system will be described in more detail. At least one inventor name unit patent information service system may be generated in the unit patent information service system of the applicant. The number of inventors' unit patent information service system is preferably less than or equal to the total number of inventors included in the patent document filed or registered in the applicant's name.

Administrative aspect

Hereinafter, the administrative aspects of the applicant's unit patent information service system and the inventor's unit patent information service system will be described in detail.

First, the administrator of the applicant patent unit patent information service system will be able to set the authority for the inventor patent unit service information system itself. The authority setting by the administrator of the applicant patent unit patent information service system includes management of access rights to the patent information service system of a specific inventor unit existing under the applicant patent unit patent information service system. For example, when the specific inventor belongs to his or her organization, the inventor may be given access to the inventor unit patent information service system. From the standpoint of the applicant's unit patent information service system administrator, when the inventor belonging to his organization leaves the company, it is not necessary to maintain the unit patent information service system of the inventor's inventor. In this case, 1) a method of deleting the unit patent information service system of the inventor's inventor name, 2) a method of removing the inventor's access authority (by deleting an ID, changing the PW, etc.) in preparation for the re-entry. May be employed.

Second, the administrator of the applicant's unit patent information service system will be able to delete the unit patent information service system itself. When deletion occurs, it occurs when the person who is primarily determined as the inventor does not belong to him or there is no need for management. The inventors listed in a specific patent application often belong to the applicant organization, but often they do not. At this time, the unit patent information service system of the inventor's name for the inventor who does not belong to the applicant organization is also generated, so it is necessary to delete it. Of course, the administrator of the applicant's unit patent information service system may allow access to the unit patent information service system of the inventor's name not belonging to the applicant's organization.

Third, the administrator of the applicant's unit patent information service system will be able to add and update the inventor's unit patent information service system itself. The addition refers to further generation of the unit patent information service system of the inventor. The unit patent of the name of the inventor whose management document is the new document targeted at the inventor listed for the first time when an inventor is first listed in a newly generated document after at least one inventor name unit information service system is generated. You just need to create an information service system.

Fourth, when the patent document is updated, the newly updated patent document may be added to the management target of the applicant patent unit information service system, and the newly updated patent document may be included in the updated patent document. In the case of the inventor, the new patent document may be added to the patent information service system of the inventor unit as a management object. Of course, the update includes the extinction, and when extinguished, the existing patent document may be deleted from the management target, or the patent document may be marked for extinction.

problem solving

Problems in Production from Public Documents (Public vs. Self)

Hereinafter, a description will be given of a problem and a solution for the case where the applicant's unit patent information service system and the inventor's unit patent information service system are produced in an open patent document. In general, when a patent application is filed, it is compulsorily published after 1 year and 6 months after the application date or at the time of registration, and may be disclosed even before the applicant's intention. The published patent documents are also available from outside. However, the applicant knows that a patent document with a specific application number has been filed, but if it is not yet published, there is a problem in that the unpublished patent document cannot be reflected as a management object based on patent information obtained from outside. There may be. In this case, a method of including the information on the unpublished patent document by the administrator of the unit patent information service system of the applicant name in the unit patent information service system of the applicant name may be considered. The information on the unpublished patent document is preferably less than the information on the public document for security reasons. An example of information included in the unit patent information service system of the applicant name among the information about the unpublished patent document may be an application number, an inventor, an application date, and the like, and may include a name of the invention and other information for management. . In this case, when the inventor information is included in the information about the unpublished patent document, the unpublished application number may be included as a management target document of the unit patent information service system of the inventor's inventor. When the unpublished patent document is released after a certain time, the applicant patent unit information engine system generation engine and / or the inventor name unit patent information service system generation engine sets the application number as a key value. By using the disclosed patent information, patent document information corresponding to the unpublished patent document can be updated.

Multi-tiered patent information service system management

Management module

Hereinafter, a multi-layered management module included in the management module will be described. First, the situation where the problem of multi-tier management occurs. If a single applicant has a significant number of inventors, the inventor may belong to at least one hierarchical organization. For example, one inventor may belong to team a1 <department <a1 <a1 <company A <alpha group. Therefore, from an administrative point of view, it would be natural for team a1 to manage the patent information service system of the inventor unit and patent documents related to team a1, and department a would be the inventor name unit for each department from a1 to aN. The patent information service system and / or patent documents are managed for the management of the patent information service system and / or patent documents in units of the inventor's name related to the department a through the department a. The unit patent information service system and / or patent document of the inventor's name related to the series, and the alpha group is the unit patent information service system of the applicant's name from company A to company Z, the unit patent information service system of the inventor's name and / or patent document, etc. I will do it by management. However, since most of the information available in the published documents is only the inventor's name and company's name (that is, the patent document generally does not have information about the group to which the inventor belongs except the applicant's information). The manager and / or the manager at the highest level will need to clarify where a particular patent document should belong. Since the patent information service system is generated through a patent document to be managed, if there is affiliation information on which inventor, which team, which department, which affiliate, and which company the patent document corresponds, through the affiliation information It is possible to create a patent information service system. In order to determine the affiliation information, a patent document, information on an inventor, and a company can be obtained from the patent document itself. Therefore, the inventor knows which team, which department, which family, and which company the company belongs to, or knows which team, which department, which family, which company the document belongs to, etc. By means of the group to which the patent document belongs can be determined.

Generation method

In this case, the method of generating the multi-tiered patent information service system may take one or more of the following two methods. The first is to create a patent information service system of the inventor unit, and then integrate the patent information service system of the inventor's name into the team unit to which the inventor belongs, integrate the patent information service system of each team unit into the department unit, and each department unit. Integrate the patent information service system of each subsidiary unit, integrate the patent information service system of each subsidiary unit into a company unit, hierarchically integrate the patent information service system of each company unit in a group unit, and in each hierarchical unit It is a method of managing patent information service system of each layer. Integration can be physical and meta-integration, where physical integration means that each layer has independent data, and meta-integration means that the upper level patent information service system only uses the meta information of lower level patent information service system. Say what you have Taking physical integration as an example, the team a1 has a unit patent information service system of the inventor of the inventor, but the department a also has a unit patent information service system of the inventor of the department. Taking meta-integration as an example, the a1 team belongs to the inventor's inventor's unit patent information service system, and the a department has only the management information for the a1 team and the inventor's unit patent does not belong to the inventor. It does not have own information service system. Second, if each team, department, affiliate, company, and / or group knows (if it can be specified) a patent document that it needs to manage, it generates a patent information service system for the above-mentioned specific document. It is a way. In this case, it is preferable that the patent information service system for the document that can be specified is a patent information service system in the unit of the applicant's name in a formal form. In this case, any one or more of physical integration and meta-integration may be employed. In addition, the manager may exist for each patent information service system of the multi-tier hierarchy, and the management function of the manager is provided by a management module of the multi-tier patent information service system unit. In this case, the administrator of the upper layer patent information service system may grant an authority to at least one lower layer patent information service system at the time of managing the multi-tier patent information service system. It may be provided in a management module of a service system unit.

Acquisition of document information to be managed

Through the above process, the following result may be generated.

First, the applicant's unit patent information service system can obtain the management target document information managed by the applicant at the unit level of the applicant's name. The document information may be a national unit and a national integration unit, and the applicant patent unit patent information service system may be a unit patent information service system of at least one or more multi-tier applicants. The manager of the unit patent information service system of the applicant name may manage document information of the unit patent information service system of the applicant name and the unit patent information service system of the inventor name through the unit management module of the applicant name, and own lower layer patents. It can also manage information service systems.

Secondly, the inventor's unit patent information service system can obtain the management target document information managed by the inventor at the unit level of the inventor's name. The document information may be a national unit and a national integration unit. Preferably, the inventor of the unit patent information service system of the inventor's name is an inventor authorized by the administrator of the unit patent information service system of the applicant's name, and the inventor has a unit patent of the inventor's name through the unit management module of the inventor's name. Document information of information service system can be managed.

Patent Information System Batch Generation Engine (5000)

The foregoing has described the generation, operation and management of the applicant patent unit patent information service system based on one applicant and the inventor patent unit service information system dependent on the applicant name unit patent information service system. Next, a method of generating and managing a unit patent information service system of a plurality of applicant names will be described. The patent information service system batch generation engine of the present invention is responsible for generating the unit patent information service systems of two or more applicant names and the unit patent information service systems of the inventors dependent on each of them. The configuration of the patent information system batch generation engine 5000 is shown well in FIG.

Applicant Name Acquisition Module

In order for the front-end patent information service system generation engine to generate the unit patent information service system of several applicant names, it is necessary to first obtain the name of the applicant. The function of acquiring the name of the applicant, which is the object of generating the patent information service system, is performed by the acquiring name of the applicant of the present invention. The Applicant Name Acquisition Module will preferably obtain at least one applicant name in the form of a list. The applicant name is not limited to one country, but may be an applicant name selected from several countries.

Individual unit patent information system generation engine 1000 driving module

When the list of applicant names is obtained, it is sufficient to generate unit patent information service systems of origin names and inventor patent unit service information systems dependent on the applicant name unit patent information services systems for each applicant. The role of generating one by one for each applicant name listed in the applicant name list is performed by the individual unit patent information system generation engine 1000 driving module of the present invention. That is, the individual unit patent information system generation engine 1000 driving module acquires one by the applicant's name and drives the patent information service system generation engine to generate the unit patent information service system of the applicant's name and the unit patent information service system of the inventor's name. When the information indicating that the generation is completed is obtained, a method of driving the patent information service system generation engine for another applicant is taken.

In this case, in the generation of the applicant patent unit patent information service system and the inventor name unit patent information service system, specific monitoring search expressions, analysis search expressions, etc. included in the monitoring service and analysis service are the individual unit patent information system generation engine 1000. The drive module may be generated while the drive module is being driven, but may be added to the unit patent information service system of the individual applicant and the unit patent information service system of the inventor.

In this case, the opening patent information service system generation engine driving module may generate only the unit patent information service system of the applicant name in some cases, and do not generate the unit patent information service system of the inventor name dependent on the unit patent information service system of the applicant name. can do. In this case, one company may attempt to create a patent information service system of the applicant's name for each competitor in order to systematically obtain patent information of several domestic and foreign companies which are its competitors. When it is necessary to know the patent activity information of each competitor's inventors, a unit patent information service system of the inventor name may be generated, but otherwise, the unit patent information service system of the applicant name may be sufficient.

For some companies, it is necessary to generate a unit patent information service system of the inventor's name, and for some companies, it is sufficient to generate the unit patent information service system of the applicant's name. Therefore, after the information on the range of generation is further obtained for each list of applicant names, it is preferable that the individual unit patent information system generation engine 1000 driving module is operated to reflect the range of generation thereof.

In addition, when obtaining the names of applicants selected from a plurality of countries, when the patent information database 2300 is constructed in a country unit, a patent information service system may be generated in a country unit. Such a situation is a problem regarding the order of batch processing, and therefore can be easily implemented by those skilled in the art.

Individual unit patent information service system multi-stage grouping module

When a plurality of applicant name unit patent information service systems have been created, the patent information service systems may be grouped with at least one or more steps according to the attributes of the applicant. On the contrary, the unit patent information service system of several applicant names may be arranged under one group. For example, the unit patent information service system of the applicant's name such as Hankook Tire Co., Ltd. and Kumho Tire Co., Ltd. may be arranged under a group having a multi-tiered structure of manufacturing-car-tire. Grouping as described above is easy in the scope of those skilled in the art, and thus detailed description is omitted.

Individual Unit Patent Information System Management Module

When two or more applicant name unit patent information systems are generated, the patent information service systems need to be managed, and the management is performed by the individual patent information service system management module. The open patent information service system management module manages authentication, authority management, authority transfer, deletion, change of location or affiliation, etc. of the applicant patent unit patent information service system.

When the unit patent information service systems of the applicants of the plurality of applicant names are generated as described above, it is necessary to integrate and manage them from the overall system perspective, and the integrated management module 6000 of the present invention performs the integrated management. 15 illustrates an embodiment of the configuration of the integrated management module 6000. The integrated management module 6000 includes an individual unit patent information system multi-stage grouping module 6100 and an individual unit patent information system management module 6300. Thus, the individual unit patent information service system can be grouped in multiple stages, and the multi-stage grouped patent information service system can be managed.

Configuration of the entire system

1 is an exemplary diagram of the configuration of the entire system of the present invention. The entire system of the present invention is a hierarchically integrated patent information service system 10, which can be connected to a user's computer through the network 300. The user computer 200 is an arbitrary computer that can be connected to the hierarchically integrated patent information service system 10 through a network 300. The user computer 200 may include a PC, a server, a notebook computer, a portable mobile terminal, and a communicable game terminal. Naturally, it includes any terminal capable of other wired / wireless communication and information processing.

The hierarchically integrated patent information service system 10 includes the individual unit patent information system generation engine 1000, stores various types of information described in the specification of the present invention, and is common to at least one module. As a database to be used, there is a common DB stage 2000. The common DB 2000 may include a DBMS 2100 and a patent information database 2300. The patent information database 2300 may include a patent document database 2310. , The patent information processing policy database 2330 and the patent classification code database 10000 are preferably included. In addition, it may include an individual unit patent information service system management DB (2500) that manages an individual unit patent information service system from a premise system point of view, and manages changes in the company name and provides information about the company such as financial information. It may optionally include a company information DB (2700) stored. In addition, the hierarchically integrated patent information service system 10 includes the patent information preprocessing module 3000, the patent information intelligence module 4000, the patent information system batch generation engine 5000, and the integrated management module ( 6000 and the search engine 7000. The search engine includes the searcher 7100, the indexer 7300, and the search index 7500.

The effects of the present invention are as follows.

First, it is possible to create a unit patent information service system of the applicant name hierarchically integrated only with the obtained applicant information, and also to effectively create the unit patent information service system of the inventor name.

Second, the patent information DB can be effectively established through various preprocessing.

Third, through the preprocessing of patent classification code information, the lower patent classification code can be effectively processed in patent search, patent analysis, patent monitoring, etc., thereby improving the quality of patent search, patent analysis, and patent monitoring services.

Fourth, by processing the fusion information on the patent classification code information, it is possible to grasp the tendency of fusion between the patent classification code information, and the fusion attribute can be utilized in patent analysis of the present invention.

Fifth, by processing various types of analysis including citation analysis in a patent document set unit, patent information can be processed independently of the size and type of the document set.

Claims (15)

 (a) identifying name information of the applicant's name from a patent information database and finding at least one patent document filed or registered in the name of the applicant's name; (b) if the patent document exists, establishing a hierarchically integrated patent information service system in units of the applicant name; (c) extracting at least one inventor listed as an inventor in the patent document; And and (d) establishing a hierarchically integrated patent information service system based on the inventor's name. The hierarchically integrated patent information service system of the inventor unit manages patent document information in which the inventor is registered, and the hierarchically integrated patent information service system of the unit of the applicant name is filed or registered under the name of the applicant. Patent document information, Patent document information managed by the hierarchically integrated patent information service system of the inventor unit is included in document information managed by the hierarchically integrated patent information service system of the unit of the applicant name, The hierarchically integrated patent information service system of the unit of the applicant's name is operated in such a manner as to include a hierarchically integrated patent information service system of the at least one inventor unit as a sub-system, Hierarchically characterized by the person having the management authority of the hierarchically integrated patent information service system of the applicant's name manages the inventor's access right to the hierarchically integrated patent information service system of the inventor's unit Integrated patent information service method. The method of claim 1, (a-1) obtaining request information for the establishment of a patent information service system hierarchically integrated from at least one or more applicants; hierarchically integrated patent information service method further comprising. The method of claim 2, Receiving the inventor designation information from the applicant name; And And performing the step (d) of the designated inventors. The method of claim 2, Transmitting inventor list information extracted in step (c) to the applicant; Obtaining inventor selection information from the inventor list information transmitted from the applicant; And And performing the step (d) of the selected inventor. The method of claim 1, Performing step (d) for all the inventors extracted in step (c); Transmitting inventor list information extracted in step (c) to the applicant; Receiving inventor selection information from the inventor list information transmitted from the applicant; And Maintaining a hierarchically integrated patent information service system of the inventor unit for only the selected inventor among all the inventors extracted in the step (c); Service method. The method of claim 1, Receiving deletion request information of the inventor from the applicant's name holder; And Closing the hierarchically integrated patent information service system of the inventor unit for the inventor requested to be deleted; hierarchically integrated patent information service method comprising the. The method of claim 1, Confirming the name information of the applicant name of step (a) is a method of querying the name information of the applicant name of the applicant with a query to a database operating system (DBMS) that manages the patent information database Integrated patent information service method. The method of claim 1, Confirming the name information of the applicant name in the step (a) is a method that the patent information search engine receives the name information of the applicant name as a search keyword and confirms, The patent information database is a hierarchically integrated patent information service method characterized in that the patent information index database indexed patent information accessible by the search engine. The method of claim 1, The patent document information registered by the inventor managed by the hierarchically integrated patent information service system of the inventor unit is managed using the application number as a key value, and the bibliography of the patent document corresponding to the application number is included in the patent document information. Hierarchically integrated patent information service method characterized in that at least one or more of the information is further included. The method of claim 9, Confirming the name information of the applicant name in the step (a) is a method that the patent information search engine receives the name information of the applicant name as a search keyword and confirms, The patent information database is a patent information index database indexed patent information accessible by the search engine, The bibliographic information of the patent document further includes patent classification code information. The patent classification code information is input to the search engine, The search engine searches the patent information index database on a predetermined time basis by using the input patent classification code information as a search word. And when the new patent document information corresponding to the patent classification code information is found as a result of the search, the retrieved patent document information is managed under the application number. The method of claim 10, The application number is a national application number, The search using the patent classification code information as a search word is performed on a patent information index database of a country unit. Searched patent document information is managed hierarchically integrated patent information service, characterized in that managed under the national application number. The method of claim 1, Confirming the name information of the applicant name in the step (a) is a method that the patent information search engine receives the name information of the applicant name as a search keyword and confirms, The patent information database is a patent information index database indexed patent information accessible by the search engine, Receiving a search expression for the search engine to perform a search from the inventor; Inputting the obtained search expression into the search engine; Causing the search engine to perform a search on the patent information index database in units of time preset by the input search formula; And If new patent document information corresponding to the search expression is found as a result of the search, storing the searched patent document information together with the search expression in a hierarchically integrated patent information service system of the inventor unit; Hierarchically integrated patent information service method comprising a. The method of claim 1, Confirming the name information of the applicant name in the step (a) is a method that the patent information search engine receives the name information of the applicant name as a search keyword and confirms, The patent information database is a patent information index database indexed patent information accessible by the search engine, Receiving analysis subject and analysis period information on the patent information; Receiving, by the search engine, a search expression for performing a search; Generating an analysis search expression by integrating the obtained search expression and the analysis period information; Inputting the analytic search expression into the search engine; Causing the search engine to perform a search on the patent information index database in the analytical search formula; And If the patent document information corresponding to the search expression is found as a result of the search, storing the counting information regarding the patent document information with the analysis subject in correspondence to the analysis period; When the analysis subject and analysis period information and the search expression are obtained from the inventor, the counting information regarding the patent document information is stored in a hierarchically integrated patent information service system of the inventor unit. When the analysis subject and analysis period information and the search expression are obtained from a person having a right to use a hierarchically integrated patent information service system in the unit of the applicant's name, the storing of counting information about the patent document information is applied to the application. Hierarchically integrated patent information service method characterized in that it is stored in a hierarchically integrated patent information service system of the name of the person. The method of claim 13, When the fraud analysis period information is received, analysis period unit information is further obtained, and counting information about the patent document information on the search result after performing the search is stored for each analysis period unit with the analysis period as a whole period. Hierarchically integrated patent information service method characterized in that. The method of claim 1, Confirming the name information of the applicant name in the step (a) is a method that the patent information search engine receives the name information of the applicant name as a search keyword and confirms, The patent information database is a patent information index database indexed patent information accessible by the search engine, Receiving analysis subject, analysis period information, and analysis period unit information for the patent information; Determining the number of cells in an analysis period unit by referring to the analysis period information and the period unit information; Receiving, by the search engine, a search expression for performing a search; Generating a cell-specific analysis search equation assigned to each cell by integrating the obtained search expression, the analysis period information, and the analysis period unit information; Inputting the cell-specific analysis search expression into the search engine; Causing the search engine to search the patent information index database by the cell-specific analysis search formula; And If the patent document information corresponding to the search expression is found as a result of the searching, storing the counting information related to the patent document information in correspondence with the cell; When the analysis subject, analysis period information, and analysis period unit information and the search expression for the patent information are obtained from the inventor, the counting information regarding the patent document information is hierarchically integrated in the inventor unit. Stored in the patent information service system, When the analysis subject, analysis period information, analysis period unit information and the search expression for the patent information are obtained from a person who has access to the hierarchically integrated patent information service system of the applicant's name; And storing the counting information about the patent document information in a hierarchically integrated patent information service system of the unit of the applicant name.

Images