Internet-Scale Pattern Recognition: New Techniques for Voluminous Data Sets and Data Clouds

— —

Anang Muhamad Amin Asad Khan

Internet-Scale Pattern Recognition

New Techniques for Voluminous Data Sets and Data Clouds

Anang Muhamad Amin, Asad Khan, Benny Nasution

$221

Hardback

Not in-store but you can order this
How long will it take?

Availability Information

We source books from suppliers in Australia and overseas. For books we don't currently have in stock, the time it takes to get them from our suppliers can vary widely - from a few days to a few months - so we check each book with each supplier to determine the expected time it will take to be supplied to us.

We then advise you accordingly. If the time taken to get any book is too long for you, you can let us know and we will cancel or adjust your order, and refund as required.

To find out the anticipated arrival time for specific items prior to ordering, please contact us by phone or email:

Phone +61 2 9264 3111, or 1800 4 BOOKS (1800 4 26657) if outside Sydney:
option 1 Abbey's Bookshop (Crime, History, Science, Kids & more) • info@abbeys.com.au
option 2 Language Book Centre (ESL & Foreign Languages) • language@abbeys.com.au
option 3 Galaxy Bookshop (Sci-fi, Fantasy, Romance, Graphic Novels) • sf@galaxybooks.com.au

QTY:

English

CRC Press Inc
20 November 2012

Data mining; Pattern recognition

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.

By: Anang Muhamad Amin, Asad Khan, Benny Nasution
Imprint: CRC Press Inc
Country of Publication: United States
Dimensions: Height: 234mm, Width: 156mm, Spine: 15mm
Weight: 430g
ISBN: 9781466510968
ISBN 10: 146651096X
Pages: 198
Publication Date: 20 November 2012
Audience: Professional and scholarly , Undergraduate
Format: Hardback
Publisher's Status: Active

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.