networks in psychology linguistics education cse 5339
play

Networks in Psychology/Linguistics/Education CSE 5339: Topics in - PowerPoint PPT Presentation

Networks in Psychology/Linguis5cs/Educa5on Networks in Psychology/Linguistics/Education CSE 5339: Topics in Network Data Analysis Networks in Psychology/Linguis5cs/Educa5on Content Cogni5ve Models (3) Associa5onism Four Laws of


  1. Networks in Psychology/Linguis5cs/Educa5on ì Networks in Psychology/Linguistics/Education CSE 5339: Topics in Network Data Analysis

  2. Networks in Psychology/Linguis5cs/Educa5on Content Cogni5ve Models (3) • Associa5onism • Four Laws of Associa5onism • Connec5onism • Opposi5on Networks in Linguis5cs (7) Sociolinguis5cs (8) • Theory • Applica5on 1 • Applica5on 2 Natural Language Processing (12) Mental Lexicon Networks (13) Networks in Educa5on Bibliography Ques5ons and Comments

  3. Networks in Psychology/Linguis5cs/Educa5on Associationism “Some of our ideas have a natural correspondence and connec5on with one another: it is the office of excellency of our reason to trace these…” –John Locke This theory considers the connec5ons between experiences as a model for human cogni5on. ì There is debate over the founder of this theory: ì Some claim it comes from Plato, and is found in the works of Aristotle (Boeree, 2000). ì Others give credit to philosopher John Locke in his second book of “An Essay Concerning Human ì Understanding” (Warren, 1921). These models are limited to linear progressions which are represented by path graphs (Elman, 1996). ì Defini5on: A path graph with ver5ces listed in the order v 1 , v 2 , …, v n , only has edges { v i , v i +1 } where i = 1, 2, …, n − 1.

  4. Networks in Psychology/Linguis5cs/Educa5on Four Laws of Association Aristotle considered the following four laws related to associa5ons (Boeree, 2000): 1. The law of con.guity . Things or events that occur close to each other in space or 5me tend to get linked ì together in the mind. For example, if you think of a cup, you may think of a saucer; if you think of making coffee, you may then think of drinking that coffee. 2. The law of frequency . The more ogen two things or events are linked, the more powerful will be that ì associa5on. For example, if you have an éclair with your coffee every day, and have done so for the last twenty years, the associa5on will be strong indeed -- and you will be fat. 3. The law of similarity . If two things are similar, the thought of one will tend to trigger the thought of the ì other. For example, if you think of one twin, it is hard not to think of the other. If you recollect one birthday, you may find yourself thinking about others as well. 4. The law of contrast . On the other hand, seeing or recalling something may also trigger the recollec5on of ì something completely opposite. For example, if you think of the tallest person you know, you may suddenly recall the shortest one as well. If you are thinking about birthdays, the one that was totally different from all the rest is quite likely to come up.

  5. Networks in Psychology/Linguis5cs/Educa5on Connectionism “’The mul5-layer nets connec5onists use are nonlinear dynamical systems, and nonlinear systems can learn rela5onships of considerable complexity.’” (Elman, 1996). This theory is ini5ally credited to psychologist Donald Hebb (Elman, 1996). He is well ì known in computa5onal neuroscience for the Hebbian Learning Rule. It considers more complex connec5ons for models for human cogni5on when compared ì to Associa5onism. Many Connec5onists consider biological plausibility when crea5ng models. ì Neural networks are a common tool used by Connec5onists. ì

  6. Networks in Psychology/Linguis5cs/Educa5on Opposition Assump5ons are made for the Connec5onist theory. They do not completely agree with the following two theories: Theory of Na5vism/Inna5sm: These theories consider the possibility of preexis5ng ì cogni5ve func5ons not developed by the associa5on of experiences. This argument is similar to that of nature vs. nature (Pinker, 2002). ì Theory of Systema5city: This theory is difficult to explain, see (Cummins, 1996; or Pullum ì & Scholz, 2007)

  7. Networks in Psychology/Linguis5cs/Educa5on Networks in Linguistics ì Sociolinguis5cs — Social Networks ì Natural Language Processing ì Mental Lexicon Networks

  8. Networks in Psychology/Linguis5cs/Educa5on Sociolinguistics This subfield of linguis5cs broadly considers the following ([Editorial], 1997): ì Socially grounded research into linguis5c varie5es; ì textual and discourse processes; and ì linguis5c and other communica5ve aspects of social life. ì There is thought to be overlap with linguis5c anthropolgy (Gumperz & Cook-Gumperz, ì 2008). The use of social networks has played an important role in the development of graph ì theory.

  9. Networks in Psychology/Linguis5cs/Educa5on Social Networks (Theory) As an early example of introducing graph theory to the study of social networks, and vice versa, Cartwright and Harary ì (1956), describe a process for crea5ng networks: Considers balances necessary to describe rela5ons (edges) in social networks, referred to as Heider’s ì Concep5on of Balance theory. It uses P-O-X units (i.e. person, another person, and impersonal en5ty). With rela5onal units L and U for ì awtudes and cogni5ve unit forma5on, respec5vely. e.g. (a) PLO reads “P likes,loves, values, or approves of O…” (b) P~LO reads “P dislikes, nega5vely values, or disapproves of O.” (c) PUX reads “P owns, made, is close to, or is associated with X…” Remark: Of Aristotle’s Four Laws of Associa5on, these rules seem to neglect frequencies. The combina5on of nega5ve rela5ons ( ~L ) and unsymmetric rela5ons, requires the use of signed digraphs, ì (Cartwright & Harary, 1956). When considering two rela5onships on persons ( L and U ), we have graphs of type 2, (Harary & Norman, 1953) . ì Addi5onally, they define the degree of balance of an s-digraph . ì Defini5on: A directed graph ( digraph ) is a graph in which the edges are ordered pairs. Defini5on: A signed digraph ( s-digraph ) is a digraph in which every edge is weighted as posi5ve or nega5ve. Defini5on: A graph of type r is a graph in which the edges can be assigned any one dis5nct color from the op5on of r different colors.

  10. Networks in Psychology/Linguis5cs/Educa5on Social Networks (Application 1) Daniel Nexle (1999) uses social networks to explore the evolu5on of ì language: Uses Social Impact Theory (i.e. ones beliefs, axributes, or behavior is ì influenced by those around them). Considers two variants, p and q, of the same gramma5cal item. ì Of 400 individuals, each learn either p or q. These are based on ì par5cular rules (Nowak, Szamrej, & Latané, 1990). Updates the network, based on the previously cited rules. ì From simula5ons, he concludes that some speaking persons (nodes) are ì more influen5al on the evolu5on of the networks, even when they do not share the majority gramma5cal varia5on. Remark: For a more detailed compila5on of research/methods involving networks of language change before 2005, see Marshall (2004).

  11. Networks in Psychology/Linguis5cs/Educa5on Social Networks (Application 2) The conference paper by Fagyal et al., (2010), is a more modern approach to ì Nexle’s research: Considers social influence as assymetric, and so the networks use ì directed edges. Network forma5on considers the work of Barabási and Albert (1999): ì Social networks have small diameter; ì they have high clustering; and ì they evolve with a scale-free degree distribu5on. ì Concludes there is a biased adop5on of gramma5cal variants from ì individuals who are more “popular,” and these persons must be aware of their hierarchy status. Addi5onally, they describe the necessity of peripheral members (i.e. ì those who are less “popular”) as necessary to regulate the diffusion dynamics within the popula5on.

  12. Networks in Psychology/Linguis5cs/Educa5on Natural Language Processing This is a subfield of computa5onal linguis5cs. ì It incorporates the use of ar5ficial intelligence algorithms which are also used ì by neural networks. Some of the many applica5ons include the following: ì Machine transla5on; ì Natural language understanding; ì Natural language genera5on; ì Op5cal character recogni5on; and ì Speech recogni5on. ì Remark: This research is very similar to that of neural networks, and I will leave this topic for a later discussion. For more informa5on, read Handbook of Natural Language Processing (Dale, Moisl, & Somers, 2000).

  13. Networks in Psychology/Linguis5cs/Educa5on Mental Lexicon ì See (Collins & Quillian, 1969; or Dyne & Storms, 2008).

  14. Networks in Psychology/Linguis5cs/Educa5on Networks in Education ì See (Miller & Gildea, 1987). ì Inves5gate models by Kintsch. ì Inves5gate more works by Thorndike.

  15. Networks in Psychology/Linguis5cs/Educa5on Bibliography Barabási, A.-L., & Albert, R. (1999). Emergence of Scaling in Random Networks. Science , ì 286 (5439), 509–512. Boeree, C. G. (2000). Psychology: The Beginnings. Retrieved from hxp://webspace.ship.edu/ ì cgboer/psychbeginnings.html Cartwright, D., & Harary, F. (1956). Structural Balance: A Generaliza5on of Heider’s Theory. ì Psychological Review , 63 (5), 277–293. hxp://doi.org/10.1037/h0046049 Collins, A. M., & Quillian, M. R. (1969). Retrieval Time from Seman5c Memory. Journal of Verbal ì Learning and Verbal Behavior , 8 (2), 240–247. hxp://doi.org/10.1016/S0022-5371(69)80069-1 Cummins, R. (1996). Systema5city. The Jounral of Philosophy , 93 (12), 591–614. hxp://doi.org/ ì 10.2307/2941118 Dale, R., Moisl, H. L., & Somers, H. L. (2000). Handbook of Natural Language Processing . New ì York: Marcel Dekker. Dyne, S. D., & Storms, G. (2008). Word associa5ons: Network and seman5c proper5es. Behavior ì Research Methods , 40 (1), 213–231. hxp://doi.org/10.3758/BRM.40.1.213

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend