Abstract
Mining the relationship structures among the investors plays a vital role in promoting economic development as well as preventing financial risks, especially in the context of big data. This article proposes fast networking approaches from investment big data to explore three underlying structures, namely, investment pedigrees, investment groups, and structural holes. Inspired by disjoint sets and path compression, we first present a pedigree classification algorithm to identify investment pedigrees. Second, through introducing a pruning strategy and a data structure termed as “2-tuple list,” we develop a novel linear-time structure mining algorithm in network (SMAN) for investigating investment groups and structural holes from the investment pedigree. Finally, we show that our SMAN has higher clustering accuracy and efficiency than other existing algorithms on a variety of real-world tasks in terms of normalized mutual information (NMI) values. Our method is particularly well suited for mining the underlying structures from investment big data.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEE Transactions on Systems, Man, and Cybernetics: Systems
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.
