Affiliation:
1. Monash University, Australia
2. RMIT University, Australia
Abstract
One of the main challenges for large-scale computer clouds dealing with massive real-time data is in coping with the rate at which unprocessed data is being accumulated. Transforming big data into valuable information requires a fundamental re-think of the way in which future data management models will need to be developed on the Internet. Unlike the existing relational schemes, pattern-matching approaches can analyze data in similar ways to which our brain links information. Such interactions when implemented in voluminous data clouds can assist in finding overarching relations in complex and highly distributed data sets. In this chapter, a different perspective of data recognition is considered. Rather than looking at conventional approaches, such as statistical computations and deterministic learning schemes, this chapter focuses on distributed processing approach for scalable data recognition and processing.
Reference25 articles.
1. Basirat, A. H., Khan, A. I., & Srinivasan, B. (2013). Highly distributable associative memory based computational framework for parallel data processing in cloud. In Proceedings of the 10th International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services. Tokyo, Japan: Academic Press.
2. Chaiken, R., Jenkins, B., Larson, P.A., Ramsey, B., Shakib, D., Weaver, S., & Zhou, J., (2008). SCOPE: Easy and efficient parallel processing of massive data sets. Proceedings of Very Large Database Systems, 1(2), 1265 – 1276.
3. Active learning for image retrieval with Co-SVM
4. Map-reduce-merge