| LDR | | 02530nmm uu200409 4500 |
| 001 | | 000000334334 |
| 005 | | 20240805180109 |
| 008 | | 181129s2018 |||||||||||||||||c||eng d |
| 020 | |
▼a 9780438284029 |
| 035 | |
▼a (MiAaPQ)AAI10969886 |
| 040 | |
▼a MiAaPQ
▼c MiAaPQ
▼d 248032 |
| 082 | 0 |
▼a 004 |
| 100 | 1 |
▼a Ranshous, Stephen Michael. |
| 245 | 10 |
▼a Scalable Algorithms for Mining Dynamic Graphs and Hypergraphs with Applications to Anomaly Detection. |
| 260 | |
▼a [S.l.] :
▼b North Carolina State University.,
▼c 2018 |
| 260 | 1 |
▼a Ann Arbor :
▼b ProQuest Dissertations & Theses,
▼c 2018 |
| 300 | |
▼a 134 p. |
| 500 | |
▼a Source: Dissertation Abstracts International, Volume: 79-12(E), Section: B. |
| 500 | |
▼a Adviser: Nagiza F. Samatova. |
| 502 | 1 |
▼a Thesis (Ph.D.)--North Carolina State University, 2018. |
| 520 | |
▼a Graph data mining has become a ubiquitous tool for researchers and practitioners in numerous domains, including social sciences, financial markets, and computer security. In particular, mining dynamic graphs has gained substantial interest in th |
| 520 | |
▼a We propose two changes for how anomaly detection is performed over large-scale dynamic graphs to cope with the growing constraints. First, we transition from the traditional approach of analyzing graph streams, where each object in the stream is |
| 520 | |
▼a In our first component, based on our extensive survey and gap analysis of the field, we begin with the simplest case, undirected graph edge streams. Key graph properties necessary for our anomaly detection algorithm are approximated from the str |
| 520 | |
▼a In our second component, we plan to extend the streaming model from graph edges to hypergraph edges, or hyperedges. As hyperedges represent higher order relationships, not strictly pairwise, we must transition to a more flexible notion of simila |
| 520 | |
▼a Finally, our last component examines the potential for pattern based anomalies in dynamic directed hypergraphs (dirhypergraphs). We perform a case study using the Bitcoin network, and propose an edge-based pattern which we posit may represent mo |
| 590 | |
▼a School code: 0155. |
| 650 | 4 |
▼a Computer science. |
| 690 | |
▼a 0984 |
| 710 | 20 |
▼a North Carolina State University. |
| 773 | 0 |
▼t Dissertation Abstracts International
▼g 79-12B(E). |
| 773 | |
▼t Dissertation Abstract International |
| 790 | |
▼a 0155 |
| 791 | |
▼a Ph.D. |
| 792 | |
▼a 2018 |
| 793 | |
▼a English |
| 856 | 40 |
▼u http://www.riss.kr/pdu/ddodLink.do?id=T15001293
▼n KERIS |
| 980 | |
▼a 201812
▼f 2019 |
| 990 | |
▼a 관리자 |