KR20180017396A - Method of finding patent for technology transfer among related patents - Google Patents

Method of finding patent for technology transfer among related patents Download PDF

Info

Publication number
KR20180017396A
KR20180017396A KR1020160101159A KR20160101159A KR20180017396A KR 20180017396 A KR20180017396 A KR 20180017396A KR 1020160101159 A KR1020160101159 A KR 1020160101159A KR 20160101159 A KR20160101159 A KR 20160101159A KR 20180017396 A KR20180017396 A KR 20180017396A
Authority
KR
South Korea
Prior art keywords
score
weight
classification
upc
ipc
Prior art date
Application number
KR1020160101159A
Other languages
Korean (ko)
Inventor
이문규
김동철
Original Assignee
서강대학교산학협력단
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 서강대학교산학협력단 filed Critical 서강대학교산학협력단
Priority to KR1020160101159A priority Critical patent/KR20180017396A/en
Publication of KR20180017396A publication Critical patent/KR20180017396A/en

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24Querying
    • G06F16/245Query processing
    • G06F16/2457Query processing with adaptation to user needs
    • G06F16/24578Query processing with adaptation to user needs using ranking
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/30Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
    • G06F16/38Retrieval characterised by using metadata, e.g. metadata not derived from the content or metadata generated manually
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90Details of database functions independent of the retrieved data types
    • G06F16/93Document management systems
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2216/00Indexing scheme relating to additional aspects of information retrieval not explicitly covered by G06F16/00 and subgroups
    • G06F2216/11Patent retrieval

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Data Mining & Analysis (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Library & Information Science (AREA)
  • Computational Linguistics (AREA)
  • Business, Economics & Management (AREA)
  • General Business, Economics & Management (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The present invention relates to a method of retrieving a technology transfer target patent in a related patent, comprising: a first step of preparing a patent database; A second step of receiving a specific patent; A third step of searching for a related patent related to the specific patent using the related patent model; And a fourth step of determining whether the expiration date of the survival period or the date of payment of the annual fee exists within the specified period from the current date, and providing the patent as the technology transfer patent candidate among the related patents.

Description

METHOD OF FINDING PATENT FOR TECHNOLOGY TRANSFER AMONG RELATED PATENTS [0002]

The present invention relates to a patent search method to be transferred to a related patent, and more specifically, to a company that desires to search for a patent to be transferred to a related patent, in particular, , The patent related patents that are ahead of the duration of the related patents or have already paid the annual fee have been provided as technology transfer patent candidates to obtain the relevant patents more quickly and at a lower cost To a patent search method subject to transfer of technology in related patents.

It is essential that SMEs receive various certifications for bidding or trading of government, municipalities or public institutions, or as qualification requirements for delivery to private companies. At this time, what is absolutely necessary is intellectual property rights such as patents in the field of business.

In such a situation, it is very time-consuming for SMEs to find patent ideas in the business field, and to obtain patent registration by privatizing ideas that have been discovered through consultation with patent attorneys. It is not realistic to acquire rights through application of ideas for SMEs that require qualification to make transactions, or for the delivery to private companies.

In this case, it was common for SMEs to find related patents as technology patents through acquaintances. Even if the related patents are sought, the position of SMEs that need urgent patents will provide a bad environment for negotiating conditions such as technology transfer amount.

Korean Patent No. 1327514 (Nov. 31, 2013), title of the invention: patent network analysis system using semantic patent similarity and patent network analysis method using the same

The present invention has been made in order to solve the above-mentioned problems. The present invention has been made in view of the fact that a patent is required to be obtained by an enterprise, For those companies that can not afford it, it is possible to acquire related patents more quickly and at a lower cost by providing related patents prior to the expiration of the related patents or having already paid the relevant annual fees for technology transfer. , And to provide a patent search method to be transferred to a technology transfer in the related patent.

According to another aspect of the present invention, there is provided a method of searching for a technology transfer target patent, comprising the steps of: preparing a patent database; A second step of receiving a specific patent; A third step of searching for a related patent related to the specific patent using the related patent model; And a fourth step of determining whether the expiration date of the survival period or the date of payment of the annual fee exists within the specified period from the current date, and providing the patent as the technology transfer patent candidate among the related patents.

Also, in the fourth step, in the step of providing, as the technology transfer patent candidate, the related patent that the duration is to expire within 6 months from the current date or the annual fee has not been paid within 6 months from the present date .

The patent database is a database including at least one of a registered patent, a patent application, a patent application, a registered utility model, a public utility model, a utility model registration application, a registered design, a public design, and a design registration application.

The related patent model may also include a backward section score that indicates the number of common backward sections between any of the specific patents and the patent database; A forward site score that indicates the number of common forward sites between the particular patent and the arbitrary patent; A time score indicating temporal proximity between the specific patent and the arbitrary patent; A CPC main classification score indicating whether the CPC main classification between the specific patent and the arbitrary patent is common; An IPC main classification score indicating whether the IPC main classification between the specific patent and the arbitrary patent is common; A UPC main classification score indicating whether the UPC main classifications between the specific patent and the arbitrary patent are common; A CPC classification score indicating the number of common CPC classifications between the particular patent and the arbitrary patent; An IPC classification score indicating the number of common IPC classifications between the specific patent and the arbitrary patent; A UPC classification score indicating the number of common UPC classifications between the specific patent and the arbitrary patent; A keyword score comparing a core technology keyword extracted through text mining with respect to each of the specific patent and the arbitrary patent and indicating the number of common core technology keywords between the specific patent and the arbitrary patent; The related patents are searched based on at least one of them.

Further, in the third step, the relevant patent score indicating the scale of the related patent is calculated by the following equation, and the related patent is searched.

[Mathematical Expression]

Related score = (backward site score) x (backward site weight) + (forward site score) x (forward site weight) + (time score) x (time weight) + (CPC main classification score) (CPC main classification weight) + (IPC main classification score) × (IPC main classification weight) + (UPC main classification score) × (UPC main classification weight) Classification score) × (IPC classification weight) + (UPC classification score) × (UPC classification weight) + (keyword score) × (keyword weight)

Further, in the third step, the relevant patent score indicating the scale of the related patent is calculated by the following equation, and the related patent is searched.

[Mathematical Expression]

Related score = (backward site score) x (backward site weight) + (forward site score) x (forward site weight) + (time score) x (time weight) + (CPC main classification score) (CPC main classification weight) + (IPC main classification score) × (IPC main classification weight) + (UPC main classification score) × (UPC main classification weight) Classification score) × (IPC classification weight) + (UPC classification score) × (UPC classification weight) + (keyword score) × (keyword weight) + (value chain score) × (value chain weight)

