Search results

The purpose of this paper is to characterize a commutative ring R with identity which is not an integral domain such that ZT(R), the total zero-divisor graph of R is connected and to determine the diameter and radius of ZT(R) whenever ZT(R) is connected. Also, the purpose is to generalize some of the known results proved by Duric et al. on the total zero-divisor graph of R.

We use the methods from commutative ring theory on primary decomposition and strong primary decomposition of ideals in commutative rings. The structure of ideals, the primary ideals, the prime ideals, the set of zero-divisors of the finite direct product of commutative rings is used in this paper. The notion of maximal Nagata prime of the zero-ideal of a commutative ring is also used in our discussion.

For a commutative ring R with identity, ZT(R) is the intersection of the zero-divisor graph of R and the total graph of R induced by the set of all non-zero zero-divisors of R. The zero-divisor graph of R and the total graph of R induced by the set of all non-zero zero-divisors of R are well studied. Hence, we determine necessary and sufficient condition so that ZT(R) agrees with the zero-divisor graph of R (respectively, agrees with the total graph induced by the set of non-zero zero-divisors of R). If Z(R) is an ideal of R, then it is noted that ZT(R) agrees with the zero-divisor graph of R. Hence, we focus on rings R such that Z(R) is not an ideal of R. We are able to characterize R such that ZT(R) is connected under the assumptions that the zero ideal of R admits a strong primary decomposition and Z(R) is not an ideal of R. With the above assumptions, we are able to determine the domination number of ZT(R).

Duric et al. characterized Artinian rings R such that ZT(R) is connected. In this paper, we extend their result to rings R such that the zero ideal of R admits a strong primary decomposition and Z(R) is not an ideal of R. As an Artinian ring is isomorphic to the direct product of a finite number of Artinian local rings, we try to characterize R such that ZT(R) is connected under the assumption that R is ta finite direct product of rings R1, R2, … Rn with Z(Ri) is an ideal of Ri for each i between 1 to n. Their result on domination number of ZT(R) is also generalized in this paper. We provide several examples to illustrate our results proved.

The implication of this paper is that the existing result of Duric et al. is applicable to large class of commutative rings thereby yielding more examples. Moreover, the results proved in this paper make us to understand the structure of commutative rings better. It also helps us to learn the interplay between the ring-theoretic properties and the graph-theoretic properties of the graph associated with it.

The results proved in this paper are original and they provide more insight into the structure of total zero-divisor graph of a commutative ring. This paper provides several examples. Not much work done in the area of total zero-divisor graph of a commutative ring. This paper is a contribution to the area of graphs and rings and may inspire other researchers to study the total zero-divisor graph in further detail.

The present work focuses on the primality and the Cartesian product of graphs.

Given a graph G, a subset M of V (G) is a module of G if, for a, b ∈ M and x ∈ V (G) \ M, xa ∈ E(G) if and only if xb ∈ E(G). A graph G with at least three vertices is prime if the empty set, the single-vertex sets and V (G) are the only modules of G.

Motivated by works obtained on “the Cartesian product of graphs” and “the primality,” this paper creates a link between the two notions.

In fact, we study the primality of the Cartesian product of two connected graphs minus k vertices, where k ∈ {0, 1, 2}.

This paper aims to propose an incremental graph indexing method based on probabilistic inferences in Bayesian network (BN) for approximate nearest neighbor search (ANNS) that adds unindexed queries into the graph index incrementally.

This paper first uses the attention mechanism based graph convolutional network to embed a social network into the low-dimensional vector space, which could improve the efficiency of graph index construction. To add the unindexed queries into the graph index incrementally, this study proposes to learn the rule-based BN from social interactions. Thus, the dependency relations of unindexed queries and their neighbors are represented, and the probabilistic inferences in BN are then performed.

Experimental results demonstrate that the proposed method improves the search precision by at least 5% and search efficiency by 10% compared to the state-of-the-art methods.

This paper proposes a novel method to construct the incremental graph index based on probabilistic inferences in BN, such that both indexed and unindexed queries in ANNS could be addressed efficiently.

