(Re)designing Clustering Algorithms for Big Data

我们目前的数据生成速度与存储容量的增加相结合，催生了计算领域的新范式。例如，根据IBM网站的数据，Facebook上每分钟大约有69.5万条状态更新和1100万条即时消息发送。然而，许多组织都面临着拥有大量数据但对它们知之甚少的问题。集群方法帮助自动识别一组数据对象的未观察到的组，并且当前正在通过可用数据的大小、种类和性质，即所谓的“大数据”，从根本上改变。本研究计划致力于开发适用于大数据集群的可扩展算法。这将通过以下两个途径实现：(I)利用它们的主要理论思想，重新设计众所周知的成功的系列算法以实现可伸缩性；(Ii)使用与大数据相关的新编程范例开发新的算法和启发式算法。

Our current speed of data generation combined with storage capacity increases have given rise to new paradigms in computing. For example, according to the IBM's website, there are approximately 695,000 status updates and 11 million instant messages sent every minute on Facebook. However, many organizations have faced the problem of having a lot of data, but poor knowledge about them. Clustering methods help to automatically identify unobserved groups for a set of data objects, and are currently being radically transformed by the size, the variety and the nature of the available data, i.e., by so-called “Big Data”. This research program focuses on the development of scalable algorithms for Big data clustering. This will be achieved both by: (i) redesigning well-known successful serial algorithms for scalability, leveraging their main theoretical ideas; and (ii) developing new algorithms and heuristics using new programming paradigms associated with Big Data.