Investigative Data Mining: Mathematical Models for Analyzing, Visualizing and Destabilizing Terrorist Networks
von Nasrullah Memon
Statistik und Sichtungsnachweis dieser Seite findet sich am Artikelende
| [1.] Nm/Fragment 101 01 - Diskussion Zuletzt bearbeitet: 2012-04-29 21:52:24 Hindemith | Fragment, Gesichtet, Nm, SMWFragment, Schutzlevel sysop, Scott 1987, Verschleierung |
|
|
|
| Untersuchte Arbeit: Seite: 101, Zeilen: 1-8 |
Quelle: Scott_1987 Seite(n): 23, Zeilen: 24-28 |
|---|---|
| A central node was one which was at the center of a number of connections, a node with many direct contacts with other nodes. The simplest and most straight-forward way to measure node centrality, therefore, is by the degrees of various nodes in the graph. The degree, is simply the number of other points to which a node is adjacent. A node is central, then, if it has high degree; the corresponding agent is central in the sense of being well connected or in the thick of things. | A central point was one which was 'at the centre' of a number of connections, a point with a great many direct contacts with other points. The simplest and most straightforward way to measure point centrality, therefore, is by the degrees of the various points in the graph. Tle degree, it will be recalled, is simply the number of other points to which a point is adjacent. A point is central, then, if it has a high degree; the corresponding agent is central in the sense of being 'well-connected' or 'in the thick of things'. |
The source is not given here. |
|
| [2.] Nm/Fragment 101 20 - Diskussion Zuletzt bearbeitet: 2012-04-29 22:07:36 Hindemith | Fragment, Gesichtet, KomplettPlagiat, Koschuetzki etal 2005, Nm, SMWFragment, Schutzlevel sysop |
|
|
|
| Untersuchte Arbeit: Seite: 101, Zeilen: 20-26 |
Quelle: Koschuetzki_etal_2005 Seite(n): 20, Zeilen: 12-16 |
|---|---|
| The degree centrality is, e.g., applicable whenever the graph represents something like a voting result. These networks represent a static situation and we are interested in the vertex that has the most direct votes or that can reach most other vertices directly. The degree centrality is a local measure, because the centrality value of a vertex is only determined by the number of its neighbours. | The degree centrality is, e.g., applicable whenever the graph represents something like a voting result. These networks represent a static situation and we are interested in the vertex that has the most direct votes or that can reach most other vertices directly. The degree centrality is a local measure, because the centrality value of a vertex is only determined by the number of its neighbors. |
The source is not mentioned anywhere in the thesis. Note, that this paragraph can also be found in other publications of Nm: Memon, Larsen, Hicks & Harkiolakis (2008) and Memon, Hicks & Larsen (2007). Henrik Legind Larsen is the thesis supervisor and David L. Hicks is the thesis committee chairman. |
|
vorherige Seite | zur Übersichtsseite | folgende Seite
Letzte Bearbeitung dieser Seite: durch Benutzer:Hindemith, Zeitstempel: 20120429221041
Letzte Bearbeitung dieser Seite: durch Benutzer:Hindemith, Zeitstempel: 20120429221041