WO2022208998A1 - Procédé de création d'une vue à vol d'oiseau en utilisant des informations de propriété intellectuelle - Google Patents

Procédé de création d'une vue à vol d'oiseau en utilisant des informations de propriété intellectuelle Download PDF

Info

Publication number
WO2022208998A1
WO2022208998A1 PCT/JP2021/043529 JP2021043529W WO2022208998A1 WO 2022208998 A1 WO2022208998 A1 WO 2022208998A1 JP 2021043529 W JP2021043529 W JP 2021043529W WO 2022208998 A1 WO2022208998 A1 WO 2022208998A1
Authority
WO
WIPO (PCT)
Prior art keywords
information
node
patent classification
classification information
eye view
Prior art date
Application number
PCT/JP2021/043529
Other languages
English (en)
Japanese (ja)
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 本田技研工業株式会社
Publication of WO2022208998A1 publication Critical patent/WO2022208998A1/fr

Links

Images

Classifications

    • 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
    • G06Q30/00—Commerce
    • G06Q30/02—Marketing; Price estimation or determination; Fundraising
    • 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

Definitions

  • the present invention uses information related to intellectual property such as patents to overview the distribution and mutual relationships of companies (e.g., applicants and rights holders of intellectual property) and technologies (e.g., IPC, FI, etc.) It relates to a method for creating a bird's-eye view that can be In particular, the present invention relates to a method of creating a bird's-eye view suitable for gaining unprecedented awareness of the distribution and relationships of companies and technologies.
  • the IP landscape has attracted attention as a method for formulating management strategies.
  • the IP landscape is defined as "the company's own market, including competitors, market research and development, management strategy trends, and technical information such as individual patents. It shows the bird's eye view of the current situation and future prospects for the position.”
  • IP landscape is a method that has been used by advanced companies for a long time, but the recent development of IoT technology, big data technology, AI technology, robotics technology, etc. has lowered the threshold between technologies in different fields and industries.
  • the company's adjacent industries have increased and become more complex, and data processing has become faster and more sophisticated, making it possible to adopt unprecedented analysis methods.
  • Patent 6794584 publication Japanese Patent Application Laid-Open No. 2019-152939 Japanese Patent No. 6370434
  • Patent Document 1 describes a method for illustrating a patent strategy chart, which reflects the product information related to the embodiment and the claims and the embodiment, and the inclusion relationship and / or relationship of the embodiment to the claims. Disclosed is a graphical representation of a patent strategy chart showing the nature of the patent strategy.
  • Patent Document 2 analysis target data such as applicants, patent classifications, keywords, etc., who have increased applications according to the development scale, are displayed without omission regardless of the development scale to facilitate visual discovery.
  • a patent mapping display device capable of
  • Patent Document 3 uses a corporate group/business attribute co-occurrence matrix to determine the similarity between companies by cosine similarity, etc., and to determine the distribution of companies and their mutual relationships.
  • a bird's-eye view system is disclosed.
  • Patent Document 1 and Patent Document 2 a bird's-eye view that can overlook the distribution and mutual relationships of companies (e.g., intellectual property applicants and rights holders) and technologies (e.g., IPC, FI, etc.) is disclosed. It has not been. Further, Patent Document 3 does not disclose any bird's-eye view of companies and technologies using intellectual property information such as patents.
  • companies e.g., intellectual property applicants and rights holders
  • technologies e.g., IPC, FI, etc.
  • patent maps which are simply organized patent information. These patent maps are convenient for grasping the current patent application and holding status for each company and technology, but they are not sufficient as an analysis method for formulating future management strategies. was an issue.
  • the present invention is a method for creating a technology bird's-eye view, and a specific patent (pending patent, patent expired before registration after filing, patent in existence, patent expired after registration, It includes any one or more of utility model registration during application, utility model registration extinguished before registration after filing, utility model registration in existence, and utility model registration extinguished after registration.Not limited to rights in Japan.The same shall apply hereinafter.) associated with the patent classification information given to the specific patent right holder (including one or more of the applicant, the current right holder, and the past right holder; the same shall apply hereinafter).
  • a technology distribution information acquisition step to be acquired an association step for associating rights holders based on either a value indicating the degree of commonality or a value indicating the degree of similarity of the technology distribution information of each right holder, and connecting each right holder to a node
  • the clustering step divides each node into groups that are estimated to have a relatively high degree of association from the state of the connection of each node by the edge, and the nodes, edges, and clustering results are and a display step for displaying in a graph format. etc.
  • this bird's-eye view created by the present invention is drawn using publicly systematized and maintained patent classification information, etc., it is an accurate and objective company can show the distribution and relationships between them (although you can use your own taxonomy if you prefer).
  • this bird's-eye view covers a large number of companies, and in order to associate each company based on the technology distribution or the characteristics of the technology distribution possessed by each company, it is possible to comprehensively and comprehensively view the technological relationships between many companies. can be grasped.
  • the company distribution is created in a graph format with each company as a node and the relationship between companies as an edge.
  • Embodiment 1 is the most basic embodiment and relates to all claims, but corresponds to Claim 1 in particular.
  • Embodiment 2 mainly corresponds to claim 2 .
  • Embodiment 3 mainly corresponds to claim 3 and claim 4 .
  • Embodiment 4 mainly corresponds to claim 5 .
  • Embodiment 5 mainly corresponds to claim 6 .
  • Embodiment 6 mainly corresponds to claim 7 .
  • Embodiment 7 mainly corresponds to claim 8 .
  • Embodiment 8 mainly corresponds to claim 9 .
  • the present invention is by no means limited to these embodiments, and can be embodied in various forms without departing from the scope of the invention. ⁇ Embodiment 1>
  • Embodiment 1 the most basic embodiment of the present invention will be described.
  • the outline of the steps of this embodiment is as shown in FIG. Each step will be described below.
  • the "data set recording step” records a data set that associates the patent classification information assigned to a specific patent with the right holder of that specific patent in the data set holding unit.
  • Specific patent means a pending patent, a patent extinguished before registration after filing, a patent in existence, a patent extinguished after registration, utility model registration during application, utility model registration extinguished before registration after filing, utility model registration in existence, after registration Any one or more of the lapsed utility model registrations. Therefore, for example, pending patents and patents in existence, which are rights that are currently in existence, may be targeted, or patents in existence, which are rights that have been registered, and patents that have expired after registration, may be targeted. Of course, it is also possible to include patents that have expired after filing and before being registered as an indication of trends in technological development. These points are the same for utility model registration. Of course, other combinations can be freely adopted depending on the purpose.
  • Patent classification information typically includes IPC, FI, F-term, USPC (United States Patent Classification), ECLA (European Patent Classification), CPC (Common Patent Classification), etc.
  • IPC International Patent Classification
  • FI Full States Patent Classification
  • F-term Full States Patent Classification
  • USPC United States Patent Classification
  • ECLA European Patent Classification
  • CPC Common Patent Classification
  • the above patent classification information is not necessarily limited to information using the classification code or the like as it is.
  • a code separated by the first digit of the IPC (section) or the first three digits of the IPC (class) may be used.
  • the delimitation criteria are not limited to the number of digits in classification definition such as section, class, and subclass.
  • codes of the same hierarchy based on the hierarchical concept defined in IPC may be used.
  • the first three digits of the IPC may be used for one technical field, and the first four digits of the IPC may be used for another technical field.
  • the patent classification information does not need to maintain the appearance of the original code.
  • the IPC may be converted to a form of keys such as numbers.
  • the same is true when the information related to the original patent classification remains while maintaining its characteristics, such as when IPC is used as a dimension and dimensionality is compressed.
  • Light holder includes any one or more of the above specific patent applicant, current right holder, and past right holder. Therefore, for example, the applicant may be targeted for pending patents, and the current right holder may be targeted for pending patents. Also, if necessary, past right holders may be targeted.
  • the rights holders mentioned above are not limited to the names listed in the bulletins and original records.
  • it may be the right holder of the name identification destination whose name is identified in the official gazette or original register.
  • the name of the subsidiary may be changed to the name of the parent company, or the name of the corporate group to which the company belongs may be changed.
  • the patents may be counted as patents of respective right holders, or all the joint owners may be registered under one name.
  • the right holder here broadly refers to the formal/substantial right holder of the patent.
  • the right holder information may of course be a right holder code or a company code (EDI code, etc.) of a company whose names have been collated, instead of the name of the right holder.
  • a "data set that associates patent classification information assigned to a specific patent with the right holder of the specific patent” is, for example, the X column is the right holder information and the Y column is the patent classification information.
  • the CSV format the TSV format, the Excel format, the relational database format, and the XML format may also be used. Any format is acceptable as long as the patent classification information is associated with the specific patent right holder.
  • FIG. 20 shows part of the contents of an Excel file (the patent number and right holder name are converted to dummies).
  • FIG. 21 shows part of the contents of an Excel-format file that aggregates patents for each right holder and each IPC (right holder names are converted to dummies).
  • this step it is possible to read a file that is compiled in advance for each right holder and each IPC.
  • the patent classification information data and the right holder information data may be held separately, and a data file for linking may be held to read a plurality of files in which the two are associated.
  • the actual data format is merely a matter of design by those skilled in the art.
  • a “data set storage unit” is a device or recording medium that records a data set.
  • This data set holding unit is typically an electric/magnetic recording medium such as a memory or HD, but is not limited to this. It should be noted that recording the data set here does not have to be long-term recording, and may be recording for temporary calculation for later steps.
  • the "technology distribution information acquisition step” acquires technology distribution information indicating the distribution of technologies owned by the right holder based on the patent classification information associated with the right holder in the data set.
  • technology distribution information is technology distribution information with noise removed by limiting aggregated information on patent classifications attached to patents for each right holder to patent classifications with a certain number of appearance ratios and number of applications.
  • numerical values may be standardized using the appearance ratio, the average value of the number of appearances, or the standard deviation.
  • N by multiplying the appearance ratio and the number of appearances by N, for example, those with a high appearance ratio and number of appearances may be emphasized.
  • Those skilled in the art may optionally apply such standardization or weighting of statistical features. For example, in FIG. 22, the technology distribution information is narrowed down to only patent classification information that appears 400 times or more.
  • the "associating step” associates the right holders based on either the value indicating the degree of commonality or the value indicating the degree of similarity of the technology distribution information between the respective right holders.
  • the "value indicating the degree of commonality of technology distribution information" is, for example, in the case of the degree of commonality between Company A and Company B, the number and ratio of patent classification information common to the technology distributions of Company A and Company B can be mentioned. . Specifically, as the simplest method, if two IPCs are common in the technology distribution of company A and company B, the value indicating the degree of commonality between AB is set to 2. At this time, it is of course possible to use technology distribution information that has been emphasized and standardized.
  • the value indicating this degree of commonality will be used as an edge weight in a later step, but if you want to perform calculations without weights, set 1 if the degree of commonality is above a certain level, and 0 if it is less than a certain level. good too.
  • the "value indicating the similarity of technology distribution information" is, for example, a cosine similarity, a similarity by set operation, a value based on the deviation of a probability distribution, and the like. The details of how these similarities are calculated will be described in another embodiment.
  • FIG. 23 is an example of this.
  • 13 is described in the intersecting element of company A (row) and company B (column), and this 13 is the degree of commonality between company A and company B.
  • each right holder is treated as a node, and the association between each right holder is treated as an edge, and each node is divided into groups that are estimated to have a relatively high degree of association based on the state of connection of each node by the edge.
  • a “node” is a node (point of contact) in so-called graph theory.
  • An “edge” is also an edge (side) in graph theory. Therefore, the "connection state of each node by an edge” is the connection state of each node.
  • edge weights When edge weights are taken into account, it refers to the state of connection in which weights are also taken into consideration.
  • edge weights When edge weights are taken into account, it refers to the state of connection in which weights are also taken into consideration.
  • these terms are not bound by the strict definition of graph theory, and the drawing of points of contact and edges representing the network structure is within the scope of the present invention.
  • Modularity index Q is defined as the ratio of links connecting nodes in a group minus the expected value if the links are randomly placed, for a given partition of the network.
  • Modularity Q is an index well known to those skilled in the art, but the formula is shown below just in case.
  • a formula that takes edge weights into account may be used as in the following formula. Even when using a formula that does not consider edge weights, clustering that reflects weight differences to some extent may be performed by calculating assuming that there are no edges below an arbitrary weight (with zero weight).
  • group division broadly refers to the process of creating a state in which grouping has been performed, for example, excluding clustering by algorithms such as the following greedy method is not.
  • Algorithms for clustering using the modularity index Q are also well known to those skilled in the art, and some examples will be outlined. For example, there is a greedy method that merges a cluster with another cluster from a state in which all nodes are individually separate clusters. In this method, the modularity index Q is used as a criterion for selecting clusters to be merged, and clusters with a larger Q after merging are merged as needed. Conversely, there is also a method in which all nodes are treated as one cluster, and the cluster is divided at any time using the modularity index Q as a reference. Since maximization of the modularity index Q in clustering is an NP problem, algorithms are proposed from time to time by those skilled in the art to find approximate solutions. Any algorithm may be applied to the present invention.
  • estimate in “each node is estimated to have a relatively high degree of relevance” means that the solution obtained by the calculation process may be an approximate solution as described above. ing. In other words, there is no need to continue the calculation until the exact solution is obtained, and the calculation may be terminated in the middle. However, this does not exclude the case where the obtained solution is an exact solution, and does not negate the clustering process for obtaining an exact solution. It may be estimated, for example, when the convergence rate of the convergence target in the nth and n+1th operations falls within a predetermined range. For example, the convergence rate, which is the difference, may be about 1% to 20%.
  • the feature of the above clustering is that clusters are created from the state of connection of the edges between nodes after drawing edges between nodes, not similarity information between nodes. Therefore, in the present invention, all methods of estimating the degree of relevance from the state of connection of the edges of each node can be adopted, instead of the similarity information between each node. With this feature, the present invention appropriately groups not only directly related adjacent companies but also indirectly related adjacent companies (adjacent to adjacent, etc.), and can systematically grasp the overall picture of the industrial world. There are benefits.
  • an index other than the modularity index Q may be used to evaluate the state of edge coupling between nodes.
  • spin glass method 1. If nodes belonging to the same community are connected to each other, plus; Minus if nodes belonging to the same community are not connected to each other; 4. Negative if nodes belonging to different communities are connected to each other; If nodes belonging to different communities are not connected to each other, the plus four factors are combined for scoring.
  • a clustering method that allows one node to belong to multiple groups can also be used. This includes, for example, a method of regarding a clique (a group of nodes in which all nodes are interconnected) as one group.
  • Betweenness centrality indicates how many paths of all shortest paths between two nodes include a given node (or edge), and can be defined by the following formula. This formula is for the betweenness centrality of a node, but the betweenness centrality of an edge can be calculated by changing "things passing through node i" to "things passing through edge i".
  • Display step displays nodes, edges, and clustering results in graph form. For example, FIG. 25 is monochrome, each node edge is actually colored, and each color constitutes a separate cluster.
  • Layout algorithms such as Fruchterman-Reingold, ForceAtlas2, etc. are preferably used for drawing nodes/edges. Note that the present invention does not impose any restrictions on the node/edge layout algorithm, so those skilled in the art may use any algorithm for rendering.
  • the formulas of the above two algorithms are as follows.
  • the Fruchterman-Reingold equation is as follows.
  • the formula for ForceAtlas2 is as follows. Note that k in the formula is a coefficient set by the user.
  • Algorithms such as ForceAtlas and OpenOrd can also be used for graph visualization (layout). Those skilled in the art may use these algorithms as appropriate.
  • this embodiment having the above configuration, it is possible to create a technology bird's-eye view showing the accurate and objective distribution and relationship between companies. Moreover, according to this bird's-eye view, it is possible to comprehend the technical relationships between many companies comprehensively and from a bird's-eye view. In addition, not only directly related companies but also indirectly related companies (neighbors of neighbors, etc.) can be appropriately grouped to systematically grasp the overall picture of the industrial world. Therefore, according to this bird's-eye view, there is a high possibility that unprecedented distributions and relationships between companies can be discovered, and the present invention can be said to be extremely useful for formulating future management strategies. ⁇ Embodiment 2>
  • Embodiment 2 is basically the same as Embodiment 1, but the node is one of the patent classification information given to the patent (main patent classification information), and the patent classification information based on the technology used at the same time It is characterized by creating a technology bird's-eye view that overlooks the relationship. An overview of the steps of this embodiment is as shown in FIG. Differences from the first embodiment will be described below.
  • one patent classification information of the patent among the patent classification information assigned to a specific patent is used as the main patent classification information, and the main patent classification information and the patent records the data set associated with the patent classification information in the data set holding unit.
  • Main patent classification information is typically the leading IPC, but it is not limited to this.
  • the first three digits (class) of the IPC are used as the patent classification information
  • the first three digits (class) of the most frequently assigned IPC may be adopted as the main axis. Specifically, if five IPCs are attached to one patent, three IPCs are of class A01 and the remaining two IPCs are of class B01, then A01 is adopted.
  • the nodes are the main patent classifications.
  • the edge is the commonality (or similarity) of the technologies used together between the principal patent classifications. That is, in the first embodiment, the right holder was the node, but in the present embodiment, the main patent classification is the node.
  • FIG. 26 is an example of this.
  • Embodiment 3 is basically the same as Embodiment 1, but the value indicating the degree of commonality or the value indicating the degree of similarity between nodes as a reference for drawing edges between nodes is relatively large. It has a node similarity identification information associating step for associating node similarity identification information indicating a node similarity relationship with each other, and displays the node similarity identification information in addition to nodes, edges, and clustering results in a "node similarity display substep". is characterized by In addition, it is characterized in that a plurality of nodes can be aggregated based on the node similarity identification information in the "aggregation step". The outline of the steps of this embodiment is as shown in FIGS. 3 and 4. FIG. Differences from the first embodiment will be described below.
  • Another way to create groups is to group them so that the degree of commonality and average similarity between rights holders in the group is as large as possible. Specifically, the values obtained from the number of common patent classifications, cosine similarity and similarity by set operation described later, and the degree of divergence of the probability distribution between right holders are equal to or greater than a certain value.
  • the number of groups can be arbitrarily adjusted by adjusting the constant value, which is convenient.
  • the nodes may be grouped sequentially from a combination of nodes having relatively high mutual similarity (or estimated to be high).
  • the value indicating the degree of commonality or the value indicating the degree of similarity used for the above grouping does not need to adopt the same calculation method as the value for drawing edges.
  • the above grouping may be performed using a value indicating the degree of commonality, and association between rights holders for drawing edges may be performed using a value indicating the degree of similarity.
  • the node similarity identification information is displayed on the technology bird's-eye view. For example, there is a display method that attaches the same symbol to similar nodes.
  • the grouped rights holders can be aggregated and displayed.
  • a plurality of rights holders may be collectively displayed in one node, or a plurality of nodes may be surrounded by a circle-like display. By doing so, the visibility of the graph is greatly improved.
  • This "aggregation step” may be implemented after the graph is displayed in the "display step”. In this case, the function is such that the multiple nodes that have already been displayed before aggregation are put into an aggregated state and displayed again.
  • the "aggregation step” may be performed before the "display step” so that a plurality of nodes are aggregated and displayed in advance.
  • the user may arbitrarily set and designate the timing of aggregation. Note that when nodes are aggregated, the edges and edge weights of the aggregated nodes may be totaled, and clustering processing may be executed again.
  • Embodiment 4 is basically the same as Embodiment 1, but uses patent classification information in which the number of distributions and/or the ratio of distributions in each technology distribution information is an arbitrary value or more for associating right holders. It is characterized by points. The outline of the steps of this embodiment is as shown in FIG. 1 (same as Embodiment 1). Differences from the first embodiment will be described below.
  • the technology distribution information in the present embodiment for example, it is preferable to replace aggregate information of patent classifications attached to patents for each right holder with a ratio, and use patent classification information in which the ratio is equal to or greater than an arbitrary value for association. be.
  • the arbitrary value should be adjustable by the user.
  • the two companies A and B are associated with equal weight. This can be said to have focused on only the technologies that are important to the company, discarding unimportant technologies, and making mutual associations.
  • the arbitrary value is 1% or more
  • the three companies A, B, and C are associated with equal weight.
  • the 1% patent classification and the 10% patent classification are treated in the same way as "1" in the association, so the technology that is not so important to Company C (for example, peripheral technology) was emphasized and associated. It will be.
  • peripheral technology for example, peripheral technology
  • Embodiment 5 is basically the same as Embodiment 1, but is characterized in that the values used for associating rights holders are set operations. Specifically, it is characterized by using the degree of similarity between right holders calculated by a set operation, with right holders as a set and patent classification information associated with the right holders as elements of the set. Specific methods of set operations are as follows. The outline of the steps of this embodiment is as shown in FIG. 1 (same as Embodiment 1). Differences from the first embodiment will be described below.
  • Embodiment 6 is basically the same as Embodiment 1, but is characterized in that the values used for associating rights holders are similarities using vector feature amounts. Specifically, it is characterized in that it is a degree of similarity between right holders calculated as a vector feature value based on patent classification information associated with each right holder. Specific vector calculation methods are as follows. The outline of the steps of this embodiment is as shown in FIG. 1 (same as Embodiment 1). Differences from the first embodiment will be described below.
  • Cosine similarity will be described as an example of similarity using vector features.
  • Cosine similarity is an index that expresses the closeness of angles formed by vectors.
  • the formula for calculating the cosine similarity is as follows. The vector of each node is obtained by taking each patent classification associated with the right holder as each dimension and the number of appearances of each patent classification as the size of each dimension.
  • FIG. 24 is a matrix of relationships between rights holders created by cosine similarity.
  • Embodiment 7 is basically the same as Embodiment 1, but is characterized in that the value used for associating rights holders is a value based on the deviation of the probability distribution. Specifically, the value indicating the degree of similarity in the association step is obtained from the degree of divergence of the probability distribution between right holders, where the distribution of the appearance frequency of the patent classification information associated with the right holder is set as a probability distribution. It is characterized by the use of values that can be obtained. Specific probability distribution calculation methods are as follows. The outline of the steps of this embodiment is as shown in FIG. 1 (same as Embodiment 1). Differences from the first embodiment will be described below.
  • the divergence of probability distributions between right holders is, for example, KL divergence.
  • KL divergence The formula for KL divergence is:
  • JS divergence is an index that makes KL divergence easier to use.
  • Embodiment 8 is basically the same as Embodiment 1, but adds patent classification contribution information for identifying patent classification information that contributed to the association between nodes to the nodes, the edges, or the clustering results. It is characterized in that it further has a labeling step. Furthermore, among the patent classifications that contributed to the association between each node, it is preferable to identify the patent classification information that has a large influence in the cluster created from the state of edge coupling. Below, the outline of the steps of this embodiment is as shown in FIG. Differences from the first embodiment will be described below.
  • the "patent classification that contributed to the association between each node" in the "labeling step” is the patent classification that influenced the value used for association in the association step, and is the patent classification that is common among the nodes. If there are multiple patent classifications that are common among nodes, a patent classification that is considered to have a greater influence on community formation may be selected. As an example of a value that can be used as the degree of influence here, there is a score (hereinafter referred to as SF-ICF) calculated by replacing words in TF-IDF with subclasses and documents with clusters.
  • SF-ICF score
  • TF-IDF is an index for evaluating the importance of a word in a document. Desired. It can be said that TF indicates the degree of importance of a certain word in a certain document, and IDF indicates the general appearance frequency of that word.
  • SF-ICF is a score calculated by replacing words in TF-IDF with subclasses and documents with clusters. Specifically, it can be expressed by the following formula.
  • SF-ICF uses subclasses, there is no problem in using patent classifications that are higher or lower than subclasses. Also, clusters can be used by replacing them with groups created in the third embodiment.
  • Fig. 27 shows the actual labeling.
  • the label that describes drinks, seasonings, etc. uses a rewritten IPC label that is easy to understand.
  • the present invention can be implemented as hardware, software, or both hardware and software.
  • hardware includes CPU, main memory, GPU, image memory, graphic board, or secondary storage device (hard disk, non-volatile memory, storage media such as CD and DVD, and read drives for those media). and various input/output devices.
  • any of these programs may be realized as a plurality of modularized programs, or two or more programs may be combined to be realized as one program.
  • FIG. 6 shows that each program and each data recorded in the non-volatile memory are read into the main memory and arithmetic processing is performed, and that the arithmetic result performed on the main memory can be recorded in the non-volatile memory.
  • FIG. 6 shows that each program and each data recorded in the non-volatile memory are read into the main memory and arithmetic processing is performed, and that the arithmetic result performed on the main memory can be recorded in the non-volatile memory.
  • the present invention which has the various configurations described above, it is possible to create a technology bird's-eye view that shows the accurate and objective distribution and relationship between companies. Moreover, according to this bird's-eye view, it is possible to comprehend the technical relationships between many companies comprehensively and from a bird's-eye view. Furthermore, not only directly related adjacent companies but also indirectly related adjacent companies (adjacent to adjacent, etc.) can be appropriately grouped, and the overall picture of the industrial world can be grasped systematically. Therefore, according to this bird's-eye view, there is a high possibility that unprecedented distributions and relationships between companies can be discovered, and the present invention can be said to be extremely useful for formulating future management strategies.

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Strategic Management (AREA)
  • Economics (AREA)
  • General Business, Economics & Management (AREA)
  • Tourism & Hospitality (AREA)
  • Finance (AREA)
  • Development Economics (AREA)
  • Marketing (AREA)
  • Accounting & Taxation (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Health & Medical Sciences (AREA)
  • Technology Law (AREA)
  • Primary Health Care (AREA)
  • Human Resources & Organizations (AREA)
  • Entrepreneurship & Innovation (AREA)
  • General Health & Medical Sciences (AREA)
  • Game Theory and Decision Science (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

L'invention aborde le problème de la création d'une vue à vol d'oiseau technologique qui permettrait de découvrir et d'analyser une relation entre une entreprise, une technologie et une affaire qui ne peuvent pas être découvertes par une approche classique. La solution selon la présente invention associe les ayants droit légitimes les uns aux autres par des caractéristiques technologiques sur la base d'un ensemble de données dans lequel des informations de classification de brevet et des ayants droit légitimes sont associés et, en adoptant chaque ayant droit légitime comme un nœud et l'association des ayants droit légitimes les uns aux autres comme en tant que bord, elle regroupe chaque nœud par un groupe dont le degré d'association est relativement élevé et crée une vue à vol d'oiseau technologique sous la forme d'un graphique.
PCT/JP2021/043529 2021-04-02 2021-11-29 Procédé de création d'une vue à vol d'oiseau en utilisant des informations de propriété intellectuelle WO2022208998A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
JP2021063646A JP7317067B2 (ja) 2021-04-02 2021-04-02 知財情報を用いた俯瞰図の作成方法
JP2021-063646 2021-04-02

Publications (1)

Publication Number Publication Date
WO2022208998A1 true WO2022208998A1 (fr) 2022-10-06

Family

ID=83458342

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2021/043529 WO2022208998A1 (fr) 2021-04-02 2021-11-29 Procédé de création d'une vue à vol d'oiseau en utilisant des informations de propriété intellectuelle

Country Status (2)

Country Link
JP (1) JP7317067B2 (fr)
WO (1) WO2022208998A1 (fr)

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2007206771A (ja) * 2006-01-31 2007-08-16 Fujitsu Ltd 情報要素処理プログラム、情報要素処理方法及び情報要素処理装置
JP2015018529A (ja) * 2013-07-15 2015-01-29 剛一 尾和 特許マップの分析方法
JP2015026388A (ja) * 2014-10-01 2015-02-05 株式会社帝国データバンク 取引関係マップ生成システム及びプログラム
US20150269693A1 (en) * 2014-03-21 2015-09-24 Arturo Geigel Method and System of querying patent information based on image interface
KR20160050729A (ko) * 2014-10-30 2016-05-11 동국대학교 산학협력단 특허 정보를 이용한 특허 로드맵 생성 방법 및 시스템
WO2019102533A1 (fr) * 2017-11-22 2019-05-31 花王株式会社 Dispositif de classification de documents
US20200104322A1 (en) * 2018-10-01 2020-04-02 Eta Sa Manufacture Horlogere Suisse Communication method for database
JP2020095669A (ja) * 2019-05-28 2020-06-18 株式会社ＡＩ Ｓａｍｕｒａｉ 特許マップ表示装置及び特許マップ表示方法並びに特許マップ表示プログラム

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2007206771A (ja) * 2006-01-31 2007-08-16 Fujitsu Ltd 情報要素処理プログラム、情報要素処理方法及び情報要素処理装置
JP2015018529A (ja) * 2013-07-15 2015-01-29 剛一 尾和 特許マップの分析方法
US20150269693A1 (en) * 2014-03-21 2015-09-24 Arturo Geigel Method and System of querying patent information based on image interface
JP2015026388A (ja) * 2014-10-01 2015-02-05 株式会社帝国データバンク 取引関係マップ生成システム及びプログラム
KR20160050729A (ko) * 2014-10-30 2016-05-11 동국대학교 산학협력단 특허 정보를 이용한 특허 로드맵 생성 방법 및 시스템
WO2019102533A1 (fr) * 2017-11-22 2019-05-31 花王株式会社 Dispositif de classification de documents
US20200104322A1 (en) * 2018-10-01 2020-04-02 Eta Sa Manufacture Horlogere Suisse Communication method for database
JP2020095669A (ja) * 2019-05-28 2020-06-18 株式会社ＡＩ Ｓａｍｕｒａｉ 特許マップ表示装置及び特許マップ表示方法並びに特許マップ表示プログラム

Also Published As

Publication number Publication date
JP2022158621A (ja) 2022-10-17
JP7317067B2 (ja) 2023-07-28

Similar Documents

Publication Publication Date Title
Zhao et al. Graph cube: on warehousing and OLAP multidimensional networks
Davis et al. Deep transfer via second-order markov logic
Newman Communities, modules and large-scale structure in networks
Liu et al. Computational and statistical methods for analysing big data with applications
Galbrun et al. What is redescription mining
Cao et al. Untangle map: Visual analysis of probabilistic multi-label data
Kim et al. A study on a way to utilize big data analytics in the defense area
Gong et al. Single cell lineage reconstruction using distance-based algorithms and the R package, DCLEAR
JP6481794B1 (ja) 学習用データ生成方法、学習用データ生成プログラム
KR20090069874A (ko) 지식맵 분석을 위한 키워드 선정 및 유사도계수 선정 방법및 그 시스템과 그 방법에 대한 컴퓨터 프로그램을 저장한기록매체
US10769161B2 (en) Generating business intelligence analytics data visualizations with genomically defined genetic selection
WO2022208998A1 (fr) Procédé de création d'une vue à vol d'oiseau en utilisant des informations de propriété intellectuelle
Khedr Decomposable algorithm for computing k-nearest neighbours across partitioned data
Pawlak et al. Synthesis of mathematical programming constraints with genetic programming
Dryden et al. Journeys in big data statistics
Mohseni et al. SAVis: A Learning Analytics Dashboard with Interactive Visualization and Machine Learning
Nguyen et al. An efficient multi-objective optimization approach for online test paper generation
Pandey Study and Analysis of K-Means Clustering Algorithm Using Rapidminer
Abascal et al. Data mining in a bicriteria clustering problem
Zhang et al. Model‐based clustering of time‐dependent categorical sequences with application to the analysis of major life event patterns
Shin et al. Analysis of evolution of movies using massive movie-tag meme network data
Flewelling Comparing subsets from digital spatial archives: Point set similarity
Xia et al. Basketball big data and visual management system under metaheuristic clustering
Gabor Typological analysis as analysis method of marketing data
Joshi A Comparative Study Of Large-Scale Network Data Visualization Tools

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 21935151

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 21935151

Country of ref document: EP

Kind code of ref document: A1