The objective of this paper is to formulate the precise meanings of grey graphs and examine some of their properties.

This article introduces innovative concepts of grey sets based on the grey number. We establish the grey graphs and examine their essential properties as isomorphisms of these graphs. Additionally, we explore the notion of a grey-complete graph and demonstrate certain properties of self-complementary grey-complete graphs.

We showcase novel facets of grey system theory through the establishment of the structures of grey graphs, and the subsequent analysis of their distinctive traits.

This article provides us with a new theoretical direction for grey system theory according to grey numbers. Thus, we present test examples that explain the routes between cities and the electrical wires between homes. Furthermore, the concept of grey graphs can be applied in several areas of engineering, computer science, neural networks, artificial intelligence, and medical diagnosis.

The proposed concepts are considered novel mathematical directions in grey system theory for the first time. Some operations of grey graphs are also explored.

Community detection is a key factor in analyzing the structural features of complex networks. However, traditional dynamic community detection methods often fail to effectively solve the problems of deep network information loss and computational complexity in hyperbolic space. To address this challenge, a hyperbolic space-based dynamic graph neural network community detection model (HSDCDM) is proposed.

HSDCDM first projects the node features into the hyperbolic space and then utilizes the hyperbolic graph convolution module on the Poincaré and Lorentz models to realize feature fusion and information transfer. In addition, the parallel optimized temporal memory module ensures fast and accurate capture of time domain information over extended periods. Finally, the community clustering module divides the community structure by combining the node characteristics of the space domain and the time domain. To evaluate the performance of HSDCDM, experiments are conducted on both artificial and real datasets.

Experimental results on complex networks demonstrate that HSDCDM significantly enhances the quality of community detection in hierarchical networks. It shows an average improvement of 7.29% in NMI and a 9.07% increase in ARI across datasets compared to traditional methods. For complex networks with non-Euclidean geometric structures, the HSDCDM model incorporating hyperbolic geometry can better handle the discontinuity of the metric space, provides a more compact embedding that preserves the data structure, and offers advantages over methods based on Euclidean geometry methods.

This model aggregates the potential information of nodes in space through manifold-preserving distribution mapping and hyperbolic graph topology modules. Moreover, it optimizes the Simple Recurrent Unit (SRU) on the hyperbolic space Lorentz model to effectively extract time series data in hyperbolic space, thereby enhancing computing efficiency by eliminating the reliance on tangent space.

Interdisciplinary PhD programs can be challenging as the vital information needed by students may not be readily available; it is scattered across the university’s websites, while tacit knowledge can be obtained only by interacting with people. Hence, there is a need to develop a knowledge management model to create, query and maintain a knowledge repository for interdisciplinary students. This study aims to propose a knowledge graph containing information on critical categories (faculty, classes, dissertations, etc.) and their relationships, extracted from multiple sources, essential for interdisciplinary PhD students. This study evaluates the usability of a participatory-designed knowledge graph intended to facilitate information exchange and decision-making.

The authors used data from multiple sources (such as university websites, faculty profiles, publication and dissertation metadata and crowdsourced data) to generate a knowledge graph in the Neo4J Bloom platform. The authors recruited 15 interdisciplinary PhD students using convenience sampling from the University of Hawaiʻi at Mānoa at various PhD stages to design and populate the knowledge graph. Next, the authors conducted a mixed methods study to perform its usability evaluation. First, the authors engaged the students in a participatory design workshop to identify relevant graph queries. Second, the authors conducted semi-structured interviews to determine the usability of the knowledge graph and rate the queries. Each interview was coded with structural and thematic codes and was further analyzed using sentiment analysis in R programming language.

The usability findings demonstrate that interaction with this knowledge graph benefits PhD students by notably reducing uncertainty and academic stress, particularly among newcomers. Knowledge graph supported them in decision-making, especially when choosing collaborators (e.g. supervisor or dissertation committee members) in an interdisciplinary setting. Key helpful features are related to exploring student–faculty networks, milestones tracking, rapid access to aggregated data and insights into crowdsourced fellow students’ activities. However, they showed concerns about crowdsourced data privacy and accessibility. Although participants expressed the need for more qualitative data in the graph, they noted it helped identify people to talk to about the topics of their interest.

