Search results

Nature’s evolution has shaped intelligent behaviors in creatures like insects and birds, inspiring the field of Swarm Intelligence. Researchers have developed bio-inspired algorithms to address complex optimization problems efficiently. These algorithms strike a balance between computational efficiency and solution optimality, attracting significant attention across domains.

Bio-inspired optimization techniques for feature engineering and its applications are systematically reviewed with chief objective of assessing statistical influence and significance of “Bio-inspired optimization”-based computational models by referring to vast research literature published between year 2015 and 2022.

The Scopus and Web of Science databases were explored for review with focus on parameters such as country-wise publications, keyword occurrences and citations per year. Springer and IEEE emerge as the most creative publishers, with indicative prominent and superior journals, namely, PLoS ONE, Neural Computing and Applications, Lecture Notes in Computer Science and IEEE Transactions. The “National Natural Science Foundation” of China and the “Ministry of Electronics and Information Technology” of India lead in funding projects in this area. China, India and Germany stand out as leaders in publications related to bio-inspired algorithms for feature engineering research.

The review findings integrate various bio-inspired algorithm selection techniques over a diverse spectrum of optimization techniques. Anti colony optimization contributes to decentralized and cooperative search strategies, bee colony optimization (BCO) improves collaborative decision-making, particle swarm optimization leads to exploration-exploitation balance and bio-inspired algorithms offer a range of nature-inspired heuristics.

In the era of artificial intelligence (AI), algorithms have gained unprecedented importance. Scientific studies have shown that algorithms are frequently mentioned in papers, making mention frequency a classical indicator of their popularity and influence. However, contemporary methods for evaluating influence tend to focus solely on individual algorithms, disregarding the collective impact resulting from the interconnectedness of these algorithms, which can provide a new way to reveal their roles and importance within algorithm clusters. This paper aims to build the co-occurrence network of algorithms in the natural language processing field based on the full-text content of academic papers and analyze the academic influence of algorithms in the group based on the features of the network.

We use deep learning models to extract algorithm entities from articles and construct the whole, cumulative and annual co-occurrence networks. We first analyze the characteristics of algorithm networks and then use various centrality metrics to obtain the score and ranking of group influence for each algorithm in the whole domain and each year. Finally, we analyze the influence evolution of different representative algorithms.

The results indicate that algorithm networks also have the characteristics of complex networks, with tight connections between nodes developing over approximately four decades. For different algorithms, algorithms that are classic, high-performing and appear at the junctions of different eras can possess high popularity, control, central position and balanced influence in the network. As an algorithm gradually diminishes its sway within the group, it typically loses its core position first, followed by a dwindling association with other algorithms.

To the best of the authors’ knowledge, this paper is the first large-scale analysis of algorithm networks. The extensive temporal coverage, spanning over four decades of academic publications, ensures the depth and integrity of the network. Our results serve as a cornerstone for constructing multifaceted networks interlinking algorithms, scholars and tasks, facilitating future exploration of their scientific roles and semantic relations.

This paper aims to review and discuss four aspects of mixed-model assembly line balancing (MMALB) problem mainly on the optimization angle. MMALB is a non-deterministic polynomial-time hard problem which requires an effective algorithm for solution. This problem has attracted a number of research fields: manufacturing, mathematics and computer science.

This paper review 59 published research works on MMALB from indexed journal. The review includes MMALB problem varieties, optimization algorithm, objective function and constraints in the problem.

Based on research trend, this topic is still growing with the highest publication number observed in 2016 and 2017. The review indicated that the future research direction should focus on human factors and sustainable issues in the problem modeling. As the assembly cost becomes crucial, resource utilization in the assembly line should also be considered. Apart from that, the growth of new optimization algorithms is predicted to influence the MMALB optimization, which currently relies on well-established algorithms.

The originality of this paper is on the research trend in MMALB. It provides the future direction for the researchers in this field.

This paper aims to present social trust as a variable of influence by demonstrating the possibilities of trusted social nodes to improve influential capability and rate of successfully influenced social nodes within a social networking environment.

This research will be conducted using simulated experiments. The base algorithm in research uses genetics algorithm diffusion model (GADM) where it carries out social influence calculations within a social networking environment. The GADM algorithm will be enhanced by integrating trust values into its influential calculations. The experiment simulates a virtual social network based on a social networking site architecture from the data set used to conduct experiments on the enhanced GADM and observe their influence capabilities.

The presence of social trust can effectively increase the rate of successfully influenced social nodes by factorizing trust value of one source node and acceptance rate of another recipient node into its probabilistic equation, hence increasing the final acceptance probability.

