Over 10 mio. titler Fri fragt ved køb over 499,- Hurtig levering 30 dages retur

On Uncertain Graphs

  • Format
  • E-bog, PDF
  • Engelsk
Er ikke web-tilgængelig
E-bogen er DRM-beskyttet og kræver et særligt læseprogram

Normalpris

kr. 434,95

Medlemspris

kr. 389,95
Som medlem af Saxo Premium 20 timer køber du til medlemspris, får fri fragt og 20 timers streaming/md. i Saxo-appen. De første 7 dage er gratis for nye medlemmer, derefter koster det 99,-/md. og kan altid opsiges. Løbende medlemskab, der forudsætter betaling med kreditkort. Fortrydelsesret i medfør af Forbrugeraftaleloven. Mindstepris 0 kr. Læs mere

Beskrivelse

Large-scale, highly interconnected networks, which are often modeled as graphs, pervade both our society and the natural world around us. Uncertainty, on the other hand, is inherent in the underlying data due to a variety of reasons, such as noisy measurements, lack of precise information needs, inference and prediction models, or explicit manipulation, e.g., for privacy purposes. Therefore, uncertain, or probabilistic, graphs are increasingly used to represent noisy linked data in many emerging application scenarios, and they have recently become a hot topic in the database and data mining communities. Many classical algorithms such as reachability and shortest path queries become #P-complete and, thus, more expensive over uncertain graphs. Moreover, various complex queries and analytics are also emerging over uncertain networks, such as pattern matching, information diffusion, and influence maximization queries. In this book, we discuss the sources of uncertain graphs and their applications, uncertainty modeling, as well as the complexities and algorithmic advances on uncertain graphs processing in the context of both classical and emerging graph queries and analytics. We emphasize the current challenges and highlight some future research directions.

Læs hele beskrivelsen
Detaljer

Anmeldelser

Vær den første!

Log ind for at skrive en anmeldelse.

Findes i disse kategorier...

Se andre, der handler om...