國立虎尾科技大學 |

Identifying Sources of Anomalies in Complex Networks.

紀錄類型:	書目-語言資料,手稿 : Monograph/item
正題名/作者:	Identifying Sources of Anomalies in Complex Networks./
作者:	Basu, Kaustav.
面頁冊數:	1 online resource (209 pages)
附註:	Source: Dissertations Abstracts International, Volume: 84-02, Section: B.
Contained By:	Dissertations Abstracts International84-02B.
標題:	Computer science. -
電子資源:	click for full text (PQDT)
ISBN:	9798841780199

Identifying Sources of Anomalies in Complex Networks.
Basu, Kaustav.

Identifying Sources of Anomalies in Complex Networks. - 1 online resource (209 pages)

Source: Dissertations Abstracts International, Volume: 84-02, Section: B.

Thesis (Ph.D.)--Arizona State University, 2022.

Includes bibliographical references

The problem of monitoring complex networks for the detection of anomalous behavior is well known. Sensors are usually deployed for the purpose of monitoring these networks for anomalies and Sensor Placement Optimization (SPO) is the problem of determining where these sensors should be placed (deployed) in the network. Prior works have utilized the well known Set Cover formulation in order to determine the locations where sensors should be placed in the network, so that anomalies can be effectively detected. However, such works cannot be utilized to address the problem when the objective is to not only detect the presence of anomalies, but also to detect (distinguish) the source(s) of the detected anomalies, i.e., uniquely monitoring the network. In this dissertation, I attempt to fill in this gap by utilizing the mathematical concept of Identifying Codes and illustrating how it not only can overcome the aforementioned limitation, but also it, and its variants, can be utilized to monitor complex networks modeled from multiple domains. Over the course of this dissertation, I make key contributions which further enhance the efficacy and applicability of Identifying Codes as a monitoring strategy. First, I show how Identifying Codes are superior to not only the Set Cover formulation but also standard graph centrality metrics, for the purpose of uniquely monitoring complex networks. Second, I study novel problems such as the budget constrained Identifying Code, scalable Identifying Code, robust Identifying Code etc., and present algorithms and results for the respective problems. Third, I present useful Identifying Code results for restricted graph classes such as Unit Interval Bigraphs and Unit Disc Bigraphs. Finally, I show the universality of Identifying Codes by applying it to multiple domains.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2024

Mode of access: World Wide Web

ISBN: 9798841780199Subjects--Topical Terms:

573171
Computer science.
Subjects--Index Terms:

Discriminating codesIndex Terms--Genre/Form:

554714
Electronic books.

Identifying Sources of Anomalies in Complex Networks.
LDR:03172ntm a22003977 4500 001 1142463
005 20240422070837.5
006 m o d
007 cr mn ---uuuuu
008 250605s2022 xx obm 000 0 eng d
020 $a 9798841780199
035 $a (MiAaPQ)AAI29319262
035 $a AAI29319262
040 $a MiAaPQ $b eng $c MiAaPQ $d NTU
100 1 $a Basu, Kaustav. $3 1466799
245 1 0 $a Identifying Sources of Anomalies in Complex Networks.
264 0 $c 2022
300 $a 1 online resource (209 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Dissertations Abstracts International, Volume: 84-02, Section: B.
500 $a Advisor: Sen, Arunabha.
502 $a Thesis (Ph.D.)--Arizona State University, 2022.
504 $a Includes bibliographical references
520 $a The problem of monitoring complex networks for the detection of anomalous behavior is well known. Sensors are usually deployed for the purpose of monitoring these networks for anomalies and Sensor Placement Optimization (SPO) is the problem of determining where these sensors should be placed (deployed) in the network. Prior works have utilized the well known Set Cover formulation in order to determine the locations where sensors should be placed in the network, so that anomalies can be effectively detected. However, such works cannot be utilized to address the problem when the objective is to not only detect the presence of anomalies, but also to detect (distinguish) the source(s) of the detected anomalies, i.e., uniquely monitoring the network. In this dissertation, I attempt to fill in this gap by utilizing the mathematical concept of Identifying Codes and illustrating how it not only can overcome the aforementioned limitation, but also it, and its variants, can be utilized to monitor complex networks modeled from multiple domains. Over the course of this dissertation, I make key contributions which further enhance the efficacy and applicability of Identifying Codes as a monitoring strategy. First, I show how Identifying Codes are superior to not only the Set Cover formulation but also standard graph centrality metrics, for the purpose of uniquely monitoring complex networks. Second, I study novel problems such as the budget constrained Identifying Code, scalable Identifying Code, robust Identifying Code etc., and present algorithms and results for the respective problems. Third, I present useful Identifying Code results for restricted graph classes such as Unit Interval Bigraphs and Unit Disc Bigraphs. Finally, I show the universality of Identifying Codes by applying it to multiple domains.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2024
538 $a Mode of access: World Wide Web
650 4 $a Computer science. $3 573171
650 4 $a Computer engineering. $3 569006
650 4 $a Information technology. $3 559429
650 4 $a Information science. $3 561178
653 $a Discriminating codes
653 $a Identifying codes
653 $a Sensor networks
653 $a Sources of anomalies
655 7 $a Electronic books. $2 local $3 554714
690 $a 0984
690 $a 0489
690 $a 0464
690 $a 0723
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a Arizona State University. $b Computer Science. $3 845377
773 0 $t Dissertations Abstracts International $g 84-02B.
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=29319262 $z click for full text (PQDT)