Here, the value chain score is a score given when the applicant or the holder of the specific patent exists on the value chain.

According to the technology transfer patent search method in the related patent according to the present invention,

First, it is useful for companies that want to search for patents related to technology transfer in related patents, especially companies that require patent achievements such as venture company certification but do not have enough time to secure them through application and registration procedures.

Second, through the relevant patent model, it is possible to search for and provide a patent having a high degree of relevance in the case of entering a patent that is believed to be related to a business field in which a small business enterprise operates.

Third, the relevant patents related to the business field of SMEs are also likely to be expired, or the related patents that have already been paid for the annual fee will be provided as technology transfer patent candidates. In negotiating technology transfer negotiations with patents, Thereby making it possible to secure the relevant patents more quickly and at a lower cost.

1 is a flowchart of a technology transfer target patent search method in a related patent according to a preferred embodiment of the present invention;
FIG. 2 is a conceptual diagram illustrating a related patent search according to a preferred embodiment of the present invention. FIG.
FIG. 3 is a view showing another example of a conceptual diagram for a related patent search according to a preferred embodiment of the present invention.

Hereinafter, preferred embodiments of the present invention will be described in detail with reference to the accompanying drawings. Prior to this, terms and words used in the present specification and claims should not be construed as limited to ordinary or dictionary terms, and the inventor should appropriately interpret the concepts of the terms appropriately The present invention should be construed in accordance with the meaning and concept consistent with the technical idea of the present invention.

Therefore, the embodiments described in this specification and the configurations shown in the drawings are merely the most preferred embodiments of the present invention and do not represent all the technical ideas of the present invention. Therefore, It is to be understood that equivalents and modifications are possible.

FIG. 1 is a flowchart of a patent search method according to a preferred embodiment of the present invention, FIG. 2 is a diagram showing an example of a concept for patent search according to a preferred embodiment of the present invention, FIG. 5 is a diagram showing another example of a conceptual diagram for a related patent search according to a preferred embodiment of the present invention. FIG.

