大数据环境中的三次聚类
Triclustering in Big Data Setting
摘要:
在本文中,我们描述的版本的三聚算法适用于高效的计算在分布式环境中与MapReduce模型或并行化机制提供现代程序设计语言。由于独立处理三元形式上下文的三元组,三聚算法的OAC家族显示出良好的并行化能力。我们提供的时间和空间复杂度的算法,并证明其相关性。我们还比较了使用分布式系统和可扩展性的性能增益。
英文摘要:
In this paper, we describe versions of triclustering algorithms adapted for efficient calculations in distributed environments with MapReduce model or parallelisation mechanism provided by modern programming languages. OAC-family of triclustering algorithms shows good parallelisation capabilities due to the independent processing of triples of a triadic formal context. We provide the time and space complexity of the algorithms and justify their relevance. We also compare performance gain from using a distributed system and scalability.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。