Shared more. Cited more. Safe forever.
    • advanced search
    • submit works
    • about
    • help
    • contact us
    • login
    View Item 
    •   MOspace Home
    • University of Missouri-Columbia
    • Graduate School - MU Theses and Dissertations (MU)
    • Theses and Dissertations (MU)
    • Dissertations (MU)
    • 2016 Dissertations (MU)
    • 2016 MU dissertations - Freely available online
    • View Item
    •   MOspace Home
    • University of Missouri-Columbia
    • Graduate School - MU Theses and Dissertations (MU)
    • Theses and Dissertations (MU)
    • Dissertations (MU)
    • 2016 Dissertations (MU)
    • 2016 MU dissertations - Freely available online
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.
    advanced searchsubmit worksabouthelpcontact us

    Browse

    All of MOspaceCommunities & CollectionsDate IssuedAuthor/ContributorTitleIdentifierThesis DepartmentThesis AdvisorThesis SemesterThis CollectionDate IssuedAuthor/ContributorTitleIdentifierThesis DepartmentThesis AdvisorThesis Semester

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular AuthorsStatistics by Referrer

    Applications of network analysis in psychology

    Hoffman, Michaela
    View/Open
    [PDF] public.pdf (2.166Kb)
    [PDF] research.pdf (1.457Mb)
    [PDF] short.pdf (4.719Kb)
    Date
    2016
    Format
    Thesis
    Metadata
    [+] Show full item record
    Abstract
    Methods and applications for network analysis can be found in a variety fields from computer science and machine learning to sociology and political science. Here I describe some methodological issues and propositions for the network analysis of data, especially in the field of psychology. Chapters one and two focus on the task of community detection, where the goal is to identify meaningful subgroups of highly connected individuals within a network, particularly in the smaller-sized network data sets of the social sciences. Chapter one describes current methodology and proposes a new community detection algorithm. This method is based on the Cohen's [kappa] similarity measure reflecting how alike two observations are in terms of their connections in the network. Through a simulation and a demonstration on real network data, this method is shown to outperform current methodology. The second chapter extends the use of the Cohen's kappa measure for community detection as a way to determine if the data exhibits community structure. Chapter three looks at a specific application of network analysis in psychology: creating networks of diagnostic criteria from survey data. The methodology discussed in this paper begins with the criteria as binary variables, indicating whether each subject in the data exhibits each criterion or not. From this data networks are constructed where the criteria make up the vertices, and the edges are estimated from their concurrence in the subjects. This study provides a cautionary remark for the use of this methodology on large data sets, as the estimates of similarity between variables might be inflated by the presence of large numbers of observations who exhibit none of the criteria.
    URI
    https://hdl.handle.net/10355/56530
    https://doi.org/10.32469/10355/56530
    Degree
    Ph. D.
    Thesis Department
    Psychology (MU)
    Rights
    OpenAccess
    This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 License.
    Collections
    • 2016 MU dissertations - Freely available online
    • Psychological Sciences electronic theses and dissertations (MU)

    Send Feedback
    hosted by University of Missouri Library Systems
     

     


    Send Feedback
    hosted by University of Missouri Library Systems