Search results

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.

Challenges associated with ensuring the accuracy and reliability of cost estimation of highway construction bid items are of significant interest to state highway transportation agencies. Even with the existing research undertaken on the subject, the problem of inaccurate estimation of highway bid items still exists. This paper aims to assess the accuracy of the cost estimation methods employed in the selected studies to provide insights into how well they perform empirically. Additionally, this research seeks to identify, synthesize and assess the impact of the factors affecting highway unit prices because they affect the total cost of highway construction costs.

This paper systematically searched, selected and reviewed 105 papers from Scopus, Google Scholar, American Society of Civil Engineers (ASCE), Transportation Research Board (TRB) and Science Direct (SD) on conceptual cost estimation of highway bid items. This study used content and nonparametric statistical analyses to determine research trends, identify, categorize the factors influencing highway unit prices and assess the combined performance of conceptual cost prediction models.

Findings from the trend analysis showed that between 1983 and 2019 North America, Asia, Europe and the Middle East contributed the most to improving highway cost estimation research. Aggregating the quantitative results and weighting the findings using each study's sample size revealed that the average error between the actual and the estimated project costs of Monte-Carlo simulation models (5.49%) performed better compared to the Bayesian model (5.95%), support vector machines (6.03%), case-based reasoning (11.69%), artificial neural networks (12.62%) and regression models (13.96%). This paper identified 41 factors and was grouped into three categories, namely: (1) factors relating to project characteristics; (2) organizational factors and (3) estimate factors based on the common classification used in the selected papers. The mean ranking analysis showed that most of the selected papers used project-specific factors more when estimating highway construction bid items than the other factors.

This paper contributes to the body of knowledge by analyzing and comparing the performance of highway cost estimation models, identifying and categorizing a comprehensive list of cost drivers to stimulate future studies in improving highway construction cost estimates.