Abstract

Purpose This paper aims to optimize and evaluating the performance of the crowd networks through analyzing their information sharing patterns. That is, in a crowd network, the qualities of accomplishing tasks are highly dependent on the effective information sharing among intelligent subjects within the networks. Hence, proposing an adaptive information-sharing approach can help improve the performance of crowd networks on accomplishing tasks that are assigned to them. Design/methodology/approach This paper first introduces the factors that affect effectiveness of information-sharing pattern: the network topology, the resources owned by intelligent subjects and the degree of information demand. By analyzing the correlation between these factors and the performance of crowd networks, an Adaptive Information Sharing Approach for Crowd Networks (AISCN approach) is proposed. By referring to information needed for accomplishing the historical tasks that are assigned to a crowd network, the AISCN approach can explore the optimized information-sharing pattern based on the predefined composite objective function. The authors implement their approach on two crowd networks including bee colony and supply chain, to prove the effectiveness of the approach. Findings The shared information among intelligent subjects affects the efficiency of task completion in the crowd network. The factors that can be used to describe the effectiveness of information-sharing patterns include the network topology, the resources owned by intelligent subjects and the degree of information demand. The AISCN approach used heuristic algorithm to solve a composite objective function which takes all these factors into consideration, so that the optimized information-sharing pattern can be obtained. Originality/value This paper introduces a set of factors that can be used to describe the correlation between information-sharing pattern and performance of crowd network. By quantifying such correlation based on these factors, this paper proposes an adaptive information-sharing approach which can explore the optimized information-sharing pattern for a variety of crowd networks. As the approach is a data-driven approach that explores the information-sharing pattern based on the network’s performance on historical tasks and network’s characteristics, it is adaptive to the dynamic change (change of incoming tasks, change of network characteristics) of the target crowd network. To ensure the commonality of the information-sharing approach, the proposed approach is not designed for a specific optimization algorithm. In this way, during the implementation of the proposed approach, heuristic algorithms can be chosen according to the complexity of the target crowd network.

Highlights

  • The phenomenon of crowd intelligence can be widely found in nature and human society

  • We defined a set of factors that can be used to describe the effectiveness of information-sharing patterns, which include the network topology, the resources owned by intelligent subjects and the degree of information demand

  • As the approach is a data-driven approach that explores the information-sharing pattern based on the network’s performance on historical tasks and network’s characteristics, the approach is adaptive to the dynamic change of the target crowd network

Read more

Summary

Introduction

The phenomenon of crowd intelligence can be widely found in nature and human society. We defined a set of factors that can be used to describe the effectiveness of information-sharing patterns, which include the network topology, the resources owned by intelligent subjects and the degree of information demand. According to the content and scope of information and the topology of the network, the intelligent subject chooses whether to share information in the whole network (through the n-nei interaction mode in Figure 2) or only in the neighborhood. In the second stage, which is for performing global optimization, we use optimization algorithm to adjust the information-sharing pattern of each intelligent subject, by considering both Reward and EC. For the input of TSi, Mi, IDi, Si, Nei(i) and Xi, according to the characteristics of case to select an appropriate optimization algorithm, to obtain the optimal information-sharing pattern Xi for intelligent subject i. According to the actual-to-preliminarily analysis, we can know that the information

Different network topologies and tasks
Conclusion
Further reading
Full Text
Paper version not known

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 call

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.