[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
research-article

Predicting Hidden Links in Supply Networks

Published: 01 January 2018 Publication History

Abstract

Manufacturing companies often lack visibility of the procurement interdependencies between the suppliers within their supply network. However, knowledge of these interdependencies is useful to plan for potential operational disruptions. In this paper, we develop the Supply Network Link Predictor (SNLP) method to infer supplier interdependencies using the manufacturer’s incomplete knowledge of the network. SNLP uses topological data to extract relational features from the known network to train a classifier for predicting potential links. Using a test case from the automotive industry, four features are extracted: (i) number of existing supplier links, (ii) overlaps between supplier product portfolios, (iii) product outsourcing associations, and (iv) likelihood of buyers purchasing from two suppliers together. Naïve Bayes and Logistic Regression are then employed to predict whether these features can help predict interdependencies between two suppliers. Our results show that these features can indeed be used to predict interdependencies in the network and that predictive accuracy is maximised by (i) and (iii). The findings give rise to the exciting possibility of using data analytics for improving supply chain visibility. We then proceed to discuss to what extent such approaches can be adopted and their limitations, highlighting next steps for future work in this area.

References

[1]
Z. E. Tang, M. Goetschalckx, and L. McGinnis, “Modeling-based design of strategic supply chain networks for aircraft manufacturing,” in Proceedings of the 11th Annual Conference on Systems Engineering Research, CSER 2013, pp. 611–620, USA, March 2013.
[2]
D. Lin, “An information-theoretic definition of similarity,” in Proceedings of the 15th Int. Conf. on Machine Learning, Madison, Wisconsin, USA, 1998.
[3]
S. B. Kotsiantis, “Supervised machine learning: A review of classification techniques,” in Emerging Artificial Intelligence Applications in Computer Engineering, I. Maglogiannis et al., Eds., pp. 3–24, 2007.
[4]
D. Garcia-Gasulla, Link prediction in large-scale directed graphs, PhD thesis Universitat Politecnica de Catalunya, Barcelona, 2015.
[5]
D. Liben-Nowell and J. Kleinberg, “The link prediction problem for social networks,” in Proceedings of the 12th ACM International Conference on Information and Knowledge Management (CIKM '03), pp. 556–559, ACM, November 2003.
[6]
L. Katz, “A new status index derived from sociometric analysis,” Psychometrika, vol. 18, no. 1, pp. 39–43, 1953.
[7]
E. A. Leicht, P. Holme, and M. E. J. Newman, “Vertex similarity in networks,” Physical Review E: Statistical, Nonlinear, and Soft Matter Physics, vol. 73, no. 2, 2006.
[8]
L. Lü, C.-H. Jin, and T. Zhou, “Similarity index based on local paths for link prediction of complex networks,” Physical Review E: Statistical, Nonlinear, and Soft Matter Physics, vol. 80, no. 4, 2009.
[9]
Z. Liu, Q.-M. Zhang, L. Lü, and T. Zhou, “Link prediction in complex networks: a local naïve Bayes model,” EPL (Europhysics Letters), vol. 96, no. 4, 2011.
[10]
A. Clauset, C. Moore, and M. E. J. Newman, “Hierarchical structure and the prediction of missing links in networks,” Nature, vol. 453, no. 7191, pp. 98–101, 2008.
[11]
H. P. Thadakamalla, U. N. Raghavan, S. Kumara, and R. Albert, “Survivability of multiagent-based supply networks: a topological perspective,” IEEE Intelligent Systems, vol. 19, no. 5, pp. 24–31, 2004.
[12]
E. J. S. Hearnshaw and M. M. J. Wilson, “A complex network approach to supply chain network theory,” International Journal of Operations & Production Management, vol. 33, no. 4, pp. 442–469, 2013.
[13]
A. Brintrup, A. Ledwoch, and J. Barros, “Topological robustness of the global automotive industry,” Logistics Research, vol. 9, no. 1, article no. 1, pp. 1–17, 2016.
[14]
A. Brintrup, Y. Wang, and A. Tiwari, “Supply Networks as Complex Systems: A Network-Science-Based Characterization,” IEEE Systems Journal, vol. 11, no. 4, pp. 2170–2181, 2017.
[15]
N. Friedman, L. Getoor, D. Koller, and A. Pfeffer, “Learning Probabilistic relational models,” in Proceedings of the 16th Int. Joint Conference on Artificial Intelligence, Stockholm, Sweden, 1999.
[16]
K. Yu, W. Chu, S. Yu, V. Tresp, and Z. Xu, “Stochastic Relational Models for Discriminative Link Prediction,” in Proceedings of Neural Information Processing Systems, p. 1553, Cambridge MA, 2006.
[17]
C. C. Aggarwal, Y. Xie, and P. S. Yu, “A framework for dynamic link prediction in heterogeneous networks,” Statistical Analysis and Data Mining, vol. 7, no. 1, pp. 14–33, 2014.
[18]
M. Al-Hassan, V. Chaoji, S. Salem, and M. J. Zaki, “Link prediction using supervised learning,” In SDM Workshop on Al-Link Analysis, Counter-terrorism and Security, 2006.
[19]
N. V. Chawla, K. W. Bowyer, L. O. Hall, and W. P. Kegelmeyer, “SMOTE: synthetic minority over-sampling technique,” Journal of Artificial Intelligence Research, vol. 16, pp. 321–357, 2002.
[20]
G. M. Weiss, “Mining with rarity: a unifying framework,” ACM SIGKDD Explorations Newsletter, vol. 6, no. 1, pp. 7–19, 2004.
[21]
X.-Y. Liu, J. Wu, and Z.-H. Zhou, “Exploratory undersampling for class-imbalance learning,” IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, vol. 39, no. 2, pp. 539–550, 2009.
[22]
M. Wasikowski and X.-W. Chen, “Combating the small sample class imbalance problem using feature selection,” IEEE Transactions on Knowledge and Data Engineering, vol. 22, no. 10, pp. 1388–1400, 2010.
[23]
T. Fawcett, “An introduction to ROC analysis,” Pattern Recognition Letters, vol. 27, no. 8, pp. 861–874, 2006.
[24]
M. Nickel, V. Tresp, and H. Kriegel, “A Three-Way Model for Collective Learning on Multi-Relational Data,” in Proc. of the 28th Int. Conf. on Machine Learning, Bellevue,WA, USA, 2011.
[25]
D. Garcia-Gasulla, U. Cortes, E. Ayguade, and J. Labarta, “Evaluating Link Prediction on Large Graphs,” in Proceedings of 18th Int. Conf. of the Catalan Association for Artificial Intelligence, pp. 90–99, 2015.

Cited By

View all

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Complexity
Complexity  Volume 2018, Issue
2018
9469 pages
This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Publisher

John Wiley & Sons, Inc.

United States

Publication History

Published: 01 January 2018

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 19 Dec 2024

Other Metrics

Citations

Cited By

View all

View Options

View options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media