Efficient learning algorithms distributed par attiya ibrahim (5 résultats)

- Couverture souple
Vendeur : preigu, Osnabrück, Allemagnepreigu
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 53,35
EUR 70,00 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 5 disponibles
Taschenbuch. Etat : Neu. Efficient Learning Algorithms for Distributed Databases | Ibrahim Attiya (u. a.) | Taschenbuch | 132 S. | Englisch | 2014 | LAP LAMBERT Academic Publishing | EAN 9783659477928 | Verantwortliche Person für die EU: BoD - Books on Demand, In de Tarpen 42, 22848 Norderstedt, info[at]bod[dot]de | Anbieter: preigu. …

- Couverture souple
- impression à la demande
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, AllemagneBuchWeltWeit Ludwig Meier e.K.
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 61,90
EUR 23,00 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 2 disponibles
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Most developed learning algorithms are designed for environments in which all the relevant data is stored at single computer site. Advances in network technology and the Internet as well as the growing size of data have contributed to the proliferation of distributed data mining. Therefore, previously developed learning algorithms for computations with such distributed databases require that all data stored in distributed locations must be transferred to a common site and recompiled as one complete and local dataset before the construction can take place. The danger in this transfer is obvious if the data itself is innately sensitive, or the necessary bandwidth to efficiently transmit the data to a single site is not available. In this book, new algorithms have been developed to preserve the privacy of the data and minimize the cost of communication among the database nodes by gathering statistical summaries at each distributed database and then passing messages describing those summaries between the participating sites. This is much more efficient than transferring the complete databases to a single site, join these databases, and then execute algorithms with this data. 132 pp. Englisch.…

- Couverture souple
- impression à la demande
Vendeur : AHA-BUCH GmbH, Einbeck, AllemagneAHA-BUCH GmbH
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 61,90
EUR 35,00 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 1 disponible
Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Most developed learning algorithms are designed for environments in which all the relevant data is stored at single computer site. Advances in network technology and the Internet as well as the growing size of data have contributed to the proliferation of distributed data mining. Therefore, previously developed learning algorithms for computations with such distributed databases require that all data stored in distributed locations must be transferred to a common site and recompiled as one complete and local dataset before the construction can take place. The danger in this transfer is obvious if the data itself is innately sensitive, or the necessary bandwidth to efficiently transmit the data to a single site is not available. In this book, new algorithms have been developed to preserve the privacy of the data and minimize the cost of communication among the database nodes by gathering statistical summaries at each distributed database and then passing messages describing those summaries between the participating sites. This is much more efficient than transferring the complete databases to a single site, join these databases, and then execute algorithms with this data.…

- Couverture souple
- impression à la demande
Vendeur : moluna, Greven, Allemagnemoluna
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 50,66
EUR 48,99 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : Plus de 20 disponibles
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Attiya IbrahimIbrahim Attiya is a faculty member at Zagazig University, Egypt. He received his BSc and MSc degrees in Computer Science from the Faculty of Science, Zagazig University, Egypt. Currently, he is a PhD candidate at Univer.…

- Couverture souple
- impression à la demande
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagnebuchversandmimpf2000
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 61,90
EUR 60,00 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 1 disponible
Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -Most developed learning algorithms are designed for environments in which all the relevant data is stored at single computer site. Advances in network technology and the Internet as well as the growing size of data have contributed to the proliferation of distributed data mining. Therefore, previously developed learning algorithms for computations with such distributed databases require that all data stored in distributed locations must be transferred to a common site and recompiled as one complete and local dataset before the construction can take place. The danger in this transfer is obvious if the data itself is innately sensitive, or the necessary bandwidth to efficiently transmit the data to a single site is not available. In this book, new algorithms have been developed to preserve the privacy of the data and minimize the cost of communication among the database nodes by gathering statistical summaries at each distributed database and then passing messages describing those summaries between the participating sites. This is much more efficient than transferring the complete databases to a single site, join these databases, and then execute algorithms with this data.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 132 pp. Englisch.…