This research focused exclusively on conceptual mathematical models and technical aspects so far; comprehensive user study, extensive performance and scalability testing is left for future work.

Two key contributions of this paper are the calculation of social trust via content integrity and the application of social trust in social influential diffusion algorithms. Two models will be designed, implemented and evaluated on the application of social trust via trusted social nodes and domain-specified (of specific interest groups) trusted social nodes.

Algorithm bias refers to repetitive computer program errors that give some users more weight than others. The aim of this article is to provide a deeper insight of algorithm bias in AI-enabled ERP software customization. Although algorithmic bias in machine learning models has uneven, unfair and unjust impacts, research on it is mostly anecdotal and scattered.

As guided by the previous research (Akter et al., 2022), this study presents the possible design bias (model, data and method) one may experience with enterprise resource planning (ERP) software customization algorithm. This study then presents the artificial intelligence (AI) version of ERP customization algorithm using k-nearest neighbours algorithm.

This study illustrates the possible bias when the prioritized requirements customization estimation (PRCE) algorithm available in the ERP literature is executed without any AI. Then, the authors present their newly developed AI version of the PRCE algorithm that uses ML techniques. The authors then discuss its adjoining algorithmic bias with an illustration. Further, the authors also draw a roadmap for managing algorithmic bias during ERP customization in practice.

To the best of the authors’ knowledge, no prior research has attempted to understand the algorithmic bias that occurs during the execution of the ERP customization algorithm (with or without AI).

This study aims to objectively synthesize the volume of accounting literature on financial statement fraud (FSF) using a systematic literature review research method (SLRRM). This paper analyzes the vast FSF literature based on inclusion and exclusion criteria. These criteria filter articles that are present in the accounting fraud domain and are published in peer-reviewed quality journals based on Australian Business Deans Council (ABDC) journal ranking. Lastly, a reverse search, analyzing the articles' abstracts, further narrows the search to 88 peer-reviewed articles. After examining these 88 articles, the results imply that the current literature is shifting from traditional statistical approaches towards computational methods, specifically machine learning (ML), for predicting and detecting FSF. This evolution of the literature is influenced by the impact of micro and macro variables on FSF and the inadequacy of audit procedures to detect red flags of fraud. The findings also concluded that A* peer-reviewed journals accepted articles that showed a complete picture of performance measures of computational techniques in their results. Therefore, this paper contributes to the literature by providing insights to researchers about why ML articles on fraud do not make it to top accounting journals and which computational techniques are the best algorithms for predicting and detecting FSF.

This paper chronicles the cluster of narratives surrounding the inadequacy of current accounting and auditing practices in preventing and detecting Financial Statement Fraud. The primary objective of this study is to objectively synthesize the volume of accounting literature on financial statement fraud. More specifically, this study will conduct a systematic literature review (SLR) to examine the evolution of financial statement fraud research and the emergence of new computational techniques to detect fraud in the accounting and finance literature.

The storyline of this study illustrates how the literature has evolved from conventional fraud detection mechanisms to computational techniques such as artificial intelligence (AI) and machine learning (ML). The findings also concluded that A* peer-reviewed journals accepted articles that showed a complete picture of performance measures of computational techniques in their results. Therefore, this paper contributes to the literature by providing insights to researchers about why ML articles on fraud do not make it to top accounting journals and which computational techniques are the best algorithms for predicting and detecting FSF.

This paper contributes to the literature by providing insights to researchers about why the evolution of accounting fraud literature from traditional statistical methods to machine learning algorithms in fraud detection and prediction.

Research shows that postsecondary students are largely unaware of the impact of algorithms on their everyday lives. Also, most noncomputer science students are not being taught about algorithms as part of the regular curriculum. This exploratory, qualitative study aims to explore subject-matter experts’ insights and perceptions of the knowledge components, coping behaviors and pedagogical considerations to aid faculty in teaching algorithmic literacy to postsecondary students.

Eleven semistructured interviews and one focus group were conducted with scholars and teachers of critical algorithm studies and related fields. A content analysis was manually performed on the transcripts using a mixture of deductive and inductive coding. Data analysis was aided by the coding software program Dedoose (2021) to determine frequency totals for occurrences of a code across all participants along with how many times specific participants mentioned a code. Then, findings were organized around the three themes of knowledge components, coping behaviors and pedagogy.

The findings suggested a set of 10 knowledge components that would contribute to students’ algorithmic literacy along with seven behaviors that students could use to help them better cope with algorithmic systems. A set of five teaching strategies also surfaced to help improve students’ algorithmic literacy.

This study contributes to improved pedagogy surrounding algorithmic literacy and validates existing multi-faceted conceptualizations and measurements of algorithmic literacy.

