arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1901.11286cs.LGcs.DCstat.ML
收藏

Spark中基于分布式相关性的特征选择

Distributed Correlation-Based Feature Selection in Spark

National Autonomous University of Honduras(洪都拉斯国立自治大学);University of Alcalá(阿尔卡拉大学);University of A Coruña(拉科鲁尼亚大学)

Raul-Jose Palma-Mendoza, Luis de-Marcos, Daniel Rodriguez, Amparo Alonso-Betanzos

摘要:

CFS(Correlation-Based特征选择)算法是一种已成功应用于多个领域的分类问题的特征选择算法。我们将分布式CFS(DiCFS)描述为CFS算法的完全重新设计的,可扩展的,并行和分布式版本,能够处理大数据应用程序中典型的大量数据。该算法的两个版本是使用Apache Spark集群计算模型实现和比较的,由于其比Hadoop的MapReduce模型快得多的处理时间,目前越来越受欢迎。我们在四个公开的数据集上测试了我们的算法,每个数据集都包含大量的实例,两个数据集也包含大量的特征。结果表明,我们的算法是优越的时间效率和可扩展性。通过利用计算机集群,他们能够处理比非分布式WEKA版本更大的数据集,同时保持结果的质量,即,与WEKA中可用的原始算法相比,我们的算法返回了完全相同的特征。

英文摘要:

CFS (Correlation-Based Feature Selection) is an FS algorithm that has been successfully applied to classification problems in many domains. We describe Distributed CFS (DiCFS) as a completely redesigned, scalable, parallel and distributed version of the CFS algorithm, capable of dealing with the large volumes of data typical of big data applications. Two versions of the algorithm were implemented and compared using the Apache Spark cluster computing model, currently gaining popularity due to its much faster processing times than Hadoop's MapReduce model. We tested our algorithms on four publicly available datasets, each consisting of a large number of instances and two also consisting of a large number of features. The results show that our algorithms were superior in terms of both time-efficiency and scalability. In leveraging a computer cluster, they were able to handle larger datasets than the non-distributed WEKA version while maintaining the quality of the results, i.e., exactly the same features were returned by our algorithms when compared to the original algorithm available in WEKA.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