The knowledge graph provides a solution to meet the personalized needs of doctoral researchers and has the potential to improve the information discovery and decision-making process substantially. It also includes the tacit knowledge exchange support missing from most current approaches, which is critical for this population and establishing interdisciplinary collaborations. This approach can be applied to other interdisciplinary programs and domains globally.

With the introduction of graph structure learning into service classification, more accurate graph structures can significantly improve the precision of service classification. However, existing graph structure learning methods tend to rely on a single information source when attempting to eliminate noise in the original graph structure and lack consideration for the graph generation mechanism. To address this problem, this paper aims to propose a graph structure estimation neural network-based service classification (GSESC) model.

First, this method uses the local smoothing properties of graph convolutional networks (GCN) and combines them with the stochastic block model to serve as the graph generation mechanism. Next, it constructs a series of observation sets reflecting the intrinsic structure of the service from different perspectives to minimize biases introduced by a single information source. Subsequently, it integrates the observation model with the structural model to calculate the posterior distribution of the graph structure. Finally, it jointly optimizes GCN and the graph estimation process to obtain the optimal graph.

The authors conducted a series of experiments on the API data set and compared it with six baseline methods. The experimental results demonstrate the effectiveness of the GSESC model in service classification.

This paper argues that the data set used for service classification exhibits a strong community structure. In response to this, the paper innovatively applies a graph-based learning model that considers the underlying generation mechanism of the graph to the field of service classification and achieves good results.

This study aims to investigate the applications of knowledge graphs in developing artificial intelligence (AI) assistants and chatbots by reviewing scholarly publications from different lenses and dimensions. The authors also analyze the various AI approaches used for knowledge graph-driven chatbots and discuss how implementing these techniques makes a difference in technology.

Over recent years, chatbots have emerged as a transformational force in interacting with the digital world in various domains, including customer service and personal assistants. Recently, chatbots have become a revolutionary tool for interacting with the digital world in various contexts, such as personal assistants and customer support. Incorporating knowledge graphs considerably improved the capabilities of chatbots by allowing them access to massive knowledge bases and enhancing their ability to understand queries. Furthermore, knowledge graphs enable chatbots to understand semantic links between elements and improve response quality. This study highlights the role of knowledge graphs in chatbots following a systematic review approach. They have been integrated into major health-care, education and business domains. Beyond improving information retrieval, knowledge graphs enhance the user experience and increase the range of fields in which chatbots can be used. Improving and enriching chatbot answers was also identified as one of the main advantages of knowledge graphs. This enriched response can increase user confidence and improve the accuracy of chatbot interactions, making them more trustworthy information sources.

Knowledge graph-based chatbots leverage extensive data retrieval to provide accurate and enriched responses, increasing user confidence and experience without requiring extensive training. The three major domains where knowledge graph-based chatbots have been used are health care, education and business.

Knowledge graph-based chatbots can better comprehend user queries and respond with relevant information efficiently without extensive training. Furthermore, knowledge graphs enable chatbots to understand semantic links between elements, allowing them to answer complicated and multi-faceted questions. This semantic comprehension improves response quality, making chatbots more successful in providing accurate and valuable information in various domains. Furthermore, knowledge graphs enable chatbots to provide consumers with individualized experiences by storing and recalling individual preferences, history or previous encounters. This study analyzes the role of knowledge graphs in chatbots following a systematic review approach. This study reviewed state-of-the-art articles to understand where and how chatbots have used knowledge graphs. The authors found health care, business and education as three main areas in which knowledge-graph-based chatbots have been mostly used. Chatbots have been developed in text, voice and visuals using various machine learning models, particularly natural language pocessing, to develop recommender systems to recommend suitable items, content or services based on user preferences and item associations.

This paper provides a comprehensive review of the current state of the field in using knowledge graphs in chatbots, focusing on machine learning models, domains and communication channels. The study highlights the prevalence of text and voice channels over visual ones and identifies research gaps and future directions. The paper’s insights can inform the design and development of chatbots using knowledge graphs and benefit both researchers and practitioners in AI, natural language processing and human–computer interaction. The paper is of interest to professionals in domains such as health care, education and business.

