Articoli correlati a On Uncertain Graphs

On Uncertain Graphs - Brossura

 
9783031007323: On Uncertain Graphs

Sinossi

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.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Informazioni sull?autore

Arijit Khan is an assistant professor in the School of Computer Engineering at Nanyang Technological University, Singapore. His research interests span in the area of big-data, big-graphs, and graph systems. He received his Ph.D. from the Department of Computer Science, University of California, Santa Barbara, and did a post-doc in the Systems group at ETH Zurich. Arijit was the recipient of the prestigious IBM Ph.D. Fellowship in 2012-13. He published several papers in premier database and data-mining conferences and journals including SIGMOD, VLDB, TKDE, ICDE, SDM, EDBT, and CIKM. Arijit co-presented tutorials on emerging graph queries, big-graph systems, summarization, and uncertain graphs at ICDE 2012, VLDB 2014, VLDB 2015, and VLDB 2017, and served in the program committee of KDD, SIGMOD, VLDB, ICDM, EDBT, WWW, and CIKM. Arijit served as the co-chair of Big-O(Q) workshop co-located with VLDB 2015.

Yuan Ye is a professor in the Department of Computer Science, Northeastern University, China. His research interests are graph databases, probabilistic databases, social network analysis and big-data computing systems. Yuan Ye received the B.S., M.S., and Ph.D. degrees in Computer Science from Northeastern University in 2004, 2007, and 2011, respectively. He was a visiting scholar of the Hong Kong University of Science and Technology, the Chinese University of Hong Kong, and the University of Edinburgh. Yuan Ye published several papers in premier database conferences and journals including SIGMOD, VLDB, ICDE, CIKM, VLDB Journal, TKDE, and TPDS. He served in the program committee of SIGMOD, VLDB, ICDE, EDBT, and CIKM. Yuan Ye received the award of the CCF excellent doctoral dissertation in 2012 and the excellent youth scholar of NSFC in 2016.
Lei Chen received a B.S. in Computer Science and Engineering from Tianjin University, China in 1994, an M.A. from Asian Institute of Technology, Thailand, in 1997, and a Ph.D. in Computer Science from University of Waterloo, Canada in 2005. He is now an associate professor in the Department of Computer Science and Engineering at Hong Kong University of Science and Technology. His research interests include uncertain databases, graph databases, multimedia, and time series databases, and sensor and peer-to-peer databases. He is editor-in-chief of the VLDB Journal and serving as an associate editor for IEEE Transactions on Knowledge and Data Engineering and Distributed and Parallel Databases. He is the PC Co-chair of the 45th International Conference on Very Large Databases (VLDB), 2019, and has served as PC Co-chair, PC Track Chair, and PC member for many conferences. He was awarded the SIGMOD Test of Time Award in 2015. He is a member of the IEEE and ACM.

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

  • EditoreSpringer-Nature New York Inc
  • Data di pubblicazione2018
  • ISBN 10 3031007328
  • ISBN 13 9783031007323
  • RilegaturaCopertina flessibile
  • LinguaInglese
  • Numero edizione1
  • Numero di pagine80
  • Contatto del produttorenon disponibile

EUR 9,70 per la spedizione da Germania a Italia

Destinazione, tempi e costi

Altre edizioni note dello stesso titolo

9781681734002: On Uncertain Graphs

Edizione in evidenza

ISBN 10:  1681734001 ISBN 13:  9781681734002
Casa editrice: Morgan & Claypool, 2018
Rilegato

Risultati della ricerca per On Uncertain Graphs

Immagini fornite dal venditore

Khan, Arijit|Ye, Yuan|Chen, Lei
ISBN 10: 3031007328 ISBN 13: 9783031007323
Nuovo Brossura
Print on Demand

Da: moluna, Greven, Germania

Valutazione del venditore 4 su 5 stelle 4 stelle, Maggiori informazioni sulle valutazioni dei venditori

Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 measureme. Codice articolo 608129118

Contatta il venditore

Compra nuovo

EUR 51,39
Convertire valuta
Spese di spedizione: EUR 9,70
Da: Germania a: Italia
Destinazione, tempi e costi

Quantità: Più di 20 disponibili

Aggiungi al carrello

Immagini fornite dal venditore

Arijit Khan
ISBN 10: 3031007328 ISBN 13: 9783031007323
Nuovo Taschenbuch
Print on Demand

Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania

Valutazione del venditore 5 su 5 stelle 5 stelle, Maggiori informazioni sulle valutazioni dei venditori

Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 80 pp. Englisch. Codice articolo 9783031007323

