KR20110104816A - Method on producing information on fusion information of technology using patent data - Google Patents
Method on producing information on fusion information of technology using patent data Download PDFInfo
- Publication number
- KR20110104816A KR20110104816A KR1020100023932A KR20100023932A KR20110104816A KR 20110104816 A KR20110104816 A KR 20110104816A KR 1020100023932 A KR1020100023932 A KR 1020100023932A KR 20100023932 A KR20100023932 A KR 20100023932A KR 20110104816 A KR20110104816 A KR 20110104816A
- Authority
- KR
- South Korea
- Prior art keywords
- classification
- fusion
- combination
- unit
- information
- Prior art date
Links
- 230000004927 fusion Effects 0.000 title claims abstract description 231
- 238000000034 method Methods 0.000 title claims abstract description 111
- 238000005516 engineering process Methods 0.000 title abstract description 31
- 238000012545 processing Methods 0.000 claims description 98
- 238000007499 fusion processing Methods 0.000 claims description 67
- 238000010586 diagram Methods 0.000 claims description 31
- 238000005192 partition Methods 0.000 claims description 6
- 230000001133 acceleration Effects 0.000 claims description 3
- 238000004458 analytical method Methods 0.000 description 53
- 238000012369 In process control Methods 0.000 description 27
- 210000004544 dc2 Anatomy 0.000 description 27
- 230000010365 information processing Effects 0.000 description 27
- 238000004190 ion pair chromatography Methods 0.000 description 27
- 238000012423 maintenance Methods 0.000 description 23
- 230000008569 process Effects 0.000 description 19
- 238000003012 network analysis Methods 0.000 description 14
- 238000011156 evaluation Methods 0.000 description 13
- 238000012800 visualization Methods 0.000 description 13
- 238000000605 extraction Methods 0.000 description 12
- 230000006870 function Effects 0.000 description 12
- 238000004422 calculation algorithm Methods 0.000 description 7
- 239000000284 extract Substances 0.000 description 7
- 238000003672 processing method Methods 0.000 description 7
- 238000004364 calculation method Methods 0.000 description 6
- 238000012098 association analyses Methods 0.000 description 5
- 230000008859 change Effects 0.000 description 4
- 238000002372 labelling Methods 0.000 description 4
- 238000013507 mapping Methods 0.000 description 4
- 230000002776 aggregation Effects 0.000 description 3
- 238000004220 aggregation Methods 0.000 description 3
- 238000001514 detection method Methods 0.000 description 3
- 238000001914 filtration Methods 0.000 description 3
- 238000007726 management method Methods 0.000 description 3
- 238000003058 natural language processing Methods 0.000 description 3
- 238000000638 solvent extraction Methods 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 210000004027 cell Anatomy 0.000 description 2
- 238000006243 chemical reaction Methods 0.000 description 2
- 239000003795 chemical substances by application Substances 0.000 description 2
- 238000010224 classification analysis Methods 0.000 description 2
- 239000002131 composite material Substances 0.000 description 2
- 238000011161 development Methods 0.000 description 2
- 230000014509 gene expression Effects 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 238000012731 temporal analysis Methods 0.000 description 2
- 238000000700 time series analysis Methods 0.000 description 2
- 238000000018 DNA microarray Methods 0.000 description 1
- 101001062535 Homo sapiens Follistatin-related protein 1 Proteins 0.000 description 1
- 101001122162 Homo sapiens Overexpressed in colon carcinoma 1 protein Proteins 0.000 description 1
- 208000001048 Oculocerebrocutaneous syndrome Diseases 0.000 description 1
- 102100027063 Overexpressed in colon carcinoma 1 protein Human genes 0.000 description 1
- 238000013459 approach Methods 0.000 description 1
- 239000003086 colorant Substances 0.000 description 1
- 150000001875 compounds Chemical class 0.000 description 1
- 239000000470 constituent Substances 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000010219 correlation analysis Methods 0.000 description 1
- 239000013078 crystal Substances 0.000 description 1
- 238000007405 data analysis Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 239000011159 matrix material Substances 0.000 description 1
- 238000005259 measurement Methods 0.000 description 1
- 238000011084 recovery Methods 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 238000012216 screening Methods 0.000 description 1
- 238000004088 simulation Methods 0.000 description 1
- 238000007619 statistical method Methods 0.000 description 1
- 238000013517 stratification Methods 0.000 description 1
- 238000013519 translation Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/25—Integrating or interfacing systems involving database management systems
- G06F16/254—Extract, transform and load [ETL] procedures, e.g. ETL data flows in data warehouses
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/10—Services
- G06Q50/18—Legal services
- G06Q50/184—Intellectual property management
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Theoretical Computer Science (AREA)
- Technology Law (AREA)
- Databases & Information Systems (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- Tourism & Hospitality (AREA)
- Health & Medical Sciences (AREA)
- Human Resources & Organizations (AREA)
- Entrepreneurship & Innovation (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- Economics (AREA)
- General Health & Medical Sciences (AREA)
- Operations Research (AREA)
- Marketing (AREA)
- Primary Health Care (AREA)
- Strategic Management (AREA)
- General Business, Economics & Management (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The present invention relates to a method and a system for generating technology fusion pattern information using cited patent information, and more particularly, to a method and system for generating fusion information using citation related patent information.
Utilizing the present invention, it is possible to effectively discover and generate fusion information between patent classifications, fusion information between technology keywords, and fusion information between technology / part / element technology / product.
Description
The present invention relates to a method for generating technology fusion pattern information using citation patent information, and more particularly, to a method for generating fusion information using citation related patent information.
With shorter technology replacement cycles and greater market volatility, the return on investment (ROI) of R & D continues to deteriorate. In response to this situation, voices are increasingly stressing the importance of open innovation and convergence technologies.
Existing convergences mainly consisted of 1) declarative convergence such as IT-BT convergence, 2) exemplary convergence at higher levels such as five sense experience display devices and services, and 3) individual convergence such as biochips. Despite the nominal emphasis on the importance of convergence under these circumstances, no specific guidance or direction is available.
Patent information is a collection of technical collective intelligence, a valuable human asset that has the characteristics that most of the world's technical knowledge is first disclosed as a patent. By exploring this patent information effectively, you will find patterns in technology convergence.
In 2007 and 2009, Kwanggato Research Institute, the applicant of this patent, disclosed a patent information fusion analysis technology using patent classification information and keywords. Prior patents include Korean Patent Application Nos. 10-2007-0061273, 10-2007-0002555, 10-2007-0129437, 10-2007-0129270, 10-2007-0129387, 10-2007-00129367, 10-2008-0126562, 10-2009-0082997 and the like. This prior patent describes in detail a method of finding a fusion pattern through association analysis of patent classification information and keywords. These patents focus on exploring fusion in terms of the existence of associations.
However, seeing fusion as "something new in the area of interest" requires a different approach to discovering fusion. In conventional association analysis, there is a problem in that it is difficult to distinguish the difference between frequently related and recently related. Accordingly, there has been a demand for technology development that can reflect new perspectives of convergence while applying correlation analysis.
In particular, there is an urgent need for the development of a method and system for finding a fusion pattern utilizing citation-related patent information that is important in patent information.
The problem to be solved by the present invention is to disclose a method for generating fusion information by using the patent information related to the citation.
Another problem to be solved by the present invention is to disclose a system for generating fusion information by utilizing the patent information related to the citation.
In order to achieve the technical problem to be achieved by the present invention, in the patent information system, (A) the first divided patent by dividing (A) at least one or more patent sets generated or obtained by applying at least one division processing criteria Generating a set and at least one second divided patent set; (B) a first citation splitting comprising one or more cited patent documents of patent documents included in the first split patent set and the second split patent set for each of the first split patent set and the second split patent set; Generating a patent set and at least one second cited split patent set; (C) In the patent documents included in the first cited divided patent set and the second cited divided patent set, a predetermined unit fusion element corresponding to the patent document is set to the first cited divided patent set and the second cited divided patent. Generating for each set; And (D) selecting a unit fusion element that meets a predetermined fusion processing criterion among the unit fusion elements generated for each of the first and second cited divided patent sets. The element is generated by including any one or more of a patent classification, a keyword extracted from the patent document, a keyword processed the extracted keyword, step (C) is the first cited divided patent set and the first A patent document including two or more patent classifications based on at least one patent classification among patent documents included in the two-quotation split patent set, or the first and second citation split patent sets and the second citation. The patent document includes two or more keywords extracted or processed from patent documents included in the divided patent set. It proposes a method for generating fusion information, characterized in that.
The unit fusion element is any one or more selected from a patent classification combination consisting of two or more patent classifications, a key keyword combination consisting of two or more keywords, and an index combination corresponding to a patent classification, and the patent classification combination and the index. Preferably, the combination is generated based on two or more patent classifications included in the patent document.
The fusion processing criterion is that the unit fusion element is present only in one predetermined patent set, or 2) the frequency of the unit fusion element for each of the divided patent sets is equal to or greater than a predetermined difference, or 3) the divided patent. The frequency of the unit fusion element for each set is equal to or greater than a preset increase rate, or 4) the frequency of the unit fusion element for each of the divided patent sets is greater than or equal to a preset increase acceleration, or 5) the unit fusion element for each of the divided patent sets It is preferable that the frequency of is to establish a predetermined function relationship or a predetermined condition relationship.
When the unit fusion element is an index combination, the method for generating the index combination may include: 1) an index using an index corresponding to the original patent classification only by the original patent classification explicitly indicated in the patent document included in each partition set. And a method of generating a combination, and 2) referring to the patent classification system to which the original patent classification belongs, with respect to the explicitly listed original patent classification, and including an index corresponding to a preset upper patent classification of the original patent classification. It is preferable that any one method selected from among the methods for generating the index combination is used.
The divisional processing criteria are generated by any one or any combination of two or more of an issuer country, a time range, an applicant or an owner or assignee, an inventor, a patent classification, a patent subject classification, and a predetermined classification attribute included in the patent document. The time that is the basis of the time range is any one of a priority date, an application date, a publication date, and a registration date of the patent document, or any combination of two or more thereof, and the patent classification is any one of IPC, USPC, FT, FI, and ECLA. One or any combination of two or more, wherein the patent subject classification is any one or more of the subject classifications generated using any one or more of the index of the IPC, the index of the USPC, or the IPC, USPC, FT, FI, and ECLA. The predetermined classification attribute constitutes a classification attribute for the applicant, the owner, or the assignee, and the patent classification. That the not less than one of a classified-patent classification properties, classification attribute for the inventors, or the subjects classified-patent classification properties are preferred.
When the unit fusion element is a patent classification combination, the method of generating the patent classification combination may include 1) generating the patent classification combination only by the original patent classification of the patent documents included in each of the divided sets; and 2) the original patent classification. Regarding the patent classification system to which the original patent classification belongs, with respect to any one of the methods selected from the method of generating the patent classification combination by including a predetermined upper patent classification of the original patent classification is used. desirable.
A first method for generating nCr (r is less than or equal to n and greater than 1) patent classification combinations when the original patent classification is n (n is an integer), the original patent classification is n (n is an integer) M, m is an integer, m is a predetermined upper patent classification for each of the original patent classifications, with reference to the patent classification system information to which the n original patent classifications belong to each of the n original patent classifications. generates a top patent classification greater than or equal to n, and wherein (n + m) Cr (r is less than or equal to (n + m) and greater than 1 with the n original patent classifications and the m top patent classifications ) A second method of generating patent classification combinations, and a third method of generating the patent classification combinations by applying a weight of a predetermined criterion to the patent classification combinations generated in the first method or the second method. To practice one or more inventions It is good.
And displaying the selected unit fusion element in a preset format. The preset format may be any one of a table format, a chart format, a graph, and a network diagram format.
When the unit fusion element is displayed, at least one of a patent classification code, title information corresponding to the patent classification code, and an index corresponding to the patent classification code is displayed, or a keyword is displayed.
The at least one patent set generated or obtained is a cited patent set consisting of a first-generated patent set, at least one cited patent document of a patent document included in the first-generated patent set, and a patent document included in the first-generated patent set. A patent made up of a cited patent set consisting of one or more of the cited patent documents of the patent document included in any one or more patent sets of the family patent sets in at least one country of the patent documents included in the first-generated patent set. It is preferable that it is a collection.
In order to achieve the technical problem to be achieved by the present invention, in the patent information system, at least one or more patent sets generated or received by dividing by applying at least one or more division processing criteria, the first divided patent set and at least one or more second divisions An aggregation dividing unit for dividing into patent sets; A unit fusion element generation unit configured to generate a predetermined unit fusion element for each of at least one divided patent set divided by the set divider and at least one divided patent set selected from at least one cited divided patent set generated for each of the divided patent sets ; And a fusion pattern processor configured to select a unit fusion element that meets a predetermined fusion processing criterion among the unit fusion elements, wherein the cited split patent set is a citation of at least one step of a patent document included in the first split patent set. At least one of the first cited split patent set composed of patent documents and the second cited split patent set composed of one or more cited patent documents of a patent document included in the second divided patent set, wherein the unit fusion element is And a patent classification combination, a keyword combination extracted from the patent document, and an index combination. The unit fusion element may be generated by a first divided patent set, a second divided patent set, and the first combination. At least one kind of patent documents included in the single-cited split patent set and the second-cited split patent set A patent document including two or more patent classifications based on a patent classification, or the first divided patent set, the second divided patent set, the first cited split patent set, and the second cited split. Is applied to a patent document including two or more keywords extracted or processed from a patent document included in the patent set, the first divided patent set, the second divided patent set, the first cited divided patent set and Includes two or more patent classifications based on at least one or more types of patent classification among the patent documents included in the second cited divided patent set, wherein the two or more patent classifications are applied to patent documents corresponding to different indices The present invention provides a patent information system for generating fusion information.
The aggregation dividing unit may further include a dividing process reference acquiring unit which receives a dividing process criterion from a user computer using the patent information system, wherein the dividing process reference acquiring unit inputs an issuer input interface and a time range included in the patent document. And one or more of an interface, an applicant, an owner or assignee input interface, an inventor input interface, a patent classification input interface, a patent subject classification input interface, and a predetermined classification attribute input interface. It is preferable to divide the generated or received patent set by applying the division processing criteria obtained through the standard acquisition unit.
And a patent classification fusion preprocessor for generating the patent classification combination based on two or more patent classifications included in the patent document, wherein the method for generating the patent classification combination by the patent classification fusion preprocessor comprises: Generates nCr (r is less than or equal to n and greater than 1) patent classification combinations when n (n is an integer) number of patent classifications included in the patent document, depending on the type of at least one patent classification included in In the first method, when there are n (n is an integer) patent classifications included in the patent document, the patent classification system information of the n patent classifications is referred to for the n patent classifications. M (m is an integer, m is greater than or equal to n) patent classifications up to a preset upper patent classification, and the n patent classifications and the m patent classifications are (n + m) Cr (r (n + m) beam Generating the patent classification combination by applying a weight of a predetermined criterion to the patent classification combination generated in the first method or the second method Is performed by any one of the third methods of carrying out the invention of any one or more of the methods, and when the first method or the second method is implemented, the generated patent classification combination is a patent classification system to which the patent classification belongs. It is preferable to use any one or more of a method of extracting a predetermined upper patent classification of the patent classification with reference to the information, and generating based on the extracted upper patent classification.
It is preferable to further include a cited patent set acquisition unit for obtaining the forward-cited patent documents cited by the patent included in the divided patent set for each of the divided patent set.
And a fusion processing reference policy DB including information on the fusion processing criteria. The fusion processing criteria further includes a frequency of the patent classification combination for each patent classification combination or a frequency of the core keyword combination for each key keyword combination. Is greater than or equal to a predetermined difference for each of the divided patent sets, is greater than or equal to a preset increase speed, is greater than or equal to a predetermined increase acceleration, or establishes a predetermined function relationship or a predetermined condition relationship. Preferably, at least one of the fusion processing reference values for each of the fusion processing criteria is provided by the system or obtained from a user computer using the system.
And a fusion pattern visualization unit configured to display the selected unit fusion elements in a preset format, wherein the preset format is any one of a tabular format, a chart format, a graph, or a network diagram format. The unit supports a function of displaying one or more of a patent classification code, title information corresponding to the patent classification code, and an index corresponding to the patent classification code or displaying the keyword when the unit fusion element is displayed. It is preferable to.
Utilizing the present invention, it is possible to effectively generate fusion information between patent classifications, fusion information between technology keywords, and fusion information between technology / parts / element technology / products.
According to the present invention, a fusion pattern can be easily discovered through various information processing such as a set operation using unit fusion elements for a divided patent set that is divided by various division criteria for a patent set that wants to know fusion information. Can be.
According to the present invention, information processing such as a set operation using a unit fusion element is performed on a divided patent set divided by various division criteria for a patent set that wants to know the fusion information and a divided cited patent set by each divided set. The fusion pattern can be easily found.
By utilizing the present invention, fusion information can be generated in advance for various objects such as each patent classification, each applicant, and each inventor, thereby providing users with fusion information quickly and conveniently.
1 is a diagram illustrating an exemplary network configuration of a patent information system of the present invention.
2 is a diagram illustrating an exemplary embodiment of a patent information system of the present invention.
3 is an exemplary diagram of a data processing unit of the present invention.
4 is an exemplary diagram of an analysis information generation unit of the present invention.
5 is an exemplary diagram of an evaluation information generating unit of the present invention.
6 is an exemplary diagram of a feature analysis information generation unit of the present invention.
7 is an exemplary diagram of a specialized object discovery unit of the present invention.
8 is an exemplary view of a similar patent set generating unit of the present invention.
9 is an exemplary diagram of an initial signal detector of the present invention.
FIG. 10 is an exemplary diagram of a niche description region discovery unit of the present invention. FIG.
11 is an exemplary diagram of an open innovation target discovery unit according to the present invention.
12 is an exemplary view of a future technology discovery unit of the present invention.
FIG. 13 is a view illustrating an additional service providing unit of the present invention. FIG.
14 is an exemplary diagram of a fusion information processing unit of the present invention.
15 is an exemplary diagram for a simple two-division convergence information model of the present invention.
16 is a diagram for one embodiment of a composite partition fusion information model of the present invention.
17 is an exemplary diagram of a simple two-division forward citation fusion information model of the present invention.
18 is a diagram for one embodiment of a composite split forward citation fusion information model of the present invention.
19 is a diagram illustrating an exemplary configuration of a key keyword DB of the present invention.
20 is a diagram for one embodiment of a method of generating fusion information in a simple two-division fusion information model of the present invention.
21 is a diagram for one embodiment of a method of generating fusion information in a simple two-division forward citation fusion information model of the present invention.
FIG. 22 is an exemplary diagram for another method of generating fusion information in the simple two-division forward citation fusion information model of the present invention. FIG.
FIG. 23 is an exemplary diagram of another method for generating fusion information in the simple two-division forward citation fusion information model of the present invention. FIG.
24 is an exemplary capture screen of information provided by WIPO for IPC and catchword.
25 is an example capture screen for an index for a USPC provided by the USPTO.
Hereinafter, it demonstrates in detail, referring drawings.
14 is a diagram illustrating an exemplary configuration of the fusion
In the present invention, any one or more of a keyword, a patent classification, and an index may be used as the unit fusion element generated by the unit
FIG. 25 is a USPTO index for USPC, and information about them can be found at http://www.uspto.gov/web/patents/classification/uspcindex/indextouspc.htm as of March 2010. It can be seen that the index abrading is classified into three levels of hierarchy in the contents of FIG. 25. It can be seen that the index Abrading corresponds to
The keyword may be generated by processing the text included in the patent specification, which is in charge of the
Through the above-described key keyword selection algorithm, it will be obvious that one or more key keyword sets corresponding to one patent document may be selectively included. That is, the key keyword set KS (Pi) = {K1 (Pi), K2 (Pi), ..., Ki (Pi), Kj (Pi) ,,,, Kn (Pi) corresponding to the i th patent document Pi } You get In the above description, i, j, n are integers, and Kn (Pi) refers to the nth key keyword selected from the i th patent document Pi. A set of key keywords can be mapped to a single patent document, because: 1) specific fields (for example, claims or summaries), 2) different weights for each field, 3) selection of two or more key keywords There may be various reasons, such as the use of an algorithm, 4) reference range of IDF calculation, 5) term extraction method, etc.) Core keyword set KS (Pi) = {K1 (Pi), K2 corresponding to the i th patent document Pi. (Pi), ..., Ki (Pi), Kj (Pi) ,,,, Kn (Pi)} may be stored in the
In this case, the unit
Meanwhile, the unit
When there are n original patent classifications for each type of patent classification in the i-th patent document Pi, the original classification set corresponding to the Pi is OCS (Pi) = {C1 (Pi), C2 (Pi) , ..., Ci (Pi), Cj (Pi) ,,,, Cn (Pi)}. I, j, n are integers, and Cn (Pi) refers to the nth patent classification selected from the i th patent document Pi. Similar to the generation of the frequency maintaining key keyword combination set, the original patent classification combination set OCCS (Pi) = {OCC1 (Pi), OCC2 (Pi), ..., OCCi (Pi), OCCj (Pi), OCCn (Pi), OCCnCr (Pi)}. Of course, the original patent classification combination set may be generated for each type of patent classification. In this case, Japanese patent documents may be generated for each IPC, FT, and FI. In this way, the generation of the patent classification combination set for the original patent classification can be handled equivalently to the generation of the frequency maintenance key keyword combination set. The original patent classification combination set becomes a negotiated patent classification combination set.
On the other hand, since the patent classification has a hierarchical structure, in addition to the combination of the revealed patent classification, an implicit patent classification combination set can be generated. For a method of generating a combination set of the above-mentioned nested patent classifications, the applicants / applicants' patent applications 10-2007-0061273, 10-2007-0002555, 10-2007-0129437, 10-2007-0129270, 10-2007-0129387 , 10-2007-00129367, 10-2008-0126562, 10-2009-0082997 and the like. The following are the contents of the published patent. The nested patent classification combination set is called an ICCS (Implicit Classification Combination Set).
Korean Patent Application No. 10-2005-0111868 is issued January 04, 2006 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 shown in the following table. The cell associated with H04B 7/00 has no cell value as described above. It is necessary to generate a nested patent classification combination set up to just before the common parent of each patent classification, and limit the depth for generating the nested patent classification combination set such as a subgroup. If there is no limitation, taking IPC as an example, there is a problem that too many patent classification combination sets are generated from excessive upper patent classifications when sections are different.
Table 1 shows the original patent classification combinations (H04B 7/15, H04B 7/26), (H04B 7/14, H04B 7/26), (
On the other hand, when there are three or more patent classifications, the nested patent classification combinations shown in Table 1 may be generated for each patent classification combination, and the nested patent classification combinations considering the main patent classification and the sub patent classification are considered. May be possible. In this regard, the patents of H04B 7/04, H04B 7/155, and H04Q 7/30, which are assigned to the Korean Patent Application No. 10-2006-0012606 in the patents of the applicant / inventor as of January 2006, will be described as an example. I'm laying.
On the other hand, processing patent classification combination sets can be introduced. Since the original patent classification shown in the patent document has a different depth (depth, the number of dots included in the title information) for each patent classification, the depth can be kept constant for each original patent classification with reference to the patent classification system. You can introduce a patent classification that has been processed to make it work. An example of the processing to be maintained at a constant depth is, in the case of IPC, a process of adjusting the original patent classification to the subgroup or 1 dot subgroup level with reference to the patent classification system. The set of patent classification combinations generated by processed patent classification is called Processed Classification Combination Set (PCCS).
The patent classification combination set of the present invention is a patent classification combination set including at least one of the original patent classification combination set, the nested patent classification combination set, and the processed patent classification combination set. The following describes the patent classification combination set. In the fusion information processing of the present invention, the user can of course select the processing range of the patent classification combination set.
On the other hand, when there is a patent classification, the unit fusion
When there are n original patent classifications for each type of patent classification in the i-th patent document Pi, there is an original classification set corresponding to the Pi, and a source index set corresponding to the original patent classification set. Index Set, OIS) gives OIS (Pi) = {I1 (Pi), I2 (Pi), ..., Ii (Pi), Ij (Pi) ,,, In (Pi)}. In the above description, i, j, n are integers, and In (Pi) refers to the nth index selected from the i th patent document Pi. Similar to the generation of the frequency-maintaining core keyword combination set, the original index combination set (OICS) corresponding to the i-th patent document Pi (OICS) OICS (Pi) = {OIC1 (Pi), OIC2 (Pi), .. , OICi (Pi), OICj (Pi) ,,,, OICn (Pi) ,,,, OICnCr (Pi)}. The cause index combination set may be generated according to the type of patent classification to which the index is associated. In this case, US patent documents may be generated for each IPC and USPC. In this way, the generation of the cause dex combination set for the original patent classification can be handled equivalently to the generation of the frequency maintenance key keyword combination set. The cause index combination set becomes a narrow index combination set.
Meanwhile, a nested index combination corresponding to the nested patent classification combination may be possible. When generating the nested index combination, 1) a method of constructing a nested patent classification combination as shown in Table 1 and removing a combination corresponding to the same index combination among the patent classification combinations, and 2) nested patent classification as shown in Table 1 above. When extracting the upper patent classifications of the original patent classification to be arranged on the horizontal axis and the vertical axis to generate the combination, a method of generating a table in abbreviated form by removing the upper patent classification corresponding to the same index may be used.
On the other hand, a processing index combination set can be introduced. Since the original patent classification shown in the patent document has a different depth (depth, the number of dots included in the title information) for each patent classification, the depth can be kept constant for each original patent classification with reference to the patent classification system. The processing may be performed so that an index corresponding to the processed patent classification may be introduced. The set of index combinations created using processed patent classifications is called a Processed Index Combination Set (PICS).
The index combination set of the present invention is an index combination set including at least one of the cause index combination set, the nested index combination set, and the processing index combination set. The following describes the index combination set. In the fusion information processing of the present invention, the user can of course select the processing range of the index combination set.
The unit fusion
The frequency maintaining key keyword combination set KCS (Pi) = {KC1 (Pi), KC2 (Pi), ..., KIi (Pi), KIj (Pi) ,,,, KCn (Pi) for the patent document Pi , ..., KCnCr (Pi)} is 1) stored in correspondence with the Pi, the stored KCS (Pi) is used, 2) when Pi is called, in real time from the key keyword KS (Pi) The method produced and used may be used. The 1) pre-generated storage method and the 2) real-time generation method for the frequency maintenance key keyword combination set will be the same for the patent classification and the index. That is, the patent classification combination set CCS (Pi) = {CC1 (Pi), CC2 (Pi), ..., CCi (Pi), CCj (Pi) ,,, CCn (Pi) for the patent document Pi. , ..., CCnCr (Pi)} is stored corresponding to the Pi, the stored CCS (Pi) may be used, and when Pi is called, generated and used in real time from the patent classification set CS (Pi) Could be And the index combination set ICS (Pi) = {IC1 (Pi), IC2 (Pi), ..., ICi (Pi), ICj (Pi) ,,, ICn (Pi), ..., ICnCr (Pi)} is stored corresponding to the Pi, and the stored ICS (Pi) may be used, and may be generated and used in real time from the index set IS (Pi) when Pi is called. will be.
Next, a method of fusion processing for each fusion processing population will be described in more detail. The fusion processing population refers to a set of targets for which a user of the
The generation of the fusion process population is in charge of the fusion process
Subsequently, the
The cited patent set obtaining
On the other hand, in the present invention, the designated
Next, an embodiment of the fusion information processing of the present invention will be described in more detail. For convenience of description, A and B sets are divided and generated by dividing the T into two parts for the fusion processing population T, PA as the forward cited patent set for A, and PB as the forward cited patent set for B. Let's say there is. Although there is no patent document belonging to A and B in common (may be in a very special case, but not in most cases), there may be a patent document belonging to PA and PB in common. Let's call PAB a patent document common to PA and PB. In other words, a patent document belonging to PAB naturally belongs to PA or PB.
The A, B, PA, PB, PAB is a set of patents, and may include at least one or more patent documents. (Of course, it may be an empty set, in which case it is obvious that there are no patent documents.) Let Pi be the Pith patent document it belongs to. In this case, patent documents belonging to B, PA, PB, and PAB will be Pi (B), Pi (PA), Pi (PB), and Pi (PAB), respectively.
Maintain Frequency Corresponding to Pi Patent Document Set of Key Keyword Combinations KCS (Pi) = {KC1 (Pi), KC2 (Pi), ..., KCi (Pi), KCj (Pi) ,,,, KCn (Pi), ..., KCnCr (Pi)}, Patent Classification Combination Set CCS (Pi) = {CC1 (Pi), CC2 (Pi), ..., CCi (Pi), CCj (Pi) ,,,, CCn (Pi) ), ,,,, CCnCr (Pi)}, index combination set ICS (Pi) = {IC1 (Pi), IC2 (Pi), ..., ICi (Pi), ICj (Pi) ,,,, ICn ( Pi), ,,,, ICnCr (Pi)}, a combination set as described above can be generated also for a patent document set having at least one patent document as an element.
The unit fusion element generating unit of the present invention has two methods for generating a frequency maintenance core keyword combination set, patent classification combination set, and index combination set in the patent document set unit. The first is a method of constructing a frequency-ignoring combination set, which performs a simple union operation on the key keyword combination set, the patent classification combination set, and the index combination set. For example, for all patent documents Pi and Pj constituting a patent document set, the frequency maintenance of the Pi key keyword combination set KCS (Pi) = {KC1 (Pi), KC2 (Pi), ..., KCi (Pi), KCj (Pi) ,,,, KCn (Pi), ..., KCnCr (Pi)} and maintaining the frequency of Pj Key keyword combination set KCS (Pi) = {KC1 (Pi), KC2 (Pi) , ..., KCi (Pi), KCj (Pi) ,,,,, KCn (Pi), ..., KCnCr (Pi)}. Since it is a union operation of a set unit, duplicate key keyword combinations are treated as one, even if they are duplicated several times. In this case, even if the same key keyword combinations (Ki, Kj) appear six times in ten patent documents, they are treated like one.
The second method is to construct a frequency maintenance combination set, which is a union operation for the frequency maintenance core keyword combination set, the patent classification combination set, and the index combination set for each Pi, but internally stores the frequency for each combination. For example, when a particular KCi is n times from the KC (keyword combinations) of the patent documents constituting a specific patent document set, the number of recovery n is mapped to a unique number (management ID) that specifies the KCi. . In this case, if the same key keyword combination (Ki, Kj) appears six times in ten patent documents, frequency information is maintained as (Ki, Kj): 6.
Let's say that all patent documents belonging to A are P (A) (which can be understood as abbreviations for Patent Documents of Set A) and the A's i-th patent document is Pi (A). In this case, the frequency maintaining key keyword combination set corresponding to Pi (A) KCS (Pi (A)) = {KC1 (Pi (A)), KC2 (Pi (A)), ..., KCi (Pi (A )), KCj (Pi (A)) ,,,, KCn (Pi (A)), ..., KCnCr (Pi (A))}, and patent classification combination set CCS (Pi (A)). ) = {(CC1 (Pi (A)), CC2 (Pi (A)), ..., CCi (Pi (A)), CCj (Pi (A)) ,,,, CCn (Pi (A)) , ,,,, CCnCr (Pi (A))}, and the index combination set ICS (Pi (A)) = {(IC1 (Pi (A)), IC2 (Pi (A)), .. , ICi (Pi (A)), ICj (Pi (A)) ,,,, ICn (Pi (A)) ,,,,, ICnCr (Pi (A))}. The same shall apply to Pi (B), Pi (PA), Pi (PB), and Pi (PAB), as shown in parentheses refer to a specific set of patent documents.
The
The information processing of the fusion
The default fusion processing criteria may include the following series, and a user may select various fusion processing criteria described below, and the
The first is the set of differences between the sets of divisions. The fusion
In the above, the process of the fusion
1) KCS (Pi (A))-KCS (Pi (B1)), ,, KCS (Pi (Bi))-KCS (Pi (B (i + 1))), KCS (Pi (Bi))- A set operation between sets of key keyword combination sets that maintain the frequency between sets of adjacent patents divided by adjacent or divided processing criteria, such as KCS (Pi (Bj)),,
2) CCS (Pi (A))-CCS (Pi (B1)),,, CCS (Pi (Bi))-CCS (Pi (B (i + 1))), CCS (Pi (Bi))- A set operation between sets of patent classification combinations between sets of adjacent patents divided by CCS (Pi (Bj)),, or divided by division processing criteria;
3) Maintaining the frequency of the patent set which unionized two or more divided patent sets obtained by the user's selection The key keyword combination set and / or the patent classification combination set may be a unit of operation for the difference set operation.
The second is the family of difference sets between forward cited patent sets. The fusion
In the above, the process of the fusion
1) KCS (Pi (PA))-KCS (Pi (PB1)), ,, KCS (Pi (PBi))-KCS (Pi (PB (i + 1))), KCS (Pi (PBi))- Maintain frequency between the divided patent sets which are adjacent to each other or divided by division processing criteria such as KCS (Pi (PBj)),, etc.
2) CCS (Pi (PA))-CCS (Pi (PB1)),,, CCS (Pi (PBi))-CCS (Pi (PB (i + 1))), CCS (Pi (PBi))- A set operation between a set of patent classification combinations between a set of divided patents adjacent to each other or divided by division processing criteria such as CCS (Pi (PBj)),,
3) Maintaining the frequency of the patent set which unionized two or more divided patent sets obtained by the user's selection The key keyword combination set and / or the patent classification combination set may be a unit of operation for the difference set operation.
The third is a set of difference operations that utilizes both a split set (in some cases a population) and a forward cited patent set. The fusion
In the above, the process of the fusion
1) KCS (Pi (A))-KCS (Pi (PA1)), ,, KCS (Pi (PAi))-KCS (Pi (PA (i + 1))), KCS (Pi (PAi))- Maintaining the frequency between adjacent patent sets divided by adjacent or divided processing criteria such as KCS (Pi (PAj)),, etc.
2) CCS (Pi (A))-CCS (Pi (PA1)),,, CCS (Pi (PAi))-CCS (Pi (PA (i + 1))), CCS (Pi (PAi))- A set operation between a set of patent classification combinations between a set of divided patents adjacent to each other or divided by division processing criteria such as CCS (Pi (PAj)),,
3) KCS (Pi (PA))-KCS (Pi (A1)), ,, KCS (Pi (Ai))-KCS (Pi (A (i + 1))), KCS (Pi (Ai))- Maintain frequency between the divided patent sets adjacent to each other or divided by the division processing criteria such as KCS (Pi (Aj)),, etc.
4) CCS (Pi (PA))-CCS (Pi (A1)),,, CCS (Pi (Ai))-CCS (Pi (A (i + 1))), CCS (Pi (Ai))- A set operation between a set of patent classification combinations between a set of divided patents adjacent to each other or divided by division processing criteria such as CCS (Pi (Aj)),,
5) Maintaining the frequency of the patent set which unionized two or more divided patent sets obtained by the user's selection The key keyword combination set and / or the patent classification combination set may be a unit of operation for the difference set operation.
The core keyword combination, the patent classification combination, and the index combination satisfying that the difference calculation operation generated by the fusion pattern processing unit of the present invention is newly imported into the patent document set of interest with respect to the patent document set to be compared which is one example of the predetermined fusion processing criteria May be the result of screening treatment.
Next, the information processing method of the fusion
First, the frequency maintenance difference operation between two divided sets will be described first. The invention idea of frequency maintenance difference operation is described by taking key keyword combination difference operation as an example. In this method, the frequency information n of the specific key keyword combination (Ki, Kj) in a specific patent document set (for example, A) is maintained as (Ki, Kj): n. In this case, when the (Ki, Kj) also exists in the B set, when the difference operation is specified as AB, the result of the frequency maintenance key keyword difference operation for the (Ki, Kj) is (Ki, Kj). ): (nm). In the case of the frequency ignore key keyword difference operation, (Ki, Kj) is a key keyword combination of both A and B, and thus, (Ki, Kj) is not included in the result of the difference operation. On the other hand, in the case of the frequency maintenance key keyword operation, it is determined whether (Ki, Kj) is included in the key keyword difference operation result according to the relationship between n and m. The relationship between n and m is managed by the fusion processing
Examples of the relationship between n and m include 1) when nm is greater than or equal to a predetermined numerical value, 2) when nm is greater than or equal to a predetermined numerical value, and m is less than or equal to a predetermined numerical value. 4) the function f (n, m) satisfies a predetermined condition, and n or m also meets a predetermined condition. have. Referring to the specific numerical value as an example, 1) has an advantage that is well applied when the difference between n and m is simply large, such as 100 and 3. However, in the above 1), when comparing the case where n and m are 100 and 30 and the case of 50 and 1, the difference value is larger in the former even though the latter meets the fusion treatment criteria. Many of both and B do not have a newly imported attribute.) Therefore, in this case, the method of 2) is valid. An example of the method of 2) may be a difference in frequency of 10 or more, m cannot exceed 2, and the like. On the other hand, in the case where the size of A (the number of patent documents belonging to A) is small and the value of n has a relatively small value, such as when the size of B is large, n is applied to n, m, such as square treatment. By processing the function, the frequency maintenance difference operation can be performed.
Although T has been described based on two divisions of A and B, the idea of the present invention can be similarly applied to the case where T is divided into A, B1, B2, ,,, Bn. It will be apparent to those skilled in the art based on what is described in the difference set operation at the time of construction.
On the other hand, when the set is divided into n + 1 rather than divided into two, if the frequency of the (Ki, Kj) f1, ... f (n + 1) for each divided patent document set, the f1 ~ Calculate increase / decrease, increase / decrease / change of f (n + 1). When the increase / decrease / change of the (Ki, Kj) satisfies a predetermined condition, the (Ki, Kj) may be included in the frequency maintenance key keyword difference calculation result, and the predetermined condition is the fusion. The processing
Meanwhile, the present invention can be applied to a frequency maintenance difference operation between forward cited patent sets for a key keyword combination, and a frequency maintenance difference operation using both a split set (in some cases, a collective) and a forward cited patent set. It will be apparent to those skilled in the art that the present invention can be applied to. In addition, although the frequency maintenance difference calculation method has been described with respect to key keyword combinations, it will be apparent to those skilled in the art that the present invention can be similarly applied to patent classification combinations and index combinations. In other words, the invention idea of the frequency maintenance difference set operation method described above is equally applicable to 1) n + 1 division set processing, 2) processing for forward citation patent set, and the like for patent classification combinations and index combinations. May be applied.
The result of the difference operation generated by the fusion pattern processor of the present invention is 1) a key keyword combination difference set, 2) a patent classification combination difference set, and 3) an index combination set difference set. KCSS (Keyword Combination Subtraction Set), CCSS (Classification Combination Subtraction Set), ICSS (Index Combination Subtraction Set). The core keyword combination set belonging to the above-mentioned "KCS (Pi (PA))-KCS (Pi (PB))" is referred to as KCSS (PA-PB) (KCSS of Patent Document Set A and Patent Document Set B). . The KCSS, CCSS, and ICSS may include at least one selected from a case in which a frequency disregarding method is applied and a case in which a frequency maintenance method is applied.
Subsequently, the
The
The
1) In the network analysis of the KCSS, the fusion
2) In the visualization of network analysis, the
3) If there is a hub key keyword, as an example of the network analysis visualization, 1) a key keyword network diagram associated with the Ki in the KCSS for the hub keyword Ki, and 2) the difference Based on the comparison target set (for example, B in the case of AB), the key keyword network diagram associated with the Ki may be displayed in contrast. In this case, there is an advantage in that the change / change / difference of the key keyword well associated with the key keyword Ki for each partitioned set can be shown.
4) For the key keyword combination (Ki, Kj) constituting the KCSS, (Ki, Kj) by querying a patent document including the Ki and the Kj in one patent document Pi in common; The patent document set having (Ki, Kj) as key keyword combinations can be mapped to. The correspondence may provide a list of patent documents, a bibliography, a full text, etc. of a patent document set corresponding to a search / query result when the user clicks on the (Ki, Kj). On the other hand, when the association of (Ki, Kj) is displayed on a network diagram (e.g., when the association is indicated by a line, etc.), the (Ki, Kj) is keyed around the display of the association. You can display the number of patent documents that you include as keyword combinations. In this case, when the user clicks on the numerical value, a list of related patent documents, bibliographic details, and the like may be provided.
On the other hand, when the frequency maintaining combination set configuration method is used, the fusion
On the other hand, the fusion
The fusion
1) By extracting the most frequent patent classification combination, the fusion
2) As an analysis of the most frequent patent classification combinations, the fusion
3) In the network analysis of the CCSS, the fusion
4) In the visualization of network analysis, the fusion
The visualization of the fusion pattern is performed in the fusion
First, it is a limiting function for the partition set. The above limitations include: 1) inputting a search word to the search engine, 2) input of a query utilizing a field constituting the
The second is quantity information processing. Frequency information of Ki may be displayed on each of the key keyword Ki nodes, or a frequency of (Ki, Kj) may be displayed on a line connecting Ki and Kj. When the user clicks on the frequency, information (patent document list, bibliographic information, professional information, etc.) about a patent document set having Ki and Kj as key keywords is provided to the
Third is the labeling display processing function. The labeling display process refers to processing by displaying different marks (for example, colors, patterns, lines, etc.) for each labeling object such as the applicant, inventor, time display, and the like.
Fourth, the filtering comparison processing function. The filtering comparison process refers to a process of comparing the patent documents of Samsung Electronics and LG Electronics among the divided sets or the (Ki, Kj), (Ci, Cj), and (Ii, Ij). When the filtering comparison process is combined with the labeling display process, blue for (Ki, Kj) related to Samsung Electronics, red for (Ki, Kj) related to LG Electronics, and purple for common (Ki, Kj) You will be able to compare and display. The same applies to patent classification.
Fifth, the conversion display function of the patent classification display into the index display. The patent classification corresponds to the index in a 1: 1 or 1: n correspondence. Therefore, where the patent classification is displayed, at least one index corresponding to the patent classification may be displayed according to the index display selection of the user.
Sixth, it is a conversion display function of the patent classification display to the title information display. The patent classification is in a code system, and what a particular code means is unknown unless the title information of the code is stored. Therefore, each time a patent classification appears visually, title information for that patent classification will need to be provided. The way in which the title information appears is 1) when a user request or interaction (for example, placing a pointer of a pointing device such as a mouse in a patent classification), or 2) providing a patent classification and title information together. And 3) title information is given priority. On the other hand, when there is a specific patent classification Ci, the title information is provided only when 1) only the title information of Ci is provided. Etc.) and / or title information up to the upper classification, 3) in addition to the Ci title information, a predetermined upper classification of Ci (for example, a superior patent classification) and / or a title of the patent classification. Information) and Ci's predetermined lower patent classification (for example, the subordinate patent classification and / or up to the titles of the subordinate patent classification).
Next, the fusion pattern report generator 953 of the present invention will be described. The fusion pattern report generator 953 may be configured according to a user's selection or default selection value of the
Next, the fusion pattern information
Next, the information processing method of the
Subsequently, the
Subsequently, the
FIG. 21 is an information processing method of the
Subsequently, the
The first is the question of the depth of citation or the citation stage. The citation depth (= citation step) means that the c cited patent documents have a citation depth of 1 when the self patent includes information on n parent patents. For every patent document ni, the grand parent patents included in the ni patent document have a citation depth of 2. The larger the citation depth, the larger the size of the relevant citation patent set, but the more likely it is to include a number of weakly related patents. The citation depth is processed by the fusion processing
Second is whether to include latent cited patents. A latent citation is a patent that is not cited in a self-patent document, but which consists of patent documents whose filing date is earlier than the self-patent document among the patent documents cited by a post-patent document than a self-patent document citing a patent document cited by the self-patent document. Say a set of documents. The latent cited patent includes 1) obtaining a cited patent document of a self-patent document, 2) obtaining a cited patent document based on the self-patent document based on the cited patent document, and 3) applying for the self-patent document based on the cited patent document Acquisition of cited patent documents, and 4) removal of patent documents included in 1) of patent documents obtained in 3). At this time, when obtaining the potential cited patent of the divided patent set, it is required to go through the process of 1) to 4) for each individual patent document in the divided patent set. That is, 1) to 4) is processed in units of individual patent documents, and 1) to 4) should not be processed in units of sets. The inclusion of the latent cited patent is processed by the fusion processing
Subsequently, the
An example of the preset fusion processing criteria may be a difference operation between unit fusion elements corresponding to the first citation split patent set and unit fusion elements corresponding to the second citation split patent set. Another example of the preset fusion processing criteria may be a difference operation between unit fusion elements corresponding to the i th cited split patent set and unit fusion elements corresponding to the i + 1 th cited split patent set.
Next, an information processing method of the
Subsequently, the
On the other hand, the information processing of step (J) and step (K) has been processed for the first divided patent set and the first cited divided patent set, but the i-divided patent set and the i-th cited divided patent Of course, it can be processed to the set, the i-divided patent set, the j-th cited split patent set may be processed as a matter of course.
Next, an information processing method of the
The
(M) a first citation splitting comprising one or more cited patent documents of patent documents included in the first split patent set and the second split patent set for each of the first split patent set and the second split patent set; Generate (SF) a patent set and at least one second cited split patent set, and (N) the first split patent set, the second split patent set, the first cited split patent set, and the second cited split patent set In the patent document included in the set, a predetermined unit fusion element corresponding to the patent document is generated for each of the first divided patent set, the second divided patent set, the first cited divided patent set, and the second cited divided patent set. And (O) selecting unit fusion elements that meet predetermined fusion processing criteria among the unit fusion elements. Examples of the preset convergence processing criteria may include unit fusion elements corresponding to the first divided patent set, unit fusion elements corresponding to the second divided patent set, and unit fusion elements corresponding to the first cited divided patent set. And a set operation of a preset order of two or more selected from unit fusion elements corresponding to the second cited divided patent set. The unit fusion elements corresponding to the set form a set, and the set may be a unit fusion element set, and the operation of the set unit may be processed.
The unit fusion elements that satisfy the predetermined fusion processing criteria of the
The first is to accept the unit fusion element set as a result of the difference operation.
A second unit fusion element set composed of unit fusion elements corresponding to the first divided patent set, and a second unit fusion element set composed of unit fusion elements corresponding to the at least one second divided patent set And a first cited unit fusion element set composed of unit fusion elements corresponding to the first cited divided patent set, and a second cited unit composed of unit fusion elements corresponding to the at least one second cited divided patent set. For the unit fusion elements constituting the set of fusion elements, only unit fusion elements for which a predetermined function value whose frequency is an independent variable such as frequency and increase rate of the frequency are more than a predetermined difference are selected.
The present invention can be used in various industries related to technical information, such as patent information industry, technology analysis and consulting industry, R & D support business, information analysis industry.
100: data part 1000: patent information system
110: patent data section 111: patent specification file section
112: Patent DB 113: Patent Classification DB
114: other patent data DB 114-1: Catchword DB
114-2: IndextoUSPC DB 120: non-patent data part
121: non-patent file unit 122: non-patent DB
123: company information DB 124: other non-patent data DB
130: key keyword DB 131: technology keyword DB
131-1: Technical keyword air pair DB 132: Product keyword DB
132-1: Product Keyword Air Pair DB 133: Syntax Keyword DB
133-1: Keyword Syntax Air Pair DB 133-2: Syntax Keyword Air Pair DB
133-3: Syntax by pattern DB 140: Patent classification metadata DB
150 applicant DB 160: rule data portion
170: language data unit 180: other DB
190: purpose-specific data unit 200: data processing unit
210: key keyword generator 211: keyword extractor
212: technical keyword generator 213: product keyword generator
214: syntax keyword generator 220: classification metadata generator
223: Core keyword stratification unit 224: Patent automatic classification unit
230: purpose-specific data generation unit 231: statistical analysis data generation unit
232: citation analysis data generation unit 233: discovery analysis data generation unit
300: search processing unit 3000: linkage system
400: analysis information generation unit 400: analysis information generation unit
410: analysis data acquisition unit 410: special analysis information generation unit
420: specialized target discovery unit 421: analysis index DB
421: Similar patent set discovery unit 422: Nich technology area discovery unit
423: Initial signal detection unit 424: Open innovation target detection unit
425: future technology discovery unit 430: analysis item selection unit
440: option processing unit 441: data limited option processing unit
442: display option processing unit 443: other option processing unit
450: analysis execution unit 451: analysis command syntax DB
460: analysis result reporting unit 461: table generation unit
462: chart generator 463: diagram generator
464: Report generation unit 470: Document set call unit
490: infinite analysis provider 500: evaluation information generation unit
5000: user computer 510: patent evaluation information generation unit
511: Applicant evaluation information generation unit 512: Inventor evaluation information generation unit
513: agent evaluation information generation unit 514: document set evaluation information generation unit
520: key keyword evaluation information generation unit 600: special analysis information generation unit
610: comparison analysis unit 611: comparison item selection unit
612: display comparison result selection unit 620: what if analysis unit
621: set operation unit 622: simulation unit
630: analysis of the inclusion / consultation 630: analysis of the inclusion / consultation
640: association analysis unit 641: association target selection unit
642: homogeneous association analysis unit 643: heterogeneous association analysis unit
644: association result display selection unit 650: risk / opportunity analysis unit
651: risk / opportunity pattern selection unit 652: risk / opportunity factor management unit
660: 2X2 analyzer 661: indicator selection unit
700: specialized target discovery unit 710: similar patent set discovery unit
710: similar patent set generation unit 711: similar patent set generation data generation unit
711-1: Core keyword generation unit 711-2: Upper patent classification code extraction unit
711-3: Citation / cited patent document extraction unit 711-4: Weighting unit
711-4a: key keyword weighting unit 711-4b: patent classification code weighting unit
711-4c: Citation / cited depth weighting unit 712: Similar patent set generation unit
713: document set selection unit 714: similar patent set providing unit
715: Document similarity evaluation information generation unit 716: Invalid reference detection unit
720: initial signal detector 721: initial signal pattern
722: Initial signal pattern measurement unit 723: Complex data analysis unit
724: Initial signal determination unit 724-1: Initial signal pattern reference unit
725: initial signal evaluation information generation unit 726: initial signal discovery batch processing unit
726: initial signal discovery batch processing unit 730: niche technology region discovery unit
731: document set selection unit 732: network diagram comparison unit
733: n-dimensional matrix selection unit 734: prior patent display unit
735: niche technology area evaluation information generation unit 740: open innovation target discovery unit
741: source selector 742: target attribute designator
743: source-target analysis unit 744: evaluation information generation unit for open innovation
750: future technology discovery unit 751: leading target discovery unit
752: lead target designator 753: lead target analyzer
754: future technology applied product analysis unit 755: future technology evaluation information generation unit
760: patent strategy discovery unit 800: additional service provider
810: member management unit 811: member data unit
811a:
811c: member billing DB 812: member directory generation unit
813: Member flag generator 814: Member mapping information generator
814a: member keyword
820: platform service provider 821: web service provider
821a: Web
830: community service provider 840: e-commerce service provider
841: e-commerce target DB 842: e-commerce processing unit
843: open market generation unit 850: billing processing unit
860: translation processing unit 870: comment processing unit
871: comment receiving unit 872: comment storage unit
873: identity determination unit 874: comment delivery unit
900: converged information processing unit 9000: wired and wireless network
910: convergence processing collection acquisition unit 920: convergence processing target set generation unit
921: set divider 921-1: divide processing reference provider
921-2: Division processing criteria acquisition part 921-3: Division processing criteria DB
922: citation patent set acquisition part 922-1: forward citation patent set acquisition part
923: collection set information acquisition unit 930: convergence processing reference information unit
931: Fusion processing criteria providing unit 932: Fusion processing criteria acquisition unit
933: Fusion processing criteria generation unit 934: Fusion processing criteria policy DB
940: fusion pattern processing unit 941: keyword fusion pattern processing unit
942: Patent classification fusion pattern processing unit 943: Hybrid fusion pattern processing unit
944: comparison information generation unit 945: comparison information processing unit
950: Fusion pattern analyzer 951: Fusion pattern visualization unit
952: Fusion pattern UI unit 960: Fusion pattern information batch generation unit
961: fusion pattern information batch generation policy unit 962: fusion pattern information DB
970: unit fusion element generator 971: core keyword unit fusion element generator
972: Patent classification unit fusion element generation unit 973: Hybrid fusion element generation unit
974: index unit fusion element generation unit 992-2: backward citation patent set acquisition unit
Claims (10)
(A) dividing the generated or received at least one patent set by applying at least one split processing criterion to generate a first split patent set and at least one second split patent set;
(B) a first citation splitting comprising one or more cited patent documents of patent documents included in the first split patent set and the second split patent set for each of the first split patent set and the second split patent set; Generating a patent set and at least one second cited split patent set;
(C) In the patent documents included in the first cited divided patent set and the second cited divided patent set, a predetermined unit fusion element corresponding to the patent document is set to the first cited divided patent set and the second cited divided patent. Generating for each set; And
(D) selecting a unit fusion element that satisfies a predetermined fusion processing criterion among the unit fusion elements generated for each of the first and second cited divided patent sets;
The unit fusion element is to be generated including any one or more of a patent classification, a keyword extracted from the patent document, a keyword processed the extracted keyword,
Step (C) is performed on a patent document including two or more patent classifications based on at least one or more types of patent classifications of patent documents included in the first and second cited divided patent sets. Or patent documents including two or more keywords extracted or processed from patent documents included in the first cited split patent set and the second cited split patent set. How to produce.
The unit fusion element is at least one selected from a patent classification combination consisting of two or more patent classifications, a key keyword combination consisting of two or more keywords, and an index combination corresponding to a patent classification,
Wherein the patent classification combination and the index combination are generated based on two or more patent classifications included in the patent document.
The fusion processing criterion is that the unit fusion element is present only in one predetermined patent set, or 2) the frequency of the unit fusion element for each of the divided patent sets is equal to or greater than a predetermined difference, or 3) the divided patent. The frequency of the unit fusion element for each set is equal to or greater than a preset increase rate, or 4) the frequency of the unit fusion element for each of the divided patent sets is greater than or equal to a preset increase acceleration, or 5) the unit fusion element for each of the divided patent sets A method of generating fusion information, characterized in that the frequency of establishes a predetermined function relationship or a predetermined condition relationship.
When the unit fusion element is an index combination, the method for generating the index combination may include: 1) an index using an index corresponding to the original patent classification only by the original patent classification explicitly indicated in the patent document included in each partition set. And a method of generating a combination, and 2) referring to the patent classification system to which the original patent classification belongs, with respect to the explicitly listed original patent classification, and including an index corresponding to a preset upper patent classification of the original patent classification. The method of generating convergence information, characterized in that any one method selected from among the methods for generating the index combination is used.
The divisional processing criteria are generated by any one or any combination of two or more of an issuer country, a time range, an applicant or an owner or assignee, an inventor, a patent classification, a patent subject classification, and a predetermined classification attribute included in the patent document.
The time that is the basis of the time range is to use any one or any combination of two or more of the priority date, application date, publication date and registration date of the patent document,
The patent classification is any one of IPC, USPC, FT, FI and ECLA, or any combination of two or more,
The patent subject classification is any one or more of the subject classification generated using any one or more of the index of the IPC, the index of the USPC or the IPC, USPC, FT, FI and ECLA,
The preset classification attribute is any one or more of a classification attribute for the applicant, the owner or the assignee, a classification attribute for each patent classification constituting the patent classification, a classification attribute for the inventors, or a classification attribute for the patent subject classification. Fusion information generation method, characterized in that.
When the unit fusion element is a patent classification combination, the method of generating the patent classification combination may include 1) generating the patent classification combination only by the original patent classification of the patent documents included in each of the divided sets; and 2) the original patent classification. Regarding the patent classification system to which the original patent classification belongs, with respect to any one method selected from among the method for generating the patent classification combination by including a predetermined upper patent classification of the original patent classification is used. Fusion information generation method characterized in that.
A first method for generating nCr (r is less than or equal to n and greater than 1) patent classification combinations when the original patent classification is n (n is an integer),
When there are n original patent classifications (n is an integer), with reference to patent classification system information to which the n original patent classifications belong to each of the n original patent classifications, the preset upper patent for each original patent classification M up to the classification (m is an integer, m is greater than or equal to n) generates the top patent classifications, and the n original patent classifications and the m top patent classifications are (n + m) Cr (r (( n + m) less than or equal to and greater than 1)
Inventing any one or more of the third method of generating the patent classification combination by applying a weight of a predetermined criterion to the patent classification combination generated in the first method or the second method. How to generate fusion information.
And displaying the selected unit fusion element in a preset format.
The preset format is any one of a tabular format, a chart format, a graph or a network diagram format.
When the unit fusion element is displayed, at least one of a patent classification code, title information corresponding to the patent classification code, and an index corresponding to the patent classification code is displayed, or a keyword is displayed. How to generate fusion information.
The at least one patent set generated or obtained is a cited patent set consisting of a first-generated patent set, at least one cited patent document of a patent document included in the first-generated patent set, and a patent document included in the first-generated patent set. A patent made up of a cited patent set consisting of one or more of the cited patent documents of the patent document included in any one or more patent sets of the family patent sets in at least one country of the patent documents included in the first-generated patent set. Fusion information generation method characterized in that the set.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| KR1020100023932A KR20110104816A (en) | 2010-03-17 | 2010-03-17 | Method on producing information on fusion information of technology using patent data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| KR1020100023932A KR20110104816A (en) | 2010-03-17 | 2010-03-17 | Method on producing information on fusion information of technology using patent data |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| KR20110104816A true KR20110104816A (en) | 2011-09-23 |
Family
ID=44955425
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| KR1020100023932A KR20110104816A (en) | 2010-03-17 | 2010-03-17 | Method on producing information on fusion information of technology using patent data |
Country Status (1)
| Country | Link |
|---|---|
| KR (1) | KR20110104816A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2014061864A1 (en) * | 2012-10-15 | 2014-04-24 | ㈜광개토연구소 | Method and system for providing analysis information for patent having technological convergence |
-
2010
- 2010-03-17 KR KR1020100023932A patent/KR20110104816A/en not_active Application Discontinuation
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2014061864A1 (en) * | 2012-10-15 | 2014-04-24 | ㈜광개토연구소 | Method and system for providing analysis information for patent having technological convergence |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Nentwig et al. | A survey of current link discovery frameworks | |
| CN101595476B (en) | System, method and computer program for client definition information architecture | |
| JP2024027087A (en) | Standard medical term management system and method based on general model | |
| Zaki et al. | BioCarian: search engine for exploratory searches in heterogeneous biological databases | |
| Senger | Assessment of the significance of patent-derived information for the early identification of compound–target interaction hypotheses | |
| KR101610938B1 (en) | Method and System on Producing Information on Unoccupied Fusion Candidate Information Using Patent Data | |
| KR20120033934A (en) | Method and system on processing information on patent litigation through multi-dimensional patent litigation expectation model | |
| KR20110104816A (en) | Method on producing information on fusion information of technology using patent data | |
| KR20110104815A (en) | Method and system on producing information on fusion information using patent data | |
| KR20110104813A (en) | Method and system on producing information on fusion information using patent data | |
| Hidders et al. | A formal model of dataflow repositories | |
| LaFond et al. | Furthering a comprehensive SETI bibliography | |
| KR20110104814A (en) | Method producing information on technology fusion information of citation information using divided patent set data | |
| Herr et al. | The NIH visual browser: An interactive visualization of biomedical research | |
| Catalá-López et al. | A cross-sectional analysis identified co-authorship networks and scientific collaboration on reporting guidelines for health research | |
| Locatelli et al. | Exploring BIM and NLP applications: A scientometric approach | |
| KR101199827B1 (en) | System, Media, Program and Method on Making Patent Litigation Prediction Model | |
| KR20200028711A (en) | System of discovering technology seller candidates based on patent information and providing reason why the seller candidates are likely to have good technology to buy | |
| KR20200028713A (en) | System of discovering technology buyer candidates based on patent information and providing reason why the buyer candidates are likely to buy | |
| KR101255181B1 (en) | System, Media and Method on Making Patent Litigation Prediction Model | |
| KR101271115B1 (en) | System, Media, Program and Method on Generating Patent Risk Hedging Prediction Information | |
| Oliveira et al. | Towards a Data Catalog for Data Analytics | |
| Miñarro-Giménez et al. | A semantic query interface for the OGO platform | |
| AU2012244384B2 (en) | System, method, and computer program for a consumer defined information architecture | |
| Cruz et al. | Agreement Maker: a Visual Tool for Aligning Heterogeneous Ontologies |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| WITN | Withdrawal due to no request for examination |