Competitive Analysis with Graph Embedding on Patent Networks

• Published in: 2020 IEEE 22nd Conference on Business Informatics (CBI) Vol. 1; pp. 10 - 19
• Main Authors: Wang, Yunli, Richard, Rene, McDonald, Daniel
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.06.2020
• Subjects: Analytical models; Competitive analysis; Data mining; Heterogeneous networks; Organizations; Representation Learning; Semantics; Topic Modeling
• ISSN: 2378-1971
• DOI: 10.1109/CBI49978.2020.00009

Advanced competitive analysis is increasingly becoming important in business analytics. A key component of strategic research is to collect and review information from multiple unstructured sources to identify major competitors and their technology development trends. Topic modeling techniques such as Latent Dirichlet Allocation (LDA) have been applied to competitive analysis, which mainly use the semantic similarities between documents to infer competitive relationships. In this study, we propose using graph embedding methods to learn the implicit competitive relationships between firms. Using patent networks with patents and organizations as nodes, we learn the embeddings of nodes which are then used to cluster organizations into groups. Organizations within the same groups are considered competitors. We applied three graph embedding methods: node2vec, metapath2vec, and GraphSAGE to learn node embeddings. Two of these methods use the structural information in patent networks: node2vec for homogeneous networks and metapath2vec for heterogeneous networks. While, GraphSAGE uses both the structure and content information in the patent network. The results are compared with a baseline author-topic modeling method. The graph embedding methods outperform the author-topic modeling approach in learning the competitive relationships. A case study, examining the evolution of competitors over multiple years, shows the graph embedding method learns meaningful node embeddings.