Research Papers: Design Automation

Network Analysis of Design Automation Literature

[+] Author and Article Information
Tinghao Guo

Industrial and Enterprise Systems Engineering,
University of Illinois at Urbana-Champaign,
Urbana, IL 60801
e-mail: guo32@illinois.edu

Jiarui Xu

Language Technologies Institute,
Carnegie Mellon University,
Pittsburgh, PA 15213
e-mail: jiaruix@cs.cmu.edu

Yue Sun

Computer Science,
University of Illinois at Urbana-Champaign,
Urbana, IL 61801
e-mail: yuesun3 @illinois.edu

Yilin Dong

Computer Science,
University of Illinois at Urbana-Champaign,
Urbana, IL 61801
e-mail: ydong24@illinois.edu

Neal Davis

Computer Science,
University of Illinois at Urbana-Champaign,
Urbana, IL 61801
e-mail: davis68@illinois.edu

James T. Allison

Industrial and Enterprise Systems Engineering,
University of Illinois at Urbana-Champaign,
Urbana, IL 60801
e-mail: jtalliso@illinois.edu

Contributed by the Design Automation Committee of ASME for publication in the JOURNAL OF MECHANICAL DESIGN. Manuscript received June 17, 2017; final manuscript received June 12, 2018; published online July 31, 2018. Assoc. Editor: Carolyn Seepersad.

J. Mech. Des 140(10), 101403 (Jul 31, 2018) (13 pages) Paper No: MD-17-1408; doi: 10.1115/1.4040787 History: Received June 17, 2017; Revised June 12, 2018

In this paper, we present the results of a study of citation and co-authorship networks for articles published at the ASME Design Automation Conference (DAC) during the years 2002–2015. Two topic-modeling methods are presented for studying the DAC literature: A frequency-based model was developed to explore DAC topic distribution and evolution, as well as citation analysis for each core topic. Correlation analysis and association-rule mining were used to discover relationships between topics. A new unsupervised learning algorithm, propagation mergence (PM), was created to address identified shortcomings of existing methods and applied to study the existing DAC citation network. Influential articles and important article clusters were identified and effective visualizations created. We also investigated the DAC co-authorship network by identifying key authors and showing that the network structure exhibits small-world-network properties. The resulting insights, obtained by the both the proposed and existing methods, may be beneficial to the engineering design research community, especially with respect to determining future research directions and possible actions for improvement. The data set used here is limited; expanding to include additional relevant conference proceedings and journal articles in the future would offer a more complete understanding of the engineering design research literature.

Copyright © 2018 by ASME
Your Session has timed out. Please sign back in to continue.