A new triage method, MBCE (Medical Bio Social Ethics), is presented with social justice, bio, and medical ethics for critical resource distribution during a pandemic. Ethical triage is a complex and challenging process that requires careful consideration of medical, social, cultural, and ethical factors to guide the decision-making process and ensure fair and transparent allocation of resources. When assigning priorities to patients, a clinician would evaluate each patient’s medical condition, age, comorbidities, and prognosis, as well as their cultural and social background and ethical factors.

A statistical analysis shows no interactions among the ethical triage factors. It implies the ethical components have no moderation effect; hence, each is independent. The result also points out that medical and bioethics may have an affinity for interactions. In such cases, there seem to be some ethical factors related to bio and medical ethics that are correlated. Therefore, the triage team should be careful in evaluating patient cases. The algorithm is explained with case histories of the selected patient. A group of triage nurses and general medical practitioners assists with the triage.

The MBCE triage algorithm aims to allocate scarce resources fairly and equitably. Another ethical principle in this triage algorithm is the principle of utility. In a pandemic, the principle of utility may require prioritizing patients with a higher likelihood of survival or requiring less medical care. The research presents a sensitivity analysis of a patient’s triage score to show the algorithm’s robustness. A weighted score of ethical factors combined with an assessment of triage factors combines multiple objectives to assign a fair triage score. These distinctive features of the algorithm are reasonably easy to implement and a new direction for the unbiased triage principle.

The idea is to make decisions about distributing and using scarce medical resources. Triage algorithms raise ethical issues, such as discrimination and justice, guiding medical ethics in treating patients with terminal diseases or comorbidity. One of the main ethical principles in triage algorithms is the principle of distributive justice.

The spatial conflicts and congestion of construction resources are challenges that lead to the reduction in efficiency. The purpose of this paper is to enable users to detect and resolve workspace conflicts by implementing four resolution strategies in a five-dimensional (5D) CAD model. In addition to resolving conflicts, the model should be able to optimize time and cost of the projects. In other words, three variables of spatial conflicts, time and cost of project are considered simultaneously in the proposed model to find the optimum solution.

In the first step, a 5D simulation model is developed that includes time, cost and geometrical information of a project. Then, time-cost trade-off analysis was carried out to distinguish optimum schedule. The schedule was imported to the 5D CAD model to detect spatial conflicts. Finally, a novel algorithm was implemented to solve identified conflicts while imposing minimum project’s time and cost. Several iterations are performed to resolve all clashes using conflict resolution algorithm and visual simulation model.

The proposed methodology in this research was applied to a real case. Results showed that in comparison to the normal and initial schedule with 19 conflicts, the finalized schedule has no conflict, while time and cost of the project are both reduced.

Implementing the proposed methodology in construction projects requires proper technical basis in this field. In this regard, the executive user should have a proper understanding of the principles, concepts and tools of building information modeling and have project management knowledge. Also, the implementation conditions of the basic model requires the determination of the construction methods, estimated volumes of working items, scheduling and technical specification. The designed methodology also has two limitations regarding to its implementation. The first is the fact that strategies should be applied manually to the schedule. The other one pertains to the number of strategies used in the research. Four strategies have been used in the conflict resolution algorithm directly and the two others (spatial divisibility and activities breakdown strategies) have been used as default strategies in the visual simulation model. Since the unused strategies including the changing of construction method and the activity resources are subjective and depend upon the planner and project manager’s personal opinion, the authors have avoided using them in this research.

The method proposed in this research contributes the coordination of the working teams at the planning and execution phases of the project. In fact, the best location and work direction for each working team is presented as a schedule, so that the space conflict may not come about and the cost can be minimized. This visual simulation not only deepens the planners’ views about the executive barriers and the spatial conditions of the worksite, it also makes the construction engineers familiar on a daily basis with their executive scope. Therefore, it considerably improves the interactions and communication of the planning and construction teams. Another advantage and application of this methodology is the use of initial and available projects’ documents including the schedule and two-dimensional drawings. The integration of these basic documents in this methodology helps identify the spatial conflicts efficiently. To achieve this, the use of the existing and widely-used construction tools has facilitated the implementation of the methodology. Using this system, planners have applied the strategies in an order of priority and can observe the results of each strategy visually and numerically in terms of time, cost and conflicts. This methodology by providing the effective resolution strategies guides the practitioner to remove conflicts while optimum time and cost are imposed to project.

Contrary to the previous models that ignore cost, the proposed model is a 5D visual simulation model, which considers the variable of cost as a main factor for conflict identification and resolution. Moreover, a forward-pass approach is introduced to implement resolution strategies that are novel compared to other investigations.

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.