東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Network mining from element level to...

State University of New York at Buffalo., Computer Science and Engineering.

FindBook

Google Book

Amazon

博客來

Network mining from element level to group level.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Network mining from element level to group level./
作者:	Hwang, Woochang.
面頁冊數:	258 p.
附註:	Adviser: Aidong Zhang.
Contained By:	Dissertation Abstracts International70-05B.
標題:	Biology, Bioinformatics. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3356038
ISBN:	9781109157376

Network mining from element level to group level.
Hwang, Woochang.

Network mining from element level to group level. - 258 p.

Adviser: Aidong Zhang.

Thesis (Ph.D.)--State University of New York at Buffalo, 2009.

Network structures were emerged broadly and frequently in real world systems ranging from the Internet, the World Wide Web to gene regulation and scientific collaborations. Several topological metrics were introduced to identify important elements or to measure importance of elements in network systems. Existing metrics for characterizing networks have broad specificity and lack the selectivity for many applications. The purpose of this research is to introduce an effective metric, termed bridging centrality, which is highly selective for identifying bridging nodes in networks for element level analysis. The bridging nodes identified by bridging centrality were distinguished from the nodes identified by the other metrics. Real world networks are highly susceptible to disruption but robust to loss structural integrity upon targeted deletion of bridging nodes. The components identified by bridging centrality are shown to be located on important paths between modules. Furthermore, these bridges were shown to be effectively used for graph clustering and drug target identification. Therefore, bridging centrality is an effective network metric identifying bridging elements with unique properties that may aid in network analysis in many areas like systems biology, drug target identification, network maintenance and national security applications.

ISBN: 9781109157376Subjects--Topical Terms:

1018415
Biology, Bioinformatics.

Network mining from element level to group level.
LDR:03764nmm 2200313 a 45 001 866846
005 20100802
008 100802s2009 ||||||||||||||||| ||eng d
020 $a 9781109157376
035 $a (UMI)AAI3356038
035 $a AAI3356038
040 $a UMI $c UMI
100 1 $a Hwang, Woochang. $3 1035520
245 1 0 $a Network mining from element level to group level.
300 $a 258 p.
500 $a Adviser: Aidong Zhang.
500 $a Source: Dissertation Abstracts International, Volume: 70-05, Section: B, page: 2997.
502 $a Thesis (Ph.D.)--State University of New York at Buffalo, 2009.
520 $a Network structures were emerged broadly and frequently in real world systems ranging from the Internet, the World Wide Web to gene regulation and scientific collaborations. Several topological metrics were introduced to identify important elements or to measure importance of elements in network systems. Existing metrics for characterizing networks have broad specificity and lack the selectivity for many applications. The purpose of this research is to introduce an effective metric, termed bridging centrality, which is highly selective for identifying bridging nodes in networks for element level analysis. The bridging nodes identified by bridging centrality were distinguished from the nodes identified by the other metrics. Real world networks are highly susceptible to disruption but robust to loss structural integrity upon targeted deletion of bridging nodes. The components identified by bridging centrality are shown to be located on important paths between modules. Furthermore, these bridges were shown to be effectively used for graph clustering and drug target identification. Therefore, bridging centrality is an effective network metric identifying bridging elements with unique properties that may aid in network analysis in many areas like systems biology, drug target identification, network maintenance and national security applications.
520 $a Quantitative characterization of the topological characteristics of protein-protein interaction (PPI) networks can enable the elucidation of biological functional modules. Finding functional modules in complex networks should be a challenging problem. Two different approaches will be introduced in this research, i.e., bridging cut and information flow based clustering algorithms (CASCADE). Bridging Cut algorithm utilized the bridges identified by bridging centrality. Cutting those bridges enabled us to find effective sub-modules in networks. We present a novel clustering methodology for PPI networks wherein the biological and topological influence of each protein on other proteins is modeled using the probability distribution that the series of interactions necessary to link a pair of distant proteins in the network occur within a time constant (the occurrence probability). CASCADE selects representative nodes for each cluster and iteratively refines clusters based on a combination of the occurrence probability and graph topology between every protein pair. The CASCADE approach is compared to nine competing approaches. The clusters obtained by each technique are compared for enrichment of biological function. CASCADE generates larger clusters and the clusters identified have p-values for biological function that are approximately 1000-fold better than the other methods on the yeast PPI network dataset.
590 $a School code: 0656.
650 4 $a Biology, Bioinformatics. $3 1018415
650 4 $a Computer Science. $3 626642
690 $a 0715
690 $a 0984
710 2 $a State University of New York at Buffalo. $b Computer Science and Engineering. $3 1035503
773 0 $t Dissertation Abstracts International $g 70-05B.
790 $a 0656
790 1 0 $a He, Roger $e committee member
790 1 0 $a Ramanathan, Murali $e committee member
790 1 0 $a Zhang, Aidong, $e advisor
791 $a Ph.D.
792 $a 2009
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3356038