The purpose of this paper is to present a method that addresses the data sparsity problem in points of interest (POI) recommendation by introducing spatiotemporal context features based on location-based social network (LBSN) data. The objective is to improve the accuracy and effectiveness of POI recommendations by considering both spatial and temporal aspects.

To achieve this, the paper introduces a model that integrates the spatiotemporal context of POI records and spatiotemporal transition learning. The model uses graph convolutional embedding to embed spatiotemporal context information into feature vectors. Additionally, a recurrent neural network is used to represent the transitions of spatiotemporal context, effectively capturing the user’s spatiotemporal context and its changing trends. The proposed method combines long-term user preferences modeling with spatiotemporal context modeling to achieve POI recommendations based on a joint representation and transition of spatiotemporal context.

Experimental results demonstrate that the proposed method outperforms existing methods. By incorporating spatiotemporal context features, the approach addresses the issue of incomplete modeling of spatiotemporal context features in POI recommendations. This leads to improved recommendation accuracy and alleviation of the data sparsity problem.

The research has practical implications for enhancing the recommendation systems used in various location-based applications. By incorporating spatiotemporal context, the proposed method can provide more relevant and personalized recommendations, improving the user experience and satisfaction.

The paper’s contribution lies in the incorporation of spatiotemporal context features into POI records, considering the joint representation and transition of spatiotemporal context. This novel approach fills the gap left by existing methods that typically separate spatial and temporal modeling. The research provides valuable insights into improving the effectiveness of POI recommendation systems by leveraging spatiotemporal information.

To support digital humanities research more effectively and efficiently, this study develops a novel Knowledge Graph Analysis Tool of People and Organizations (KGAT-PO) for the Digital Humanities Research Platform for Biographies of Chinese Malaysian Personalities (DHRP-BCMP) based on artificial intelligence (AI) technology that would not only allow humanities scholars to look at the relationships between people but also has the potential for aiding digital humanities research by identifying latent relationships between people via relationships between people and organizations.

To verify the effectiveness of KGAT-PO, a counterbalanced design was applied to compare research participants in two groups using DHRP-BCMP with and without KGAT-PO, respectively, to perform people relationship inquiry and to see if there were significant differences in the effectiveness and efficiency of exploring relationships between people, and the use of technology acceptance between the two groups. Interviews and Lag Sequential Analysis were also used to observe research participants’ perceptions and behaviors.

The results show that the DHRP-BCMP with KGAT-PO could help research participants improve the effectiveness of exploring relationships between people, and the research participants showed high technology acceptance towards using DHRP-BCMP with KGAT-PO. Moreover, the research participants who used DHRP-BCMP with KGAT-PO could identify helpful textual patterns to explore people’s relationships more quickly than DHRP-BCMP without KGAT-PO. The interviews revealed that most research participants agreed that the KGAT-PO is a good starting point for exploring relationships between people and improves the effectiveness and efficiency of exploring people’s relationship networks.

The research’s limitations encompass challenges related to data quality, complex people relationships, and privacy and ethics concerns. Currently, the KGAT-PO is limited to recognizing eight types of person-to-person relationships, including couple, sibling, parent-child, friend, teacher-student, relative, work, and others. These factors should be carefully considered to ensure the tool’s accuracy, usability, and ethical application in enhancing digital humanities research.

The study’s practical implications encompass enhanced research efficiency, aiding humanities scholars in uncovering latent interpersonal relationships within historical texts with high technology acceptance. Additionally, the tool’s applications can extend to social sciences, business and marketing, educational settings, and innovative research directions, ultimately contributing to data-driven insights in the field of digital humanities.

The research’s originality lies in creating a Knowledge Graph Analysis Tool of People and Organizations (KGAT-PO) using AI, bridging the gap between digital humanities research and AI technology. Its value is evident in its potential to efficiently uncover hidden people relationships, aiding digital humanities scholars in gaining new insights and perspectives, ultimately enhancing the depth and effectiveness of their research.