| Téléchargement | - Voir le manuscrit accepté : Competitive analysis with graph embedding on patent networks (PDF, 886 Kio)
|
|---|
| DOI | Trouver le DOI : https://doi.org/10.1109/CBI49978.2020.00009 |
|---|
| Auteur | Rechercher : Wang, Yunli1; Rechercher : Richard, Rene1; Rechercher : Mcdonald, Daniel1 |
|---|
| Affiliation | - Conseil national de recherches du Canada. Technologies numériques
|
|---|
| Format | Texte, Article |
|---|
| Conférence | 2020 IEEE 22nd Conference on Business Informatics (CBI), June 22-24, 2020, Antwerp, Belgium |
|---|
| Sujet | competitive analysis; representation learning; topic modeling |
|---|
| Résumé | 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. |
|---|
| Date de publication | 2020-07-15 |
|---|
| Maison d’édition | IEEE |
|---|
| Dans | |
|---|
| Langue | anglais |
|---|
| Publications évaluées par des pairs | Oui |
|---|
| Exporter la notice | Exporter en format RIS |
|---|
| Signaler une correction | Signaler une correction (s'ouvre dans un nouvel onglet) |
|---|
| Identificateur de l’enregistrement | 9d9f6e4f-884a-44c9-be45-227954ad80b1 |
|---|
| Enregistrement créé | 2020-11-12 |
|---|
| Enregistrement modifié | 2021-02-08 |
|---|
