Thiswork presents link prediction similarity measures for social networks that exploitthe degree distribution of the networks. In the context of link prediction indense networks, the text proposes similarity measures based on Markov inequalitydegree thresholding (MIDTs), which only consider nodes whose degree is above a thresholdfor a possible link. Also presented are similarity measures based on cliques(CNC, AAC, RAC), which assign extra weight between nodes sharing a greater numberof cliques. Additionally, a locally adaptive (LA) similarity measure isproposed that assigns different weights to common nodes based on the degreedistribution of the local neighborhood and the degree distribution of thenetwork. In the context of link prediction in dense networks, the textintroduces a novel two-phase framework that adds edges to the sparse graph toforma boost graph.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Dr. Virinchi Srinivas is a Graduate Research Assistant inthe Department of Computer Science at the University of Maryland, College Park,MD, USA.
Dr. Pabitra Mitra is an Associate Professor in the Departmentof Computer Science and Engineering at the Indian Institute of Technology,Kharagpur, India.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
EUR 17,35 per la spedizione da Regno Unito a Italia
Destinazione, tempi e costiEUR 9,70 per la spedizione da Germania a Italia
Destinazione, tempi e costiDa: moluna, Greven, Germania
Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Presents anaccessible explanation of the role of power law degree distribution in linkpredictionDescribes arange of link prediction algorithms in an easy-to-understand mannerDiscusses the implementation of both the popularlink prediction algor. Codice articolo 106033966
Quantità: Più di 20 disponibili
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Thiswork presents link prediction similarity measures for social networks that exploitthe degree distribution of the networks. In the context of link prediction indense networks, the text proposes similarity measures based on Markov inequalitydegree thresholding (MIDTs), which only consider nodes whose degree is above a thresholdfor a possible link. Also presented are similarity measures based on cliques(CNC, AAC, RAC), which assign extra weight between nodes sharing a greater numberof cliques. Additionally, a locally adaptive (LA) similarity measure isproposed that assigns different weights to common nodes based on the degreedistribution of the local neighborhood and the degree distribution of thenetwork. In the context of link prediction in dense networks, the textintroduces a novel two-phase framework that adds edges to the sparse graph toforma boost graph. 80 pp. Englisch. Codice articolo 9783319289212
Quantità: 2 disponibili
Da: Ria Christie Collections, Uxbridge, Regno Unito
Condizione: New. In. Codice articolo ria9783319289212_new
Quantità: Più di 20 disponibili
Da: AHA-BUCH GmbH, Einbeck, Germania
Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - Thiswork presents link prediction similarity measures for social networks that exploitthe degree distribution of the networks. In the context of link prediction indense networks, the text proposes similarity measures based on Markov inequalitydegree thresholding (MIDTs), which only consider nodes whose degree is above a thresholdfor a possible link. Also presented are similarity measures based on cliques(CNC, AAC, RAC), which assign extra weight between nodes sharing a greater numberof cliques. Additionally, a locally adaptive (LA) similarity measure isproposed that assigns different weights to common nodes based on the degreedistribution of the local neighborhood and the degree distribution of thenetwork. In the context of link prediction in dense networks, the textintroduces a novel two-phase framework that adds edges to the sparse graph toforma boost graph. Codice articolo 9783319289212
Quantità: 1 disponibili
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Taschenbuch. Condizione: Neu. Neuware -Thiswork presents link prediction similarity measures for social networks that exploitthe degree distribution of the networks. In the context of link prediction indense networks, the text proposes similarity measures based on Markov inequalitydegree thresholding (MIDTs), which only consider nodes whose degree is above a thresholdfor a possible link. Also presented are similarity measures based on cliques(CNC, AAC, RAC), which assign extra weight between nodes sharing a greater numberof cliques. Additionally, a locally adaptive (LA) similarity measure isproposed that assigns different weights to common nodes based on the degreedistribution of the local neighborhood and the degree distribution of thenetwork. In the context of link prediction in dense networks, the textintroduces a novel two-phase framework that adds edges to the sparse graph toforma boost graph.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 80 pp. Englisch. Codice articolo 9783319289212
Quantità: 2 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: New. Codice articolo 25225898-n
Quantità: Più di 20 disponibili
Da: California Books, Miami, FL, U.S.A.
Condizione: New. Codice articolo I-9783319289212
Quantità: Più di 20 disponibili
Da: Best Price, Torrance, CA, U.S.A.
Condizione: New. SUPER FAST SHIPPING. Codice articolo 9783319289212
Quantità: 2 disponibili
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Condizione: New. Codice articolo 25225898-n
Quantità: Più di 20 disponibili
Da: Chiron Media, Wallingford, Regno Unito
PF. Condizione: New. Codice articolo 6666-IUK-9783319289212
Quantità: 10 disponibili