Exploring Network Behavior Using Cluster Analysis
Rong Rong () and
Daniel Houser ()
Additional contact information
Rong Rong: Department of Economics, Weber State University
No 1049, Working Papers from George Mason University, Interdisciplinary Center for Economic Science
Innovation occurs in network environments. Identifying the important players in the innovative Â process, Â namely Â â€œthe Â innovatorsâ€ , Â is Â key to understanding the process of innovation. Doing this requires flexible analysis tools tailored to work well with complex datasets generated within such environments. One such tool, cluster analysis, organizes a large data set into discrete groups based on patterns of similarity. It can be used to discover data patterns in networks without requiring strong ex ante assumptions about the properties of either the data generating process or the environment. This paper reviews key procedures and algorithms related to cluster analysis. Further, it demonstrates how to choose among these methods to identify the characteristics of players in a network experiment where innovation emerges endogenously. Length: 30
Keywords: cluster analysis; k-means algorithm; innovation; networks; laboratory experiment (search for similar items in EconPapers)
JEL-codes: C46 C81 (search for similar items in EconPapers)
New Economics Papers: this item is included in nep-cmp, nep-cse, nep-gth, nep-ino, nep-knm and nep-sbm
References: Add references at CitEc
Citations: Track citations by RSS feed
Downloads: (external link)
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:gms:wpaper:1049
Access Statistics for this paper
More papers in Working Papers from George Mason University, Interdisciplinary Center for Economic Science Contact information at EDIRC.
Bibliographic data for series maintained by Shams Bahabib ().