TAILIEUCHUNG - Managing and Mining Graph Data part 48

Managing and Mining Graph Data part 48 is a comprehensive survey book in graph data analytics. It contains extensive surveys on important graph topics such as graph languages, indexing, clustering, data generation, pattern mining, classification, keyword search, pattern matching, and privacy. It also studies a number of domain-specific scenarios such as stream mining, web graphs, social networks, chemical and biological data. The chapters are written by leading researchers, and provide a broad perspective of the area. This is the first comprehensive survey book in the emerging topic of graph data processing. . | 4558 MANAGING AND MINING GRAPH DATA provide an indication of its capacity to influence his neighbors. Tins property is cslled expansiven ess 58 tn the other 1 iancl. the in-degree is the most itraightrorward measure lor the popularity of each node in the network. Complex networks exhibic lacge variaoce hi tire values of their degrees very few nodes have nirt oapaciCy of attracting a taege traction of links while the largest majority of nodcr are connected to network by few in-coming and out-gomg Sinks. Stgniticane i nsighi. on the natucc erf the graph tan be obtained by measuring hie coricialion hclwacn the degrees of adiaceni. vertexes 47 . This is also referred to as assortative mixing. Complsx networks can be divided into three types bated oa the value of their mixing coefficient r i disassortative if r 0 zz neutral if r w 0 and iii assortative if r 0. An altesnative way to 1 rr assoriaiive or dirasrottaitvc network is by using the average degree E knn k of a neighboring vertex of a vertex with degree k 47 As k increases the ixpectation E knn k increasrs for an ascortalivc network and dr crcases for a disassortaUve one. In particular a power-law equation E knn k k-7 is raiislisd. where 7 is negative for ar asrortalive network and poritivc for a disassortative orc 9 iSociai networks such as friendship networks tire mostiy assortative tmxed i i it technological and biological networks tend Io tie dh ii- ior ti tlitis 62g. Assortative mating is a well-known social riOi romcnon that captures the hkr ldii od that marriage partners will share common background characterictics svhether it is income education or social etaiuc. lit oniinc activity netwocks ruch ar question-answering portals and newsgroups. tine degree corrciation provides information about user tendency io provide hc i. Such kind of network aic neutral or slightly disassortative active usars arc pronr to contribute wlthoui. considering the expertise or the invotyements fl iOic users .

TỪ KHÓA LIÊN QUAN
Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.