Referring to the drawings, a method for retrieving a technology transfer target patent in a related patent according to the present invention includes a first step (S100) of preparing a patent database; A second step (S200) of receiving a specific patent; A third step (S300) of searching for a related patent related to the specific patent using the related patent model; And a fourth step (S400) of determining whether the expiration date of the survival period exists within a specific period from the current date, and providing the patent as a technology transfer patent candidate among the related patents.

Here, the patent database is collectively referred to as a patent database, and includes not only registered patent, open patent, patent application but also registered patent application, public utility model, utility model registration application, registered design, public design, And a database containing at least one of these.

The patent, etc. stored in the patent database includes the country code, the application number, the filing date, the name of the invention, the summary, the claim of claim, the number of claims, the publication number, the publication date, the announcement number, Main classification, CPC all classification, IPC all classification, US patent classification, US All patent classification, European main patent classification, European all patent classification, F-term, FI (file index), applicant, applicant nationality, The invention includes at least one of inventor, inventor nationality, priority country, priority number, priority claim date, family patent information, backward citation information, and forward citation information.

Further, the patent database provides an information service to a user computer through a wired / wireless network (not shown). The patent database may be stored in a distributed or centralized manner in each patent office or a system of a raw data provider or a system of an enterprise information provider providing patent raw data, but it is not limited thereto and can be variously implemented. It may be a patent database which is constructed by using the data received through the query to the relevant patent office search engine.

Also, the specific patent received in the second step (S200) is at least one of a registered patent, a registered utility model, a patent application, a utility model registration application, a registered design, or a design registration application related to a business field of a small- , And information for specifying a specific patent including at least one of a patent number, a public number, and a registration number of a specific patent.

The related patent model for searching related patents includes a backward citation score that indicates the number of common backward citations between any of the patents and patent databases, A forward citation score indicative of the number of common forward citations between any patent and any patent and a time score indicating the temporal proximity between a particular patent and any patent, A CPC main classification score indicating whether the CPC main classification between arbitrary patents is common and an IPC main classification score indicating whether the IPC main classification between a specific patent and any patent are common, , A UPC message indicating whether the UPC main classifications between specific patents and arbitrary patents are common A CPC classification score indicating the number of common CPC classifications between a specific patent and any patent and an IPC classification score indicating the number of common IPC classifications between a specific patent and any patent, A classification score (IPC classification score), a UPC classification score indicating the number of common UPC classifications between the specific patent and the arbitrary patent, and text mining for each of the specific patent and the arbitrary patent The related patent can be searched based on at least one of the keyword scores extracted by comparing the extracted core skill keywords and the keyword score indicating the number of common core skill keywords between the specific patent and the arbitrary patent.

Here, the backward site refers to a case where a specific patent is described as a prior art, or the applicant himself or herself submits through an information disclosure statement at the examination stage of a specific patent, is quoted at a stage of examination of a family patent, Means patent documents or non-patent documents cited by the examiner at the examination stage of the patent.

In addition, the forward site is a patent application in which a specific patent is cited in a later patent application, that is, when a later patent application is filed, the applicant may submit the patent as described in the prior art, or the applicant himself / It will be a direct site or, if quoted by an examiner at the screening stage, be a forward site.

In addition, patent applications of the same field that exist within the nearest time in the trend of patent application or technological development are likely to include similar technical content, so this assumes that these factors are one factor. Or, it is a significant factor in extracting patents that are close in time that are not extracted by the forward site or backward site because of the patent disclosure system, for example 1.6 to 2 years.

In addition, the more similar the technical classification such as CPC, UPC (USPC), IPC, etc., and the more common technical classification, the more likely it is the related patent. The CPC, UPC, IPC, and IPC, respectively, were obtained and the values were obtained by using the number of common classifications. However, the number of common technical categories for all the various technical categories such as CPC, UPC, IPC, FI, F- It is also possible to calculate the related patent scores using

The keyword score is a value indicating the number of common core technology keywords between a specific patent and any patent by comparing the core technology keywords extracted through text mining for each specific patent and any patent. It is also possible to determine in advance the number of key technology keywords extracted through text mining in advance.

Further, in the third step, the relevant patent score indicating the scale of the related patent can be calculated by the following expression (1), and the relevant patent can be searched.

[Equation 1]