ASME, 2017, International Design Engineering Technical Conferences & Computers & Information in Engineering Conference, American Society of Mechanical Engineers, Cleveland, OH.
Ilies, H. , Parkinson, M. , Seepersad, C. C. , Kokkolaras, M. , Ragsdell, K. , Papalambros, P. Y. , Mistree, F. , Williams, C. , Rai, R. , Panchal, J. , Ferguson, S. , DuPont, B. , and Allison, J. T. , 2015, “ New Perspectives on Design Automation: Celebrating the 40th Anniversary of the ASME Design Automation Conference,” ASME J. Mech. Des., 137(5), p. 050301. [CrossRef]
Otte, E. , and Rousseau, R. , 2002, “ Social Network Analysis: A Powerful Strategy, Also for the Information Sciences,” J. Inf. Sci., 28(6), pp. 441–453. [CrossRef]
Wellman, B. , and Berkowitz, S. D. , 1988, Social Structures: A Network Approach, Vol. 2, CUP Archive, Cambridge, England.
Ni, C. , Sugimoto, C. R. , and Jiang, J. , 2011, “ Degree, Closeness, and Betweenness: Application of Group Centrality Measurements to Explore Macro-Disciplinary Evolution Diachronically,” ISSI, pp. 1–13. https://www.elektrokomponenten.ch/media/files/09e4150bd20e58c913000000.pdf
Le, Q. , and Panchal, J. H. , 2012, “ Building Smaller Sized Surrogate Models of Complex Bipartite Networks Based on Degree Distributions,” IEEE Trans. Syst., Man, Cybern.-Part A: Syst. Humans, 42(5), pp. 1152–1166. [CrossRef]
Li, X-H. , and Guan, Z-H. , 2013, “ Energy-Aware Routing in Wireless Sensor Networks Using Local Betweenness Centrality,” Int. J. Distrib. Sensor Networks, 9(5), pp. 1–9.
Narayanan, S. , 2005, “ The Betweenness Centrality of Biological Networks,” Ph.D. thesis, Virginia Tech, Blacksburg, VA. http://hdl.handle.net/10919/35405
Derrible, S. , 2012, “ Network Centrality of Metro Systems,” PloS One, 7(7), p. e40575. [CrossRef] [PubMed]
Jain, A. K. , Murty, N. , and Flynn, P. J. , 1999, “ Data Clustering: A Review,” ACM Comput. Surv. (CSUR), 31(3), pp. 264–323. [CrossRef]
Xu, X. , Yuruk, N. , Feng, Z. , and Schweiger, T. A. J. , 2007, “ Scan: A Structural Clustering Algorithm for Networks,” 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Jose, CA, Aug. 12–15, pp. 824–833.
Shibata, N. , Kajikawa, Y. , Takeda, Y. , Sakata, I. , and Matsushima, K. , 2011, “ Detecting Emerging Research Fronts in Regenerative Medicine by the Citation Network Analysis of Scientific Publications,” Technol. Forecasting Soc. Change, 78(2), pp. 274–282. [CrossRef]
Malliaros, F. D. , and Vazirgiannis, M. , 2013, “ Clustering and Community Detection in Directed Networks: A Survey,” Phys. Rep., 533(4), pp. 95–142. [CrossRef]
Newman, M. E. J. , 2004, “ Fast Algorithm for Detecting Community Structure in Networks,” Phys. Rev. E, 69(6), p. 066133. [CrossRef]
Newman, M. E. J. , and Girvan, M. , 2004, “ Finding and Evaluating Community Structure in Networks,” Phys. Rev. E, 69(2), p. 026113. [CrossRef]
Page, L. , Brin, S. , Motwani, R. , and Winograd, T. , 1999, “ The PageRank Citation Ranking: Bringing Order to the Web,” Stanford University InfoLab, Stanford, CA, Technical Report No. SIDL-WP-1999-0120. http://ilpubs.stanford.edu:8090/422/
Brin, S. , and Page, L. , 2012, “ Reprint of: The Anatomy of a Large-Scale Hypertextual Web Search Engine,” Comput. Networks, 56(18), pp. 3825–3833. [CrossRef]
Kleinberg, J. M. , 1999, “ Authoritative Sources in a Hyperlinked Environment,” J. ACM (JACM), 46(5), pp. 604–632. [CrossRef]
Sun, Y. , Han, J. , Yan, X. , Yu, P. S. , and Wu, T. , 2011, “ Pathsim: Meta Path-Based Top-k Similarity Search in Heterogeneous Information Networks,” Proc. VLDB Endowment, 4(11), pp. 992–1003. http://web.cs.ucla.edu/~yzsun/papers/vldb11_topKSim.pdf
Sun, Y. , Barber, R. , Gupta, M. , Aggarwal, C. C. , and Han, J. , 2011, “ Co-author Relationship Prediction in Heterogeneous Bibliographic Networks,” International Conference on Advances in Social Networks Analysis and Mining (ASONAM), Kaohsiung, Taiwan, July 25–27, pp. 121–128.
Liben-Nowell, D. , and Kleinberg, J. , 2007, “ The Oink-Prediction Problem for Social Networks,” J. Am. Soc. Inf. Sci. Technol., 58(7), pp. 1019–1031. [CrossRef]
Albert, R. , and Barabási, A.-L. , 2002, “ Statistical Mechanics of Complex Networks,” Rev. Mod. Phys., 74(1), p. 47. [CrossRef]
Newman, M. E. J. , 2003, “ The Structure and Function of Complex Networks,” SIAM Rev., 45(2), pp. 167–256. [CrossRef]
Danon, L. , Diaz-Guilera, A. , Duch, J. , and Arenas, A. , 2005, “ Comparing Community Structure Identification,” J. Stat. Mech.: Theory Exp., 2005(9), p. 09008. [CrossRef]
Fortunato, S. , 2010, “ Community Detection in Graphs,” Phys. Rep., 486(3–5), pp. 75–174. [CrossRef]
Blei, D. M. , Ng, A. Y. , and Jordan, M. J. , 2003, “ Latent Dirichlet Allocation,” J. Mach. Learn. Res., 3, pp. 993–1022. http://www.jmlr.org/papers/volume3/blei03a/blei03a.pdf
Pritchard, J. K. , Stephens, M. , and Donnelly, P. , 2000, “ Inference of Population Structure Using Multilocus Genotype Data,” Genetics, 155(2), pp. 945–959. http://www.genetics.org/content/155/2/945 [PubMed]
Rosen-Zvi, M. , Griffiths, T. , Steyvers, M. , and Smyth, P. , 2004, “ The Author-Topic Model for Authors and Documents,” 20th Conference on Uncertainty in Artificial Intelligence, Banff, AB, Canada, July 7–11, pp. 487–494.
Jie, T. , Ruoming, J. , and Jing, Z. , 2008, “ A Topic Modeling Approach and Its Integration Into the Random Walk Framework for Academic Search,” Eighth IEEE International Conference on Data Mining, (ICDM), Pisa, Italy, Dec. 15–19, pp. 1055–1060.
Ding, Y. , 2011, “ Scientific Collaboration and Endorsement: Network Analysis of Coauthorship and Citation Networks,” J. Informetrics, 5(1), pp. 187–203. [CrossRef]
Fu, K. , Cagan, J. , Kotovsky, K. , and Wood, K. , 2013, “ Discovering Structure in Design Databases Through Functional and Surface Based Mapping,” ASME J. Mech. Des., 135(3), p. 031006. [CrossRef]
Barnett, G. A. , Huh, C. , Kim, Y. , and Park, H. W. , 2011, “ Citations Among Communication Journals and Other Disciplines: A Network Analysis,” Scientometrics, 88(2), pp. 449–469. [CrossRef]
Buitelaar, P. , and Eigner, T. , 2008, “ Topic Extraction From Scientific Literature for Competency Management,” Seventh International Semantic Web Conference, (ISWC), Karlsruhe, Germany, Oct. 26–30, pp. 25–66. http://ceur-ws.org/Vol-403/paper5.pdf
Cambrosio, A. , Keating, P. , Mercier, S. , Lewison, G. , and Mogoutov, A. , 2006, “ Mapping the Emergence and Development of Translational Cancer Research,” Eur. J. Cancer, 42(18), pp. 3140–3148. [CrossRef] [PubMed]
Casper, W. J. , Eby, L. T. , Bordeaux, C. , Lockwood, A. , and Lambert, D. , 2007, “ A Review of Research Methods in IO/OB Work-Family Research,” J. Appl. Psychol., 92(1), pp. 28–43. [CrossRef] [PubMed]
Kajikawa, Y. , Ohno, J. , Takeda, Y. , Matsushima, K. , and Komiyama, H. , 2007, “ Creating an Academic Landscape of Sustainability Science: An Analysis of the Citation Network,” Sustainability Sci., 2(2), pp. 221–231. [CrossRef]
Kajikawa, Y. , and Takeda, Y. , 2009, “ Citation Network Analysis of Organic LEDs,” Technol. Forecasting Soc. Change, 76(8), pp. 1115–1123. [CrossRef]
Watts, D. J. , and Strogatz, S. H. , 1998, “ Collective Dynamics of ‘Small-World’ Networks,” Nature, 393(6684), pp. 440–442. [CrossRef] [PubMed]
Su, D. , 2017, “ Propagation Mergence for Community Detection,” Senior thesis, University of Illinois at Urbana-Champaign, Champaign, IL. https://www.ideals.illinois.edu/bitstream/handle/2142/96023/Propagation_Mergence_Senior_Thesis.pdf?sequence=2&isAllowed=y
Levenshtein, V. I. , 1966, “ Binary Codes Capable of Correcting Deletions, Insertions and Reversals,” Sov. Physics Doklady, 10(8), pp. 707–710.
Hagberg, A. , Schult, D. , and Swart, P. , 2008, “ Exploring Network Structure, Dynamics, and Function Using NetworkX,” Seventh Python in Science Conference (SciPy), Pasadena, CA, Aug. 19–24, pp. 11–15. https://conference.scipy.org/proceedings/scipy2008/paper_2/full_text.pdf
Kaiser, M. , 2008, “ Mean Clustering Coefficients: The Role of Isolated Nodes and Leafs on Clustering Measures for Small-World Networks,” New J. Phys., 10(8), p. 083042. [CrossRef]
El-Kishky, A. , Song, Y. , Wang, C. , Voss, C. R. , and Han, J. , 2014, “ Scalable Topical Phrase Mining From Text Corpora,” Proc. VLDB Endowment, 8(3), pp. 305–316. [CrossRef]
Rose, S. , Engel, D. , Cramer, N. , and Cowley, W. , 2010, “ Automatic Keyword Extraction From Individual Documents,” Text Mining: Applications and Theory, pp. 1–20. [CrossRef]
Loper, E. , and Bird, S. , 2002, “ NLTK: The Natural Language Toolkit,” ACL-02 Workshop on Effective Tools and Methodologies for Teaching Natural Language Processing and Computational Linguistics-Volume 1, Association for Computational Linguistics, pp. 63–70.
Agrawal, R. , and Srikant, R. , 1994, “ Fast Algorithms for Mining Association Rules in Large Databases,” 20th International Conference on Very Large Data Bases, VLDB '94, San Francisco, CA, pp. 487–499.
Hahsler, M. , Grün, B. , and Hornik, K. , 2005, “ Arules—A Computational Environment for Mining Association Rules and Frequent Item Sets,” J. Stat. Software, 14(15), pp. 1–25. [CrossRef]
Agrawal, R. , Imieliński, T. , and Swami, A. , 1993, “ Mining Association Rules Between Sets of Items in Large Databases,” SIGMOD Rec., 22(2), pp. 207–216. [CrossRef]
Anyuru, A. , 2012, Professional Webgl Programming: Developing 3D Graphics for the Web, Wiley, Hoboken, New Jersey.
Cantor, D. , and Jones, B. , 2012, WebGL Beginner's Guide, Packt Publishing, Birmingham, UK.
Parisi, T. , 2012, WebGL: Up and Running, O'Reilly Media, Sebastopol, CA.
Leskovec, J. , Rajaraman, A. , and Ullman, J. D. , 2014, Mining of Massive Datasets, Cambridge University Press, Cambridge, UK. [CrossRef]
Ding, Y. , Yan, E. , Frazho, A. , and Caverlee, J. , 2009, “ PageRank for Ranking Authors in Co-Citation Networks,” J. Am. Soc. Inf. Sci. Technol., 60(11), pp. 2229–2243. [CrossRef]
Ding, Y. , 2011, “ Topic-Based PageRank on Author Cocitation Networks,” J. Am. Soc. Inf. Sci. Technol., 62(3), pp. 449–466.
Chen, P. , Xie, H. , Maslov, S. , and Redner, S. , 2007, “ Finding Sientific Gems With Google's PageRank Algorithm,” J. Informetrics, 1(1), pp. 8–15. [CrossRef]
Yang, Z. , Hong, L. , and Davison, B. D. , 2010, “ Topic-Driven Multi-Type Citation Network Analysis,” 9th International Conference on Adaptivity, Personalization and Fusion of Heterogeneous Information (RIAO), Paris, France, Apr. 28–30, pp. 24–31. https://pdfs.semanticscholar.org/9ac3/4193818fa7a8a2aa51846066d3c7ec7d9d86.pdf
Uzzi, B. , Amaral, L. A. N. , and Reed-Tsochas, F. , 2007, “ Small-World Networks and Management Science Research: A Review,” Eur. Manage. Rev., 4(2), pp. 77–91. [CrossRef]
Collins, R. , and Restivo, S. , 1983, “ Development, Diversity, and Conflict in the Sociology of Science,” Sociol. Q., 24(2), pp. 185–200. [CrossRef]
Moody, J. , 2004, “ The Structure of a Social Science Collaboration Network: Disciplinary Cohesion From 1963 to 1999,” Am. Sociol. Rev., 69(2), pp. 213–238. [CrossRef]
Helen, L. , 2016, “ The Social Dimensions of Scientific Knowledge,” The Stanford Encyclopedia of Philosophy, Edward N. Zalta , ed., Metaphysics Research Lab, Stanford University, Stanford, CA.
Hahsler, M. , and Karpienko, R. , 2016, “ Visualizing Association Rules in Hierarchical Groups,” J. Bus. Econ., 87(3), pp. 1–19.
Wang, G. G. , and Shan, S. , 2007, “ Review of Metamodeling Techniques in Support of Engineering Design Optimization,” ASME J. Mech. Des., 129(4), pp. 370–380. [CrossRef]
Blondel, V. D. , Guillaume, J.-L. , Lambiotte, R. , and Lefebvre, E. , 2008, “ Fast Unfolding of Communities in Large Networks,” J. Stat. Mech.: Theory Exp., 2008(10), p. 10008. [CrossRef]
Klosik, D. F. , and Bornholdt, S. , 2014, “ The Citation Wake of Publications Detects Nobel Laureates' Papers,” PloS One, 9(12), p. e113184. [CrossRef] [PubMed]
Herrera, M. , Roberts, D. C. , and Gulbahce, N. , 2010, “ Mapping the Evolution of Scientific Fields,” PloS One, 5(5), p. e10355. [CrossRef] [PubMed]
Centola, D. , 2015, “ The Social Origins of Networks and Diffusion,” Am. J. Sociol., 120(5), pp. 1295–1338. [CrossRef] [PubMed]
Greenberg, S. , 2009, “ How Citation Distortions Create Unfounded Authority: Analysis of a Citation Network,” BMJ, 339, pp. 210–213. [CrossRef]
Symon, R.J. , and Dangerfield, K.J. , 1980, “ Application of Design to Cost in Engineering and Manufacturing,” NATO AGARD Lecture Series, the Application of Design to Cost and Life Cycle Cost to Aircraft Engines, Vol. 107, pp. 15–16.
Barton, J. A. , Love, D. M. , and Taylor, G. D. , 2001, “ Design Determines 70% of Cost? a Review of Implications for Design Evaluation,” J. Eng. Des., 12(1), pp. 47–58. [CrossRef]
Papalambros, P. Y. , 2015, “ Design Science: Why, What and How,” Des. Sci., 1, pp. 1–38. [CrossRef]
Fadel, G. , Mocko, G. , and Summers, J. , 2015, “ NSF Sponsored Engineering Design and Systems Engineering Foundations Workshop (November 14–17, 2015),” accessed July 14, 2018, http://www.clemson.edu/centers-institutes/design/workshop/
Jiao, R. , and Choi, S. , 2017, “ NSF ESD/SYS Program Workshop and Grantees Meeting: Future Directions in Engineering Design and Systems Engineering,” accessed July 14, 2018, http://nsfworkshop.gatech.edu/


Grahic Jump Location
Fig. 1

Main topic frequency plot

Grahic Jump Location
Fig. 2

Subtopic frequency plot

Grahic Jump Location
Fig. 3

Main topic chronological evolution

Grahic Jump Location
Fig. 4

Subtopic chronological evolution

Grahic Jump Location
Fig. 10

Citation network for sustainable energy system design

Grahic Jump Location
Fig. 5

Main topic correlation

Grahic Jump Location
Fig. 6

Subtopic correlation

Grahic Jump Location
Fig. 7

Main topic and subtopic correlation

Grahic Jump Location
Fig. 8

Average in-degree for main topics

Grahic Jump Location
Fig. 9

Average in-degree for subtopics

Grahic Jump Location
Fig. 13

Two significant clusters identified using PM: (a) cluster 4: design for market systems and (b) cluster 5: visualization

Grahic Jump Location
Fig. 11

Scatter plot for association rules of the main topics

Grahic Jump Location
Fig. 12

Group matrix-based visualization for main topics



Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In