DOCSLIB.ORG

Community Detection in Social Networks: an In-Depth Benchmarking Study with a Procedure-Oriented Framework ∗

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Community Detection in Social Networks: an In-Depth Benchmarking Study with a Procedure-Oriented Framework ∗ Community Detection in Social Networks: An In-depth Benchmarking Study with a Procedure-Oriented Framework ∗ Meng Wang1, Chaokun Wang1, Jeffrey Xu Yu2, Jun Zhang1 1 Tsinghua University, Beijing 100084, China 2 The Chinese University of Hong Kong, Hong Kong, China fmeng-wang12, [email protected], [email protected], [email protected] ABSTRACT graphs from the entire graph [26]. Since networks are usually mod- Revealing the latent community structure, which is crucial to un- eled as graphs, detecting communities in multifarious networks is derstanding the features of networks, is an important problem in also known as the graph partition problem in modern graph theory network and graph analysis. During the last decade, many ap- [7,2], as well as the graph clustering [1] or dense subgraph discov- proaches have been proposed to solve this challenging problem in ery problem [16] in the graph mining area. In the last decade, lots diverse ways, i.e. different measures or data structures. Unfortu- of solutions have emerged in the literature [5,9, 19, 24, 14, 25, 12, nately, experimental reports on existing techniques fell short in va- 3, 29,4, 11], trying to solve this problem from various perspectives. lidity and integrity since many comparisons were not based on a The extensive research work has promoted the prosperity of the unified code base or merely discussed in theory. family of community detection approaches. However, it also raises We engage in an in-depth benchmarking study of community de- a new difficulty, how to choose the most appropriate approach in tection in social networks. We formulate a generalized community specific scenarios, since many latest approaches have not been com- detection procedure and propose a procedure-oriented framework pared with each other upon unified platforms with same datasets for benchmarking. This framework enables us to evaluate and com- and uniform configurations. Given the huge diversity of various pare various approaches to community detection systematically and approaches, it is usually not easy to analyze, compare and eval- thoroughly under identical experimental conditions. Upon that we uate the extensive existing work. In this sense, a general bench- can analyze and diagnose the inherent defect of existing approaches mark for community detection is quite necessary and beneficial. deeply, and further make effective improvements correspondingly. In this paper, we make a benchmarking study for community de- We have re-implemented ten state-of-the-art representative al- tection, which contains a universal procedure-oriented framework gorithms upon this framework and make comprehensive evalua- and a comprehensive evaluation system. Upon that, we are able tions of multiple aspects, including the efficiency evaluation, per- to analyze, evaluate, diagnose and further improve the existing ap- formance evaluations, sensitivity evaluations, etc. We discuss their proaches thoroughly, and get interesting and credible conclusions. merits and faults in depth, and draw a set of take-away interesting 1.1 Challenges conclusions. In addition, we present how we can make diagnoses An in-depth benchmarking study for community detection is non- for these algorithms resulting in significant improvements. trivial and poses a set of unique challenges. Firstly, considering the various existing approaches, the lack of a 1. INTRODUCTION procedure-oriented framework for community detection makes it a Intrinsic community structures are possessed by many real-world puzzle to understand, compare and diagnose them. Since these ap- networks, e.g. biological data, communication networks and social proaches are of various categories, a universal framework of com- graphs, to name but a few. Given a network, it is particularly in- munity detection is quite difficult to be summarized and abstracted. teresting as well as challenging to detect the inherent and hidden Secondly, to make a fair comparison and build a general bench- communities. Communities, which have no quantitative definition, mark for evaluation, it is a necessity to re-implement different ap- are also called clusters. They are usually considered as groups proaches of various categories based on a common code base. Ac- of nodes, in which intra-group connections are much denser than tually, the re-implementation is really a tough work. those inter-group ones. Just as many classic puzzles, community Finally, when proposing a new approach, authors often testify detection is intuitive at first sight but actually an intricate problem. their work via limited metrics that perform well. In our benchmark- Community detection [8] aims at grouping nodes in accordance ing evaluation, we need a suite of metrics which can embody full with the relationships among them to form strongly linked sub- structural characteristics of communities to evaluate the approaches as comprehensively and thoroughly as possible. ∗Corresponding author: Chaokun Wang. There exist two pieces of research work similar to ours. Yang This work is licensed under the Creative Commons Attribution- et al. only investigated the performances of different metrics for NonCommercial-NoDerivs 3.0 Unported License. To view a copy of this li- communities with ground-truth [28]. Xie et al. made an evaluation cense, visit http://creativecommons.org/licenses/by-nc-nd/3.0/. Obtain per- on overlapping community detection [27]. However, they failed to mission prior to any use beyond those covered by the license. Contact present a universal framework. Instead, we conduct a systematic copyright holder by emailing [email protected]. Articles from this volume in-depth benchmarking study to solve the above challenges. were invited to present their results at the 41st International Conference on Very Large Data Bases, August 31st - September 4th 2015, Kohala Coast, 1.2 General Benchmark Hawaii. Proceedings of the VLDB Endowment, Vol. 8, No. 10 In this paper, we have designed a benchmark for community de- Copyright 2015 VLDB Endowment 2150-8097/15/06. tection. As shown in Fig.1, our benchmark consists of four core 998 The remainder of this paper is organized as follows. We formu- Efficiency Distribution Quantity DIagnosis 1 late the problem of community detection and sketch out existing Effectiveness Accuracy Outliers Diagnosis 2 work in Sec.2. In Sec.3 we propose a universal framework for Density Overlapping ... benchmarking in community detection, and then in Sec.4 we map Diagnoses ... Evaluation the existing approaches to the framework. Afterwards we present how to make targeted diagnoses based on the framework in Sec.5. Initialization Transformation Construction We evaluate these approaches with our benchmark and report the results and findings in Sec.6, and conclude this study in Sec.7. Collect Select Update Fluctuate PreCompute FirstAllocate MultiLevelDraft 2. PRELIMINARY AND BACKGROUND Extract Loop Conditions As preliminaries, we first define basic concepts and the problem Detection Framework of community detection, and then review the existing approaches. 2.1 Problem Definition Algorithms Configurations Datasets Graph Model Setup Social Networks.A social network with n individuals and m social ties can be denoted as G(V;E), where V is the set of nodes, Figure 1: Benchmark for community detection jVj = n, and E is the set of undirected relationships, E ⊆ V ×V, modules: (1) Setup, including a set of algorithms (Sec. 2.2), real- jEj = m. A social network is also referred to herein as a graph. world and synthetic datasets (Sec. 6.1), parameter configurations Communities. Non-overlapping communities are not confined to (Sec. 6.2), and a unified graph model converted from the datasets; a graph partition, and clusters which incompletely cover the graph (2) Detection Framework, a generalized detection procedure with are usually more desirable. Here we define the communities as 0 0 high abstraction of the common workflow of community detection a list of non-empty node subsets: Coms = fV1;··· ;Vcng, where (the details of the framework are introduced in Sec.3; the proce- Scn 0 i=1Vi ⊆ V, and cn is the total number of communities. Please dure mappings in Sec.4); (3) Diagnoses, which provide targeted 0 T 0 note Coms should try to satisfy Vi Vj = /0.A community is also diagnoses on these algorithms based on our framework, leading referred to as a cluster or a part. to directions of improvement over the existing work (Sec.5); (4) Outliers. Since community detection does not force each node Evaluation, a comprehensive evaluation system for community de- into a certain group, some independent nodes, which cannot be tection from different aspects (Sec. 6.3–6.11). grouped into any communities, are allowed far outside the detected The benchmark contains a universal framework which abstracts 0 groups [13]. We define them as outliers: Outs = fvjv 2 V; V 2 the key factors, phases and steps from many approaches to com- @ i 0 Scn 0 munity detection tasks, and makes it easy to implement classical or Coms ^ v 2 Vi g = V − i=1Vi . It is worth mentioning that outliers latest algorithms for comparison. Moreover, it consists of a com- can be directly identified by original algorithms or be produced by prehensive suite of widely-recognized metrics for evaluation of var- disbanding the tiny groups, whose sizes are less than the predefined ious concerned aspects, including the efficiency evaluation on the threshold of minimal valid size (mvs) of communities. time cost, performance evaluations on accuracy and effectiveness, PROBLEM DEFINITION 1. Generally, given a network G(V;E), sensitivity evaluations on network density and mixture degree, and and an mvs, the community detection problem aims at finding the additional evaluations on community distribution and the ability to optimal community assignment R(Coms;Outs) from G, s.t. (1) Coms avoid excessive outliers. By modularizing and separating key fac- \Outs = /0 and (2) Coms [ Outs = V. Herein the optimal assign- tors and steps, our framework allows us to study the strength and ment refers to closely connected groups of nodes (Coms) and a weakness of each algorithm thoroughly, and make diagnoses and moderate number of disparate outliers (Outs).
Load more

