Search results

Movies critics believe that the diversity of Iranian cinematic genres has decreased over time. The paper aims to answer the following questions: What is the impact of the continuous cooperation between the key nodes on the audience's taste, uniformity of the cinematic genres and the box office? Is there any relationship between the importance of actors in the actors' network and their popularity?

In the artistic world, artists' relationships lead to a network that affects individuals' commercial or artistic success and defines the artwork's value. To study the issue that the diversity of Iranian cinematic genres has decreased over time, the authors utilized social network analysis (SNA), in which every actor is considered a node, and its collaboration with others in the same movies is depicted via edges. After preparing the desired dataset, networks were generated, and metrics were calculated. First, the authors compared the structure of the network with the box office. The results illustrated that the network density growth negatively affects box office. Second, network key nodes were identified, their relationships with other actors were inspected using the Apriori algorithm to examine the density cause and the cinematic genre of key nodes, and their followers were investigated. Finally, the relationship between the actors' Instagram follower count and their importance in the network structure was analyzed to answer whether the generated network is acceptable in society.

The social problem genre has stabilized due to continuous cooperation between the core nodes because network density negatively impacts the box office. As well as, the generated network in the cinema is acceptable by the audience because there is a positive correlation between the importance of actors in the network and their popularity.

The novelty of this paper is investigating the issue raised in the cinema industry and trying to inspect its aspects by utilizing the SNA to deepen the cinematic research and fill the gaps. This study demonstrates a positive correlation between the actors' Instagram follower count and their importance in the network structure, indicating that people follow those central in the actors' network. As well as investigating the network key nodes with a heuristic algorithm using coreness centrality and analyzing their relationships with others through the Apriori algorithm. The authors situated the analysis using a novel and original dataset from the Iranian actors who participated in the Fajr Film Festival from 1998 to 2020.

Communities representing groups of agents with similar interests or functions are one of the essential features of complex networks. Finding communities in real-world networks is critical for analyzing complex systems in various areas ranging from collaborative information to political systems. Given the different characteristics of networks and the capability of community detection in handling a plethora of societal problems, community detection methods represent an emerging area of research. Contributing to this field, the authors propose a new community detection algorithm based on the hybridization of node and link granulation.

The proposed algorithm utilizes a rough set-theoretic concept called closure on networks. Initial sets are constructed by using neighborhood topology around the nodes as well as links and represented as two different categories of granules. Subsequently, the authors iteratively obtain the constrained closure of these sets. The authors use node mutuality and link mutuality as merging criteria for node and link granules, respectively, during the iterations. Finally, the constrained closure subsets of nodes and links are combined and refined using the Jaccard similarity coefficient and a local density function to obtain communities in a binary network.

Extensive experiments conducted on twelve real-world networks followed by a comparison with state-of-the-art methods demonstrate the viability and effectiveness of the proposed algorithm.

The study also contributes to the ongoing effort related to the application of soft computing techniques to model complex systems. The extant literature has integrated a rough set-theoretic approach with a fuzzy granular model (Kundu and Pal, 2015) and spectral clustering (Huang and Xiao, 2012) for node-centric community detection in complex networks. In contributing to this stream of work, the proposed algorithm leverages the unexplored synergy between rough set theory, node granulation and link granulation in the context of complex networks. Combined with experiments of network datasets from various domains, the results indicate that the proposed algorithm can effectively reveal co-occurring disjoint, overlapping and nested communities without necessarily assigning each node to a community.

This study carries important practical implications for complex adaptive systems in business and management sciences, in which entities are increasingly getting organized into communities (Jacucci et al., 2006). The proposed community detection method can be used for network-based fraud detection by enabling experts to understand the formation and development of fraudulent setups with an active exchange of information and resources between the firms (Van Vlasselaer et al., 2017). Products and services are getting connected and mapped in every walk of life due to the emergence of a variety of interconnected devices, social networks and software applications.

The proposed algorithm could be extended for community detection on customer trajectory patterns and design recommendation systems for online products and services (Ghose et al., 2019; Liu and Wang, 2017). In line with prior research, the proposed algorithm can aid companies in investigating the characteristics of implicit communities of bloggers or social media users for their services and products so as to identify peer influencers and conduct targeted marketing (Chau and Xu, 2012; De Matos et al., 2014; Zhang et al., 2016). The proposed algorithm can be used to understand the behavior of each group and the appropriate communication strategy for that group. For instance, a group using a specific language or following a specific account might benefit more from a particular piece of content than another group. The proposed algorithm can thus help in exploring the factors defining communities and confronting many real-life challenges.

This work is based on a theoretical argument that communities in networks are not only based on compatibility among nodes but also on the compatibility among links. Building up on the aforementioned argument, the authors propose a community detection method that considers the relationship among both the entities in a network (nodes and links) as opposed to traditional methods, which are predominantly based on relationships among nodes only.