Abstract
Banks are collecting an unprecedentedly large amount of data about their customers from difference sources, considering their cyber, physical, social activities. The focus of this paper is to study the problem of information sharing and lower the communication overhead among different nodes for a specific data mining approach in distributed big data architectures. This problem can be abstracted as how to efficiently search under a specific cluster node topology. This paper proposes a new design rule for topologies including: 1) low coordination number; 2) high packing density; and 3) having a 3-D structure. According to this rule, a rhombic dodecahedron topology is proposed. A distributed banking big data mining framework based on the proposed topology is implemented. The experiments based on multioptimization benchmark functions show the excellent searching ability of the proposed topology; and a banking customer feature reduction prototype has been implemented to showcase the practicality of the data mining framework.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.