Fandom

VroniPlag Wiki

Nm/Fragment 033 01

< Nm

31.373Seiten in
diesem Wiki
Seite hinzufügen
Diskussion0 Teilen

Störung durch Adblocker erkannt!


Wikia ist eine gebührenfreie Seite, die sich durch Werbung finanziert. Benutzer, die Adblocker einsetzen, haben eine modifizierte Ansicht der Seite.

Wikia ist nicht verfügbar, wenn du weitere Modifikationen in dem Adblocker-Programm gemacht hast. Wenn du sie entfernst, dann wird die Seite ohne Probleme geladen.


Typus
KomplettPlagiat
Bearbeiter
Graf Isolan
Gesichtet
Yes.png
Untersuchte Arbeit:
Seite: 33, Zeilen: 1-15
Quelle: Koelle et al 2006
Seite(n): 1 (internet version), Zeilen: right column 26-43
1.5. LIMITATIONS

While traditional SNA has been used to successfully derive insights into a social network, it can be restrictive for a number of reasons. SNA assumes a well-formed social network, but real-world methods of data collection may not ensure that the resulting social network is complete and contains needed data. SNA focuses primarily on the existence of a relationship between nodes in the network, but not on attributes of that relationship or the nodes in the relationship. Furthermore, SNA does not explicitly consider the uncertainty of attributes on nodes or relationships. Finally, graph-theoretic algorithms used in SNA tend to focus on homogenous set of entities and relationships, making it difficult to analyze networks that involve a heterogeneous set of nodes connected by a variety of link types.

1.5.1 Issues in Data Collection [FN 7]

[FN 7] The text in this subsection is partially published in Memon Nasrullah and Larsen Henrik Legind. (2007e)

2. LIMITATIONS OF SOCIAL NETWORK ANALYSIS

While traditional SNA has been used to successfully derive insights into a social network, it can be restrictive for a number of reasons. SNA assumes a well-formed social network, but real-world methods of data collection may not ensure that the resulting social network is complete and contains needed data. SNA focuses primarily on the existence of a relationship between nodes in the network, but not on attributes of that relationship or the nodes in the relationship. Furthermore, SNA does not explicitly consider the uncertainty of attributes on nodes or relationships. Finally, graph-theoretic algorithms used in SNA tend to focus on a homogenous set of entities and relationships, making it difficult to analyze networks that involve a heterogeneous set of nodes connected by a variety of link types.

2.1 ISSUES IN DATA COLLECTION

Anmerkungen

Identical, with the source not being mentioned anywhere in Nm's thesis.

Sichter
(Graf Isolan), Hindemith

Auch bei Fandom

Zufälliges Wiki