Related score = (backward site score) x (backward site weight) + (forward site score) x (forward site weight) + (time score) x (time weight) + (CPC main classification score) (CPC main classification weight) + (IPC main classification score) × (IPC main classification weight) + (UPC main classification score) × (UPC main classification weight) Classification score) × (IPC classification weight) + (UPC classification score) × (UPC classification weight) + (keyword score) × (keyword weight)

Further, in the third step, the relevant patent score indicating the scale of the related patent can be calculated by the following expression (2), and the related patent can be searched.

&Quot; (2) "

Related score = (backward site score) x (backward site weight) + (forward site score) x (forward site weight) + (time score) x (time weight) + (CPC main classification score) (CPC main classification weight) + (IPC main classification score) × (IPC main classification weight) + (UPC main classification score) × (UPC main classification weight) Classification score) × (IPC classification weight) + (UPC classification score) × (UPC classification weight) + (keyword score) × (keyword weight) + (value chain score) × (value chain weight)

Here, the value chain score is a score given when the applicant or the holder of the specific patent exists on the value chain, that is, in the case of a business in a forward industry or a rear industry.

The weight, or weight, can be obtained by extracting patents that are actually searched and examined in the output related patents and can be adjusted through continuous learning, machine learning, and deep running.

Of the related patents thus extracted, in the fourth stage, related patents that are due to expire within six months from the current date, or which have not yet been paid in an annual fee within six months from the present date, are transferred as technology transfer candidates The method comprising the steps of:

Of course, it is possible that the duration will expire within three months from the current date, but it is also possible to extract a patent that is due to expire within one year.

However, pursuant to Article 81 of the Patent Act, it is possible to pay the annual fee within six months (additional payment period) after the end of the payment period, so that the related patent that has already been paid within six months from the present date Most preferred.

In this way, related patents with high relevance to the business field of SMEs are provided with the related patents that are ahead of the expiration date or have already paid the annual fee, as technology transfer patent candidates, Thereby providing a favorable environment in terms of conditions, making it possible to acquire related patents more quickly and at a lower cost.

While the present invention has been particularly shown and described with reference to exemplary embodiments thereof, it is to be understood that the invention is not limited to the disclosed exemplary embodiments. It is to be understood that various modifications and changes may be made without departing from the scope of the appended claims.

Claims (6)

A method for retrieving a technology transfer target patent from a related patent,
A first step of preparing a patent database;
A second step of receiving a specific patent;
A third step of searching for a related patent related to the specific patent using the related patent model; And
Determining whether the expiration date of the survival period or the date of payment of the annual fee exists within a specified period from the current date, and providing the patent as a technology transfer patent candidate;
A patent search method for technology transfer in related patents.
The method according to claim 1,
In the fourth step,
Including the step of providing a related patent that has not expired the annual fee within six months from the present date as a technology transfer candidate,
A patent search method for technology transfer in related patents.
3. The method of claim 2,
The patent database includes at least one of a registered patent, a patent, a patent application, a registered utility model, a public utility model, a utility model registration application, a registered design, a public design,
A patent search method for technology transfer in related patents.
3. The method of claim 2,
In the related patent model,
A backward region score that indicates the number of common backward regions between any of the particular patent and the patent database;
A forward site score that indicates the number of common forward sites between the particular patent and the arbitrary patent;
A time score indicating temporal proximity between the specific patent and the arbitrary patent;
A CPC main classification score indicating whether the CPC main classification between the specific patent and the arbitrary patent is common;
An IPC main classification score indicating whether the IPC main classification between the specific patent and the arbitrary patent is common;
A UPC main classification score indicating whether the UPC main classifications between the specific patent and the arbitrary patent are common;
A CPC classification score indicating the number of common CPC classifications between the particular patent and the arbitrary patent;
An IPC classification score indicating the number of common IPC classifications between the specific patent and the arbitrary patent;
A UPC classification score indicating the number of common UPC classifications between the specific patent and the arbitrary patent; And
A keyword score comparing a core technology keyword extracted through text mining with respect to each of the specific patent and the arbitrary patent and indicating the number of common core technology keywords between the specific patent and the arbitrary patent; Based on at least one of < RTI ID = 0.0 >
A patent search method for technology transfer in related patents.
5. The method of claim 4,
In the third step, the related patent score indicating the scale of the related patent is calculated by the following equation,
A patent search method for technology transfer in related patents.
[Mathematical Expression]
Related score = (backward site score) x (backward site weight) + (forward site score) x (forward site weight) + (time score) x (time weight) + (CPC main classification score) (CPC main classification weight) + (IPC main classification score) × (IPC main classification weight) + (UPC main classification score) × (UPC main classification weight) Classification score) × (IPC classification weight) + (UPC classification score) × (UPC classification weight) + (keyword score) × (keyword weight)
5. The method of claim 4,
In the third step, the related patent score indicating the scale of the related patent is calculated by the following equation,
A patent search method for technology transfer in related patents.
[Mathematical Expression]
Related score = (backward site score) x (backward site weight) + (forward site score) x (forward site weight) + (time score) x (time weight) + (CPC main classification score) (CPC main classification weight) + (IPC main classification score) × (IPC main classification weight) + (UPC main classification score) × (UPC main classification weight) Classification score) × (IPC classification weight) + (UPC classification score) × (UPC classification weight) + (keyword score) × (keyword weight) + (value chain score) × (value chain weight)
Here, the value chain score is a score given when the applicant or the holder of the specific patent exists on the value chain.

