國立虎尾科技大學 |

Bipartite Network Community Detection : = Algorithms and Applications.

紀錄類型:	書目-語言資料,手稿 : Monograph/item
正題名/作者:	Bipartite Network Community Detection :/
其他題名:	Algorithms and Applications.
作者:	Pesantez Cabrera, Paola Gabriela.
面頁冊數:	1 online resource (174 pages)
附註:	Source: Dissertation Abstracts International, Volume: 79-11(E), Section: B.
Contained By:	Dissertation Abstracts International79-11B(E).
標題:	Computer science. -
電子資源:	click for full text (PQDT)
ISBN:	9780438104723

Bipartite Network Community Detection : = Algorithms and Applications.
Pesantez Cabrera, Paola Gabriela.

Bipartite Network Community Detection :Algorithms and Applications. - 1 online resource (174 pages)

Source: Dissertation Abstracts International, Volume: 79-11(E), Section: B.

Thesis (Ph.D.)--Washington State University, 2018.

Includes bibliographical references

Methods to efficiently uncover and extract community structures are required in a vast number of applications where networked data and their interactions can be modeled as graphs, and observing tightly-knit groups of vertices ("communities") can offer insights into the structural and functional building blocks of the underlying network. Classical applications of community detection have largely focused on unipartite networks---i.e., graphs built out of a single type of objects. However, due to increased availability of data from various sources, there is now an increasing need for handling heterogeneous networks which are built out of multiple types of objects.

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

Mode of access: World Wide Web

ISBN: 9780438104723Subjects--Topical Terms:

573171
Computer science.
Index Terms--Genre/Form:

554714
Electronic books.

Bipartite Network Community Detection : = Algorithms and Applications.
LDR:03338ntm a2200349Ki 4500 001 916666
005 20180927111921.5
006 m o u
007 cr mn||||a|a||
008 190606s2018 xx obm 000 0 eng d
020 $a 9780438104723
035 $a (MiAaPQ)AAI10787364
035 $a (MiAaPQ)wsu:12393
035 $a AAI10787364
040 $a MiAaPQ $b eng $c MiAaPQ $d NTU
100 1 $a Pesantez Cabrera, Paola Gabriela. $3 1190470
245 1 0 $a Bipartite Network Community Detection : $b Algorithms and Applications.
264 0 $c 2018
300 $a 1 online resource (174 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: Dissertation Abstracts International, Volume: 79-11(E), Section: B.
500 $a Adviser: Ananth Kalyanaraman.
502 $a Thesis (Ph.D.)--Washington State University, 2018.
504 $a Includes bibliographical references
520 $a Methods to efficiently uncover and extract community structures are required in a vast number of applications where networked data and their interactions can be modeled as graphs, and observing tightly-knit groups of vertices ("communities") can offer insights into the structural and functional building blocks of the underlying network. Classical applications of community detection have largely focused on unipartite networks---i.e., graphs built out of a single type of objects. However, due to increased availability of data from various sources, there is now an increasing need for handling heterogeneous networks which are built out of multiple types of objects.
520 $a In this dissertation, we address the problem of identifying communities from bipartite networks---i.e., networks where interactions are observed between two different types of objects, with special interest in meaningful biological and ecological networks (e.g., genes and diseases, drugs and protein complexes, plants and pollinators, hosts and pathogens). Toward detecting communities in such bipartite networks, we make the following contributions: i) (metrics) we propose a variant of bipartite modularity called Murata+ and we extend this variant to manage not just inter-type, but also intra-type edge information of the network; ii) (algorithms) we present an efficient algorithm called biLouvain that implements a set of heuristics toward fast and precise community detection in large bipartite networks; and iii) (experiments) we present a thorough experimental evaluation of our algorithm including comparison to other state-of-the-art methods to identify communities in bipartite networks. Experimental results show that our biLouvain algorithm identifies robust community structures that have a comparable or better quality (as measured by bipartite modularity) than existing methods, while significantly reducing the time-to-solution between one and four orders of magnitude. The implementation of our algorithm and heuristics is publicly available as open source at https://github.com/paolapesantez/biLouvain.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2018
538 $a Mode of access: World Wide Web
650 4 $a Computer science. $3 573171
650 4 $a Bioinformatics. $3 583857
655 7 $a Electronic books. $2 local $3 554714
690 $a 0984
690 $a 0715
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a Washington State University. $b Computer Science. $3 1186533
773 0 $t Dissertation Abstracts International $g 79-11B(E).
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10787364 $z click for full text (PQDT)