Recommended publications
  • Detecting Statistically Significant Communities
    1 Detecting Statistically Significant Communities Zengyou He, Hao Liang, Zheng Chen, Can Zhao, Yan Liu Abstract—Community detection is a key data analysis problem across different fields. During the past decades, numerous algorithms have been proposed to address this issue. However, most work on community detection does not address the issue of statistical significance. Although some research efforts have been made towards mining statistically significant communities, deriving an analytical solution of p-value for one community under the configuration model is still a challenging mission that remains unsolved. The configuration model is a widely used random graph model in community detection, in which the degree of each node is preserved in the generated random networks. To partially fulfill this void, we present a tight upper bound on the p-value of a single community under the configuration model, which can be used for quantifying the statistical significance of each community analytically. Meanwhile, we present a local search method to detect statistically significant communities in an iterative manner. Experimental results demonstrate that our method is comparable with the competing methods on detecting statistically significant communities. Index Terms—Community Detection, Random Graphs, Configuration Model, Statistical Significance. F 1 INTRODUCTION ETWORKS are widely used for modeling the structure function that is able to always achieve the best performance N of complex systems in many fields, such as biology, in all possible scenarios. engineering, and social science. Within the networks, some However, most of these objective functions (metrics) do vertices with similar properties will form communities that not address the issue of statistical significance of commu- have more internal connections and less external links.
    [Show full text]
  • Society, Community, and Development: a Tale of Two Regions
    Michael Storper, Lena Lavinas and Alejandro Mercado- Célis Society, community, and development: a tale of two regions Book section Original citation: Originally published in Polenske, Karen, The economic geography of innovation. Cambridge, UK : Cambridge University Press, 2007, pp. 310-339. © 2007 Cambridge University Press This version available at: http://eprints.lse.ac.uk/4882/ Available in LSE Research Online: May 2008 LSE has developed LSE Research Online so that users may access research output of the School. Copyright © and Moral Rights for the papers on this site are retained by the individual authors and/or other copyright owners. Users may download and/or print one copy of any article(s) in LSE Research Online to facilitate their private study or for non-commercial research. You may not engage in further distribution of the material or use it for any profit-making activities or any commercial gain. You may freely distribute the URL (http://eprints.lse.ac.uk) of the LSE Research Online website. This document is the author’s submitted version of the book section. There may be differences between this version and the published version. You are advised to consult the publisher’s version if you wish to cite from it. 0 SOCIETY, COMMUNITY AND DEVELOPMENT:1 A Tale of Two Regions Michael Storper Lena Lavinas Alejandro Mercado Célis Storper: Institut d’Etudes Politiques de Paris and London School of Economics Lavinas : Institute of Economics, Federal University of Rio de Janeiro ([email protected]) Mercado : Universidad Nacional Autónoma
    [Show full text]
  • Common Course Outline for SOCL
    Common Course Outline SOCL 101 Introduction to Sociology 3 Credits Community College of Baltimore County Description SOCL 101 – 3 credits – Introduction to Sociology examines social interactions and the use of sociological perspectives to explain the individual relationships , as well as interactions among the groups and societies that shape them. It covers basic concepts such as culture, socialization, social inequality, social power, deviance, social control, institutions, and global issues. 3 credits Prerequisites: ACLT 052 or ACLT 053 Overall Course Objectives Upon completion of this course students will be able to: 1. assess the sociological perspective and its development in studying human behavior; 2. compare and contrast the macro and micro sociological approaches in examining social structure and social interaction; 3. evaluate the importance of social institutions including marriage, family, the media, educational, political and economic structures in a diverse and global society; 4. evaluate major sociological theories by focusing on the main concepts, ideas and critical assessment of each theory from a historical, social and political context; 5. apply the sociological perspective when using technology to evaluate and validate information; 6. find, evaluate, use, and cite appropriate academic resources related to sociological topics; 7. apply the steps in the scientific research process, utilizing technology and appropriate academic resources, to analyze or design a sociological study; 8. examine the nature of culture, subcultures, social norms, ethnocentrism, and cultural relativism with a focus on diversity appreciation and ethical awareness; 9. describe the theories and processes of socialization on the development of the self and lifelong learning; 10. assess patterns of social interaction using the concepts: status, role, primary group, and secondary group; 11.
    [Show full text]
  • Human Services and Community Justice
    BACHELOR OF SCIENCE IN MAJOR HUMAN SERVICES AND COMMUNITY JUSTICE DEPARTMENT OF COUNSELING AND HUMAN SERVICES 524 West 59th Street, New York, NY 10019 ¢ New Building, 8.65.26 ¢ 212-393-6883 www.jjay.cuny.edu/department-counseling-human-services See all major requirements at: www.jjay.cuny.edu/human-services-and-community-justice-major-resources WHAT WILL YOU LEARN IN THIS MAJOR? The Human Services and Community Justice (HSCJ) major is designed to train students in the practice and theory of human services. Students in the major will progress through a series of required core courses, designed to prepare them to be self-reflective, competent and compas- sionate practitioners, change agents, advocates, and community lead- ers. Students will examine issues of social, racial, and economic injustice, and the challenges encountered by diverse and underserved populations in society. Through multidisciplinary coursework, students will develop a rich appreciation for diverse human systems and interventions, justice and advocacy, and policy and administration, promoting a “just” society. IN THIS MAJOR YOU WILL nnn FIRST COURSES IN THE MAJOR nnn Read journal articles and textbooks. CHS 150: Foundations of Human Services Understand human services values, attitudes and Counseling ethics and their appropriate application in practice to AFR 145: Introduction to Community Justice culture, ethnicity, race, class, gender, religion/spiritual- in Human Systems ity, ability, sexual orientation, and other expressions of AFR 227: Community Based Approaches diversity. to Justice Engage with diverse faculty and social and advocacy CHS 230: Culture, Direct Services & Community groups, examining the dynamics of power, values Practice and equity of public service, civic activism and CHS 235: Theories of Assessment and transformational organizational change.
    [Show full text]
  • Centrality in Modular Networks
    Ghalmane et al. EPJ Data Science (2019)8:15 https://doi.org/10.1140/epjds/s13688-019-0195-7 REGULAR ARTICLE OpenAccess Centrality in modular networks Zakariya Ghalmane1,3, Mohammed El Hassouni1, Chantal Cherifi2 and Hocine Cherifi3* *Correspondence: hocine.cherifi@u-bourgogne.fr Abstract 3LE2I, UMR6306 CNRS, University of Burgundy, Dijon, France Identifying influential nodes in a network is a fundamental issue due to its wide Full list of author information is applications, such as accelerating information diffusion or halting virus spreading. available at the end of the article Many measures based on the network topology have emerged over the years to identify influential nodes such as Betweenness, Closeness, and Eigenvalue centrality. However, although most real-world networks are made of groups of tightly connected nodes which are sparsely connected with the rest of the network in a so-called modular structure, few measures exploit this property. Recent works have shown that it has a significant effect on the dynamics of networks. In a modular network, a node has two types of influence: a local influence (on the nodes of its community) through its intra-community links and a global influence (on the nodes in other communities) through its inter-community links. Depending on the strength of the community structure, these two components are more or less influential. Based on this idea, we propose to extend all the standard centrality measures defined for networks with no community structure to modular networks. The so-called “Modular centrality” is a two-dimensional vector. Its first component quantifies the local influence of a node in its community while the second component quantifies its global influence on the other communities of the network.
    [Show full text]
  • What Is Social Capital?
    OECD Insights: Human Capital What is social capital? The concept of social capital became fashionable only relatively recently, but the term has been in use for almost a century while the ideas behind it go back further still. “Social capital” may first have appeared in a book published in 1916 in the United States that dis- cussed how neighbours could work together to oversee schools. Author Lyda Hanifan referred to social capital as “those tangible assets [that] count for most in the daily lives of people: namely goodwill, fellowship, sympathy, and social intercourse among the individuals and families who make up a social unit”. That gives some sense of what’s meant by social capital, although today it would be hard to come up with a single definition that sat- isfied everyone. For the sake of simplicity, however, we can think of social capital as the links, shared values and understandings in society that enable individuals and groups to trust each other and so work together. In recent years, the term entered the popular imagination with the publication in 2000 of Robert Putnam’s bestseller, Bowling Alone: The Collapse and Revival of American Community. Putnam argued that while Americans have become wealthier their sense of commu- nity has withered. Cities and traditional suburbs have given way to “edge cities” and “exurbs” – vast, anonymous places where people sleep and work and do little else. As people spend more and more time in the office, commuting to work and watching TV alone, there’s less time for joining community groups and voluntary organ- isations, and socialising with neighbours, friends and even family.
    [Show full text]
  • Incorporating Network Structure with Node Contents for Community Detection on Large Networks Using Deep Learning
    Neurocomputing 297 (2018) 71–81 Contents lists available at ScienceDirect Neurocomputing journal homepage: www.elsevier.com/locate/neucom Incorporating network structure with node contents for community detection on large networks using deep learning ∗ Jinxin Cao a, Di Jin a, , Liang Yang c, Jianwu Dang a,b a School of Computer Science and Technology, Tianjin University, Tianjin 300350, China b School of Information Science, Japan Advanced Institute of Science and Technology, Ishikawa 923-1292, Japan c School of Computer Science and Engineering, Hebei University of Technology, Tianjin 300401, China a r t i c l e i n f o a b s t r a c t Article history: Community detection is an important task in social network analysis. In community detection, in gen- Received 3 June 2017 eral, there exist two types of the models that utilize either network topology or node contents. Some Revised 19 December 2017 studies endeavor to incorporate these two types of models under the framework of spectral clustering Accepted 28 January 2018 for a better community detection. However, it was not successful to obtain a big achievement since they Available online 2 February 2018 used a simple way for the combination. To reach a better community detection, it requires to realize a Communicated by Prof. FangXiang Wu seamless combination of these two methods. For this purpose, we re-examine the properties of the mod- ularity maximization and normalized-cut models and fund out a certain approach to realize a seamless Keywords: Community detection combination of these two models. These two models seek for a low-rank embedding to represent of the Deep learning community structure and reconstruct the network topology and node contents, respectively.
    [Show full text]
  • Review of Community Detection Over Social Media: Graph Prospective
    (IJACSA) International Journal of Advanced Computer Science and Applications, Vol. 10, No. 2, 2019 Review of Community Detection over Social Media: Graph Prospective Pranita Jain1, Deepak Singh Tomar2 Department of Computer Science Maulana Azad National Institute of Technology Bhopal, India 462001 Abstract—Community over the social media is the group of globally distributed end users having similar attitude towards a particular topic or product. Community detection algorithm is used to identify the social atoms that are more densely interconnected relatively to the rest over the social media platform. Recently researchers focused on group-based algorithm and member-based algorithm for community detection over social media. This paper presents comprehensive overview of community detection technique based on recent research and subsequently explores graphical prospective of social media mining and social theory (Balance theory, status theory, correlation theory) over community detection. Along with that this paper presents a comparative analysis of three different state of art community detection algorithm available on I-Graph package on python i.e. walk trap, edge betweenness and fast greedy over six different social media data set. That yield intersecting facts about the capabilities and deficiency of community analysis methods. Fig 1. Social Media Network. Keywords—Community detection; social media; social media Aim of Community detection is to form group of mining; homophily; influence; confounding; social theory; homogenous nodes and figure out a strongly linked subgraphs community detection algorithm from heterogeneous network. In strongly linked sub- graphs (Community structure) nodes have more internal links than I. INTRODUCTION external. Detecting communities in heterogeneous networks is The Emergence of Social networking Site (SNS) like Face- same as, the graph partition problem in modern graph theory book, Twitter, LinkedIn, MySpace, etc.
    [Show full text]
  • Closeness Centrality for Networks with Overlapping Community Structure
    Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (AAAI-16) Closeness Centrality for Networks with Overlapping Community Structure Mateusz K. Tarkowski1 and Piotr Szczepanski´ 2 Talal Rahwan3 and Tomasz P. Michalak1,4 and Michael Wooldridge1 2Department of Computer Science, University of Oxford, United Kingdom 2 Warsaw University of Technology, Poland 3Masdar Institute of Science and Technology, United Arab Emirates 4Institute of Informatics, University of Warsaw, Poland Abstract One aspect of networks that has been largely ignored in the literature on centrality is the fact that certain real-life Certain real-life networks have a community structure in which communities overlap. For example, a typical bus net- networks have a predefined community structure. In public work includes bus stops (nodes), which belong to one or more transportation networks, for example, bus stops are typically bus lines (communities) that often overlap. Clearly, it is im- grouped by the bus lines (or routes) that visit them. In coau- portant to take this information into account when measur- thorship networks, the various venues where authors pub- ing the centrality of a bus stop—how important it is to the lish can be interpreted as communities (Szczepanski,´ Micha- functioning of the network. For example, if a certain stop be- lak, and Wooldridge 2014). In social networks, individuals comes inaccessible, the impact will depend in part on the bus grouped by similar interests can be thought of as members lines that visit it. However, existing centrality measures do not of a community. Clearly for such networks, it is desirable take such information into account. Our aim is to bridge this to have a centrality measure that accounts for the prede- gap.
    [Show full text]
  • A Centrality Measure for Networks with Community Structure Based on a Generalization of the Owen Value
    ECAI 2014 867 T. Schaub et al. (Eds.) © 2014 The Authors and IOS Press. This article is published online with Open Access by IOS Press and distributed under the terms of the Creative Commons Attribution Non-Commercial License. doi:10.3233/978-1-61499-419-0-867 A Centrality Measure for Networks With Community Structure Based on a Generalization of the Owen Value Piotr L. Szczepanski´ 1 and Tomasz P. Michalak2 ,3 and Michael Wooldridge2 Abstract. There is currently much interest in the problem of mea- cated — approaches have been considered in the literature. Recently, suring the centrality of nodes in networks/graphs; such measures various methods for the analysis of cooperative games have been ad- have a range of applications, from social network analysis, to chem- vocated as measures of centrality [16, 10]. The key idea behind this istry and biology. In this paper we propose the first measure of node approach is to consider groups (or coalitions) of nodes instead of only centrality that takes into account the community structure of the un- considering individual nodes. By doing so this approach accounts for derlying network. Our measure builds upon the recent literature on potential synergies between groups of nodes that become visible only game-theoretic centralities, where solution concepts from coopera- if the value of nodes are analysed jointly [18]. Next, given all poten- tive game theory are used to reason about importance of nodes in the tial groups of nodes, game-theoretic solution concepts can be used to network. To allow for flexible modelling of community structures, reason about players (i.e., nodes) in such a coalitional game.
    [Show full text]
  • Chapter 4 : Developing a Community Profile
    CHAPTER 4 : DEVELOPING A COMMUNITY PROFILE The community profile is a summary of baseline conditions and trends in a community and study area. It establishes the context for assessing potential impacts and for project decision-making. Developing a community profile involves identifying community issues and attitudes, locating notable features in the study area, and assessing social and economic conditions and trends in the community and region that have a bearing on the project. Preparing a community profile is often an iterative process. Although some information can be collected early project development, other important information about the community may not be uncovered until later in project development or production. Information can be collected both from primary sources, such as interviews or field surveys, and secondary sources, such as comprehensive plans or newspaper articles. The nature of the data collection effort and the level of documentation required will vary according to the project. For major or controversial projects, information on the community might feed into the Baseline Conditions section of the CIA technical report. For other less extensive projects, a brief summary of key issues and baseline data could be included in the project files. This chapter provides a general process for developing a community profile (see Figure 4-1). It addresses major elements for consideration, where and how to get the information, and suggestions on documenting the information. A checklist, summarizing the various elements of a community profile, appears at the end of this chapter. It is intended as a guide for collecting relevant data, recognizing that not all of this information will be relevant for every project.
    [Show full text]
  • Community and Environmental Sociology 1
    Community and Environmental Sociology 1 COMMUNITY AND DEGREES/MAJORS/CERTIFICATES • Community and Environmental Sociology, B.S. (http:// ENVIRONMENTAL guide.wisc.edu/undergraduate/agricultural-life-sciences/community- environmental-sociology/community-environmental-sociology-bs/) SOCIOLOGY • Food Systems, Certificate (http://guide.wisc.edu/undergraduate/ agricultural-life-sciences/community-environmental-sociology/food- Sociologists study human social behavior and how societies are systems-certificate/) organized. The Department of Community and Environmental Sociology’s focus is on the relationship between people and their natural environment and with the communities in which people live, work, and play. PEOPLE A major in Community and Environmental Sociology is good preparation for jobs that involve an understanding of social issues, require knowledge PROFESSORS of the functioning and organization of communities and the relationship Michael Bell (chair), Katherine Curtis, Nan Enstad, Randy Stoecker between people and the natural environment, and involve data collection or data analysis. Community and Environmental Sociology graduates ASSOCIATE PROFESSORS may be employed in nongovernmental organizations (NGOs) that Samer Alatout, Noah Feinstein, Monica White focus on a number of issues surrounding community development, environment, and advocacy, governmental planning or social service ASSISTANT PROFESSORS agencies, agricultural or environmental organizations, and cooperative Josh Garoon, Sarah Rios or agribusiness enterprises. A major in Community and Environmental Sociology also provides excellent preparation for careers in international EMERITUS PROFESSORS development, law, and further academic work in sociology or other social Jane Collins, Glenn Fuguitt, Jess Gilbert, Gary Green, Tom Heberlein, sciences. Daniel Kleinman, Jack Kloppenburg, Gene Summers, Leann Tigges, Paul Voss The Department of Community and Environmental Sociology offers a wide range of courses for both beginning and advanced students.
    [Show full text]