KR1020160101159A 2016-08-09 2016-08-09 Method of finding patent for technology transfer among related patents KR20180017396A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
KR1020160101159A KR20180017396A (en) 2016-08-09 2016-08-09 Method of finding patent for technology transfer among related patents

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
KR1020160101159A KR20180017396A (en) 2016-08-09 2016-08-09 Method of finding patent for technology transfer among related patents

Publications (1)

Publication Number Publication Date
KR20180017396A true KR20180017396A (en) 2018-02-21

Family

ID=61525244

Family Applications (1)

Application Number Title Priority Date Filing Date
KR1020160101159A KR20180017396A (en) 2016-08-09 2016-08-09 Method of finding patent for technology transfer among related patents

Country Status (1)

Country Link
KR (1) KR20180017396A (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20210002968A (en) * 2019-07-01 2021-01-11 청주대학교 산학협력단 System and method for generating prediction of technology transfer base on machine learning
JP6998093B1 (en) * 2021-03-18 2022-01-18 地方独立行政法人大阪産業技術研究所 Patent utilization support device, patent utilization support method and program

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20210002968A (en) * 2019-07-01 2021-01-11 청주대학교 산학협력단 System and method for generating prediction of technology transfer base on machine learning
JP6998093B1 (en) * 2021-03-18 2022-01-18 地方独立行政法人大阪産業技術研究所 Patent utilization support device, patent utilization support method and program

Similar Documents

Publication Publication Date Title
US7933843B1 (en) Media-based computational influencer network analysis
Sula et al. Citations, contexts, and humanistic discourse: Toward automatic extraction and classification
CN111260223A (en) Intelligent identification and early warning method, system, medium and equipment for trial and judgment risk
CN104899268A (en) Distributed enterprise information vertical searching method
CN107958014B (en) Search engine
Boella et al. Eunomos, a legal document and knowledge management system to build legal services
Peng et al. News citation recommendation with implicit and explicit semantics
Uchitpe et al. Predicting the future of project management research
Thelwall et al. Online presentations as a source of scientific impact? An analysis of PowerPoint files citing academic journals
Haddaway et al. Systematic reviews: A glossary for public health
KR20070056017A (en) Trademark system
Amicarelli et al. Introducing the PeaceKeeping Operations Corpus (PKOC)
KR20180017396A (en) Method of finding patent for technology transfer among related patents
Dallmeier-Tiessen et al. Open access publishing-models and attributes
Domnina A megajournal as a new type of scientific publication
Hugar Impact of open access journals in DOAJ: An analysis
CN112100216A (en) Creative keyword processing method and device
Taylor et al. Towards a machine understanding of Malawi legal text
Mabile et al. Towards new tools for bioresource use and sharing
Basson An investigation of open access citation advantage through multiple measures and across subject areas for articles published from 2005 to 2014
CN111858938B (en) Method and device for extracting referee document tag
KR20170070681A (en) Method of searching for related patent
RU132587U1 (en) INTELLIGENT QUALITY ASSESSMENT SYSTEM FOR SCIENTIFIC AND TECHNICAL DOCUMENTS
Gurunath et al. Essentials of Abstracting and Indexing for Research Paper Writing
Zuccon et al. Retrieval of health advice on the web: AEHRC at ShARe/CLEF eHealth evaluation lab task 3