Muhamad Amin / Khan / Nasution | Internet-Scale Pattern Recognition | Buch | 978-1-4665-1096-8 | sack.de

Buch, Englisch, 198 Seiten, Format (B × H): 157 mm x 234 mm, Gewicht: 476 g

Muhamad Amin / Khan / Nasution

Internet-Scale Pattern Recognition

New Techniques for Voluminous Data Sets and Data Clouds

Buch, Englisch, 198 Seiten, Format (B × H): 157 mm x 234 mm, Gewicht: 476 g

ISBN: 978-1-4665-1096-8
Verlag: Taylor & Francis Ltd (Sales)


For machine intelligence applications to work successfully, machines must perform reliably under variations of data and must be able to keep up with data streams. Internet-Scale Pattern Recognition: New Techniques for Voluminous Data Sets and Data Clouds unveils computational models that address performance and scalability to achieve higher levels of reliability. It explores different ways of implementing pattern recognition using machine intelligence.

Based on the authors’ research from the past 10 years, the text draws on concepts from pattern recognition, parallel processing, distributed systems, and data networks. It describes fundamental research on the scalability and performance of pattern recognition, addressing issues with existing pattern recognition schemes for Internet-scale data deployment. The authors review numerous approaches and introduce possible solutions to the scalability problem.

By presenting the concise body of knowledge required for reliable and scalable pattern recognition, this book shortens the learning curve and gives you valuable insight to make further innovations. It offers an extendable template for Internet-scale pattern recognition applications as well as guidance on the programming of large networks of devices.
Muhamad Amin / Khan / Nasution Internet-Scale Pattern Recognition jetzt bestellen!

Zielgruppe


Professional Practice & Development

Weitere Infos & Material


I Recognition: A New Perspective: Introduction. Distributed Approach for Pattern Recognition. II Evolution of Internet-Scale Recognition: One-Shot Learning Considerations. Hierarchical Model for Pattern Recognition. Recognition via a Divide-and-Distribute Approach. III Systems and Tools: Internet-Scale Applications Development. IV Implementations and Applications: Multi-Feature Classifications for Complex Data. Pattern Recognition within Coarse-Grained Networks. Event Detection within Fine-Grained Networks. Recognition: The Future and Beyond. Bibliography.


Anang Hudaya Muhamad Amin is a senior lecturer in the Faculty of Information Science and Technology at Multimedia University in Malaysia. He received a BTech (Hons.) in information technology from Universiti Teknologi PETRONAS and a masters in network computing and PhD from Monash University. His research interests include artificial intelligence with specialization in distributed pattern recognition and bio-inspired computational intelligence, wireless sensor networks, and distributed computing.

Asad I. Khan is a senior lecturer in the Faculty of Information Technology at Monash University. Dr. Khan is an Australian Research Council assessor and has published over 80 refereed papers. His research areas include parallel computation, neural networks, and distributed pattern recognition as well as the development of e-research systems and intelligent sensor networks.

Benny Nasution is with the Department of Computer Engineering at Politeknik Negeri Medan. Dr. Nasution was awarded the IBM Award from Tokyo Research Lab and the Mollie Holman Medal from Monash University.


Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.