Contatta il venditore

Compra nuovo

EUR 56,70
Convertire valuta
Spese di spedizione: EUR 11,00
Da: Germania a: Italia
Destinazione, tempi e costi

Quantità: 2 disponibili

Aggiungi al carrello

Foto dell'editore

Khan, Arijit; Ye, Yuan; Chen, Lei
Editore: Springer, 2018
ISBN 10: 3031007328 ISBN 13: 9783031007323
Nuovo Brossura

Da: Ria Christie Collections, Uxbridge, Regno Unito

Valutazione del venditore 5 su 5 stelle 5 stelle, Maggiori informazioni sulle valutazioni dei venditori

Condizione: New. In. Codice articolo ria9783031007323_new

Contatta il venditore

Compra nuovo

EUR 60,50
Convertire valuta
Spese di spedizione: EUR 10,66
Da: Regno Unito a: Italia
Destinazione, tempi e costi

Quantità: Più di 20 disponibili

Aggiungi al carrello

Immagini fornite dal venditore

Arijit Khan
ISBN 10: 3031007328 ISBN 13: 9783031007323
Nuovo Taschenbuch

Da: AHA-BUCH GmbH, Einbeck, Germania

Valutazione del venditore 5 su 5 stelle 5 stelle, Maggiori informazioni sulle valutazioni dei venditori

Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Codice articolo 9783031007323

Contatta il venditore

Compra nuovo

EUR 56,70
Convertire valuta
Spese di spedizione: EUR 14,99
Da: Germania a: Italia
Destinazione, tempi e costi

Quantità: 2 disponibili

Aggiungi al carrello

Foto dell'editore

Khan, Arijit
Editore: Springer 2018-07, 2018
ISBN 10: 3031007328 ISBN 13: 9783031007323
Nuovo PF

Da: Chiron Media, Wallingford, Regno Unito

Valutazione del venditore 5 su 5 stelle 5 stelle, Maggiori informazioni sulle valutazioni dei venditori

PF. Condizione: New. Codice articolo 6666-IUK-9783031007323

Contatta il venditore

Compra nuovo

EUR 57,89
Convertire valuta
Spese di spedizione: EUR 23,71
Da: Regno Unito a: Italia
Destinazione, tempi e costi

Quantità: 10 disponibili

Aggiungi al carrello

Foto dell'editore

Khan, Arijit; Ye, Yuan; Chen, Lei
Editore: Springer, 2018
ISBN 10: 3031007328 ISBN 13: 9783031007323
Nuovo Brossura

Da: Books Puddle, New York, NY, U.S.A.

Valutazione del venditore 4 su 5 stelle 4 stelle, Maggiori informazioni sulle valutazioni dei venditori

Condizione: New. 1st edition NO-PA16APR2015-KAP. Codice articolo 26395061334

Contatta il venditore

Compra nuovo

EUR 80,77
Convertire valuta
Spese di spedizione: EUR 7,93
Da: U.S.A. a: Italia
Destinazione, tempi e costi

Quantità: 4 disponibili

Aggiungi al carrello

Foto dell'editore

Khan, Arijit; Ye, Yuan; Chen, Lei
Editore: Springer, 2018
ISBN 10: 3031007328 ISBN 13: 9783031007323
Nuovo Brossura
Print on Demand

Da: Majestic Books, Hounslow, Regno Unito

Valutazione del venditore 5 su 5 stelle 5 stelle, Maggiori informazioni sulle valutazioni dei venditori

Condizione: New. Print on Demand. Codice articolo 402364297

Contatta il venditore

Compra nuovo

EUR 81,16
Convertire valuta
Spese di spedizione: EUR 10,50
Da: Regno Unito a: Italia
Destinazione, tempi e costi

Quantità: 4 disponibili

Aggiungi al carrello

Foto dell'editore

Khan, Arijit; Ye, Yuan; Chen, Lei
Editore: Springer, 2018
ISBN 10: 3031007328 ISBN 13: 9783031007323
Nuovo Brossura
Print on Demand

Da: Biblios, Frankfurt am main, HESSE, Germania

Valutazione del venditore 5 su 5 stelle 5 stelle, Maggiori informazioni sulle valutazioni dei venditori

Condizione: New. PRINT ON DEMAND. Codice articolo 18395061340

Contatta il venditore

Compra nuovo

EUR 84,16
Convertire valuta
Spese di spedizione: EUR 7,95
Da: Germania a: Italia
Destinazione, tempi e costi

Quantità: 4 disponibili

Aggiungi al carrello